On the Second Hardy-Littlewood Conjecture
arXiv:2503.02766
Abstract
The second Hardy-Littlewood conjecture asserts that the prime counting function satisfies the subadditive inequality \begin{align*} Ï(x+y)\leqslant Ï(x)+Ï(y) \end{align*} for all integers . By linking the subadditivity of to the error term in the Prime Number Theorem, we obtain unconditional improvements on the range of for which is known to be subadditive. Moreover, assuming the Riemann Hypothesis, we show that for all , there exists such that for all and in the range \begin{align*} \frac{(2+ε)\sqrt{x}\log^2x}{8Ï}\leqslant y\leqslant x, \end{align*} the inequality holds.
10 pages