Maths Olympiad Prep

Library / /152 of 158

Geometry Difficulty 7.2 National Olympiad, round 2 Prove it Estonia

Jüri wishes to draw nn circles and any number of lines on the plane such that all the lines meet at one point, and for every two circles there exist two lines that touch both of these circles.

a)
Is it possible for Jüri to solve this problem for any n2n \ge 2?

b)
For which natural numbers nn is it possible to solve this problem if in addition all the circles must have the same radius?

Solution

a.
Jüri can draw two lines and draw any number of circles such that they touch both of the lines.

Figure 1
Fig. 8

b.
Assume that Jüri has solved the problem for some nn, where n>1n > 1.

Let OO be the intersection point of all the lines. Look at any circle cc. From the premises of the problem we see that the circle cc touches two of the lines drawn by Jüri, which we call kk and ll. But any one circle can only touch up to two lines drawn from one point. So, the circle cc does not have any more lines touching it. If cc' is any other circle drawn by Jüri, then the common tangents of cc and cc' can only be kk and ll. Therefore, kk and ll are the common tangents of all the circles. Two lines divide the plane into four sectors, inside each can be only one circle with the previously set radius.

Figure 2
Fig. 9

So, for n>4n > 4 the problem has no solution but for n4n \le 4, it obviously has.

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.