Example 1 — Coin-flip puzzle
Show the steps and the answer
Track , the number of cups facing up. Flipping two down cups gives , one up and one down gives , two up cups gives .
These are the only three kinds of move, so they cover every possible flip.
Conclude that every move changes by an even number, so whether is even or odd never changes.
Adding , or to an even number always gives an even number.
Compare: the start has , which is even; the target has , which is odd.
Different parities at start and target mean no sequence of moves can link them.
Contrast with the target : parity allows it, and one move, flipping any two cups, reaches it.
An invariant only rules outcomes out; when the values match, you still have to find the moves.
Answer: No — parity invariance forbids it
Takeaway: Find a quantity no move can change, then compare its value at the start and at the target. Here parity settles the question without trying a single sequence.