math.NT — Number Theory
Robin's Inequality and Superabundant Counterexamples
Robin's criterion states that the Riemann Hypothesis holds if and only if for every . Let be the squarefree kernel of , its largest prime factor, and . We prove that Robin's inequality holds for every with , and for every whose prime factors are all below , and that both results remain valid with replaced by . Our main results concern superabundant numbers, among which there are infinitely many counterexamples to Robin's inequality if the Riemann Hypothesis is false. Using the classical error term in the prime number theorem, we show that every superabundant counterexample satisfies for absolute constants . Since the least counterexample satisfies , we deduce that the Riemann Hypothesis is true if there are constants and with , and a threshold , such that for every superabundant number with . We also give explicit versions of these bounds: every counterexample satisfies , and every superabundant counterexample satisfies . An enumeration of the superabundant numbers up to shows that only of the exceeding satisfy , namely those with , the largest of which is . Testing the hypothesis of the sufficient condition on the same range, we find that all superabundant numbers between and satisfy , and that for each the minimum of over them is positive, ranging from for to for , and is attained at the same superabundant number, whose largest prime factor is .