On a conjecture of Erdős on the sum \(\sum_{p\leq n}1/(p\,\log \,p)\) (Q810562): Difference between revisions

A sequence \(A=\{a_ 1,...\}\) of positive integers is primitive if no term divides any other terms. It is proved that if each term \(a_ i\) of a primitive sequence A has at most four prime factors (counted with multiplicity) then \[ \sum_{a_ i\leq n}1/(a_ i \log a_ i)\leq \sum_{p\leq n}1/(p \log p),\quad n>1, \] where p runs over all primes. This is a very modest step towards a conjecture of P. Erdős, which claims the above inequality for all primitive sequences. The proof is elementary and based on a very precise form of the prime number theorem and on extensive calculations.