GeometryDifficulty 6.1National OlympiadProve itUnited States
Problem:
Six unit disks C1,C2,C3,C4,C5,C6 are in the plane such that they don't intersect each other and Ci is tangent to Ci+1 for 1≤i≤6 (where C7=C1). Let C be the smallest circle that contains all six disks. Let r be the smallest possible radius of C, and R the largest possible radius. Find R−r.
Solution
Solution:
The minimal configuration occurs when the six circles are placed with their centers at the vertices of a regular hexagon of side length 2. This gives a radius of 3.
The maximal configuration occurs when four of the circles are placed at the vertices of a square of side length 2. Letting these circles be C1,C3,C4,C6 in order, we place the last two so that C2 is tangent to C1 and C3 and C5 is tangent to C4 and C6. (Imagine pulling apart the last two circles on the plane; this is the configuration you end up with.) The resulting radius is 2+3, so the answer is 3−1.
Proof of minimality. We claim the minimal configuration stated above cannot be covered by a circle with radius r<2. If r<2 and all six vertices O1,O2,…,O6 are in the circle, then we have that ∠O1OO2>60∘ since O1O2 is the largest side of the triangle O1OO2, and similar for other angles ∠O2OO3,∠O3OO4,…, but we cannot have six angles greater than 60∘ into 360∘, contradiction. Therefore r≥2.
Proof of maximality. Let ABCDEF be the hexagon, and choose the covering circle to be centered at O, the midpoint of AD, and radius 3+1. We claim the other vertices are inside this covering circle. First, we will show the claim for B. Let M be the midpoint of AC. Since ABC is isosceles and AM≥1, we must have BM≤4−1=3. Furthermore, MO is a midline of ACD, so MO=2CD=1. Thus by the triangle inequality, OB≤MB+OM=3+1, proving the claim. A similar argument proves the claim for C,E,F. Finally, an analogous argument to above shows if we define P as the midpoint of BE, then AP≤3+1 and DP≤3+1, so by triangle inequality AD≤2(3+1). Hence OA=OD≤3+1, proving the claim for A and D. Thus the covering circle contains all six vertices of ABCDEF.
Want a route through all this instead of an archive? The track
puts 2,000 problems in a working order, from AMC 10 level to the IMO shortlist.
Source: MathNet,
licensed CC-BY-4.0.
Statement reproduced verbatim; metadata (topic, difficulty) added by this project.