A finite arithmetic form of Robin's inequality and its equivalence to the Riemann hypothesis
Abstract
Robin's inequality reformulates the Riemann hypothesis as a bound on the sum-of-divisors function σ. We introduce a finite-truncation version of Robin's inequality determined intrinsically by the arithmetic structure of n, σ(n)/n < eγ∑j=0ω(n) ((lnlnln n)j)/j!, n>5040, where ω(n) denotes the number of distinct prime factors of n, and γ is the Euler-Mascheroni constant. The resulting bound is pointwise stronger than Robin's inequality and we prove it unconditionally for integers with ω(n)≤ 6, primorials, odd integers and square-free integers. We also prove that this inequality is equivalent to Robin's inequality, and hence to the Riemann hypothesis. Consequently, the Riemann hypothesis is equivalent to the truncated inequality holding for all colossally abundant numbers. We further show that if the inequality fails, its minimal counterexample must be a superabundant number, placing any obstruction within a rigid extremal class of integers.
Related
- Currently, there are no reasons to doubt the Riemann Hypothesis: The zeta function beyond the realm of computation
- A Formal Proof of Riemann Hypothesis from Existence Alone, the Sign Excepted by Theorem: The Constructed Witness, the Identity Cone over the Fixed Locus, the Grounded Counter-Model, and the Cure Theorem Proved in Lean 4 and Re-executed in Fortran
- Ramanujan Conjecture and Riemann Hypothesis for the unitary groups over function fields
- Proof of the Riemann Hypothesis through the limit of an approximated ξ function
- Computational verification of the Riemann hypothesis via differential equations
BibTeX
@misc{mishra2026finite,
title = {{A finite arithmetic form of Robin's inequality and its equivalence to the Riemann hypothesis}},
author = {Challenger Mishra and Rahul Sarkar},
howpublished = {arXiv},
year = {2026},
month = sep,
doi = {10.48550/arxiv.2609.26787},
eprint = {2609.26787},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2609.26787},
}
RIS
TY - UNPB
TI - A finite arithmetic form of Robin's inequality and its equivalence to the Riemann hypothesis
AU - Challenger Mishra
AU - Rahul Sarkar
PY - 2026
DA - 2026/09/22
PB - arXiv
DO - 10.48550/arxiv.2609.26787
UR - https://arxiv.org/abs/2609.26787
AB - Robin's inequality reformulates the Riemann hypothesis as a bound on the sum-of-divisors function σ. We introduce a finite-truncation version of Robin's inequality determined intrinsically by the arithmetic structure of n, σ(n)/n < e^γ∑_j=0^ω(n) ((lnlnln n)^j)/j!, n>5040, where ω(n) denotes the number of distinct prime factors of n, and γ is the Euler-Mascheroni constant. The resulting bound is pointwise stronger than Robin's inequality and we prove it unconditionally for integers with ω(n)≤ 6, primorials, odd integers and square-free integers. We also prove that this inequality is equivalent to Robin's inequality, and hence to the Riemann hypothesis. Consequently, the Riemann hypothesis is equivalent to the truncated inequality holding for all colossally abundant numbers. We further show that if the inequality fails, its minimal counterexample must be a superabundant number, placing any obstruction within a rigid extremal class of integers.
ER -