A Direct Proof of the Prime Number Theorem using Riemann's Prime-counting Function
Zihao Liu

TL;DR
This paper introduces a new analytic contour-integration method to prove the prime number theorem directly via Riemann's prime counting function, offering an alternative to traditional asymptotic expansions.
Contribution
It presents a novel proof of the prime number theorem using contour integration on Riemann's prime counting function, diverging from conventional methods.
Findings
Proves the prime number theorem in de la Vallée Poussin's form
Develops a new analytic approach using contour integration
Shows Riemann's prime counting function closely approximates π(x)
Abstract
In this paper, we develop a novel analytic method to prove the prime number theorem in de la Vall\'ee Poussin's form: 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 , which only differs from by .
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.
