All vaults

Erdős problem 89

The distinct distances problem

Do n points in the plane always determine at least a constant times n/√(log n) different distances? A square grid shows this would be best possible, and Guth and Katz proved the bound n/log n in 2015.

Erdős's prize: $500 (history)Open on erdosproblems.com