Back to Problems

erdos_961.sylvester_schur

Specification

Sylvester and Schur [Er34] proved that every set of $k$ consecutive integers greater than $k$ contains an integer divisible by a prime greater than $k$, i.e. not $(k+1)$-smooth.

Actions

Submit a Proof

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

Submit Proof
Lean 4 Statement 
theorem erdos_961.sylvester_schur (k : ℕ) (hk : 0 < k) : Erdos961Prop k k
ID: ErdosProblems__961__erdos_961.sylvester_schur
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.