Structural Reduction of the Collatz Conjecture with Reproducible Computational Verification
Abstract
This upload contains a structural reduction of the Collatz conjecture together with a reproduciblecomputational verification. The attached notebook executes a finite verification that does not detectnon-trivial odd cycles up to the explicitly tested bound. Code, execution environment, and outputare provided as evidence.
Fields of Study & Subjects
Analytic Number Theory Research
Advanced Mathematical Theories
Mathematical Dynamics and Fractals
Publication details
- Journal / source
- Zenodo (CERN European Organization for Nuclear Research)
- Publication date
- 3 February 2026