All open problems
Source labels openChecked July 26, 2026

Erdős ProblemsNumber theory

Erdős Problem 1095: Lower Conjecture

Erdős, Lacampagne, and Selfridge [ELS93] write 'it is clear to every right-thinking person' that g(k)exp(cklogk)g(k)\geq\exp(c\frac{k}{\log k}) for some constant c>0c>0.

Mathematical statement

Erdős, Lacampagne, and Selfridge [ELS93] write 'it is clear to every right-thinking person' that g(k)exp(cklogk)g(k)\geq\exp(c\frac{k}{\log k}) for some constant c>0c>0.

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_1095.variants.lower_conjecture

Canonical source
Complete statement target, proof intentionally absentLean 4
theorem erdos_1095.variants.lower_conjecture :  c > 0, ᶠ k in atTop, g k  exp (c * k / log k) := by  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