number-theory / Number Theory, Sieve Theory

Erdős Problem #489

If $A$ is a forbidden-divisor set with $|A \cap [1,x]| = o(\sqrt{x})$ and $B = \{b_1 < b_2 < \cdots\}$ the sifted set, must $x^{-1} \sum_{b_i < x} (b_{i+1} - b_i)^2$ converge to a finite limit?

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 #489

Prior state unknownproved

If $A$ is a forbidden-divisor set with $|A \cap [1,x]| = o(\sqrt{x})$ and $B = \{b_1 < b_2 < \cdots\}$ the sifted set, must $x^{-1} \sum_{b_i < x} (b_{i+1} - b_i)^2$ converge to a finite limit?

SourceReplayReproducedFormal proofStatement auditExternal checkExpert reviewPeer review

Research memory

Claims and attempts

Scoped claims

Source authenticated

If $A$ is a forbidden-divisor set with $|A \cap [1,x]| = o(\sqrt{x})$ and $B = \{b_1 < b_2 < \cdots\}$ the sifted set, must $x^{-1} \sum_{b_i < x} (b_{i+1} - b_i)^2$ converge to a finite limit?

Recorded attempts

Evidence graph

Connected research record

No public relationships recorded yet.