Maths Olympiad Prep

Library / /370 of 520

Geometry Difficulty 7.2 National olympiad, round 2 Find the answer

Let L\mathcal{L} be a finite collection of lines in the plane in general position (no two lines in L\mathcal{L} are parallel and no three are concurrent). Consider the open circular discs inscribed in the triangles enclosed by each triple of lines in L\mathcal{L}. Determine the number of such discs intersected by no line in L\mathcal{L}, in terms of L|\mathcal{L}|.

B. Aronov et al.

A number or a short expression. Fractions can be typed as 3/2, and spacing doesn't matter.

Solution

1. Base Case Verification:
- For L=1|\mathcal{L}| = 1, there are no triangles formed, hence no discs.
- For L=2|\mathcal{L}| = 2, there are still no triangles formed, hence no discs.
- For L=3|\mathcal{L}| = 3, exactly one triangle is formed by the three lines, and thus one disc is inscribed in this triangle. The formula (L1)(L2)2\frac{(|\mathcal{L}|-1)(|\mathcal{L}|-2)}{2} gives (31)(32)2=1\frac{(3-1)(3-2)}{2} = 1, which matches our observation.

2. Inductive Step:
- Assume the formula holds for L=n|\mathcal{L}| = n, i.e., the number of discs intersected by no line in L\mathcal{L} is (n1)(n2)2\frac{(n-1)(n-2)}{2}.
- Consider L=n+1|\mathcal{L}| = n+1. The n+1n+1-th line intersects each of the nn lines in nn distinct points, creating nn segments and two half-lines.
- Each of these nn segments creates a new finite region. Thus, the total number of finite regions formed by n+1n+1 lines is:
n+(n1)(n2)2=n(n1)2 n + \frac{(n-1)(n-2)}{2} = \frac{n(n-1)}{2}
- Each of these finite regions contains exactly one disc that is inscribed in a triangle formed by three of its sides.

3. Lemma:
- Inside each convex polygon formed by the lines, there is exactly one disc that is tangent to three of its sides.
- Proof of Lemma:
- Start with a small circle tangent to one side e1e_1 of the polygon.
- Homothetically expand the circle until it touches another side e2e_2.
- Let AA be the intersection of the lines determined by e1e_1 and e2e_2. Expand the circle from AA until it touches a third side e3e_3.
- The circle is now tangent to three sides, forming a triangle MNP\triangle MNP.
- If the circle is not the incircle of MNP\triangle MNP, it must be an ex-circle. Continue expanding the circle until it touches another side e4e_4.
- This process continues, increasing the radius of the circle until it must stop, at which point the circle is inscribed in a triangle formed by three sides of the polygon.
- To prove uniqueness, assume there are two such discs. The larger disc must be inside the triangle formed by the smaller disc, leading to a contradiction. Hence, there is exactly one such disc.

4. Conclusion:
- The total number of discs intersected by no line in L\mathcal{L} is given by the formula (L1)(L2)2\frac{(|\mathcal{L}|-1)(|\mathcal{L}|-2)}{2}.

The final answer is (L1)(L2)2\boxed{\frac{(|\mathcal{L}|-1)(|\mathcal{L}|-2)}{2}}

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: NuminaMath-1.5, licensed Apache-2.0. Statement and solution reproduced as published; topic and difficulty added by this site.