When guests are points
Friday, April 30th, 2010Place four points in the plane such that the distance between any pair is >= 1 and the average distance between pairs is minimised.
Find a formula for the minimum average distance between pairs for four, five, six, …, n points.
I am sure this is a famous problem, but I don’t know its name or any results. I came to think of it when I was a dinner party as explained here.









