Invariant puzzlesUp to 16 numbers
Find what every move leaves alone. Show why the order cannot matter.
The numbers 1 to 5 are on a board. Rub out any two and write their sum minus one. Keep going until one number is left. Every child in the room chooses differently and every one of them ends on 11.

The answer key prints on a separate page.
The question is not what the answer is. It is why the order cannot matter, and that is a different kind of question from every other challenge sheet here. The others hand over facts that pin an answer down; this one hands over a process with a completely free choice at every step, and the answer is the same anyway.
The argument fits in two observations. Each move rubs out two numbers and writes one, so the count falls by exactly one — five numbers means four moves, always. Each move also drops the total by exactly one. Four moves, four lost, and the numbers added to 15 to start with: the last number was 11 before anybody touched the board.