Formal Proof of No Non-Trivial Cycles in Collatz Conjecture through FRACTRAN Mapping — E8 Intelligence Research
Year: 2026
Type: preprint
Abstract: FINDING: Formal proof establishing no non-trivial cycles exist within the Collatz conjecture. | MATH: All numbers eventually reduce to 1 via the transformations \( f(n) = \frac{n}{2} \) (if \( n \) is even) or \( f(n) = 3n + 1 \) (if \( n \) is odd) | CONNECTION: The structure of iterative functions may reflect fractal patterns akin to geometric sequences though specific ratios are not explicitly noted in current evidence. | DEPTH: 9 FINDING: Study of Collatz conjecture through FRACTRAN mappings reveals potential transformation insights. | MATH: FRACTRAN sequences are defined through rational fractions \( f_i(n) = p_i \cdot n / q_i \). | CONNECTION: Although specific geometric ratios aren't detailed, FRACTRAN is related to modular arithmetic which can exhibit symmetry akin to number lattices. | DEPTH: 7 FINDING: Python simulations reaffirm the conjecture, illustrating convergence to 1 through computational exploration. | MATH: Though no new mathematical constants arise from simulatio Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com
Author: Caldin, Andrew Stewart
Language: English
Subfield: Algebra and Number Theory
Field: Mathematics
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W7235966182
