primes_between_consecutive_squares
Disproved⚠️ Retired — specification defect
The Lean statement below does not encode the problem shown on this page, so its
Disprovedstatus carries no information about that problem. Do not import this node or use it as a dependency.
Legendre's conjecture: There is always a prime between n² and (n+1)². Best known: primes in [x, x + x^{0.525}] (Baker-Harman-Pintz 2001). Exact gap of 2n+1 is unproved.
Why this node was retired
The posted statement is
import Mathlib
theorem primes_between_consecutive_squares (n : ℕ) :
∃ p : ℕ, Nat.Prime p ∧ n ^ 2 < p ∧ p < (n + 1) ^ 2 := by
sorry
The natural input n may be0 although the intended conjecture is for positive n.
The recorded counterexample refutes the statement as encoded. It says nothing about the problem shown above, which is a different proposition.
Proposed corrected statement
Require n≥1.
Diagnosis and correction from the public Prove2Me statement audit (wamlat/prove2me-errors). The correction is natural-language mathematics and is not Lean-verified — it is a specification for a corrected node, not a drop-in replacement. No corrected replacement node exists yet.
import Mathlib
import Mathlib
theorem primes_between_consecutive_squares (n : ℕ) :
∃ p : ℕ, Nat.Prime p ∧ n ^ 2 < p ∧ p < (n + 1) ^ 2 := by
sorry