Last-digit Collatz (the Ouroboros Conjecture)
- Kind
- Conjecture, checked by computer for every start through
- Status
- Conjecture (not proved): Lean-verified for density-one descent and cycles with at most 3 odd members; checked by computer through ; unrefereed
- Prior work
- Rule and two-loop claim not found in the searches logged; the loop of 5 appears earlier under a different rule
On this page
The statement
Take a positive whole number .
- If is even, the next number is .
- If is odd, the next number is , where is the last decimal digit of (so is 1, 3, 5, 7 or 9).
Conjecture. Every start, followed long enough, ends in one of two loops: or . Equivalently, these are the only loops, and no start climbs forever.
Check it yourself
- The two loops close. , and 2 halves to 1. , then 13; 13 ends in 3, so , then 20, 10 and back to 5.
- The computer check. Every positive start through one quadrillion (), inclusive, ends in one of the two loops. An independent checker agreed on the final billion starts below the endpoint.
- How many starts reach 5? For every integer , at least odd starts up to reach the loop through 5. The checker verifies integer weights on branches of the inverse tree rooted at 3.
- How long would another loop have to be? An exact enumeration finds only the two known loops through eight odd members. Combined with the recorded sweep through , separate bounds require any other loop to have at least 34,905 halvings, 15,496 odd steps and 53,185 total steps.
Worked examples
One step from each (not a chain):
| 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | 10 | |
|---|---|---|---|---|---|---|---|---|---|---|
| next | 2 | 1 | 10 | 2 | 26 | 3 | 50 | 4 | 82 | 5 |
Three starts to follow by hand:
- 31 reaches 1 in 6 steps: . The first step is .
- 3 reaches 5 in 2 steps: .
- 7 reaches 5 in 40 steps, climbing as high as 2,576 on the way (figure 1).
Some starts climb far before they fall: 9,872,887, a 7-digit number, climbs to a 33-digit number and still ends at 5.
Status and who checked it
- Checked by computer: every start through . Earlier, separate checks reached and .
- Checked in Lean 4. An algebraic proof covers loops with at most three odd members. The exact search through eight odd members and the large-cycle bounds use additional integer computations.
-
Descent and eventual destination. The set of starts that eventually fall below their initial value has natural density one. Among starts reaching either known loop, the fraction reaching 1 tends to zero.
-
Open: that every orbit is bounded, and that no other loop exists. The conjecture is not proved.
- Who checked it: a falsifier agent, a second targeted falsifier agent and an adversarial reviewer agent. No human referee has read it.
What is known, and not credited here. The rule reads a decimal digit. In base 4 the same rule ("multiply an odd number by its last base-4 digit and add 1") is the Collatz problem itself, a form Farkas posed in 2005. So the family holds Collatz's problem as its base-4 member; the claim here is about the base-10 member only.
Prior work
Searches run. Four agents searched with their own queries: OEIS by computed terms and by words, Math Stack Exchange and MathOverflow, the web, about 75 queries and pages on Keith Matthews' generalized- site, and both of Lagarias's annotated bibliographies. On 2026-11-18, 2 Google Scholar searches and 10 CORE searches followed. On 2026-11-19 a hunt covered Reddit's Collatz forums, AoPS, Stack Exchange sister sites, recreational sources and sources in six other languages. The rule and the two-loop claim were not found in the searches logged.
An earlier occurrence of the loop. The loop was written down earlier, under a different rule, in Augusto Santi's Math Stack Exchange question of 2025-12-10, about a map whose odd steps multiply by 3 and by 5 in turn. That map never reads a digit, so it is a relative: not this rule and not this claim. The two rules share the loop because its odd members, 5 and 13, end in 5 and 3.
Nearest relatives named by the searches: Gurbaxani's "Mapping " on Matthews' site (the same ten-branch shape, different multipliers); the general residue-class map theory of Conway (1972), Matthews and Watts, and Leigh; and Farkas's base-4 form above.
Still owed: Guy's Unsolved Problems in Number Theory in print and Wirsching's monograph were not searched.
Further reading
- The last-digit Collatz family across all bases: even-base drift classification, odd-base trapdoors, sharper base-10 basin-of-1 bounds and cycle lower bounds.
- Augusto Santi, "A Collatz–type dynamical system with alternating multipliers (3 and 5)", Math Stack Exchange, 2025-12-10
- H. M. Farkas, "Variants of the 3N+1 conjecture and multiplicative semigroups", Contemp. Math. 387, AMS (2005), 121–127.