The error term in the prime number theorem
Dave Platt, Tim Trudgian

TL;DR
This paper explicitly refines the error term in the prime number theorem, reducing it to roughly the square root of previous bounds, and applies this to a classical inequality problem linked to Ramanujan.
Contribution
It makes explicit a theorem improving the error term in the prime number theorem and applies it to a longstanding problem related to Ramanujan.
Findings
Error term in prime number theorem improved to roughly square-root of previous bounds
Explicit version of Pintz's theorem provided
Application to Ramanujan's inequality problem
Abstract
We make explicit a theorem of Pintz concerning the error term in the prime number theorem. This gives an improved version of the prime number theorem with error term roughly square-root of that which was previously known. We apply this to a long-standing problem concerning an inequality studied by Ramanujan.
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.
