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?
number-theory / Number Theory, Sieve Theory
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?
Temporal state
No reconciled state yet.
Append-only history
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?
Research memory
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?
Evidence graph
No public relationships recorded yet.