Example 1 — Parity invariant
EasyProblem
Numbers through are on a board. You repeatedly erase two and write their sum. What property of the count of odd numbers is invariant... and what's the final number's parity?
Solution
-
Each move sums two numbers; track whether the total sum stays fixed.
Name the structure before touching arithmetic — that is what makes the right method obvious.
-
Ask the recognition question: Is there a property that holds equal before and after the transformation?
If the answer is yes, the concept applies; the cue, not a keyword, decides the method.
-
Note that replacing with leaves the overall sum unchanged — the sum is the invariant.
The rule is chosen only after the structure matches, so the steps mean something.
-
Sum stays through every step.
Keep units, shape, or answer form tied to the story so the work does not become symbol pushing.
-
Check the answer against the original question.
It should fit the mental model — stays the same through the change. If it does not, revisit the recognition step before changing the arithmetic.
Answer
The final single number is
Takeaway: An invariant (here the total sum) is preserved through every move and pins the outcome.