MathDB

In the beginnig, all nine squares of

3\times 3

chessboard contain

0

. At each step, we choose two squares sharing a common edge, then we add

1

to them or

-1

to them. Show that it is not possible to make all squares

2

, after a finite number of steps.

3