Legendre's conjectural prime recursion for a Mills-type construction

Define q1=2q_1=2, and for each positive integer nn, let qn+1q_{n+1} be the least prime exceeding qn2q_n^2. Legendre's recursive prime-gap assertion. Then

qn+1<(qn+1)2q_{n+1}<(q_n+1)^2

for all nn. This assertion is the instance of Legendre's conjecture needed for the displayed recursive construction of a real number whose powers yield primes; the paper also notes that a related existence result is known unconditionally by work of Kaisa Matomäki.

Sources & referencesView supporting material

Primary source

Marc Chamberland and Armin Straub, “Weakening the Legendre Conjecture”, arXiv:2602.22502 (2026).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.