MathDB
IMO LongList 1967, Great Britain 3

Source: IMO LongList 1967, Great Britain 3

December 16, 2004
geometrypoint seteuclidean distancemaximizationIMO ShortlistIMO Longlist

Problem Statement

The nn points P1,P2,,PnP_1,P_2, \ldots, P_n are placed inside or on the boundary of a disk of radius 1 in such a way that the minimum distance DnD_n between any two of these points has its largest possible value Dn.D_n. Calculate DnD_n for n=2n = 2 to 7. and justify your answer.