Abstract

The Erd\H{o}s primitive set conjecture states that the sum $f(A) = \sum_{a\in A}\frac{1}{a\log a}$, ranging over any primitive set $A$ of positive integers, is maximized by the set of prime numbers. Recently Laib, Derbal, and Mechik proved that the translated Erd\H{o}s conjecture for the sum $f(A,h) = \sum_{a\in A}\frac{1}{a(\log a+h)}$ is false starting at $h=81$, by comparison with semiprimes. In this note we prove that such falsehood occurs already at $h= 1.04\cdots$, and show this translate is best possible for semiprimes. We also obtain results for translated sums of $k$-almost primes with larger $k$.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call