Composite
Named by 5 essays across 2 fields — each of them below, with the objects they name alongside it.
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.
The primes are what is left over
Eratosthenes' sieve does not find the primes. It removes everything else, one prime at a time, and whatever survives is prime by default — which is a strange way to reach the most studied objects in arithmetic.
There is no last prime
Euclid's argument is often described as producing a new prime from any finite list. It does not, and the number it builds is frequently composite — which makes the proof more interesting rather than less.
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.
The exponent that is smaller than Euler's
Euler's theorem raises every unit to the count of the units and gets one. The smallest exponent that works for all of them at once is often much smaller — and a composite is invisible to Fermat's test exactly when that smaller number divides n − 1.
Named alongside it
The objects these essays reach for when they reach for this one.
PrimesCounting two waysModular arithmeticOrderCyclic groupFermats little theoremModulusOrbitPrimality testCounting argumentDensityDivisibility