pith. sign in

arxiv: 1402.6417 · v2 · pith:YNWZ7N33new · submitted 2014-02-26 · 🧮 math.NT

On the Riemann Hypothesis and the Difference Between Primes

classification 🧮 math.NT
keywords primessqrtepsilonhypothesisintervallargeproveresult
0
0 comments X
read the original abstract

We prove some results concerning the distribution of primes on the Riemann hypothesis. First, we prove the explicit result that there exists a prime in the interval $(x-\frac{4}{\pi} \sqrt{x} \log x,x]$ for all $x \geq 2$; this improves a result of Ramar\'{e} and Saouter. We then show that the constant $4/\pi$ may be reduced to $(1+\epsilon)$ provided that $x$ is taken to be sufficiently large. From this we get an immediate estimate for a well-known theorem of Cram\'{e}r, in that we show the number of primes in the interval $(x, x+c \sqrt{x} \log x]$ is greater than $\sqrt{x}$ for $c=3+\epsilon$ and all sufficiently large $x$.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.