MathDB
IMO Shortlist 2008, Geometry problem 5

Source: IMO Shortlist 2008, Geometry problem 5, German TST 1, P2, 2009

July 9, 2009
geometrypoint setcombinatorial geometrylinesIMO Shortlist

Problem Statement

Let k k and n n be integers with 0\le k\le n \minus{} 2. Consider a set L L of n n lines in the plane such that no two of them are parallel and no three have a common point. Denote by I I the set of intersections of lines in L L. Let O O be a point in the plane not lying on any line of L L. A point X∈I X\in I is colored red if the open line segment OX OX intersects at most k k lines in L L. Prove that I I contains at least \dfrac{1}{2}(k \plus{} 1)(k \plus{} 2) red points. Proposed by Gerhard Woeginger, Netherlands