The mean square of the error term in the prime number theorem
Richard P. Brent, David J. Platt, and Timothy S. Trudgian

TL;DR
This paper investigates the error term in the prime number theorem, establishing bounds on its mean square under the Riemann hypothesis and unconditionally, revealing new insights into its asymptotic behavior.
Contribution
It provides improved bounds on the mean square of the error term in the prime number theorem, both conditionally under RH and unconditionally, and shows that the ratio has no limit as X grows.
Findings
Under RH, limsup of I(X)/X^2 is at most 0.8603.
Unconditionally, I(X)/X^2 is bounded below by 1/5374 for large X.
The ratio I(X)/X^2 does not have a limit as X approaches infinity.
Abstract
We show that, on the Riemann hypothesis, , where This proves (and improves on) a claim by Pintz from 1982. We also show unconditionally that for sufficiently large , and that the has no limit as .
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
