number-theory / Number Theory, Complete Sequences

Erdős Problem #254

If $A \subseteq \mathbb{N}$ has unbounded dyadic-shell counts and $\sum_{n \in A} \|\theta n\| = \infty$ for every $0 < \theta < 1$, must $A$ be complete - is every sufficiently large integer a sum of distinct elements of $A$?

10Significance / 100
1Frontier events
0Verification tasks
0Recorded attempts

Temporal state

Current frontier

No reconciled state yet.

Append-only history

Frontier timeline

number-theoryJul 13, 2026Significance 10/100Registry: lean verified

Erdős Problem #254

Prior state unknownproved

If $A \subseteq \mathbb{N}$ has unbounded dyadic-shell counts and $\sum_{n \in A} \|\theta n\| = \infty$ for every $0 < \theta < 1$, must $A$ be complete - is every sufficiently large integer a sum of distinct elements of $A$?

SourceReplayReproducedFormal proofStatement auditExternal checkExpert reviewPeer review

Research memory

Claims and attempts

Scoped claims

Source authenticated

If $A \subseteq \mathbb{N}$ has unbounded dyadic-shell counts and $\sum_{n \in A} \|\theta n\| = \infty$ for every $0 < \theta < 1$, must $A$ be complete - is every sufficiently large integer a sum of distinct elements of $A$?

Recorded attempts

Evidence graph

Connected research record

No public relationships recorded yet.

Erdős Problem #254 — Mathematical Frontier Network