All open problems
Source labels openChecked July 26, 2026

Erdős ProblemsNumber theory

Erdős Problem 359: Ii

Let a1<a2<a_1< a_2 < ⋯ be an infinite sequence of integers such that a1=1a_1=1 and ai+1a_{i+1} is the least integer which is not a sum of consecutive earlier aja_js. Show that ak/k1+c0a_k / k ^ {1 + c} \to 0 for any c>0c > 0.

Mathematical statement

Let a1<a2<a_1< a_2 < ⋯ be an infinite sequence of integers such that a1=1a_1=1 and ai+1a_{i+1} is the least integer which is not a sum of consecutive earlier aja_js. Show that ak/k1+c0a_k / k ^ {1 + c} \to 0 for any 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_359.parts.ii

Canonical source
Complete statement target, proof intentionally absentLean 4
theorem erdos_359.parts.ii (A :   ) (hA : IsGoodFor A 1) (c : ) (hc : 0 < c):    atTop.Tendsto (fun k  A k / (k : ) ^ (1 + c)) (nhds 0) := 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