Analogues of the Robin-Lagarias Criteria for the Riemann Hypothesis

preprint2020arXivOpen access

Abstract

Robin's criterion states that the Riemann hypothesis is equivalent to σ(n)<eγnlog⁡log⁡nσ(n) < e^γn \log\log n for all integers n≥5041n \geq 5041, where σ(n)σ(n) is the sum of divisors of nn and γγ is the Euler-Mascheroni constant. We prove that the Riemann hypothesis is equivalent to the statement that σ(n)<eγ2nlog⁡log⁡nσ(n) < \frac{e^γ}{2} n \log\log n for all odd numbers n≥34⋅53⋅72⋅11⋯67n \geq 3^4 \cdot 5^3 \cdot 7^2 \cdot 11 \cdots 67. Lagarias's criterion for the Riemann hypothesis states that the Riemann hypothesis is equivalent to σ(n)<Hn+exp⁡Hnlog⁡Hnσ(n) < H_n + \exp{H_n}\log{H_n} for all integers n≥1n \geq 1, where HnH_n is the nnth harmonic number. We establish an analogue to Lagarias's criterion for the Riemann hypothesis by creating a new harmonic series Hn′=2Hn−H2nH^\prime_n = 2H_n - H_{2n} and demonstrating that the Riemann hypothesis is equivalent to σ(n)≤3nlog⁡n+exp⁡Hn′log⁡Hn′σ(n) \leq \frac{3n}{\log{n}} + \exp{H^\prime_n}\log{H^\prime_n} for all odd n≥3n \geq 3. We prove stronger analogues to Robin's inequality for odd squarefree numbers. Furthermore, we find a general formula that studies the effect of the prime factorization of nn and its behavior in Robin's inequality.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.