On the counting function of primitive sets of integers
Erdos has shown that for a primitive set A subset of N Sigma(a is an element of A) 1/(a log a) < const. This implies that A(x) <x/(log log x log log log x) for infinitely many x. We prove that this is best possible apart from a factor (log log log x)(epsilon). (C) 1999 Academic Press
79
2
330-344
330-344
Academic Press