Browse · MathNet
PrintNMO Selection Tests for the Balkan and International Mathematical Olympiads
Romania geometry
Problem
Let be a finite collection of lines in the plane in general position (no two lines in are parallel and no three are concurrent). Consider the open circular discs inscribed in the triangles enclosed by each triple of lines in . Determine the number of such discs intersected by no line in , in terms of .
Solution
The complement of the union of all lines in is the disjoint union of open convex sets called rooms, of which exactly are bounded. Let denote the set of the discs we are to count. Clearly, each disc in is contained in some bounded room. We shall prove that each bounded contains exactly one such, whence the conclusion. To this end, we shall first prove that no bounded room contains more than one disc in , and then that each bounded room contains at least one such.
Suppose, if possible, that is a bounded room which contains two discs in ; one, of radius , centered at , inscribed in the triangle enclosed by the lines and in ; and another, of radius , centered at , inscribed in the triangle enclosed by the lines and in . Clearly, the lines and support edges on the boundary of , the triangles and both contain , and and are distinct. Without loss of generality, we may assume that . Since lies in the interior of the triangle and is different from , it is within from one of the lines or . Consequently, that line intersects the disc of radius centered at – a contradiction.
We now proceed to prove that each bounded room contains a disc in . Since is convex, and no two lines in are parallel, among those lines in which support edges on the boundary of , at least three enclose a triangle which contains – this is a well-known fact about convex polygons different from a parallelogram. Of all such triangles, choose one with a minimal inradius. We shall prove that the open circular disc inscribed in that triangle is contained in ; in particular, is in . Let the triangle be enclosed by the lines and in . Since each of the lines and supports an edge on the boundary of , it follows that and are not disjoint. Suppose, if possible, that is not contained in . Then contains points on some edge on the boundary of . Let be a line in that supports such an edge. Clearly, is different from and , and it is not hard to see that and two of the lines enclose a triangle which contains and has an inradius smaller than the radius of – a contradiction.
Suppose, if possible, that is a bounded room which contains two discs in ; one, of radius , centered at , inscribed in the triangle enclosed by the lines and in ; and another, of radius , centered at , inscribed in the triangle enclosed by the lines and in . Clearly, the lines and support edges on the boundary of , the triangles and both contain , and and are distinct. Without loss of generality, we may assume that . Since lies in the interior of the triangle and is different from , it is within from one of the lines or . Consequently, that line intersects the disc of radius centered at – a contradiction.
We now proceed to prove that each bounded room contains a disc in . Since is convex, and no two lines in are parallel, among those lines in which support edges on the boundary of , at least three enclose a triangle which contains – this is a well-known fact about convex polygons different from a parallelogram. Of all such triangles, choose one with a minimal inradius. We shall prove that the open circular disc inscribed in that triangle is contained in ; in particular, is in . Let the triangle be enclosed by the lines and in . Since each of the lines and supports an edge on the boundary of , it follows that and are not disjoint. Suppose, if possible, that is not contained in . Then contains points on some edge on the boundary of . Let be a line in that supports such an edge. Clearly, is different from and , and it is not hard to see that and two of the lines enclose a triangle which contains and has an inradius smaller than the radius of – a contradiction.
Final answer
C(|L|-1, 2)
Techniques
Combinatorial GeometryTriangle centers: centroid, incenter, circumcenter, orthocenter, Euler line, nine-point circleOptimization in geometry