Maths Olympiad Prep

Library / /22 of 23

Geometry Difficulty 5.7 AIME, harder Prove it United States

Problem:
A finite set of circles in the plane is called nice if it satisfies the following three conditions:
(i) No two circles intersect in more than one point;
(ii) For every point AA of the plane there are at most two circles passing through AA;
(iii) Each circle from the set is tangent to exactly 5 other circles from the set.
Does there exist a nice set consisting of exactly
(a) 2006 circles?
(b) 2007 circles?

Solution

Solution:
(a) The answer is yes. The following picture shows that there is a nice set consisting of exactly 12 circles. It is also possible to construct a nice set with 22 circles (the picture can be found below). Since 2006=15812+5222006 = 158 \cdot 12 + 5 \cdot 22 we can make a nice set of 2006 by making a union of 158 disjoint nice sets of 12 circles each, and 5 disjoint nice sets each of which contains 22 circles.
Figure 1

(b) We will prove that a nice set can't contain an odd number of circles. Let nn be the total number of circles. We will count the number of pairs (k,P)(k, P) where kk is a circle in the set and PP a point at which kk touches another circle. For each circle kk there are exactly 5 such pairs, and hence the total number of pairs is 5n5n. For each point PP there are exactly 2 pairs corresponding to it. Hence the total number of pairs has to be even, but 5n5n can't be even if nn is odd.

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.