Collatz Conjecture: No Proof Found, Only Tao's Almost-All Orbits Result — E8 Intelligence Research

FINDING: No proof or partial proof of the Collatz conjecture is presented in these sources; only popular expositions, failed attempts, and Terence Tao's result on almost all orbits attaining almost bounded values. | MATH: Collatz function: \( f(n) = n/2 \) if \( n \) even, \( f(n) = 3n+1 \) if \( n \) odd. Tao's result (2019): For almost all \( n \), the minimal value of the orbit is bounded by any function that grows slower than any iterated logarithm. No exact constants, ratios, or equations beyond the definition. | CONNECTION: None. No geometric ratios (0.382, 0.618, 0.786, 1.618, 2.618), base-60, or crystallographic symmetries appear. The problem is purely number-theoretic and iterative, with no known link to harmonic or lattice structures. | DEPTH: 2 — Tao's result is a significant probabilistic advance but does not constitute a partial proof of the conjecture itself. The sources are mostly expository or failed attempts, yielding no new mathematical essence or universal structural 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-08-20
DOI
https://doi.org/10.5281/zenodo.22022241
Primary Topic
Benford’s Law and Fraud Detection
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
preprint

Collatz Conjecture: No Proof Found, Only Tao's Almost-All Orbits Result — E8 Intelligence Research

Andrew Stewart Caldin
Zenodo (CERN European Organization for Nuclear Research)
Benford’s Law and Fraud Detection
preprint

Collatz Conjecture: No Proof Found, Only Tao's Almost-All Orbits Result — E8 Intelligence Research

Andrew Stewart Caldin
preprint en

Abstract

FINDING: No proof or partial proof of the Collatz conjecture is presented in these sources; only popular expositions, failed attempts, and Terence Tao's result on almost all orbits attaining almost bounded values. | MATH: Collatz function: \( f(n) = n/2 \) if \( n \) even, \( f(n) = 3n+1 \) if \( n \) odd. Tao's result (2019): For almost all \( n \), the minimal value of the orbit is bounded by any function that grows slower than any iterated logarithm. No exact constants, ratios, or equations beyond the definition. | CONNECTION: None. No geometric ratios (0.382, 0.618, 0.786, 1.618, 2.618), base-60, or crystallographic symmetries appear. The problem is purely number-theoretic and iterative, with no known link to harmonic or lattice structures. | DEPTH: 2 — Tao's result is a significant probabilistic advance but does not constitute a partial proof of the conjecture itself. The sources are mostly expository or failed attempts, yielding no new mathematical essence or universal structural Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com

Zenodo (CERN European Organization for Nuclear Research)
Benford’s Law and Fraud Detection
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.