On Robin’s inequality
Open Access
- 28 December 2022
- journal article
- research article
- Published by Springer Nature in The Ramanujan Journal
- Vol. 61 (3) , 909-919
Abstract
Let $$\sigma (n)$$ denote the sum of divisors function of a positive integer n. Robin proved that the Riemann hypothesis is true if and only if the inequality $$\sigma (n) < \textrm{e}^{\gamma }n \log \log n$$ holds for every integer $$n > 5040$$ , where $$\gamma $$ is the Euler–Mascheroni constant. In this paper we establish a new family of integers for which Robin’s inequality $$\sigma (n) < \textrm{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
All Related Versions
Funding Information
- Heinrich-Heine-Universität Düsseldorf
This publication has 16 references indexed in Scilit:
- Sharper bounds for the Chebyshev function 𝜃(𝑥)Mathematics of Computation, 2021
- A NEW UPPER BOUND FOR THE SUM OF DIVISORS FUNCTIONBulletin of the Australian Mathematical Society, 2017
- The Robin Inequality for 7-Free IntegersIntegers, 2012
- The Nicolas and Robin inequalities with sums of two squaresMonatshefte für Mathematik, 2008
- Upper bound for sum of divisors function and the Riemann hypothesisTsukuba Journal of Mathematics, 2007
- On Robin’s criterion for the Riemann hypothesisJournal de Théorie des Nombres de Bordeaux, 2007
- Abundant Numbers and the Riemann HypothesisExperimental Mathematics, 2006
- Highly Composite Numbers by Srinivasa RamanujanThe Ramanujan Journal, 1997
- On highly composite and similar numbersTransactions of the American Mathematical Society, 1944
- Some asymptotic expressions in the theory of numbersTransactions of the American Mathematical Society, 1913