Maths Olympiad Prep

Library / /52 of 56

Geometry Difficulty 7.1 National Olympiad, round 2 Prove it JBMO

Problem:

Consider a regular 2n+12n+1-gon PP in the plane, where nn is a positive integer. We say that a point SS on one of the sides of PP can be seen from a point EE that is external to PP, if the line segment SESE contains no other points that lie on the sides of PP except SS. We want to color the sides of PP in 3 colors, such that every side is colored in exactly one color, and each color must be used at least once. Moreover, from every point in the plane external to PP, at most 2 different colors on PP can be seen (ignore the vertices of PP, we consider them colorless). Find the largest positive integer for which such a coloring is possible.

Solution

Solution:

Answer: n=1n=1 is clearly a solution, we can just color each side of the equilateral triangle in a different color, and the conditions are satisfied. We prove there is no larger nn that fulfills the requirements.

Lemma 1. Given a regular 2n+12n+1-gon in the plane, and a sequence of n+1n+1 consecutive sides s1,s2,,sn+1s_{1}, s_{2}, \ldots, s_{n+1} there is an external point QQ in the plane, such that the color of each sis_{i} can be seen from QQ, for i=1,2,,n+1i=1,2, \ldots, n+1.

Proof. It is obvious that for a semi-circle SS, there is a point RR in the plane far enough on the perpendicular bisector of the diameter of SS such that almost the entire semi-circle can be seen from RR.

Now, it is clear that looking at the circumscribed circle around the 2n+12n+1-gon, there is a semi-circle SS such that each sis_{i} either has both endpoints on it, or has an endpoint that is on the semi-circle, and is not on the semicircle's end. So, take QQ to be a point in the plane from which almost all of SS can be seen, clearly, the color of each sis_{i} can be seen from QQ. \diamond

Take n2n \geq 2, denote the sides a1,a2,,a2n+1a_{1}, a_{2}, \ldots, a_{2n+1} in that order, and suppose we have a coloring that satisfies the condition of the problem. Let's call the 3 colors red, green and blue. We must have 2 adjacent sides of different colors, say a1a_{1} is red and a2a_{2} is green. Then, by Lemma 1:

(i) We cannot have a blue side among a1,a2,,an+1a_{1}, a_{2}, \ldots, a_{n+1}.

(ii) We cannot have a blue side among a2,a1,a2n+1,,an+3a_{2}, a_{1}, a_{2n+1}, \ldots, a_{n+3}.

We are required to have at least one blue side, and according to (i) and (ii), that can only be an+2a_{n+2}, so an+2a_{n+2} is blue.

Now, applying Lemma 1 on the sequence of sides a2,a3,,an+2a_{2}, a_{3}, \ldots, a_{n+2} we get that a2,a3,,an+1a_{2}, a_{3}, \ldots, a_{n+1} are all green.

Applying Lemma 1 on the sequence of sides a1,a2n+1,a2n,,an+2a_{1}, a_{2n+1}, a_{2n}, \ldots, a_{n+2} we get that a2n+1,a2n,,an+3a_{2n+1}, a_{2n}, \ldots, a_{n+3} are all red.

Therefore an+1,an+2a_{n+1}, a_{n+2} and an+3a_{n+3} are all of different colors, and for n2n \geq 2 they can all be seen from the same point according to Lemma 1, so we have a contradiction.

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.