Difference between revisions of "1991 AIME Problems/Problem 11"
(→Problem) |
|||
| Line 2: | Line 2: | ||
Twelve congruent disks are placed on a [[circle]] <math>C^{}_{}</math> of [[radius]] 1 in such a way that the twelve disks cover <math>C^{}_{}</math>, no two of the disks overlap, and so that each of the twelve disks is [[tangent (geometry)|tangent]] to its two neighbors. The resulting arrangement of disks is shown in the figure below. The sum of the areas of the twelve disks can be written in the from <math>\pi(a-b\sqrt{c})</math>, where <math>a,b,c^{}_{}</math> are positive integers and <math>c^{}_{}</math> is not divisible by the square of any prime. Find <math>a+b+c^{}_{}</math>. | Twelve congruent disks are placed on a [[circle]] <math>C^{}_{}</math> of [[radius]] 1 in such a way that the twelve disks cover <math>C^{}_{}</math>, no two of the disks overlap, and so that each of the twelve disks is [[tangent (geometry)|tangent]] to its two neighbors. The resulting arrangement of disks is shown in the figure below. The sum of the areas of the twelve disks can be written in the from <math>\pi(a-b\sqrt{c})</math>, where <math>a,b,c^{}_{}</math> are positive integers and <math>c^{}_{}</math> is not divisible by the square of any prime. Find <math>a+b+c^{}_{}</math>. | ||
| − | + | <asy> | |
| + | real r=2-sqrt(3); | ||
| + | draw(Circle(origin, 1)); | ||
| + | int i; | ||
| + | for(i=0; i<12; i=i+1) { | ||
| + | draw(Circle(dir(30*i), r)); | ||
| + | dot(dir(30*i)); | ||
| + | } | ||
| + | draw(origin--(1,0)--dir(30)--cycle); | ||
| + | label("1", (0.5,0), S); | ||
| + | </asy> | ||
== Solution == | == Solution == | ||
Revision as of 11:11, 21 January 2017
Problem
Twelve congruent disks are placed on a circle 
of radius 1 in such a way that the twelve disks cover , no two of the disks overlap, and so that each of the twelve disks is tangent to its two neighbors. The resulting arrangement of disks is shown in the figure below. The sum of the areas of the twelve disks can be written in the from 
, where 
are positive integers and 
is not divisible by the square of any prime. Find 
.
![[asy] real r=2-sqrt(3); draw(Circle(origin, 1)); int i; for(i=0; i<12; i=i+1) { draw(Circle(dir(30*i), r)); dot(dir(30*i)); } draw(origin--(1,0)--dir(30)--cycle); label("1", (0.5,0), S); [/asy]](http://latex.artofproblemsolving.com/0/a/9/0a91573f0e220a8bb6e074b4b524f5d216f6543d.png)
Solution
We wish to find the radius of one circle, so that we can find the total area.
Notice that for them to contain the entire circle, each pair of circles must be tangent on the larger circle. Now consider two adjacent smaller circles. This means that the line connecting the radii is a segment of length 
that is tangent to the larger circle at the midpoint of the two centers. Thus, we have essentially have a regular dodecagon whose vertices are the centers of the smaller triangles circumscribed about a circle of radius 
.
We thus know that the apothem of the dodecagon is equal to . To find the side length, we make a triangle consisting of a vertex, the midpoint of a side, and the center of the dodecagon, which we denote 
and 
respectively. Notice that 
, and that 
is a right triangle with hypotenuse 
and 
. Thus 
, which is the radius of one of the circles. The area of one circle is thus 
, so the area of all 
circles is 
, giving an answer of 
.
See also
| 1991 AIME (Problems • Answer Key • Resources) | ||
| Preceded by Problem 10 |
Followed by Problem 12 | |
| 1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15 | ||
| All AIME Problems and Solutions | ||
The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions. 
