All open problems
Source labels openChecked July 26, 2026

Erdős ProblemsCombinatorics

Erdős Problem 160: Better Upper

Estimate h(n)h(n) by finding a better upper bound.

Mathematical statement

Estimate h(n)h(n) by finding a better upper bound.

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_160.better_upper

Canonical source
Complete statement target, proof intentionally absentLean 4
theorem erdos_160.better_upper :    let upper_bound :    := answer(sorry)    (fun n => (erdos_160.h n : )) =O[atTop] upper_bound     upper_bound =o[atTop] fun n => (n : ) ^ ((2 : ) / 3) := 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