Robin’s Inequality at Colossally Abundant Numbers and Nicolas’ Inequality at Their Largest Prime Factor
Year: 2026
Type: preprint
Abstract: Robin's criterion states that the Riemann Hypothesis holds if and only if \( \sigma(n) < e^{\gamma} \cdot n \cdot \log\log n \) for every \( n > 5040 \), and Nicolas' criterion states that it holds if and only if \( c(q) = \log(q\#/\varphi(q\#)) - \gamma - \log\log\theta(q) > 0 \) for every prime \( q \), where \( q\# \) is the primorial of \( q \) and \( \theta \) is the Chebyshev function. Let \( N \) be a colossally abundant number, let \( \xi(N) \) be the real number associated with \( N \) by Nicolas, and let \( q \) be the largest prime not exceeding \( \xi(N) \). Writing \( \Delta(N) = \log(\sigma(N)/N) - \gamma - \log\log\log N \), we prove without any hypothesis that, whenever \( \log q \geq 31 \), \( 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) \). The range \( \log q \geq 31 \) contains the prime \( q \) of every colossally abundant counterexample, in accordance with the author's result that the largest prime factor of the least counterexample exceeds \( e^{31.018} \). Thus the functions \( \Delta(N) \) and \( c(q) \) differ by \( 2\sqrt{2}/(\sqrt{q} \log q) \) up to an explicit error of order \( 1/(\sqrt{q} \log^{2} q) \). This comparison is two-sided, but it is not an equivalence between Robin's inequality at \( N \) and Nicolas' inequality at \( q \): it does not decide Robin's inequality at \( N \) when \( c(q) \sqrt{q} \log q \) lies between \( 2\sqrt{2}(1 - 1.4035/\log q) \) and \( 2\sqrt{2}(1 - 0.4787/\log q) \). As consequences, every colossally abundant counterexample to Robin's inequality yields a prime \( q \) with \( c(q) > 2.70/(\sqrt{q} \log q) \); conversely, every prime \( q \) with \( \log q \geq 31 \) and \( c(q) > 2\sqrt{2}(1 - 0.4787/\log q)/(\sqrt{q} \log q) \) yields a colossally abundant counterexample, which gives a derivation of Robin's known theorem on colossally abundant counterexamples from Nicolas' oscillation theorem; and under the Riemann Hypothesis every colossally abundant number with \( \log q \geq 31 \) satisfies \( \Delta(N) < -0.654/(\sqrt{q} \log q) \), in accordance with the constant \( 2(\sqrt{2}-1) \) of Ramanujan's bound. For superabundant counterexamples, using the exponent bound of Nazardonyavi and Yakubovich, which gives \( \log n \geq \psi(p_{k}) \) for the largest prime factor \( p_{k} \), we prove \( c(p_{k}) > 0.9991/(\sqrt{p_{k}} \log p_{k}) \), a bound that applies to the least counterexample, which is superabundant, and we show that the least colossally abundant number not smaller than the least counterexample \( n \) is itself a counterexample \( N \) with \( \log N - \log\xi(N) \leq \log n \).
Source: Preprints.org
Author: Frank Vega
Language: English
Subfield: Algebra and Number Theory
Field: Mathematics
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W7225869825
