Robin's theorem, primes, and a new elementary reformulation of the Riemann hypothesis

From MaRDI portal
Publication:3108533

DOI10.1515/INTEG.2011.057zbMATH Open1235.11082arXiv1110.5078OpenAlexW2963025056MaRDI QIDQ3108533FDOQ3108533


Authors: Geoffrey Caveney, Jonathan Sondow, Jean-Louis Nicolas Edit this on Wikidata


Publication date: 4 January 2012

Published in: Integers (Search for Journal in Brave)

Abstract: For n>1, let G(n)=sigma(n)/(n log log n), where sigma(n) is the sum of the divisors of n. We prove that the Riemann Hypothesis is true if and only if 4 is the only composite number N satisfying G(N) ge max(G(N/p),G(aN)), for all prime factors p of N and all multiples aN of N. The proof uses Robin's and Gronwall's theorems on G(n). An alternate proof of one step depends on two properties of superabundant numbers proved using Alaoglu and ErdH{o}s's results.


Full work available at URL: https://arxiv.org/abs/1110.5078

File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)



Recommendations





Cited In (10)





This page was built for publication: Robin's theorem, primes, and a new elementary reformulation of the Riemann hypothesis

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