MathDB
2561 points on a circle

Source: 2018 Thailand October Camp 1.1

February 18, 2022
combinatorics

Problem Statement

Let 25612561 given points on a circle be colored either red or green. In each step, all points are recolored simultaneously in the following way: if both direct neighbors of a point PP have the same color as PP, then the color of PP remains unchanged, otherwise PP obtains the other color. Starting with the initial coloring F1F_1, we obtain the colorings F2,F3,F_2, F_3,\dots after several recoloring steps. Determine the smallest number nn such that, for any initial coloring F1F_1, we must have Fn=Fn+2F_n = F_{n+2}.