The Nicolas Criterion for the Riemann Hypothesis

20 December 2021, Version 5
This content is an early or alternative research output and has not been peer-reviewed by Cambridge University Press at the time of posting.

Abstract

In mathematics, the Riemann hypothesis is a conjecture that the Riemann zeta function has its zeros only at the negative even integers and complex numbers with real part $\frac{1}{2}$. For every prime number $p_{n}$, we define the sequence $X_{n} = \prod_{q \leq p_{n}} \frac{q}{q-1} - e^{\gamma} \times \log \theta(p_{n})$, where $\theta(x)$ is the Chebyshev function and $\gamma \approx 0.57721$ is the Euler-Mascheroni constant. The Nicolas criterion states that the Riemann hypothesis is true if and only if $X_{n} > 0$ holds for all primes $p_{n} > 2$. For every prime number $p_{k} > 2$, $X_{k} > 0$ is called the Nicolas inequality. We prove that the Nicolas inequality holds for all primes $p_{n} > 2$. In this way, we demonstrate that the Riemann hypothesis is true.

Keywords

Riemann hypothesis
Nicolas inequality
Chebyshev function
Monotonicity
prime numbers

Supplementary weblinks

Comments

Comments are not moderated before they are posted, but they can be removed by the site moderators if they are found to be in contravention of our Commenting and Discussion Policy [opens in a new tab] - please read this policy before you post. Comments should be used for scholarly discussion of the content in question. You can find more information about how to use the commenting feature here [opens in a new tab] .
This site is protected by reCAPTCHA and the Google Privacy Policy [opens in a new tab] and Terms of Service [opens in a new tab] apply.