Back to Problems

erdos_142

Specification

Prove an asymptotic formula for $r_k(N)$, the largest possible size of a subset of $\{1, \dots, N\}$ that does not contain any non-trivial $k$-term arithmetic progression.

Mathematics prize
Prize

$10000

Paul Erdős

Lean 4 Statement 
theorem erdos_142 (k : ℕ) : (fun N => (r k N : ℝ)) =Θ[atTop] (answer(sorry) : ℕ → ℝ)
ID: ErdosProblems__142__erdos_142
Actions

Submit a Proof

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

Submit Proof
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.