Concept

Lattice — where it appears

4 essays name this object, across one field. What follows is each of them, and the objects they name alongside it.
124361251020153060× 2 →× 3 ↑2^2 × 3 × 5 — 3 × 2 × 2 = 12 divisors

The shape of a number's divisors

Lay a number's divisors out as a lattice with one axis per prime, and two of the most useful facts in arithmetic stop being formulas and become the width and the corner of a rectangle.

number · unique factorisation
12 lattice points sit on the circle — and 4 × (3 − 0) = 12divisors of 25: 1, 5, 25 are 1 mod 4, none are 3 mod 4

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.

number · sums of two squares
0612391017134511281401234012mod 3 ↓mod 5 →every one of the 15 pairs is reached, exactly onceso a remainder mod 3 and a remainder mod 5 together name one number mod 15

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.

number · modular arithmetic
slope 7/117 points below the line, 8 above, and 7 + 8 = 5 × 3 = 15(7 | 11) = −1 from the count below; (11 | 7) = +1 from the count above

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.

number · quadratic reciprocity

Named alongside it

The objects these essays reach for when they reach for this one.

Counting two waysModular arithmeticPrimesUnique factorisationBijectionChinese remainder theoremCyclic groupDivisor functionDivisor sumGauss lemmaGaussian integersGreatest common divisor

All concepts