Modular arithmetic — where it appears
Numbers that wrap
A clock does arithmetic. It has finitely many numbers, addition never leaves it, and multiplication behaves entirely differently depending on one property of the size of the dial.
Two squares, and a lattice
Whether a prime is the sum of two squares is decided entirely by its remainder on division by four. A fact about circles is settled by a fact about remainders, and neither statement contains any hint of the other.
Necklaces that prove a theorem
Thread five beads in two colours, thirty-two ways. Two of them are all one colour; the other thirty fall into rings of five. That count, and nothing else, is Fermat's little theorem.
Two dials at once
Watch one number on two clocks with different faces. If the faces share no factor, every pair of readings occurs exactly once — so two remainders name a number, and a hard calculation can be split into two easy ones.
Counting one rectangle, twice
Whether seven is a square modulo eleven, and whether eleven is a square modulo seven, are two unrelated-looking questions. Their answers are linked, and the link is a rectangle of dots counted along its rows and then along its columns.
Named alongside it
The objects these essays reach for when they reach for this one.
Counting two waysPrimesCyclic groupLatticeFermats little theoremGreatest common divisorOrderParityPeriodicityRemainderBijectionChinese remainder theorem