Back to Problems

erdos_1063.better_upper

Specification

Estimate $n_k$ by finding a better upper bound.

Actions

Submit a Proof

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

Submit Proof
Lean 4 Statement 
theorem erdos_1063.better_upper :
    let upper_bound : ℕ → ℝ
ID: ErdosProblems__1063__erdos_1063.better_upper
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.