A Very Brief Note on the Riemann Hypothesis

16 August 2022, Version 2
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

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$ and $\gamma \approx 0.57721$ is the Euler-Mascheroni constant. We study some properties about the possible counterexamples of the Robin's inequality greater than $5040$. We obtain for the possible smallest counterexample of the Robin's inequality $n > 5040$ that $n < \alpha^{2} \cdot (N_{k})^{1.000208229291}$, where $N_{k} = \prod_{i = 1}^{k} q_{i}$ is the primorial number of order $k$ and $\alpha = \prod_{i=1}^{k} \left(1 - \frac{1}{q_{i}^{a_{i} + 1}} \right)$ when $n$ is a superabundant number by this representation $n = \prod_{i = 1}^{k} q_{i}^{a_{i}}$. Finally, we provide solid arguments which suggest that the Riemann Hypothesis is possibly true.

Keywords

Riemann Hypothesis
Robin's inequality
Sum-of-divisors function
Superabundant numbers
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.