The sum of divisors function and the Riemann hypothesis (Q2155870)

Let \(\sigma(n)\) be the sum of positive divisors of \(n\), and \(\gamma\) denotes the Euler constant. In this paper, the author is motivated by Robin's work asserting that \(\sigma(n)<e^\gamma\,n\log\log n\) for \(n>5040\) is equivalent to the Riemann hypothesis (RH), and also Ramanujan's work asserting that under RH the following asymptotic upper bound holds \[ \sigma(n)<e^\gamma\,n\left(\log\log n-\frac{2\left(\sqrt{2}-1\right)}{\sqrt{\log n}}+S_1(\log n)+\frac{O(1)}{\sqrt{\log n}\log\log n}\right), \] where \(S_1(x)=\sum_\rho\frac{x^{\rho-1}}{|\rho|^2}\), and \(\rho\) runs over the non-trivial zeros of the Riemann \(\zeta\) function. The author proves an effective form of the above result of Ramanujan, for any \(n\geq 2\), replacing the last fraction including \(O\)-term by \[ \frac{3.789}{\sqrt{\log n}\log\log n}+\frac{0.026\log\log n}{\log^\frac{2}{3} n}. \] Moreover, the author proves that his refinement is equivalent to RH, hence, improving on the Robin's equivalent for \(n>3.98\dots\times10^{80}\). The author ends the paper by proposing some related open problems.