OlympiadMediumProofs7–9
Invariant Principle
Princípio do Invariante
On a board, numbers 1 through 20 are written. In each step, you erase two numbers and , and write . Can the last remaining number be 0?
Consider the sum of all numbers modulo 2.
Solution
Step 1 of 6
- 1.Invariant: replacing and by never changes the parity of the total sum, because .