polygon is cut by at least one of these m lines
Source: China TST 1990, problem 2
June 27, 2005
geometry unsolvedgeometry
Problem Statement
Finitely many polygons are placed in the plane. If for any two polygons of them, there exists a line through origin that cuts them both, then these polygons are called "properly placed". Find the least , such that for any group of properly placed polygons, lines can drawn through and every polygon is cut by at least one of these lines.