Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

What is the configuration (set of locations) of $n$ points on the surface of a sphere such that the sum of distances is maximum for $n=1,2,3,...$?

The sum of distances is measured by summing the lengths of every straight line (through the sphere) connecting every possible combination of $2$ points. All the points are on a single sphere of radius $R$.

Here's a visualization: enter image description here

Acknowledgements: Based on this Physics S.E. question. Image from StackOverflow.

share|cite|improve this question
Mean distance between 2 points within a sphere… might help – raindrop Sep 5 '12 at 4:17
I seem to recall hearing that the problem of maximizing the minimum is unsolved. But maximizing the sum is another matter. – Michael Hardy Sep 5 '12 at 4:24
A bunch of previous questions are closely related. None is an exact duplicate of this one, but you may find the answers and references there of interest. – Rahul Sep 5 '12 at 4:56
"Straight line"? Through the sphere or on the surface? – Henry Sep 5 '12 at 6:37
Straight line through the sphere. – raindrop Sep 6 '12 at 16:43
up vote 1 down vote accepted

As far as I know the answer to the general question is unknown. For the computer approach you can look at this article by Berman and Hanes. Here it is shown that the result for 5 points on the sphere can be found in finite time by computer. Also you can find some interesting references in the introduction part.

Hope, this will help

share|cite|improve this answer

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.