All open problems
Source labels openChecked July 26, 2026

Erdős ProblemsNumber theory

Erdős Problem 385: Lb

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

Mathematical statement

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

Statement source: Erdős Problems statement material

Statement terms: Source-specific

Source-specific terms. Therefore does not assert reuse rights beyond attributed display.

Statement artifacts, not proofs

These records expose exact Lean propositions and statement-only wrappers. Defining a proposition does not supply a proof of it. A placeholder-bearing target also contains no proof. Elaboration checks syntax and types; it does not certify that a formalization perfectly captures every nuance of the informal problem.

Pinned Lean formulation 1

erdos_385.variants.lb

Canonical source
Complete statement target, proof intentionally absentLean 4
theorem erdos_385.variants.lb : answer(sorry)   (e :   ) (he : e =o[atTop] (1 :   )),     n, n + (1 - e n) * √n  F n :=  sorry
Statement source
Formal Conjectures
Lean version
v4.27.0
Placeholder
Present; no proof artifact
Source evidence
Pinned source index
Fidelity review
Community formulation

References