Erdős distinct distances problem
From Wikipedia, the free encyclopedia
In discrete geometry, the Erdős distinct distances problem states that every set of points in the plane has a nearly-linear number of distinct distances. It was posed by Paul Erdős in 1946[1][2] and almost proven by Larry Guth and Nets Katz in 2015.[3][4][5]