Given a circle with a diameter of 100.
Twelve points lies on a circle, in such a way that their total pairwise distance, is maximal.
Give the value of . (I.e. rounded down to the nearest integer.)
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
The distance is optimized when the points lie evenly distributed around the circle, i.e. at 3 0 ∘ intervals.
The distance between two points on a circle of radius R at distance θ ∘ is d = 2 R sin 2 θ .
There are 12 pairs of points that are 3 0 ∘ apart. Their distance is d 1 = 1 0 0 sin 1 5 ∘ = 2 5 . 8 8 1 9 . Likewise, there are 12 pairs at 6 0 ∘ ; 12 pairs at 9 0 ∘ ; 12 pairs at 1 2 0 ∘ ; and 12 pairs at 1 5 0 ∘ : d 2 = 1 0 0 sin 3 0 ∘ = 5 0 . 0 0 0 0 , d 3 = 1 0 0 sin 4 5 ∘ = 7 0 . 7 1 0 7 , d 4 = 1 0 0 sin 6 0 ∘ = 8 6 . 6 0 2 5 , d 5 = 1 0 0 sin 7 5 ∘ = 9 6 . 5 9 2 6 . Finally, there are 6 pairs of point diametrically opposite, with distance d 6 = 1 0 0 . 0 0 0 0 . The total is D = 1 2 ⋅ ( 2 5 . 8 8 1 9 + 5 0 . 0 0 0 0 + 7 0 . 7 1 0 7 + 8 6 . 6 0 2 5 + 9 6 . 5 9 2 6 ) + 6 ⋅ 1 0 0 . 0 0 0 0 = 4 5 5 7 . 4 5 2 .