Farey sequence
Named by 5 essays across one field — each of them below, with the objects they name alongside it.
Every fraction, exactly once
Take two fractions, add the tops and add the bottoms. That is not how fractions are added, it is not an average, and repeating it produces every positive rational exactly once, already in lowest terms.
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.
The arcs a line crosses on its way to a number
Draw a semicircle over every pair of neighbouring fractions and the half-plane above the number line is cut into curved triangles that never overlap. A straight line dropped towards any number crosses those arcs one after another, and the arcs it crosses, and the side it leaves each triangle by, are exactly the steps of the Stern–Brocot descent towards that number.
How evenly the fractions spread
List every fraction between nought and one with denominator at most n, in order. They spread across the interval almost evenly, and how fast the unevenness shrinks as n grows is — exactly, provably — the Riemann hypothesis. The link runs through a second fact: set the fractions round a circle and add them as arrows, and what is left is a whole number.
Three unit fractions for every four over n
Two neighbouring fractions in the tree always differ by a unit fraction, so stepping down the tree writes any fraction as a sum of them — four over n in at most four steps. Erdős and Straus asked in 1948 whether three always suffice. Three identities settle every n except those leaving remainder 1 on division by 24, a search settles every one anyone has tried, and nobody has a proof.
Named alongside it
The objects these essays reach for when they reach for this one.
MediantStern brocot treeContinued fractionsLowest termsUnimodularBijectionConjectureCounting two waysDeterminantDiophantine approximationDiscrepancyEquidistribution