Back to Problems

erdos_1085_upper_d4_erdos

Specification

Erdős showed that, for $d \ge 4$, $f_d(n) \le \left(\frac{p - 1}{2p} + o(1)\right) n^2$ 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_upper_d4_erdos (hd : 4 ≤ d) :
    ∃ g : ℕ → ℝ, Tendsto g atTop (𝓝 0) ∧
      ∀ n, f d n ≤ (↑(d / 2 - 1) / (2 * ↑(d / 2)) + g n) * n ^ 2
ID: ErdosProblems__1085__erdos_1085_upper_d4_erdos
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.