Difference between revisions of "1994 USAMO Problems/Problem 2"
(Created page with "==Problem== The sides of a <math>99</math>-gon are initially colored so that consecutive sides are red, blue, red, blue,..., red, blue, yellow. We make a sequence of modification...") |
(No difference)
|
Revision as of 23:02, 22 May 2014
Problem
The sides of a -gon are initially colored so that consecutive sides are red, blue, red, blue,..., red, blue, yellow. We make a sequence of modifications in the coloring, changing the color of one side at a time to one of the three given colors (red, blue, yellow), under the constraint that no two adjacent sides may be the same color. By making a sequence of such modifications, is it possible to arrive at the coloring in which consecutive sides are red, blue, red, blue, red, blue,..., red, yellow, blue?