Points on a sphere

Pose Olympiad-level questions to the monkeys in the peanut #.

Points on a sphere

Postby nonTrivialZero » Tue Sep 29, 2009 12:14 pm

I'm not sure where else this might go, so if this is in the wrong category someone can move it.

Show that the sum of the squares of the distances between n points on a unit sphere is at most n^2, and determine when that value equals n^2.

I've been working on this using vectors, and the best I've been able to do is show that the sum is less than 2n(n-1) and that it is n^2 when the points form the vertices of a regular polygon inscribed in a great circle, but it appears that anything beyond that involves adding a ton of cosines/dot products for which I can discern no useful pattern. Is there another way to look at this problem?
User avatar
nonTrivialZero
Typical User
 
Posts: 4
Joined: Mon Apr 13, 2009 4:29 pm
Location: TX

Return to Olympiads

Who is online

Users browsing this forum: No registered users and 1 guest

cron