In one sentence
Parity is just the remainder mod : the coarsest sieve there is, sorting the integers into only two classes. It is used in almost the same way every time:
Find a quantity whose parity never changes, whatever you do (or changes at every step). If the start and the goal have different parities, the goal can never be reached.
All you need to know is three facts:
- odd ± odd = even, even ± even = even, odd ± even = odd; so adding a number and subtracting the same number have the same effect on parity.
- When you add up a bunch of numbers, the parity of the sum depends only on how many of them are odd.
- A product is odd every factor is odd.
Why ±1 ±2 ±3 ±4 ±5 ±6 can never make 0
Step 1 / 5- All plus signs
, which is odd.
Stop 1 · Operations: flipping cups
Predict first
cups stand facing up. Each move you must flip exactly of them. Can you, after some number of moves, get all cups facing down?
Keep your eye on “the number of cups facing up”. A move flips cups: if of them were facing up, the number facing up goes down by and up by , a net change of , which is even. It starts at (odd), so it stays odd forever and can never become .
Flip a few times yourself and watch the “Its parity” box. Then change to and try again. Can it be done this time?
Stop 2 · Boards: black-and-white coloring
Color the cells of the board black and white according to the parity of “row number + column number”. Two neighboring cells are always one black and one white. The coloring is parity drawn onto the picture.
The two opposite corners you removed have the same color. That leaves cells of one color and of the other, but every domino covers one black and one white cell, so dominoes need black and white. The board cannot be covered, and you don't even need to try.
Stop 3 · Equations: two ways
One problem, several solutions
Prove that has no integer solutions.
Parity argument
. Since is even, and have the same parity.
- Both odd: the product is odd, so it is not .
- Both even: the product is a multiple of . But is not a multiple of .
Neither case works, so there are no integer solutions.
CostNo tools needed, but you have to think of factoring it as (x−y)(x+y).
Mod 4
A square divided by can only leave or (the topic of the next stop). So divided by can only leave , while leaves .
CostOne step, but you need to know first that squares leave only 0 or 1 mod 4.
The two solutions say the same thing: mod simply splits “odd and even” one level finer. When a parity argument is not enough, the next step is to switch to a better modulus.
Practice
Is odd or even? (Don't work out the sum.)
Put a or a in front of each of however you like, then work out the result. What is the smallest non-negative result you can get?
is any arrangement of . Prove that the product is always even.
A grid has one beetle in each cell. When a whistle blows, every beetle crawls to a neighboring cell that shares a side with its own. Prove that after the whistle some cell must be empty.