HEXAGONbeta

Robin's Inequality at Colossally Abundant Numbers and Nicolas' Inequality at Their Largest Prime Factor

Primarily AI-generated textHuman understanding: all partsmath.NT — Number Theorymath.NA — Numerical Analysis

Contributed by Frank Vega ↗

Version 1 / Nov 02, 2026 / CC BY 4.0

Abstract

Robin's criterion states that the Riemann Hypothesis holds if and only if σ(n)<eγ⋅n⋅log⁡log⁡n\sigma(n) < e^{\gamma} \cdot n \cdot \log\log n for every n>5040n > 5040, and Nicolas' criterion states that it holds if and only if c(q)=log⁡(q#/φ(q#))−γ−log⁡log⁡θ(q)>0c(q) = \log(q\#/\varphi(q\#)) - \gamma - \log\log\theta(q) > 0 for every prime qq, where q#q\# is the primorial of qq and θ\theta is the Chebyshev function. Let NN be a colossally abundant number, let ξ(N)\xi(N) be the real number associated with NN by Nicolas, and let qq be the largest prime not exceeding ξ(N)\xi(N). Writing Δ(N)=log⁡(σ(N)/N)−γ−log⁡log⁡log⁡N\Delta(N) = \log(\sigma(N)/N) - \gamma - \log\log\log N, we prove without any hypothesis that, whenever log⁡q≥31\log q \geq 31, 1.353/(qlog⁡2q)≤Δ(N)−c(q)+22/(qlog⁡q)≤3.970/(qlog⁡2q)1.353/(\sqrt{q} \log^{2} q) \leq \Delta(N) - c(q) + 2\sqrt{2}/(\sqrt{q} \log q) \leq 3.970/(\sqrt{q} \log^{2} q). Thus Robin's inequality at NN and Nicolas' inequality at qq differ by 22/(qlog⁡q)2\sqrt{2}/(\sqrt{q} \log q) up to an explicit error of smaller order. As consequences, every colossally abundant counterexample to Robin's inequality yields a prime qq with c(q)>2.70/(qlog⁡q)c(q) > 2.70/(\sqrt{q} \log q); conversely, every prime qq with log⁡q≥31\log q \geq 31 and c(q)>22(1−0.4787/log⁡q)/(qlog⁡q)c(q) > 2\sqrt{2}(1 - 0.4787/\log q)/(\sqrt{q} \log q) yields a colossally abundant counterexample, so that Nicolas' oscillation theorem implies Robin's theorem on colossally abundant counterexamples; and under the Riemann Hypothesis every colossally abundant number with log⁡q≥31\log q \geq 31 satisfies Δ(N)<−0.654/(qlog⁡q)\Delta(N) < -0.654/(\sqrt{q} \log q), in accordance with the constant 2(2−1)2(\sqrt{2}-1) of Ramanujan's bound. For superabundant counterexamples, using the exponent bound of Nazardonyavi and Yakubovich, which gives log⁡n≥ψ(pk)\log n \geq \psi(p_{k}) for the largest prime factor pkp_{k}, we prove c(pk)>0.9991/(pklog⁡pk)c(p_{k}) > 0.9991/(\sqrt{p_{k}} \log p_{k}), and we show that the least colossally abundant number not smaller than the least counterexample nn is itself a counterexample NN with log⁡N−log⁡ξ(N)≤log⁡n\log N - \log\xi(N) \leq \log n.

Provenance statement

The author used Claude Opus 5.5 to write the verification script verify_robin_nicolas.py of Section 6 and to generate parts of the text of this manuscript. The experiments were run by the author. After using this tool, the author reviewed and edited the code and the content as needed and takes full responsibility for the content of the publication.
AI provenance filesverify_robin_nicolas.py · 9 KB

Tools used

Anthropic
Claude OpusVersion 5.5

References

  1. Borwein, Peter B.; Choi, Stephen; Rooney, Brendan; Weirathmueller, Andrea. The Riemann Hypothesis: A Resource for the Afficionado and Virtuoso Alike. Springer, vol. 27. 2008DOI
  2. Conrey, Brian. Riemann's hypothesis. Colloquium De Giorgi 2013 and 2014, pp. 109–117. 2015DOI
  3. Connes, Alain. An Essay on the Riemann Hypothesis. Open Problems in Mathematics, pp. 225–257. 2016DOI
  4. Conrey, Brian. The Riemann Hypothesis. Notices of the AMS, vol. 50, no. 3, pp. 341–353. 2003
  5. Robin, Guy. Grandes valeurs de la fonction somme des diviseurs et hypothèse de Riemann. Journal de Mathématiques Pures et Appliquées. Neuvième Série, vol. 63, no. 2, pp. 187–213. 1984
  6. Grönwall, Thomas Hakon. Some asymptotic expressions in the theory of numbers. Transactions of the American Mathematical Society, vol. 14, no. 1, pp. 113–122. 1913DOI
  7. Lagarias, Jeffrey C. An elementary problem equivalent to the Riemann hypothesis. The American Mathematical Monthly, vol. 109, no. 6, pp. 534–543. 2002DOI
  8. Briggs, Keith. Abundant numbers and the Riemann hypothesis. Experimental Mathematics, vol. 15, no. 2, pp. 251–256. 2006DOI
  9. Caveney, Geoffrey; Nicolas, Jean-Louis; Sondow, Jonathan. On SA, CA, and GA numbers. The Ramanujan Journal, vol. 29, no. 1–3, pp. 359–384. 2012DOI
  10. Choie, YoungJu; Lichiardopol, Nicolas; Moree, Pieter; Solé, Patrick. On Robin's criterion for the Riemann hypothesis. Journal de Théorie des Nombres de Bordeaux, vol. 19, no. 2, pp. 357–372. 2007DOI
Show all 26 referencesShow fewer references
  1. Banks, William D.; Hart, Derrick; Moree, Pieter; Nevans, C. Wesley. The Nicolas and Robin inequalities with sums of two squares. Monatshefte für Mathematik, vol. 157, no. 4, pp. 303–322. 2009DOI
  2. Solé, Patrick; Planat, Michel. The Robin inequality for 7-free integers. Integers, vol. 12, no. 2, pp. 301–309. 2012DOI
  3. Broughan, Kevin; Trudgian, Tim. Robin's inequality for 11-free integers. Integers, vol. 15. 2015
  4. Platt, David J.; Morrill, Thomas. Robin's inequality for 20-free integers. Integers, vol. 21, no. A28. 2021
  5. Akbary, Amir; Friggstad, Zachary. Superabundant numbers and the Riemann hypothesis. The American Mathematical Monthly, vol. 116, no. 3, pp. 273–275. 2009DOI
  6. Nazardonyavi, Sadegh; Yakubovich, Semyon. Extremely abundant numbers and the Riemann hypothesis. Journal of Integer Sequences, vol. 17, no. 2. 2014
  7. Vega, Frank. Robin's criterion on divisibility. The Ramanujan Journal, vol. 59, no. 3, pp. 745–755. 2022DOI
  8. Nicolas, Jean-Louis. Petites valeurs de la fonction d'Euler. Journal of Number Theory, vol. 17, no. 3, pp. 375–388. 1983DOI
  9. Ramanujan, Srinivasa. Highly composite numbers. The Ramanujan Journal, vol. 1, no. 2, pp. 119–153. 1997. Annotated and with a foreword by Jean-Louis Nicolas and Guy RobinDOI
  10. Nicolas, Jean-Louis. The sum of divisors function and the Riemann hypothesis. The Ramanujan Journal, vol. 58, no. 4, pp. 1113–1157. 2022DOI
  11. Nicolas, Jean-Louis. Small values of the Euler function and the Riemann hypothesis. Acta Arithmetica, vol. 155, no. 3, pp. 311–321. 2012DOI
  12. Alaoglu, Leonidas; Erdős, Paul. On highly composite and similar numbers. Transactions of the American Mathematical Society, vol. 56, no. 3, pp. 448–469. 1944DOI
  13. Rosser, J. Barkley; Schoenfeld, Lowell. Approximate formulas for some functions of prime numbers. Illinois Journal of Mathematics, vol. 6, no. 1, pp. 64–94. 1962DOI
  14. Büthe, Jan. An analytic method for bounding ψ(x)\psi(x). Mathematics of Computation, vol. 87, no. 312, pp. 1991–2009. 2018DOI
  15. Dusart, Pierre. Explicit estimates of some functions over primes. The Ramanujan Journal, vol. 45, no. 1, pp. 227–251. 2018DOI
  16. Axler, Christian. New estimates for some functions defined over primes. Integers, vol. 18, no. A52. 2018

Version history

  1. v1Submitted by Frank VegaInitial depositCurrentOct 31, 2026