Robin's criterion on divisibility (Q2084547)

Robin's criterion states that the Riemann hypothesis is true if and only if the inequality \(\sigma(n) < e^\gamma \times n \times \log \log n\) (called Robins\((n)\)) holds for all natural numbers \(n > 5040\), where \(\sigma(n)\) is the sum-of-divisors function of \(n\) and \(\gamma \approx 0.57721\) is the Euler-Mascheroni constant. In this paper it is shown that the Robin's inequality is true for all natural numbers \(n > 5040\) that are not divisible by some prime between 2 and 1771559. Another result states that if \(\frac{\pi^2}{6}\times \log\log n' \leq \log\log n\) for \(n>5040\) such that \(n'\) is the square free kernel of the natural number \(n\), then Robins\((n)\) holds. A few other instances for which Robin's inequality holds, are stated, as well. The last part of the paper identifies conditions for possible counterexamples, i.e., natural numbers \(n\) for which Robins\((n)\) would not hold.