The Riemann Hypothesis

06 July 2021, Version 13
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

Let's define $\delta(x) = (\sum_{{q\leq x}}{\frac{1}{q}}-\log \log x-B)$, where $B \approx 0.2614972128$ is the Meissel-Mertens constant. The Robin theorem states that $\delta(x)$ changes sign infinitely often. For $x \geq 2$, Nicolas defined the function $u(x) = \sum_{q > x} \left(\log( \frac{q}{q-1}) - \frac{1}{q} \right)$ and proved that $0 < u(x) \leq \frac{1}{2 \times (x - 1)}$. We define the another function $\varpi(x) = \left(\sum_{{q\leq x}}{\frac{1}{q}}-\log \log \theta(x)-B \right)$, where $\theta(x)$ is the Chebyshev function. Using the Nicolas theorem, we demonstrate that the Riemann Hypothesis is true if and only if the inequality $\varpi(x) > u(x)$ is satisfied for all number $x \geq 3$. Consequently, we show that when the inequality $\varpi(x) \leq 0$ is satisfied for some number $x \geq 3$, then the Riemann Hypothesis should be false. In addition, we know that $\lim_{{x\to \infty }} \varpi(x) = 0$.

Keywords

Chebyshev function
Nicolas theorem
Riemann hypothesis
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.