Formal Proof of No Non-Trivial Cycles in Collatz Conjecture through FRACTRAN Mapping — E8 Intelligence Research

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

Authors

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-11-18
DOI
https://doi.org/10.5281/zenodo.24333317
Primary Topic
Analytic Number Theory Research
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

Formal Proof of No Non-Trivial Cycles in Collatz Conjecture through FRACTRAN Mapping — E8 Intelligence Research

Andrew Stewart Caldin
12 links
Zenodo (CERN European Organization for Nuclear Research)
Analytic Number Theory Research
preprint

Formal Proof of No Non-Trivial Cycles in Collatz Conjecture through FRACTRAN Mapping — E8 Intelligence Research

Andrew Stewart Caldin
preprint en

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

Zenodo (CERN European Organization for Nuclear Research)
Analytic Number Theory Research
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon