All the 16 squares of a array are white. Define a move by selecting a rectangle or and switching the colors of each of its squares from white to black or from black to white. Is it possible that all squares turn black after a sequence of moves?
Solution
<table><tr><td>1</td><td>2</td><td>3</td><td>1</td></tr><tr><td>2</td><td>3</td><td>1</td><td>2</td></tr><tr><td>3</td><td>1</td><td>2</td><td>3</td></tr><tr><td>1</td><td>2</td><td>3</td><td>1</td></tr></table>
to observe that a move will change colors in one square of each number. As initially there are six squares labeled 1, an even number of moves is required to turn black all these squares. On the other hand, five squares were labeled with 2 at the start, requiring an odd number of moves to turn all black, hence the answer is negative.
Want a route through all this instead of an archive? The track
puts 2,000 problems in a working order, from AMC 10 level to the IMO shortlist.