Question 54
Consider a white square $ABCD$ of size $8 \times 8$, that consists of $64$ unit squares of size $1 \times 1$. In a turn one can choose any
a) square;
b) rectangle,
that consists of a whole number of unit squares and contains at least one of the vertices of the square $ABCD$, and change a color of every unit square in it to the opposite one (white is changed to black and vice versa). Is it possible to obtain arbitrary coloring of the square $ABCD$ using the turns described above?
a) square;
b) rectangle,
that consists of a whole number of unit squares and contains at least one of the vertices of the square $ABCD$, and change a color of every unit square in it to the opposite one (white is changed to black and vice versa). Is it possible to obtain arbitrary coloring of the square $ABCD$ using the turns described above?