Rational approximation
Named by 4 essays across one field — each of them below, with the objects they name alongside it.
A fraction that never closes
Euclid's algorithm throws away everything except the number of squares it peeled at each step. Those counts are a second name for the number it started from — one that terminates exactly when the ratio is a ratio.
How close a fraction can get
Drop eight points into seven boxes and two of them share. That one line, applied to the multiples of an irrational number, proves that every irrational has infinitely many astonishingly good rational approximations — and no construction is needed anywhere.
Approached too fast to be algebraic
An algebraic number of degree d cannot be approached by fractions faster than the denominator's dth power. So a number that is approached faster than that is the root of no polynomial at all — and one can be built by choosing where its decimal digits go.
The fractions that beat every smaller one
Walking down the tree towards a number produces a sequence of fractions closing in on it. Most of them are steps along the way; a few are the best approximations there are — closer than every fraction with a smaller denominator — and which few is decided by where the turns change direction.
Named alongside it
The objects these essays reach for when they reach for this one.
Continued fractionsContinued fraction convergentDiophantine approximationExistence proofGolden ratioLiouville numberTranscendenceAlgebraic numberConstructionCounting argumentDegreeDirichlet