There is a newer version of the record available.

Published December 26, 2025 | Version v21
Preprint Open

A Structural Solution to the Collatz Conjecture across All Integers: Perspectives on Integer Dynamics via Alternating Binary Notation and Collatz Phase Expression

Description

We study Collatz-type dynamics in a unified manner across the positive and

negative integer domains, using a deterministic structural encoding of integers

rather than treating them as atomic points or relying only on congruence classes.

 

We introduce Alternating Binary Notation (ABN), a signed binary

representation with an alternation constraint, and its maximal block

decomposition, the Collatz Phase Expression (CPE), written as a sequence

of two types of blocks (Chains and Nodes). From CPE we extract a small set of

structural features, including the number of chains and the total lengths of

chain- and node-blocks.

 

The core observation is that one odd step of the accelerated Collatz map can be

interpreted as a finite set of local rewriting rules on CPE. These local rules

yield explicit inequalities controlling the structural features along

iteration. In particular, a global ``growth budget'' is at most linear, while a

certain ``resistive'' feature cannot remain nondecreasing indefinitely unless

the orbit is already in a terminal regime. This provides a reduction scheme in

which the positive-domain dynamics enter the classical $\{1,2,4\}$ cycle, and

the negative-domain dynamics (via the associated odd-to-odd $3n-1$ map) enter

one of finitely many periodic systems.

Notes (English)

Logical inconsistencies in Chapter 3 have been resolved, providing a more lucid proof for the Collatz conjecture across both positive and negative domains.

Files

[Eng]Main Collatz v21.pdf

Files (321.9 kB)

Name Size Download all
md5:9f05fcfc61d416aa0f304fdab9615975
321.9 kB Preview Download

Additional details

Related works

Is identical to
Preprint: 10.17605/OSF.IO/TXZYA (DOI)

References

  • L. Collatz, "On the motivation and origin of the (3n+1)-conjecture," J. Graph Theory, 10 (1986), 585-585.
  • J. C. Lagarias, "The 3x+1 problem and its generalizations," Amer. Math. Monthly, 92 (1985), 3-23.
  • R. K. Guy, Unsolved problems in number theory, Springer Science & Business Media, 2004.
  • M. Chamberland, "A guide to the Collatz conjecture," Math. Intelligencer, 28 (2006), 26-32.
  • D. Barina, "The 3x+1 Problem: A Computational Verification up to 268," arXiv preprint arXiv:2009.08353, 2020.
  • P. Simons and B. M. M. de Weger, "The $3x+1$ problem: computational verification of the cycles up to $10^{18}$," Acta Arithmetica, 117 (2005),
  • J. C. Lagarias, "The $3x+1$ problem: An annotated bibliography, II (1999–2010)," arXiv preprint arXiv:1001.3735, 201
  • A. Altassan and M. Alan, "Mersenne Numbers in Generalized Lucas Sequences," C. R. Acad. Bulg. Sci., 77 (2024), 3-10.
  • Y. Soykan, "A Study on Generalized Mersenne Numbers," J. Progr. Res. Math., 18 (2021), 90-108.
  • R. Chergui, "Ge ̀ne ̀ralisation du The ́ore ̀me de Zeckendorf," arXiv:2403.17292 [math.NT], 2024.