Robin's inequality for new families of integers
Abstract
Robin's criterion states that the Riemann Hypothesis (RH) is true if and only if Robin's inequality σ(n):=Σp|np<eγ n n is satisfied for n > 5040, where γ denotes the Euler-Mascheroni constant. We show that if the 2-adic order of n is big enough in comparison to the odd part of n then Robin's inequality is satisfied. We also show that if an positive integer n satisfies either 2(n) ≤ 19, 3(n) ≤ 12,5(n) ≤ 7, 7(n) ≤ 6, 11(n) ≤ 5 then Robin's inequality is satisfied, where p(n) is the p-adic order of n. In the end we show that σ(n)/n < 1.0000005645 eγ n holds unconditionally for n > 5040.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.