HEXAGONbeta

On Bounds for Reciprocal Sums and Residues in Collatz Orbits, and Their Consequences

A mix of human-written and AI-generated textHuman understanding: all partsmath.NT — Number Theorymath.DS — Dynamical Systems

Contributed by Behzad Nikzad ↗, Karl Frinkle, Fatemeh Bagherzadeh

Version 1 / Nov 03, 2026 / CC BY 4.0

Abstract

We prove uniform bounds for reciprocal sums and residue products along Collatz paths. Let F\mathcal F be a finite nonrepeating shortcut path whose input states are greater than 11, let RF\mathcal R_{\mathcal F} be the sum of the reciprocals of its odd inputs, and let ρF\rho_{\mathcal F} be its finite-path residue. Then RF<1,ρF<43.\mathcal R_{\mathcal F}<1, \qquad \rho_{\mathcal F}<\frac{4}{3}. For the first-arrival trajectory of a terminating positive integer nn, these inequalities give R(n)<1,ρ(n)=2E(n)3O(n)n<43,\mathcal R(n)<1, \qquad \rho(n)=\frac{2^{E(n)}}{3^{O(n)}n}<\frac{4}{3}, where E(n)E(n) and O(n)O(n) are the division and odd-operation counts. More generally, when each odd value greater than 11 is counted once, the corresponding reciprocal-sum and residue bounds hold for every forward orbit, without a termination assumption. The proof combines verified finite height-delay records and residue bounds, canonical-block reciprocal estimates, and an exact finite count organized by gap brackets. Gap brackets, closely related to parity vectors, record the divisions by two between successive odd inputs and organize the finite counting argument; together with a related coordinate representation, they also yield exact formulas for reconstructing finite trajectories. After taking base-22 logarithms, the bound ρF<4/3\rho_{\mathcal F}<4/3 leaves an uncertainty of less than 1/21/2 in the relation between the even- and odd-operation counts. Since these counts are integers, either count is determined exactly by the other count and the path endpoints. We obtain nearest-integer restrictions on the changes in EE and OO between adjacent integers, apart from explicit small exceptions, and prove that adjacent terminating integers of equal height have identical operation counts. Thus every equal-height streak lies in a single operation-count class. We further introduce the charge λ=E−2O\lambda=E-2O and associated height and charge slice functions to study the persistence and eventual break of equal-height streaks. We distinguish class records, which are the least starting integers attaining specified values, from delay records, which attain new extrema relative to all smaller starting integers. The resulting record theory shows that λ\lambda-delay records form a subsequence of the odd-count delay records, which form a subsequence of the common division-count and height-delay list. On the class side, the nonpositive charge-class records lie among the odd-count class records, which lie among the division-count class records, which in turn lie among the height-class records. The corresponding hierarchies also hold for first-arrival paths to a common endpoint zz when z=1z=1 or when z>2z>2 is nonperiodic under the shortcut map.

Provenance statement

During the rather lengthy development and preparation of this work, the authors used OpenAI's ChatGPT to assist in exploring candidate arguments, generating code and examples for testing observations, as well as assisting in organization and maintaining consistency and notation across the many areas of study found herein. ChatGPT was also used to resolve occasional LaTeX formatting issues. The authors independently checked the validity of all conversations, arguments, computations, and code used to help develop the material presented in this paper, and take full responsibility for its content.

Tools used

OpenAI
ChatGPT

References

  1. M. Elia and A. Tucker, ``Consecutive Integers and the Collatz Conjecture,'' INTEGERS 15 (2015), Article A54; arXiv:1511.09141.arXiv
  2. C. J. Everett, ``Iteration of the number-theoretic function f(2n)=nf(2n)=n, f(2n+1)=3n+2f(2n+1)=3n+2,'' Advances in Mathematics 25 (1977), 42--45.
  3. K. Frinkle, S. Rowland, J. Pack, M. Gordon, J. Eskue, S. Egbe, and M. Morris, ``Computing streaks of consecutive numbers with the same Collatz height,'' The Journal of Supercomputing 81 (2025), Article 1338, doi:10.1007/s11227-025-07820-8.DOI
  4. G.-G. Gao, ``On consecutive numbers of the same height in the Collatz problem,'' Discrete Mathematics 112 (1993), 261--267, doi:10.1016/0012-365X(93)90240-T.DOI
  5. L. E. Garner, ``On heights in the Collatz 3n+13n+1 problem,'' Discrete Mathematics 55 (1985), 57--64, doi:10.1016/S0012-365X(85)80020-0.DOI
  6. M. D. LaDue, ``Clusters of Integers with Equal Total Stopping Times in the 3x+13x+1 Problem,'' The Fibonacci Quarterly 56 (2018), 156--162; arXiv:1709.02979.arXiv
  7. J. C. Lagarias, ``The 3x+13x+1 problem and its generalizations,'' The American Mathematical Monthly 92 (1985), 3--23.
  8. J. C. Lagarias, The 3x+13x+1 Problem: An Annotated Bibliography (1963--1999) , arXiv:math/0309224, January 2011 version; see entry 68.arXiv
  9. J. C. Lagarias, ``The 3x+13x+1 Problem: An Overview,'' arXiv:2111.02635 (2021).arXiv
  10. Y. Luo, ``Iteration Steps of 3x+13x+1 Problem,'' arXiv:2506.23070v3 (16 July 2026).arXiv
Show all 20 referencesShow fewer references
  1. OEIS Foundation Inc. (2026). The On-Line Encyclopedia of Integer Sequences . Sequence A127789. https://oeis.org/A127789.link
  2. OEIS Foundation Inc. (2026). The On-Line Encyclopedia of Integer Sequences . Sequence A277109. https://oeis.org/A277109.link
  3. OEIS Foundation Inc. (2026). The On-Line Encyclopedia of Integer Sequences . Sequence A346775. https://oeis.org/A346775.link
  4. E. Roosendaal, ``On the 3x+13x+1 Problem,'' web resource, https://www.ericr.nl/wondrous/, accessed 24 August 2026.link
  5. O. Rozier and C. Terracol, ``Paradoxical behavior in Collatz sequences,'' Discrete Mathematics 349 (2026), 115167, doi:10.1016/j.disc.2026.115167; arXiv:2502.00948v5.arXivDOI
  6. R. Ruggiero, ``The relationship between stopping time and number of odd terms in Collatz sequences,'' arXiv:1911.01229 (2019).arXiv
  7. G. Scollo, ``Looking for Class Records in the 3x+13x+1 Problem by means of the COMETA Grid Infrastructure,'' in R. Barbera (ed.), Proceedings of GRID Open Days at the University of Palermo , Consorzio COMETA (2008), 255--263. https://www.dmi.unict.it/~scollo/seminars/gridpa2007/CR3x%2B1paper.pdf.link
  8. G. Scollo, ``Results and programming techniques from the CR3x+1 project,'' in R. Barbera, M. Iacono Manno, and M. Fargetta (eds.), Proceedings of the Final Workshop of Grid Projects Funded by PON Ricerca 2000--2006 Avviso 1575 , Consorzio COMETA (2010), 102--110. https://www.dmi.unict.it/~scollo/seminars/gridct2009/CR3x%2B1CTpreprint.pdf.link
  9. T. Tao, ``Almost all orbits of the Collatz map attain almost bounded values,'' Forum of Mathematics, Pi 10 (2022), e12.
  10. R. Terras, ``A stopping time problem on the positive integers,'' Acta Arithmetica 30 (1976), 241--252.

Version history

  1. v1Submitted by Behzad NikzadInitial depositCurrentNov 02, 2026