All open problems
Source labels openChecked July 26, 2026

Erdős ProblemsNumber theory

Erdős Problem 1063: Better Upper

Estimate nkn_k by finding a better upper bound.

Mathematical statement

Estimate nkn_k 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_1063.better_upper

Canonical source
Complete statement target, proof intentionally absentLean 4
theorem erdos_1063.better_upper :    let upper_bound :    := answer(sorry)    (fun k => (n k : )) =O[atTop] upper_bound     upper_bound =o[atTop] fun k =>      (k : ) * ((Finset.Icc 1 (k - 1)).lcm (fun n :  => n) : ) := 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