A Rigorous Framework for the Collatz Conjecture

10 February 2026, Version 1
This content is an early or alternative research output and has not been peer-reviewed by Cambridge University Press at the time of posting.

Abstract

We analyze Collatz by restricting to $A = \{N \text{ odd}: v_2(3N+1) \le 6\}$, containing $63/64$ of odd integers. We prove equivalence to full conjecture, characterize $A$ via congruences, establish growth constraints, develop Markov models, and synthesize with Tao's result and 2-adic theory.

Keywords

Collatz
Number theory
Dynamic systems

Comments

Comments are not moderated before they are posted, but they can be removed by the site moderators if they are found to be in contravention of our Commenting and Discussion Policy [opens in a new tab] - please read this policy before you post. Comments should be used for scholarly discussion of the content in question. You can find more information about how to use the commenting feature here [opens in a new tab] .
This site is protected by reCAPTCHA and the Google Privacy Policy [opens in a new tab] and Terms of Service [opens in a new tab] apply.