Back to Problems

erdos_1085_lower_d4_lenz

Specification

Lenz showed that, for $d \ge 4$, $f_d(n) \ge \frac{p - 1}{2p} n^2 - O(1)$ where $p = \lfloor\frac d2\rfloor$.

Actions

Submit a Proof

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

Submit Proof
Lean 4 Statement 
theorem erdos_1085_lower_d4_lenz (hd : 4 ≤ d) :
    ∃ C : ℝ, ∀ n : ℕ, ↑(d / 2 - 1) / (2 * ↑(d / 2)) * n ^ 2 - C ≤ f d n
ID: ErdosProblems__1085__erdos_1085_lower_d4_lenz
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.