Papers
Topics
Authors
Recent
Search
2000 character limit reached

Strong version of Andrica's conjecture

Published 6 Dec 2018 in math.NT | (1812.02762v3)

Abstract: A strong version of Andrica's conjecture can be formulated as follows: Except for $p_n\in{3,7,13,23,31,113}$, that is $n\in{2,4,6,9,11,30}$, one has$\sqrt{p_{n+1}}-\sqrt{p_n} < \frac{1}{2}.$ While a proof is far out of reach I shall show that this strong version of Andrica's conjecture is unconditionally and explicitly verified for all primes below the location of the 81${st}$ maximal prime gap, certainly for all primes $p <2{64}\approx 1.844\times 10{19}$. Furthermore this strong Andrica conjecture is slightly stronger than Oppermann's conjecture --- which in turn is slightly stronger than both the strong and standard Legendre conjectures, and the strong and standard Brocard conjectures. Thus the Oppermann conjecture, and strong and standard Legendre conjectures, are all unconditionally and explicitly verified for all primes $p <2{64}\approx1.844\times 10{19}$. Similarly, the strong and standard Brocard conjectures are unconditionally and explicitly verified for all primes $p <2{32} \approx 4.294 \times 109$.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (1)

Collections

Sign up for free to add this paper to one or more collections.