Proof of the Riemann Hypothesis

EasyChair Preprint no. 7159

10 pagesDate: December 6, 2021

Abstract

The Riemann hypothesis has been considered the most important unsolved problem in mathematics. Robin criterion states that the Riemann hypothesis is true if and only if the inequality $\sigma(n) < e^{\gamma } \times n \times \log \log n$ holds for all natural numbers $n > 5040$, where $\sigma(n)$ is the sum-of-divisors function of $n$ and $\gamma \approx 0.57721$ is the Euler-Mascheroni constant. We show that the Robin inequality is true for all natural numbers $n > 5040$ which are not divisible by the prime $3$. Moreover, we prove that the Robin inequality is true for all natural numbers $n > 5040$ which are divisible by the prime $3$. Consequently, the Robin inequality is true for all natural numbers $n > 5040$ and thus, the Riemann hypothesis is true.

Keyphrases: prime numbers, Riemann hypothesis, Riemann zeta function, Robin inequality, sum-of-divisors function