All open problems
Source labels openChecked July 26, 2026

Erdős ProblemsNumber theory

Erdős Problem 254

Let ANA\subseteq \mathbb{N} be such that A[1,2x]A[1,x] as x\lvert A\cap [1,2x]\rvert -\lvert A\cap [1,x]\rvert \to \infty\textrm{ as }x\to \infty and nA{θn}=\sum_{n\in A} \{ \theta n\}=\infty for every θ(0,1)\theta\in (0,1), where {x}\{x\} is the distance of xx from the nearest int...

Mathematical statement

Let ANA\subseteq \mathbb{N} be such that A[1,2x]A[1,x] as x\lvert A\cap [1,2x]\rvert -\lvert A\cap [1,x]\rvert \to \infty\textrm{ as }x\to \infty and nA{θn}=\sum_{n\in A} \{ \theta n\}=\infty for every θ(0,1)\theta\in (0,1), where {x}\{x\} is the distance of xx from the nearest integer. Then every sufficiently large integer is the sum of distinct elements of AA.

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_254

Canonical source
Complete statement target, proof intentionally absentLean 4
theorem erdos_254 :     (A : Set ),      (Tendsto (fun x :   (A ∩ Icc 1 (2 * x)).ncard - (A ∩ Icc 1 x).ncard) atTop atTop)       ( θ : , 0 < θ  θ < 1  ¬ Summable (fun n : A  distToNearestInt (θ * (n : ))))         ᶠ m in atTop, IsSumOfDistinct A m := 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