Submitted:
11 November 2026
Posted:
12 November 2026
You are already at the latest version
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 \).
Keywords:
Riemann Hypothesis
; Robin’s inequality
; Nicolas’ inequality
; colossally abundant numbers
; superabundant numbers
; primorial
; Chebyshev function
MSC: 11M26; 11A41; 11A25; 11N37
1. Introduction
The Riemann Hypothesis (RH) is the conjecture that the Riemann zeta function has its zeros only at the negative even integers and at complex numbers with real part [1]. It has been called the “Holy Grail of Mathematics” [2,3], and numerous equivalent formulations exist [4]. One of particular interest here is Robin’s criterion [5], which asserts that RH is equivalent to the inequality
Here is the Euler–Mascheroni constant, is the sum-of-divisors function, and log denotes the natural logarithm. Grönwall’s theorem [6] states that , so (1) asserts that this limiting value is never attained beyond 5040. A closely related elementary reformulation in terms of harmonic numbers is due to Lagarias [7], and the extremal integers relevant to both criteria have been studied computationally by Briggs [8] and structurally by Caveney, Nicolas and Sondow [9].
It is known that (1) holds for many classes of integers: odd integers exceeding 9 and squarefree integers exceeding 30 [10], sums of two squares exceeding 720 [11], and t-free integers for and 20 [10,12,13,14]. Akbary and Friggstad [15] showed that the least counterexample to (1), should one exist, must be a superabundant number, Nazardonyavi and Yakubovich [16] refined this to the smaller class of extremely abundant numbers, and the author proved that its largest prime factor exceeds [17]. Robin [5] proved that if RH is false, then (1) fails for infinitely many colossally abundant numbers.
A second criterion concerns the primorials . For a real number put
where is the Chebyshev function, so that is the inequality , with Euler’s totient function. Nicolas [18] proved that for every if RH is true, and that if RH is false, then for some . Under RH, Ramanujan’s asymptotic upper bound for [19] contains the term , and Nicolas [20] gave an effective form of this bound, using the structure of colossally abundant numbers and his estimate [21] of under RH.
In this paper we compare Robin’s inequality at a colossally abundant number with Nicolas’ inequality at its largest prime factor, without assuming RH. For an integer put
so that Robin’s inequality holds for if and only if . To each colossally abundant number N Nicolas associates a real number [20] (Definition 4.3); every prime factor of N is at most (Section 3). Our main result is the following.
Theorem 1.
Let N be a colossally abundant number, and let q be the largest prime with . If , then
The hypothesis of Theorem 1 covers every colossally abundant counterexample to (1). In [17] (Theorem 4.2) the author proved that the largest prime factor of the least counterexample satisfies , and Lemma 6 gives for the largest prime factor of every counterexample; since every prime factor of a colossally abundant number N is at most q, the prime q of a colossally abundant counterexample satisfies .
Thus Robin’s function at N and Nicolas’ function at q differ by , up to an explicit error of order , that is, smaller by a factor . The comparison is two-sided, but it is not an equivalence between Robin’s inequality at N and Nicolas’ inequality at q. Theorem 1 gives when and when , and it does not determine the sign of when lies between these two numbers. Remark 2 lists the terms of the proof that produce this interval.
The relation of Theorem 1 to earlier work is the following. The comparison of with the Mertens product at colossally abundant numbers goes back to Robin [5] (Section 4), and the decomposition used here is that of Nicolas’ proof of [20] (Proposition 5.1), which gives, under RH and for , an upper and a lower bound for in terms of . In that proof RH is used in two ways. First, the Mertens product is evaluated by the estimate of under RH [21] (2.16), [20] (1.11) (Proposition 8). Second, the numbers , and are compared in [20], which is stated under RH and whose proof uses the bounds and valid under RH [20] (2.7), (2.8); the comparison of with in [20] (Lemma 4.17) is deduced from that lemma. The estimates of the sums over the primes according to their exponent in [20] (5.5)–(5.8) rest on bounds that do not assume RH. In Theorem 1 the Mertens product is not evaluated; it is kept inside . The comparison of with is made directly in Lemma 4, by the mean value theorem applied to the difference , in which is estimated by the bounds of Büthe [22] and Dusart [23], which give for every when (Lemma 1), and by the bound of Dusart. The sum is estimated by Stieltjes integration (Lemmas 2 and 3), as in [20] (Lemma 2.1), and the primes with exponent at least 2 are treated as in [20] (5.5), (5.6) (Lemma 5). By Proposition 1, a counterexample to (1) exists only if RH is false, so an estimate proved under RH does not apply to a counterexample; Theorem 1 applies to every colossally abundant number with , whether RH holds or not, and it is used in this way in Corollaries 1, 2 and 3. Under RH and for , the estimates of [20] give a narrower interval than Theorem 1; Remark 1 compares the constants.
Theorem 1 has the following consequences.
- (1)
- Every colossally abundant counterexample to (1) yields a prime q with and (Corollary 1).
- (2)
- Conversely, every prime q with and yields a colossally abundant counterexample to (1) (Corollary 2).
- (3)
- Nicolas’ theorem under the failure of RH implies, through (2), Robin’s theorem that (1) then fails for infinitely many colossally abundant numbers (Corollary 3).
- (4)
- Under RH, every colossally abundant number N with satisfies (Corollary 4); the constant obtained from Theorem 1 and the main term of is the constant of Ramanujan’s bound.
- (5)
For superabundant counterexamples, which need not be colossally abundant, we prove the following (Section 5).
- (6)
- Every superabundant number n with largest prime factor satisfies (Lemma 7, following [16]), and every superabundant counterexample satisfies (Theorem 2).
- (7)
- If n is the least counterexample, then the least colossally abundant number is a counterexample, and (Corollary 6).
The status of these statements with respect to the literature is as follows. Items (3) and (5) are derivations of known results: item (3) recovers Robin’s theorem (Proposition 6) from Nicolas’ theorem (Proposition 7) by means of Theorem 1, and the equivalence of item (5) also follows from the results of Nicolas, as stated there. The first claim of item (6) is due to Nazardonyavi and Yakubovich [16], and item (7) is obtained by combining two results of Robin and Nicolas (Proposition 10 (f) and (g)) with item (1). Theorem 1, items (1), (2) and (4), and the second claim of item (6) are proved in this paper.
The proofs use the description of colossally abundant numbers by Alaoglu and Erdos [24], Robin [5] and Nicolas [20], explicit estimates for the Chebyshev function of Rosser and Schoenfeld [25], Büthe [22] and Dusart [23], the estimate of Axler [26] for the Mertens product, and the numerical verification of (1) for all due to Morrill and Platt [14]. Section 2 collects these results, Section 3 proves Theorem 1, Section 4 derives its consequences, Section 5 treats superabundant counterexamples, and Section 6 describes the computer verification of the numerical constants.
2. Background
We write for the abundancy index, and we say that Robin’s inequality holds for n if . An integer for which Robin’s inequality does not hold is called a counterexample. We write for the second Chebyshev function, so that and . For a prime p we write , so that , and denotes the sequence of primes. Since and change only at primes, when q is the largest prime with .
2.1. Robin’s Criterion and Counterexamples
Proposition 1.
Robin’s inequality holds for all natural numbers if and only if the Riemann Hypothesis is true [5].
Proposition 2.
For , , where is the product of the distinct primes dividing n [10] ((2.7), p. 362).
Proposition 3.
Robin’s inequality holds for every integer n with [14] (Theorem 5).
A natural number n is superabundant if for every , and colossally abundant if there is with for every [24]; such a number is called a parameter of n. Every colossally abundant number is superabundant [24].
Proposition 4.
If n is superabundant with largest prime factor , then with [24] (Theorem 1, p. 450).
Proposition 5.
If is the smallest integer such that Robin’s inequality does not hold for n, then n is superabundant [15].
Proposition 6.
If the Riemann Hypothesis is false, then Robin’s inequality fails for infinitely many colossally abundant numbers [5] (Section 4, Proposition 1).
2.2. Nicolas’ Criterion
Proposition 7.
In [18,21] the statement is given for , where . Put
where runs over the nontrivial zeros of the Riemann zeta function [20] (1.3), (1.5).
Proposition 8.
Consequently for every .
Proof.
The left inequality gives , and . □
2.3. Explicit Estimates for Primes
Proposition 9.
The following hold.
Lemma 1.
The following hold.
- (a)
- for every .
- (b)
- Let . Then for every .
Proof. (a) For this is Proposition 9 (a); for , Proposition 9 (b) gives .
(b) Let . If , Proposition 9 (a) gives and , so ; the right-hand side is decreasing for , and is less than at . If , Proposition 9 (b) gives with . If , this is at most , and otherwise it is at most . □
Lemma 2.
Let and be such that for every . Put . Then
Proof.
Put . Since , we have , hence , , and . By Stieltjes integration,
and . Using for , the sum is at least , and at most , using . □
3. Colossally Abundant Numbers
3.1. The Structure of Colossally Abundant Numbers
We recall the description given by Nicolas [20] (Section 4), which goes back to Alaoglu and Erdos [24] and Robin [5]. For real and an integer put
which is decreasing in t. Let N be a colossally abundant number and its largest parameter. The number determines a sequence of real numbers , which are the thresholds at which the exponent of a prime changes (Proposition 10 (a)): is defined by , and for by , with ; K is the largest j with [20] (Definition 4.3). Put . Throughout, the letter without index denotes , and the other terms of the sequence always carry their index . The numbers N and have the same largest parameter , hence the same numbers , and K; they need not be equal, and by Proposition 10 (a) and (b) below, N divides and . The exponents of the primes are described for , and the results are stated for N.
Proposition 10.
With this notation, the following hold.
3.2. Three Estimates
Throughout this subsection, N is a colossally abundant number with , where , and we put
The proof of Theorem 1 rests on three estimates, each with main term or a multiple of it. Lemma 3 estimates : by Lemma 2, has the main term , and . Lemma 4 estimates : by the mean value theorem this difference has the main term , where has the main term , which is up to a factor , and . Lemma 5 shows that is up to a term of smaller order. The three lemmas give up to terms of the form , and the decimal constants in their statements are the values of C obtained for ; these constants are verified in Section 6 (Table 4).
By Proposition 10 (d), and since and ,
so Lemma 1 (b) applies to every with . Table 1 collects the notation of this section. Here and are the lower and the upper bound for of Proposition 10 (d); they are used only through (2). For we have by , and since , also , so that
Lemma 3.
.
Proof.
Since , we get , and
By Lemma 2 with and ,
and
where we used and . By Lemma 2 with , using ,
because is decreasing for . Since , the claim follows. □
Lemma 4.
.
Proof.
Put . By Proposition 10 (c), , so , and by Proposition 9 (d), , because for . Proposition 10 (b) and (e) and Lemma 1 then give
Moreover
because is decreasing for . Hence
By Proposition 9 (b), . Hence , so that and
Also , so that
Since is decreasing for , the mean value theorem gives
With , the lower bound is at least , and the upper bound is at most . □
Lemma 5.
Let q be the largest prime with . Then
Proof.
For let be the exponent of p in . By Proposition 10 (a) and (b), the primes are the primes , and
Every term of the second sum is negative, and for ; since , the second sum is at most , and the upper bound follows from .
For the lower bound we split the second sum into three parts. For , , so this part is at least . For , , and by Proposition 9 (e), since , this part is at least . For , if with , then by Proposition 10 (c), so ; by Proposition 9 (d) and Proposition 10 (c), the number of such primes is at most , so this part is at least . Together with and ,
Finally , and is decreasing for , so , while by Lemma 3 and (2). □
Table 2 summarizes the proof of Lemma 5: it lists the four terms of , according to the exponent of the prime p in , with the bounds obtained for each of them.
3.3. Proof of Theorem 1
Proof Theorem 1.
Put , and , so that . Since and the primes are the primes , we have and
By Lemmas 3, 4 and 5,
that is, . Put . The prime following q exceeds , so by Proposition 9 (c), and . Hence , , and
Therefore
and
Since , and , the theorem follows. □
In the notation of the proof, Theorem 1 is the pair of inequalities
Remark 1.
The decomposition of used in the proof of Theorem 1 follows Nicolas’ proof of [20] (Proposition 5.1), in which is written as [20] (5.4), with the Mertens product; a comparison of with this product for colossally abundant numbers N also underlies Robin’s proof of Proposition 6 [5] (Section 4). In [20] (Proposition 5.1) the Mertens product is evaluated under RH by [21] (2.16), that is, by Proposition 8. In Theorem 1 it is kept in the form , so that no hypothesis on the zeros of the Riemann zeta function is used, and the remaining terms are bounded from above and from below with explicit constants for every colossally abundant number with . The estimate of the Mertens product that does not assume RH, Proposition 9 (f), is an upper bound with the factor , where , whereas the terms compared in Theorem 1 are of order ; in this paper it is used only in Lemmas 6 and 9. Under RH, [20] contains a comparison of the same form as Theorem 1, with in place of q: for , the estimates [20] (5.5)–(5.8), (4.68), (4.69) give, for the number ,
where U is the sum of [20] (5.4), which satisfies [20] (5.3), so that W is with replaced by U. Here and are the sums of the constants of [20] (5.8), (4.69) and of [20] (5.7), (4.68), and is the sum of the constants of [20] (5.5), (5.6), (4.69); with [20] (1.11) they give the constants and of [20] (5.11), (5.12). The interval from to , of length , is contained in the interval from to of Theorem 1, of length . Thus, under RH and for , the estimates of [20] are more precise than Theorem 1; Theorem 1 holds without RH, and its constants include, at the threshold , the terms of order (Remark 2).
Remark 2.
The two bounds of Theorem 1 differ by . Consequently, Corollaries 1 and 2 below do not decide whether Robin’s inequality holds at a colossally abundant number N when lies between and . In the proof, the two sides differ by ; of this, comes from Lemma 5 (the primes , which have exponent at least 2), from Lemma 3, and from Lemma 4. Two of these contributions are bounds, evaluated at the threshold , of quantities that tend to 0 as . The term of Lemma 5 bounds a quantity which is at most (Table 2), and in the proof of Lemma 4 the term , which is part of the contribution , bounds , which comes from the primes with exponent at least 3 in ; the functions and are decreasing for and tend to 0. The rest of the difference comes from the relative error of for (Lemma 1 (b)) and from the two bounds for of Proposition 10 (d), whose constants are and , the latter being stated for .
4. Consequences
Lemma 6.
Let n be a counterexample with largest prime factor . Then and .
Proof.
Put and . By Proposition 3, , so . By Proposition 2, . If , then by Proposition 9 (f) at , this product is less than , a contradiction. Hence , and Proposition 9 (f) gives . Since is decreasing and , , so ; then , so and . □
For the least counterexample, the author proved [17] (Theorem 4.2); Lemma 6 applies to every counterexample.
Corollary 1.
Let N be a colossally abundant counterexample, and q the largest prime with . Then and
Proof.
The largest prime factor of N is at most by Proposition 10 (a), so and by Lemma 6. Since Robin’s inequality fails for N, , and the upper bound in (4) gives the first inequality. The function is increasing, and its value at exceeds . □
Corollary 2.
Let q be a prime with and
Then every colossally abundant number N such that q is the largest prime with is a counterexample. In particular, the colossally abundant number of Proposition 10 (a), for which , is a counterexample.
Proof.
The lower bound in (4) gives , that is, , and because q divides and by Proposition 10 (b). For , the number is colossally abundant with largest parameter by Proposition 10 (a), and because is decreasing. □
By Corollaries 1 and 2, for colossally abundant numbers N with , Robin’s inequality fails at N when and holds at N when .
Corollary 3.
Proposition 7 and Corollary 2 imply Proposition 6: if the Riemann Hypothesis is false, then Robin’s inequality fails for infinitely many colossally abundant numbers.
Proof.
If RH is false, Proposition 7 gives and such that for arbitrarily large x. Let q be the largest prime with ; then and , so for all sufficiently large such x. Corollary 2 gives a colossally abundant counterexample for each such q with , and these numbers are distinct because . □
Remark 3.
Corollary 4.
Assume the Riemann Hypothesis. Let N be a colossally abundant number, and q the largest prime with . If , then
Proof.
By (4) and Proposition 8, since ,
□
The number appearing in the proof is the constant obtained from Ramanujan’s bound [19] together with , as in [20] (1.8); here plays the role of , since by the proof of Lemma 4 and Proposition 9 (c).
Corollary 5.
The Riemann Hypothesis is true if and only if
for every prime .
Proof.
The inequality is . If RH is true, it holds for every prime by Proposition 8. If RH is false, Proposition 6 gives a colossally abundant counterexample, and Corollary 1 gives a prime q with , so , and . □
By Propositions 7 and 8, the equivalence of Corollary 5 also holds with replaced by any constant greater than . Corollary 1 identifies primes that violate it: the primes q attached to colossally abundant counterexamples.
5. Superabundant Counterexamples
The results of Section 4 concern counterexamples that are colossally abundant, whereas Proposition 5 states that the least counterexample is superabundant. In this section a superabundant counterexample n is treated directly, in terms of its own largest prime factor , without assuming that n is colossally abundant. Theorem 2 gives an explicit lower bound for ; in particular, Nicolas’ inequality holds at the largest prime factor of every superabundant counterexample, hence at the largest prime factor of the least counterexample. The constant of Theorem 2 is smaller than the constant of Corollary 1, which is available only when the counterexample is colossally abundant, and it is smaller than , so Theorem 2 and Corollary 2 do not imply that the colossally abundant number is a counterexample. Corollary 6 relates the least counterexample n to a colossally abundant counterexample , to which Corollary 1 applies with the prime q attached to N. All proofs of this section are given in full, and the numerical constants of Lemmas 8 and 9 and of Theorem 2, in particular , are verified in Section 6 (Table 3).
Lemma 7.
Let be a superabundant number with largest prime factor . Then for every , and consequently .
Proof.
The first claim is due to Nazardonyavi and Yakubovich [16]; we give the proof for completeness. For a prime p and an integer put . For the claim is . Let , write and , and suppose that . Then , and since , we have . Put , which is an integer with , and write . Since I is multiplicative,
where we used , and . Thus with , which contradicts the superabundance of n. Finally, by Proposition 4 the primes dividing n are exactly the primes , so
where denotes the exponent of q in n. □
Lemma 8.
Let n be a counterexample, and the product of the distinct primes dividing n. Then and
Proof.
By Proposition 2, and since Robin’s inequality fails for n, . By Proposition 3, , so . Since for every , we get , hence . Taking logarithms gives , and subtracting gives the first inequality. The second follows from . □
For a superabundant counterexample with largest prime factor , Proposition 4 gives , so Lemma 8 gives
Lemma 9.
Let n be a superabundant counterexample with largest prime factor . Then and .
Proof.
Put and . By Lemma 6, , and by Propositions 2 and 9 (f), . Hence
Therefore and , so that
□
Theorem 2.
Let n be a superabundant counterexample with largest prime factor . Then
Proof.
By (5) and Lemma 7, . The function has the decreasing derivative for , and . By the mean value theorem and Lemma 9,
By Lemma 6, , so Proposition 9 (a) gives if , and Proposition 9 (b) gives otherwise. Since , the second inequality follows. □
Remark 4.
The second inequality of Theorem 2 compares two functions of the prime alone, and its constant is bounded by 1 in the following sense: for every and every sufficiently large prime p,
Indeed, , where the terms with vanish, so by Lemma 1 (a) the sum over is at most , and Proposition 9 (b) gives and as ; hence . Since is decreasing, the mean value theorem gives .
Corollary 6.
Suppose that the Riemann Hypothesis is false, and let n be the least counterexample. Let be the consecutive colossally abundant numbers with . Then N is a counterexample,
and the largest prime satisfies .
Proof.
By Proposition 10 (f) applied to , the consecutive colossally abundant numbers satisfy , which gives the displayed inequalities. The number 55440 is colossally abundant [20] (Figure 1), and by Proposition 3, so . Since , Robin’s inequality holds for , that is, , whereas . By Proposition 10 (g), , and , so N is a counterexample. The last claim is Corollary 1. □
6. Experimental Verification
Every numerical inequality between explicit constants used in this paper was checked by a self-contained Python 3.12 script, verify_robin_nicolas.py, written with the help of Claude Opus 5.5 (Anthropic) and run by the author. The script uses the arbitrary-precision library mpmath with 60 significant decimal digits, and exact rational arithmetic (Python’s fractions module) for the inequalities that involve only decimal constants, some of which hold with equality. For each inequality it prints the computed value of its left-hand side. The script has three parts, and all 69 checks performed by the script passed: 14 in Part 1, 50 in Part 2 and 5 in Part 3. We now describe the output.
6.1. Part 1: Counterexamples
Part 1 checks the constants of Lemmas 6, 8 and 9 and of Theorem 2. The computed values are listed in Table 3. The starting point is , the bound for coming from Proposition 3. At , where Proposition 9 (f) begins to apply, and , which lies below by ; this is the smallest margin in Part 1. The two steps of Lemma 6 give and . In Lemma 9, the constant exceeds the computed value , and the factor exceeds the computed value by .
6.2. Part 2: The Proof of Theorem 1
Part 2 checks the constants of Lemmas 1, 3, 4 and 5 and of the proof of Theorem 1, all at the threshold , where ; each quantity checked at is monotone in in the direction stated in the proofs. Table 4 lists the main values. In Lemma 1 (b), the relative error for on comes from Büthe’s bound, with computed value at , whereas Dusart’s bound contributes at most . In Lemma 4, the contribution of the primes with exponent at least 3 reduces the coefficient coming from to . In Lemma 5, the primes with exponent 2 and those with exponent at least 3 contribute , which is at . Twelve of the checks in Part 2 are identities or inequalities between the decimal constants of the proofs, such as and ; they are verified in exact rational arithmetic. The smallest positive margins in Part 2 are those of , of , and of , with differences , and . The final constants of Theorem 1 are and .
Table 4.
Values computed in Part 2 of the script, at .
| Quantity | Computed value | Bound used |
|---|---|---|
6.3. Part 3: The Corollaries
Part 3 checks the constants of Proposition 8 and Corollaries 1, 4 and 5. The script computes , so that , and , the constant discussed after Corollary 4. The constant of Corollary 1 is , and the constant of Corollary 4 is . The constant of Corollary 5 exceeds the bound of Proposition 8 by . Finally, , so the primes q of Corollary 1 lie in the range of Proposition 8.
Supplementary Materials
The following supporting information can be downloaded at the website of this paper posted on Preprints.org.
Data Availability Statement
The Python script verify_robin_nicolas.py used in Section 6 is available in the preprint.
Acknowledgments
This work was carried out with the help of Claude Opus 5.5 (Anthropic): the verification script verify_robin_nicolas.py used in Section 6 and parts of the text of this paper were generated with this AI assistant. The experiments were run by the author.
Conflicts of Interest
The author declares no conflicts of interest.
References
- Borwein, P.B.; Choi, S.; Rooney, B.; Weirathmueller, A. The Riemann Hypothesis: A Resource for the Afficionado and Virtuoso Alike . In CMS Books in Mathematics; Springer: New York, 2008; Vol. 27. [Google Scholar]
- Conrey, B. Conrey, B., Riemann’s hypothesis. In <italic>Colloquium De Giorgi 2013 and 2014</italic>; Publications of the Scuola Normale Superiore ((COLLOQUIASNS,volume 5)), Scuola Normale Superiore, 2015; pp. 109–117. [CrossRef]
- Connes, A. An Essay on the Riemann Hypothesis. Open Probl. Math. 2016, 225–257. [Google Scholar] [CrossRef]
- Conrey, B. The Riemann Hypothesis. Not. AMS 2003, 50, 341–353. [Google Scholar]
- Robin, G. Grandes valeurs de la fonction somme des diviseurs et hypothèse de Riemann. J. De Mathématiques Pures Et. Appliquées. Neuvième Série 1984, 63, 187–213. [Google Scholar]
- Grönwall, T.H. Some asymptotic expressions in the theory of numbers. Trans. Am. Math. Soc. 1913, 14, 113–122. [Google Scholar] [CrossRef]
- Lagarias, J.C. An elementary problem equivalent to the Riemann hypothesis. Am. Math. Mon. 2002, 109, 534–543. [Google Scholar] [CrossRef]
- Briggs, K. Abundant numbers and the Riemann hypothesis. Exp. Math. 2006, 15, 251–256. [Google Scholar] [CrossRef]
- Caveney, G.; Nicolas, J.L.; Sondow, J. On SA, CA, and GA numbers. Ramanujan J. 2012, 29, 359–384. [Google Scholar] [CrossRef]
- Choie, Y.; Lichiardopol, N.; Moree, P.; Solé, P. On Robin’s criterion for the Riemann hypothesis. J. De Théorie Des. Nr. De Bordx. 2007, 19, 357–372. [Google Scholar] [CrossRef]
- Banks, W.D.; Hart, D.; Moree, P.; Nevans, C.W. The Nicolas and Robin inequalities with sums of two squares. Monatshefte Für Math. 2009, 157, 303–322. [Google Scholar] [CrossRef]
- Solé, P.; Planat, M. The Robin inequality for 7-free integers. Integers 2012, 12, 301–309. [Google Scholar] [CrossRef]
- Broughan, K.; Trudgian, T. Robin’s inequality for 11-free integers. Integers 2015, 15. [Google Scholar]
- Platt, D.J.; Morrill, T. Robin’s inequality for 20-free integers. Integers 2021, 21. [Google Scholar]
- Akbary, A.; Friggstad, Z. Superabundant numbers and the Riemann hypothesis. Am. Math. Mon. 2009, 116, 273–275. [Google Scholar] [CrossRef]
- Nazardonyavi, S.; Yakubovich, S. Extremely abundant numbers and the Riemann hypothesis. J. Integer Seq. 2014, 17. [Google Scholar]
- Vega, F. Robin’s criterion on divisibility. Ramanujan J. 2022, 59, 745–755. [Google Scholar] [CrossRef]
- Nicolas, J.L. Petites valeurs de la fonction d’Euler. J. Number Theory 1983, 17, 375–388. [Google Scholar] [CrossRef]
- Ramanujan, S. Ramanujan, S. Highly composite numbers. The Ramanujan Journal 1997, 1, 119–153. Annotated and with a foreword by Jean-Louis Nicolas and Guy Robin. [CrossRef]
- Nicolas, J.L. The sum of divisors function and the Riemann hypothesis. Ramanujan J. 2022, 58, 1113–1157. [Google Scholar] [CrossRef]
- Nicolas, J.L. Small values of the Euler function and the Riemann hypothesis. Acta Arith. 2012, 155, 311–321. [Google Scholar] [CrossRef]
- Büthe, J. An analytic method for bounding ψ(x). Math. Comput. 2018, 87, 1991–2009. [Google Scholar] [CrossRef]
- Dusart, P. Explicit estimates of some functions over primes. Ramanujan J. 2018, 45, 227–251. [Google Scholar] [CrossRef]
- Alaoglu, L.; Erdos, P. On highly composite and similar numbers. Trans. Am. Math. Soc. 1944, 56, 448–469. [Google Scholar] [CrossRef]
- Rosser, J.B.; Schoenfeld, L. Approximate formulas for some functions of prime numbers. Ill. J. Math. 1962, 6, 64–94. [Google Scholar] [CrossRef]
- Axler, C. New estimates for some functions defined over primes. Integers 2018, 18. [Google Scholar]
Table 1.
Notation of Section 3.
Table 1.
Notation of Section 3.
| Symbol | Meaning |
|---|---|
| Largest parameter of the colossally abundant number N. | |
| , | Real numbers with ; a prime p with |
| has exponent j in . | |
| K | Largest j with . |
| Colossally abundant number , | |
| a multiple of N. | |
| q, u | Largest prime with , and . |
| . | |
| , | and . |
| . | |
| . | |
| D | . |
| (Lemma 2), | |
| with and in the proof of Lemma 3. |
Table 2.
The terms of in the proof of Lemma 5.
| Primes | Term | Upper bound | Lower bound |
|---|---|---|---|
| () | |||
| () | 0 | ||
| () | 0 | ||
| all | 0 | ||
| Total |
Table 3.
Values computed in Part 1 of the script.
| Quantity | Computed value | Bound used |
|---|---|---|
| 3 |
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content. |
© 2026 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (http://creativecommons.org/licenses/by/4.0/).
Copyright: This open access article is published under a Creative Commons CC BY 4.0 license, which permit the free download, distribution, and reuse, provided that the author and preprint are cited in any reuse.