Back to Problems

erdos_385.variants.lb

Specification

A question of Erdős, Eggleton, and Selfridge, who write that in fact it is possible that this quantity is always at least $n+(1-o(1))\sqrt{n}$

Actions

Submit a Proof

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

Submit Proof
Lean 4 Statement 
theorem erdos_385.variants.lb : answer(sorry) ↔ ∃ (e : ℕ → ℝ) (he : e =o[atTop] (1 : ℕ → ℝ)),
    ∀ n, n + (1 - e n) * √n ≤ F n
ID: ErdosProblems__385__erdos_385.variants.lb
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.