Robin's criterion on divisibility

DOI10.1007/S11139-022-00574-4MaRDI QIDQ2084547zbMATH OpenOpenAlexFDO

Authors Frank Vega

Publication date 18 October 2022

Published in The Ramanujan Journal (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s11139-022-00574-4

zbMATH Keywords

prime numbersRiemann hypothesisRiemann zeta functionRobin inequalitysum-of-divisors function

Mathematics Subject Classification ID

Arithmetic functions; related numbers; inversion formulas (11A25) Primes (11A41) (zeta (s)) and (L(s, chi)) (11M06) Nonreal zeros of (zeta (s)) and (L(s, chi)); Riemann and other hypotheses (11M26)

Review text

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.

Recommendations

• On Robin's criterion for the Riemann hypothesis
• Superabundant numbers and the Riemann hypothesis
• New results for witnesses of Robin's criterion
• Robin's inequality for new families of integers
• Some remarks on Robin's inequality

Cites work

• Approximate formulas for some functions of prime numbers
• Explicit estimates involving the primorial integers and applications
• Grandes valeurs de la fonction somme des diviseurs et hypothèse de Riemann
• On Highly Composite and Similar Numbers
• On Robin's criterion for the Riemann hypothesis
• Robin's inequality for 20-free integers
• Robin's inequality for new families of integers
• Superabundant numbers and the Riemann hypothesis
• The 𝑘^{𝑡ℎ} prime is greater than 𝑘(ln𝑘+lnln𝑘-1) for 𝑘≥2

Cited in

(10)

• An asymptotic Robin inequality
• Superabundant numbers and the Riemann hypothesis
• Some remarks on Robin's inequality
• A new upper bound for the sum of divisors function
• Analogues of the Robin-Lagarias criteria for the Riemann hypothesis
• New results for witnesses of Robin's criterion
• Robin's inequality for new families of integers
• A family of analogues to the Robin criterion
• The Nicolas and Robin inequalities with sums of two squares
• On Robin's criterion for the Riemann hypothesis

This page was built for publication: Robin's criterion on divisibility

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2084547)