AUSTRIAN-POLISH 1988 Problem 7
Each side of a regular octagon is colored blue or yellow. In each step, the sides are simultaneously recolored as follows: if the two neighbors of a side have different colors, the side will be recolored blue, otherwise it will be recolored yellow. Show that after a finite number of moves all sides will be colored yellow. What is the least value of the number of moves that always lead to all sides being yellow?
Dataset text AI-MO AoPS. Quoted with source.
Solutions
No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.
Similar problems
These problems have the most words in common with this statement.