Regional Olympiad in Mexico.
Source: OMM
July 31, 2013
invariantalgorithmrotationcombinatorics unsolvedcombinatorics
Problem Statement
A board of x is colored chess style, a movement is the changing of colors of a x square. For what integers is possible to complete the board with one color using a finite number of movements?