Realizer Bounds and Repetition Constraints at the First Coefficient Crossing in the 3x + 1 Problem
Version 1 / Nov 15, 2026 / CC BY 4.0
Abstract
Terras’s coefficient stopping time conjecture asks whether the shortcut Collatz orbit of
every integer n ≥ 2 lies below n when its coefficient ρk = 3d/2k first falls below one. Here
k counts shortcut steps and d counts their odd inputs. We prove that every eligible realizer
descends when the first-crossing word has at most 75 maximal runs of odd inputs. Any
counterexample requires at least 76 such runs, 10 439 860 591 steps and 6 586 818 670 odd
inputs. The proof uses a lower bound on the seed from the length of its odd runs, rational
approximations to log2 3, the verified range of Rozier and Terracol, and Rhin’s estimate
for a linear form in logarithms. We also prove descent for a family with arbitrarily many
odd runs. Two further restrictions narrow the remaining words. An initial square U U in
a failing word satisfies |U | < 35 log2 k. For a counterexample of shortest crossing length,
the reciprocal-sum estimate of Nikzad, Frinkle and Bagherzadeh gives a lower bound on
ρk whose value begins 0.9441733669 . . .. The open inequality compares the least eligible
starting value in each remaining parity class with an explicit threshold.
Provenance statement
References
- Shalom Eliahou. The problem: new lower bounds on nontrivial cycle lengths. Discrete Mathematics , 118:45--56, 1993.
- Kazunobu Hikawa. Research notes on Terras ' coefficient stopping time problem I : Previous results and open problems, 2026. English translation, November 2026; Japanese original, Zenodo, 13 November 2026, DOI 10.5281/zenodo.24187839.DOI
- Elias De Jesús. Beyond S turmian words in the periodicity conjecture: A periodic-approximation and arithmetic-height bridge, 2026. Revision 5, 13 November 2026; Revision 4 deposited as Zenodo DOI 10.5281/zenodo.23070093.DOI
- Elias De Jesús. Exact realizer congruences and rational-shadow bounds for C ollatz words, 2026. Zenodo preprint, 31 October 2026. doi:10.5281/zenodo.23847289 (https://doi.org/10.5281/zenodo.23847289).DOI
- Elias De Jesús. Exact realizer floors for one- and two-defect valuation words in the accelerated map, 2026. Zenodo preprint, 22 October 2026. doi:10.5281/zenodo.23579193 (https://doi.org/10.5281/zenodo.23579193).DOI
- Elias De Jesús. Independent verification of high-path reciprocal bounds for nonrepeating C ollatz trajectories, 2026. Unpublished manuscript, 3 November 2026.
- Behzad Nikzad, Karl Frinkle, and Fatemeh Bagherzadeh. On bounds for reciprocal sums and residues in C ollatz orbits, and their consequences, 2026. Hexagon preprint 2611.00033v1, https://hexagonmath.org/2611.00033v1.hexagon
- Georges Rhin. Approximants de P adé et mesures effectives d'irrationalité. In Séminaire de Théorie des Nombres, Paris 1985--86 , volume 71 of Progress in Mathematics , pages 155--164. Birkhäuser Boston, 1987.
- Olivier Rozier and Claude Terracol. Paradoxical behavior in C ollatz sequences. Discrete Mathematics , 349:115167, 2026. arXiv:2502.00948v5.arXiv
- Riho Terras. A stopping time problem on the positive integers. Acta Arithmetica , 30:241--252, 1976.
Version history
- v1 · 6 pagesSubmitted by Elias De JesúsInitial depositSupersededNov 14, 2026
- v2 · 12 pagesSubmitted by Elias De JesúsSubmitted as a new versionCurrentNov 15, 2026