Abstract
Grönwall's function \(G\) is defined for all natural numbers \(n>1\) by \(G(n)=\frac{\sigma(n)}{n \cdot \log \log n}\) where \(\sigma(n)\) is the sum of the divisors of \(n\) and \(\log\) is the natural logarithm. We require the properties of extremely abundant numbers, that is to say left to right maxima of \(n \mapsto G(n)\). We also use the colossally abundant and hyper abundant numbers. There are several statements equivalent to the famous Riemann hypothesis. It is known that the Riemann hypothesis is true if and only if there exist infinitely many extremely abundant numbers. In this note, using this criterion on hyper abundant numbers, we prove that the Riemann hypothesis is true.
Reference7 articles.
1. Jean-Louis Nicolas and Guy Robin, Highly Composite Numbers by Srinivasa Ramanujan, The Ramanujan Journal 1 (1997), no. 2, 119–153.
2. Leonidas Alaoglu and Paul Erdős, On Highly Composite and Similar Numbers, Transactions of the American Mathematical Society 56 (1944), no. 3, 448–469.
3. Jean Louis Nicolas, Some Open Questions, The Ramanujan Journal 9 (2005), no. 1, 251–264.
4. Thomas H Grönwall, Some Asymptotic Expressions in the Theory of Numbers, Transactions of the American Mathematical Society 14 (1913), no. 1, 113–122.
5. Guy Robin, Grandes valeurs de la fonction somme des diviseurs et hypothèse de Riemann, J. Math. pures appl 63 (1984), no. 2, 187–213.