Maths Olympiad Prep

Library / /53 of 86

Combinatorics Difficulty 7.0 National Olympiad, round 2 Prove it United States

Problem:

Each vertex of a regular 17-gon is colored red, blue, or green in such a way that no two adjacent vertices have the same color. Call a triangle "multicolored" if its vertices are colored red, blue, and green, in some order. Prove that the 17-gon can be cut along nonintersecting diagonals to form at least two multicolored triangles.

(A diagonal of a polygon is a line segment connecting two nonadjacent vertices. Diagonals are called nonintersecting if each pair of them either intersect in a vertex or do not intersect at all.)

Solution

Solution:

Denote the colors by 1,2,31, 2, 3. Notice that all three colors must be used. This is true because if only two colors were used, the vertex coloring would be of the type 121212121212 \ldots which is impossible, since 1717 is odd (this would make two adjacent vertices the same color). Hence there are three consecutive vertices colored (without loss of generality) 1,2,31, 2, 3, respectively. (For otherwise, if 33 consecutive vertices had coloration of the form abaa b a, the next three vertices [overlapping two vertices] would have to be colored babb a b, etc., forcing the pattern abababa b a b a b \ldots which is not possible with an odd number of vertices.)

Thus we have 44 cases depending on the colors of the vertices adjacent to this segment: 2123121231, 2123221232, 3123131231, 3123231232. It is easy to see that the desired construction can be done in each case; the figure below illustrates this.

Figure 1

Figure 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: MathNet, licensed CC-BY-4.0. Statement reproduced verbatim; metadata (topic, difficulty) added by this project.