The last-digit Collatz family across all bases
- Kind
- Theorem with exact computations
- Status
- Proved (mixed): Lean-verified for base 2, base 10 descent, base 17 runaway, and even-base drift; written proof for bases 4 and 6 descent; checked by certificates for finite screens; unrefereed
- Prior work
- Companion to the base-10 Ouroboros paper; builds on Terras (1976), Lagarias (1985), Matthews and Watts (1984, 1985), Krasikov and Lagarias (2003), and Simons and de Weger (2005)
The statement
For any integer base , write for the last base- digit of , and define the last-digit Collatz map on positive integers by
In base this map is conjugate on odd integers to the classical Collatz map; base is the Ouroboros map. This companion paper develops the theory of the family across all bases and sharpens the base- bounds across four parts:
-
All even bases. The -adic odd-step Markov chain admits a closed recurrent class of non-positive logarithmic drift if and only if . The near-zero band contains precisely , and contains only . The least drift satisfies , and if is the natural density of starts still at or above their initial value after every shortcut step through , then satisfies if and only if . A positive limit here is a statement about finite horizons. Individual orbits in these even bases require a separate argument.
-
Odd bases and zero-digit trapdoors. For odd , odd multiples of carry last digit and drop immediately to . Entry into this trapdoor is classified by : rootless bases (divisible by a prime ) have trapping density , while rooted bases have entry roots. Exact rational trapping and runaway densities are established for through .
- How many decimal starts reach 1? If counts odd starts up to that reach 1, then . Some constant gives . Whether a single growth exponent exists remains open.
- Short decimal cycles. An exact computation through eight odd members finds only and in the odd-to-odd map. A separate Lean proof covers up to three. Combined with the recorded sweep through , the large-cycle bounds require at least 34,905 halvings, 15,496 odd steps and 53,185 total steps for any other cycle.
Check it yourself
Even-base Markov drifts ( through ).
| Even base | 2 | 4 | 6 | 8 | 10 | 12 | 14 | 16 | 18 |
|---|---|---|---|---|---|---|---|---|---|
| Least drift |
Only have , and only (Collatz) and (Ouroboros) lie in .
Odd-base trapdoors and runaways by hand.
- Base 5 (certain trapping, ): ends in base- digit , so . Every odd residue class enters the trapdoor with density .
- Base 13 (rooted split): traps while escapes.
- Base 17 (rooted split with runaway orbit): and . Starting at () gives . Every positive in this residue class satisfies , which returns to the same class. Iterating gives divergence.
Replay the checks. Run python3 directly on the downloaded verification archive (python3 last-digit-family-*-verification.zip). Its README also gives commands for the separate C++ period enumeration and the Lean build.
Status and who checked it
- Formal proofs. The archived Lean library records 424 declarations: Lean-verified for base 2 convergence, base 10 density-one descent, base 17 divergence modulo 34, the even-base stationary drift classification, parity coding, decimal backward moves, and decimal cycles through three odd members. The finite-state density-one descent step from negative drift in bases 4 and 6 rests on the manuscript's written proof.
- Exact computations. The checker verifies the even-base drift screen through 208, odd-base certificates through 1,999, three decimal inverse-tree weight vectors and the short-period enumeration through eight odd members.
-
Open. Global boundedness in bases 4 and 10 and the exact growth of the decimal basin of 1 remain open.
-
Unrefereed. Checked by Lean 4, exact-arithmetic scripts, and agent reviewers; no human referee has read the manuscript.
Prior work
Searches run. Sweeps of arXiv, zbMATH Open, OpenAlex, and OEIS through 2026-11-21 found no prior work defining , proving the all-even-base drift classification, or establishing the odd-base zero-digit trapdoor criterion. Twenty-nine of the manuscript's references were read in full. On 2026-11-22, a Google Scholar sweep (5 queries) found no prior work stating this claim.
Context and credit. Parity coding and stopping-time density build on Terras (1976, 1979) and Lagarias (1985); Markov-chain methods for generalized Syracuse maps follow Matthews and Watts (1984, 1985), Leigh (1986), and Matthews (2010); predecessor-tree lower bounds build on Applegate and Lagarias (1995) and Krasikov and Lagarias (2003), matching OEIS A003269 on digit- chains; cycle lower bounds adapt Simons and de Weger (2005, 2010), Simons (2008), Hercher (2023), and Barina (2025).
Still owed. Ten paywalled or print-only references marked unchecked in the manuscript (Belaga and Mignotte 1998, Eliahou 1993, Everett 1977, Guy 2004, Krasikov 1989, Lagarias and Weiss 1992, Steiner 1978, Venturini 1992 and 1997, and Wirsching 1998).
Further reading
- Last-digit Collatz (the Ouroboros Conjecture): the base- companion page and quadrillion check.
- R. Terras, "A stopping time problem on the positive integers", Acta Arithmetica 30 (1976), 241–252
- J. C. Lagarias, "The problem and its generalizations", Amer. Math. Monthly 92 (1985), 3–23
- I. Krasikov and J. C. Lagarias, "Bounds for the problem using difference inequalities", Acta Arithmetica 109 (2003), 237–258
- J. L. Simons and B. M. M. de Weger, "Theoretical and computational bounds for -cycles of the -problem", Acta Arithmetica 117 (2005), 51–70
- C. Hercher, "There are no Collatz -cycles with ", J. Integer Seq. 26 (2023), Art. 23.3.5