On a conjecture of Erdős on the sum _p n1/(p\, \,p)
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.
- On the random series ^ n (an Erdös problem)
- On the series of reciprocals of primes
- On the size of primitive sets in function fields
- On the Erdős primitive set conjecture in function fields
- Almost primes and the Banks-Martin conjecture
- Upper bound of \(\sum 1/(a_i \log a_i)\) for quasi-primitive sequences
- Sieving Very Thin Sets of Primes, and Pratt Trees with Missing Primes
- Some Questions of Erdos and Graham on Numbers of the Form ∑g n /2 g n
- Upper Bound of ∑1/(a i loga i ) for Primitive Sequences
- An Upper Bound of Σ1/(a i loga i ) for Primitive Sequences
- scientific article; zbMATH DE number 1521549 (Why is no real title available?)
- The Erdős conjecture for primitive sets
- scientific article; zbMATH DE number 205510 (Why is no real title available?)
- Note on a theorem of Zehnxiag Zhang
- The degree of primitive sequences and Erdős conjecture
- Sums over primitive sets with a fixed number of prime factors
- Primes in prime number races
- Results and conjectures related to a conjecture of Erdős concerning primitive sequences
This page was built for publication: On a conjecture of Erdős on the sum \(\sum_{p\leq n}1/(p\,\log \,p)\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q810562)
