How to arrange n points on a plane such that the distance between any two points is at least $1$ and the maximum of the distances between two points is minimized?
It sounds like a world-famous problem, yet I can't find anything on the internet. I assume the answer is a $n-1$ sided regular polygon with one point in the center and the rest of them on the vertices, but I couldn't prove it. Any help is appreciated.