Downloads provided by UsageCounts
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 $n > 5040$, where $\sigma(n)$ is the sum-of-divisors function and $\gamma \approx 0.57721$ is the Euler-Mascheroni constant. This is known as the Robin inequality. We obtain a contradiction just assuming the smallest counterexample of the Robin inequality exists for some $n > 5040$. In this way, we prove that the Robin inequality is true for all $n > 5040$. Consequently, the Riemann Hypothesis is also true.
sum-of-divisors function, prime numbers, Riemann hypothesis, Robin inequality
sum-of-divisors function, prime numbers, Riemann hypothesis, Robin inequality
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 0 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
| views | 5 | |
| downloads | 3 |

Views provided by UsageCounts
Downloads provided by UsageCounts