From Bombieri's Mean Value Theorem to the Riemann Hypothesis
Fu-Gao Song

TL;DR
This paper explores how Bombieri's mean value theorem relates to the prime number theorem and the Riemann hypothesis, establishing equivalences and bounds for primes in arithmetic progressions.
Contribution
It demonstrates the derivation of the prime number theorem and bounds on the least prime in arithmetic progressions from Bombieri's mean value theorem, linking key conjectures.
Findings
Prime number theorem is equivalent to the Riemann hypothesis under Bombieri's theorem.
Established an upper bound P(q)=O(q^2 [ln q]^32) for the least prime in arithmetic progressions.
Connected Bombieri's mean value theorem to fundamental conjectures in number theory.
Abstract
From Bombieri's mean value theorem one can deduce the prime number theorem being equivalent to the Riemann hypothesis and the least prime P(q) satisfying P(q)= O(q^2 [ln q]^32) in any arithmetic progressions with common difference q.
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.
Taxonomy
TopicsMathematical and Theoretical Analysis · Advanced Optimization Algorithms Research · Statistical and numerical algorithms
