Variants on Andrica's conjecture with and without the Riemann hypothesis
Matt Visser (Victoria University of Wellington)

TL;DR
This paper explores variants of Andrica's conjecture, examining the implications of the Riemann hypothesis and providing new bounds and unconditional results related to prime gaps and prime distributions.
Contribution
It introduces new bounds on prime gaps under the Riemann hypothesis and refines unconditional results, extending the understanding of Andrica's conjecture variants.
Findings
Under Riemann hypothesis, bounds involving roots of primes are established.
Unconditional results on differences of logarithmic powers of consecutive primes are provided.
The region where Andrica's conjecture is verified is slightly expanded.
Abstract
The gap between what we can explicitly prove regarding the distribution of primes and what we suspect regarding the distribution of primes is enormous. It is (reasonably) well-known that the Riemann hypothesis is not sufficient to prove Andrica's conjecture: , is ? But can one at least get tolerably close? I shall first show that with a logarithmic modification, provided one assumes the Riemann hypothesis, one has \[ {\sqrt{p_{n+1}}\over\ln p_{n+1}} -{\sqrt{p_n}\over\ln p_n} < {11\over25}; \qquad (n\geq1). \] Then, by considering more general roots, again assuming the Riemann hypothesis, I shall show that \[ {\sqrt[m]{p_{n+1}}} -{\sqrt[m]{p_n}} < {44\over25 \,e\, (m-2)}; \qquad (n\geq 3;\; m >2). \] In counterpoint, if we limit ourselves to what we can currently prove unconditionally, then the only explicit Andrica-like results…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAnalytic Number Theory Research · Algebraic Geometry and Number Theory · Coding theory and cryptography
