Colossally Abundant Numbers and Nicolas' Second Criterion

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

Contributed by Frank Vega ↗

Version 1 / Nov 15, 2026 / CC BY 4.0

Abstract

Robin's criterion states that the Riemann Hypothesis holds if and only if σ(n)<eγnlog⁡log⁡n\sigma(n) < e^{\gamma} n \log\log n for every n>5040n > 5040. Nicolas' second criterion, in the form given by Broughan, states that it holds if and only if n/φ(n)<eγlog⁡log⁡n+eγ(2+τ)/log⁡nn/\varphi(n) < e^{\gamma} \log\log n + e^{\gamma}(2 + \tau)/\sqrt{\log n} for every n≥N120569n \geq N_{120569}, where NkN_{k} is the kk-th primorial and τ=2+γ−log⁡(4π)\tau = 2 + \gamma - \log(4\pi); for NkN_{k} this inequality reads c(pk)<E(pk)c(p_{k}) < E(p_{k}). Let NN be a colossally abundant number, let q=pkq = p_{k} be the largest prime not exceeding the number ξ(N)\xi(N) associated with NN by Nicolas, and write Δ(N)=log⁡(σ(N)/N)−γ−log⁡log⁡log⁡N\Delta(N) = \log(\sigma(N)/N) - \gamma - \log\log\log N. For log⁡q≥31\log q \geq 31 we prove unconditionally that 1.317/(qlog⁡2q)≤Δ(N)−c(q)+E(q)+(22−2−τ)/(qlog⁡q)≤3.973/(qlog⁡2q)1.317/(\sqrt{q}\log^{2} q) \leq \Delta(N) - c(q) + E(q) + (2\sqrt{2} - 2 - \tau)/(\sqrt{q}\log q) \leq 3.973/(\sqrt{q}\log^{2} q). Consequently, the second inequality for NkN_{k} implies Δ(N)<−0.654/(qlog⁡q)\Delta(N) < -0.654/(\sqrt{q}\log q). We also prove that the primorials are the extremal cases of the second inequality, and that if it holds for every NkN_{k} with e31≤pk≤Xe^{31} \leq p_{k} \leq X, then Robin's inequality holds for every n>5040n > 5040 with log⁡n≤X(1−log⁡−3X)−log⁡X\log n \leq X(1 - \log^{-3} X) - \log X. A computation over the primes up to X=100,000,008,765,439X = 100{,}000{,}008{,}765{,}439 verifies this hypothesis, so Robin's inequality holds unconditionally for 5040<n≤101013.63775040 < n \leq 10^{10^{13.6377}}. To the author's knowledge, this is the largest range for which Robin's inequality has been verified: it extends the range 5040<n≤101013.114855040 < n \leq 10^{10^{13.11485}} of Morrill and Platt.

Provenance statement

The author used Claude Opus 5.5 to write the verification script verify_second_criterion.py of Section 7 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.

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 27 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. Broughan, Kevin. Equivalents of the Riemann Hypothesis. Volume 1: Arithmetic Equivalents. Cambridge University Press, vol. 164. 2017DOI
  13. Büthe, Jan. An analytic method for bounding ψ(x)\psi(x). Mathematics of Computation, vol. 87, no. 312, pp. 1991–2009. 2018DOI
  14. Dusart, Pierre. Explicit estimates of some functions over primes. The Ramanujan Journal, vol. 45, no. 1, pp. 227–251. 2018DOI
  15. 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
  16. 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
  17. Axler, Christian. New estimates for some functions defined over primes. Integers, vol. 18, no. A52. 2018

Version history

  1. v1 · 23 pagesSubmitted by Frank VegaInitial depositCurrentNov 14, 2026