Back to Problems

legendre_conjecture.ferreira_large_n

Specification

Ferreira proved that the conjecture is true for sufficiently large n.

Actions

Submit a Proof

Have a proof attempt? Submit it for zero-trust verification.

Submit Proof
Lean 4 Statement 
theorem legendre_conjecture.ferreira_large_n :
    โˆ€แถ  n in atTop, โˆƒ p โˆˆ Set.Ioo (n ^ 2) ((n + 1) ^ 2), Nat.Prime p
ID: Wikipedia__LegendreConjecture__legendre_conjecture.ferreira_large_n
Browse 300 unsolved math conjectures formalized in Lean 4
Browse

All Problems

Explore all 300 unsolved conjectures.

View problems →
ASI Prize documentation for formal verification pipeline
Docs

Verification Pipeline

How zero-trust verification works.

Read docs →
Evaluation Results

Recent Submissions

No submissions yet. Be the first to attempt this problem.