2000 character limit reached
A Direct Proof of the Prime Number Theorem using Riemann's Prime-counting Function
Published 7 May 2021 in math.NT | (2105.05317v5)
Abstract: In this paper, we develop a novel analytic method to prove the prime number theorem in de la Vall\'ee Poussin's form: $$ \pi(x)=\operatorname{li}(x)+\mathcal O(xe{-c\sqrt{\log x}}) $$ Instead of performing asymptotic expansion on Chebyshev functions as in conventional analytic methods, this new approach uses contour-integration method to analyze Riemann's prime counting function $J(x)$, which only differs from $\pi(x)$ by $\mathcal O(\sqrt x/\log x)$.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.