On the Second Hardy-Littlewood Conjecture
Authors:
- Bittu ChahalBCBittu Chahal
- Ertan ElmaEEErtan Elma
- Nic FelliniNFNic Fellini
- Akshaa VatwaniAVAkshaa Vatwani
- Do Nhat Tan VoDVDo Nhat Tan Vo
Preprint
Abstract
The second Hardy-Littlewood conjecture asserts that the prime counting function $π(x)$ satisfies the subadditive inequality \begin{align*} π(x+y)\leqslant π(x)+π(y) \end{align*} for all integers $x,y\geqslant 2$. By linking the subadditivity of $π(x)$ to the error term in the Prime Number Theorem, we obtain unconditional improvements on the range of $y$ for which $π(x)$ is known to be subadditive. Moreover, assuming the Riemann Hypothesis, we show that for all $ε>0$, there exists $x_ε \geqslant 2$ such that for all $x\geqslant x_ε$ and $y$ in the range \begin{align*} \frac{(2+ε)\sqrt{x}\log^2x}{8π}\leqslant y\leqslant x, \end{align*} the inequality $π(x+y)\leqslant π(x) + π(y)$ holds.
Keywords
All Related Versions
This publication has 6 references indexed in Scilit:
- Explicit zero-free regions for the Riemann zeta-functionResearch in Number Theory, 2024
- Some explicit estimates for the error term in the prime number theoremJournal of Mathematical Analysis and Applications, 2023
- Improving bounds on prime counting functions by partial verification of the Riemann hypothesisThe Ramanujan Journal, 2022
- Estimating 𝜋(𝑥) and related functions under partial RH assumptionsMathematics of Computation, 2015
- Sur la conjecture π(x+y)≤π(x)+π(y)Acta Arithmetica, 2002
- Sharper Bounds for the Chebyshev Functions θ(x) and ψ(x)Mathematics of Computation, 1975