English

On Robin's inequality

Number Theory 2021-11-01 v3

Abstract

Let σ(n)\sigma(n) denotes the sum of divisors function of a positive integer nn. Robin proved that the Riemann hypothesis is true if and only if the inequality σ(n)<eγnloglogn\sigma(n) < e^{\gamma}n \log \log n holds for every positive integer n5041n \geq 5041, where γ\gamma is the Euler-Mascheroni constant. In this paper we establish a new family of integers for which Robin's inequality σ(n)<eγnloglogn\sigma(n) < e^{\gamma}n \log \log n hold. Further, we establish a new unconditional upper bound for the sum of divisors function. For this purpose, we use an approximation for Chebyshev's ϑ\vartheta-function and for some product defined over prime numbers.

Keywords

Cite

@article{arxiv.2110.13478,
  title  = {On Robin's inequality},
  author = {Christian Axler},
  journal= {arXiv preprint arXiv:2110.13478},
  year   = {2021}
}

Comments

v3: A typo in Theorem 1.4 is fixed

R2 v1 2026-06-24T07:11:23.061Z