Collatz conjecture
Named by 3 essays across one field — each of them below, with the objects they name alongside it.
How short a cycle could be
The drift argument cannot see cycles at all, which is why it is not a proof. What can see them is arithmetic — a cycle's shape has to be a fraction that approximates the logarithm of three to base two extraordinarily well, and there are very few such fractions.
Every pattern happens exactly once
Choose any sequence of odds and evens and there is exactly one residue class whose orbit follows it, and exactly one fraction that cycles through it forever. The Collatz conjecture is then the statement that only one of those infinitely many cycles is made of whole numbers.
How high an orbit climbs
The Collatz orbit of 27 climbs to 9,232 before it falls, and below ten million the champion, 6,631,675, climbs to sixty trillion — almost exactly the square of where it started. That is not a coincidence of the two numbers but a law of the whole family: an orbit climbs to x times its start with a chance of about one in x, and the exponent is one because half of three-halves plus half of a half is exactly one. Among N starts the luckiest climbs about N-fold, and so the records grow like the square of the start.
Named alongside it
The objects these essays reach for when they reach for this one.
Exhaustive searchPeriodic orbitBijectionCollatzContinued fractionsDiophantine approximationDriftExpectationHeuristicInvariantModular arithmeticRandom walk