On the Erdős distinct distances problem in the plane (Q482909)

Paul Erdős considered his greatest contribution to geometry posing the following two problems in 1946: what is the largest number of unit distances among \(n\) points in the plane? and what is the minimum number of distinct distances among \(n\) points in the plane? Both problems have been under intensive investigation and they are still unsolved. For the distinct distances problems lattice points with coordinates \(0\leq x,y\leq \sqrt{n} \) give \(O(n/\sqrt{\log n})\) distinct distances and Erdős conjectured that this is about the correct quantity. The paper under review makes a major breakthrough proving a \(\Omega(n/{\log n})\) lower bound. Terence Tao's blog beautifully explains the history and the ideas behind the proof under \url{https://terrytao.wordpress.com/2010/11/20/the-guth-katz-bound-on-the-erdos-distance-problem/}.