The n points P1,P2,…,Pn are placed inside or on the boundary of a disk of radius 1 in such a way that the minimum distance Dn between any two of these points has its largest possible value Dn. Calculate Dn for n=2 to 7. and justify your answer.
Problem
Source: IMO LongList 1967, Great Britain 3
Tags: geometry, point set, euclidean distance, maximization, IMO Shortlist, IMO Longlist