There are $n$ points on the plane, we need to maximize the number of pairs of points which have same Euclidean distance.
4 of 6
Corrected plural in title, edited text to better reflect what I think is being asked for
gmvh
- 3.1k
- 6
- 27
- 45
How to find n points on a plane so that as many pairs of points as possible have the same distance?
Cynasty
- 159
- 7