Browse · MathNet
PrintVijetnam 2007
Vietnam 2007 counting and probability
Problem
Given a regular 2007-polygon. Find the smallest positive integer satisfying the following property: In every set of vertices there are 4 vertices which form a quadrilateral with 3 edges of the given 2007-polygon.
Solution
Denote the vertices of the regular 2007-polygon by . Note that every quadrilateral has 3 edges of the given polygon if and only if its 4 vertices are consecutive vertices of the polygon.
Denote by the set of the vertices except () and , in fact, . Let and has no 4 consecutive vertices of the given 2007-polygon. Thus, .
Now, we will prove that every subset of 1506 vertices contains 4 consecutive vertices of the given 2007-polygon. Let be a subset of arbitrary 1506 vertices of the given 2007-polygon. By deleting 501 vertices not belonging to we obtain a decomposition of the set of the vertices of the given 2007-polygon into the subsets with . By the Dirichlet principle, there is a set containing consecutive vertices.
Denote by the set of the vertices except () and , in fact, . Let and has no 4 consecutive vertices of the given 2007-polygon. Thus, .
Now, we will prove that every subset of 1506 vertices contains 4 consecutive vertices of the given 2007-polygon. Let be a subset of arbitrary 1506 vertices of the given 2007-polygon. By deleting 501 vertices not belonging to we obtain a decomposition of the set of the vertices of the given 2007-polygon into the subsets with . By the Dirichlet principle, there is a set containing consecutive vertices.
Final answer
1506
Techniques
Pigeonhole principleColoring schemes, extremal arguments