Problem 4
Consider a board with an integer written in each unit square. Two unit squares are called neighbours if they share a common edge. In each turn, some unit squares are chosen; then, for each chosen square, the average of all its neighbours is computed, and finally, after all these computations are done, the number in each chosen square is replaced by its corresponding average. Is it always possible to make the numbers in all squares equal after finitely many turns?
Step 5 of 6: An equilibrium board is a fixed point of every turn
Detailed analysis
In a turn, each chosen square is replaced by the modulo- average of its neighbours' current values; but by construction every cell of the tiled board already equals that average. So whichever subset of squares is chosen, every chosen square is replaced by its own current value, and unchosen squares are untouched by definition. Hence the board modulo is unchanged by any single turn, and therefore by any finite sequence of turns.