Chebyshev's bias and generalized Riemann hypothesis
Adel Alamadhi (MECAA), Michel Planat (FEMTO-ST), Patrick Sol\'e, (MECAA)

TL;DR
This paper explores Chebyshev's bias in prime number distributions, reformulates it for general moduli, and proves its equivalence to the generalized Riemann hypothesis, supported by numerical investigations.
Contribution
It generalizes Chebyshev's bias to arbitrary moduli and establishes its equivalence to the generalized Riemann hypothesis, combining theoretical reformulation with numerical analysis.
Findings
Chebyshev's bias relates to GRH for general moduli.
Numerical evidence supports the reformulation.
Proves the equivalence between bias and GRH for the modulus q.
Abstract
It is well known that (i) up to the (very large) Skewes' number \cite{Bays00}. But, according to a Littlewood's theorem, there exist infinitely many that violate the inequality, due to the specific distribution of non-trivial zeros of the Riemann zeta function , encoded by the equation (1). If Riemann hypothesis (RH) holds, (i) may be replaced by the equivalent statement (ii) due to Robin \cite{Robin84}. A statement similar to (i) was found by Chebyshev that (iii) holds for any \cite{Rubin94} (the notation means the number of primes up to and congruent to ). The {\it Chebyshev's bias}(iii) is related to the generalized Riemann hypothesis…
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
TopicsAnalytic Number Theory Research · Advanced Mathematical Identities · Mathematical functions and polynomials
