The Robin Inequality On Certain Numbers

19 May 2021, Version 1
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}$. In 1915, Ramanujan proved that under the assumption of the Riemann hypothesis, the inequality $\sigma(n) < e^{\gamma } \times n \times \log \log n$ holds for all sufficiently large $n$, where $\sigma(n)$ is the sum-of-divisors function and $\gamma \approx 0.57721$ is the Euler-Mascheroni constant. In 1984, Guy Robin proved that the inequality is true for all $n > 5040$ if and only if the Riemann hypothesis is true. Since then, this is called as the Robin inequality. It is known that the Robin inequality is satisfied for many classes of numbers. We show more classes of numbers for which the Robin inequality is always satisfied.

Keywords

Riemann hypothesis
Robin inequality
sum-of-divisors function
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.