Robin’s Criterion on Superabundant Numbers
Year: 2024
Type: preprint
Abstract: The Riemann hypothesis is the assertion that all non-trivial zeros are complex numbers with real part $\frac{1}{2}$. It is considered by many to be the most important unsolved problem in pure mathematics. There are several statements equivalent to the famous Riemann hypothesis. Robin's criterion states that the Riemann hypothesis is true if and only if the inequality $\sigma(n) < e^{\gamma} \cdot n \cdot \log \log n$ holds for all natural numbers $n > 5040$, where $\sigma(n)$ is the sum-of-divisors function of $n$, $\gamma \approx 0.57721$ is the Euler-Mascheroni constant and $\log$ is the natural logarithm. We require the properties of superabundant numbers, that is to say left to right maxima of $n \mapsto \frac{\sigma(n)}{n}$. In this note, using Robin's criterion on superabundant numbers, we prove that the Riemann hypothesis is true.
Source: Preprints.org
Author: Frank Vega
Language: English
Subfield: Algebra and Number Theory
Field: Mathematics
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W4304459158