Open AccessCount(q) does not imply Count(p)
Author(s) -
Søren Riis
Publication year - 1994
Publication title -
brics report series
Language(s) - English
Resource type - Journals
eISSN - 1601-5355
pISSN - 0909-0878
DOI - 10.7146/brics.v1i21.21646
Subject(s) - mathematics , count data , prime (order theory) , conjecture , combinatorics , gate count , arithmetic , discrete mathematics , statistics , computer science , poisson distribution , embedded system
I solve a conjecture originally studied by M.Ajtai. It states that for different primes q, p the matching principles Count(q) and Count(p) are logically independent. I prove that this indeed is the case. Actually I show that Count(q) implies Count(p) exactly when each prime in p also is a factor in q.