The
![n](/media/m/a/e/5/ae594d7d1e46f4b979494cf8a815232b.png)
points
![P_1,P_2, \ldots, P_n](/media/m/4/2/6/426d6d379679e861e6afeded0651e792.png)
are placed inside or on the boundary of a disk of radius 1 in such a way that the minimum distance
![D_n](/media/m/c/3/7/c374cd937c9fb1d42806c1b7dee8e528.png)
between any two of these points has its largest possible value
![D_n.](/media/m/2/7/c/27c1dd732d0b226878bf5304dbde95fa.png)
Calculate
![D_n](/media/m/c/3/7/c374cd937c9fb1d42806c1b7dee8e528.png)
for
![n = 2](/media/m/5/d/e/5de286c03f7be13a5a67f0265685173b.png)
to 7. and justify your answer.
%V0
The $n$ points $P_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 $D_n$ between any two of these points has its largest possible value $D_n.$ Calculate $D_n$ for $n = 2$ to 7. and justify your answer.