Back to Problems

erdos_1063.variants.cambie_upper_bound

Specification

[Cambie observed](https://www.erdosproblems.com/1063) the improved bound $n_k \le k \cdot \operatorname{lcm}(1, \dotsc, k - 1)$.

Actions

Submit a Proof

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

Submit Proof
Lean 4 Statement 
theorem erdos_1063.variants.cambie_upper_bound {k : ℕ} (hk : 3 ≤ k) :
    n k ≤ k * (Finset.Icc 1 (k - 1)).lcm id
ID: ErdosProblems__1063__erdos_1063.variants.cambie_upper_bound
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.