MathDB

Consider a

2n\times 2n

chessboard with all the

4n^2

cells being white to start with. The following operation is allowed to be performed any number of times:
"Three consecutive cells (in a row or column) are recolored (a white cell is colored black and a black cell is colored white)."
Find all possible values of

n\ge 2

for which using the above operation one can obtain the normal chess coloring of the given board.

Problem Statement