Weakening the Legendre Conjecture

Abstract

The world of primes has many gaps between evidence and theorems. Here, we review Legendre's conjecture on primes between consecutive squares and recent progress on the weaker question of primes between consecutive larger powers. Assuming the Riemann hypothesis (RH), we observe that a recent result of Emanuel Carneiro, Micah Milinovich and Kannan Soundararajan, combined with a large-scale computation by Jonathan Sorenson and Jonathan Webster, implies the existence of primes between $x^{2+δ}$ and $(x+1)^{2+δ}$ for all real $x \geq 1$ when $δ\geq 1/4$. For smaller values of $δ> 0$, we provide an explicit bound $x_0 = x_0 (δ)$ such that primes exist in these intervals whenever $x \geq x_0$ (again assuming RH). We conclude with an application to Mills-type prime-generating constants.

Theorems & Definitions (24)

• conjecture 1.1: Legendre
• theorem 1.2
• proposition 1.3
• proof
• corollary 1.4: Baker, Harman, Pintz bhp-primes-diff2
• lemma 2.1
• proof
• corollary 2.2
• theorem 3.1: Carneiro, Milinovich, Soundararajan cms-primes-fourier
• corollary 3.2