Collatz Conjecture Unproven; Unverified Cayley Graph Approach Emerges — E8 Intelligence Research
FINDING: No proof of Collatz conjecture found; one preprint claims automorphic Cayley graph approach but remains unverified. | MATH: Collatz map: f(n) = n/2 if n even, 3n+1 if n odd. Conjecture: ∀ n ∈ ℕ, iterates reach cycle 4→2→1→4. | CONNECTION: None identified. The automorphic Cayley graph approach may hint at lattice symmetries, but no explicit geometric ratios (0.382, 0.618, 0.786, 1.618, 2.618) or base-60 connections appear in the provided abstracts. | DEPTH: 2 — No substantive mathematical advance; the field remains open. The only potential depth is the structural link to automorphic graphs, but it is not validated. Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com
Authors
- Andrew Stewart Caldin
Publication Details
- Journal
- Zenodo (CERN European Organization for Nuclear Research)
- Published
- 2026-08-20
- DOI
- https://doi.org/10.5281/zenodo.22022612
- Primary Topic
- Benford’s Law and Fraud Detection
- Type
- preprint