Collatz Conjecture: The Simplest Unsolved Math Problem — E8 Intelligence Research

FINDING: The search results are predominantly clickbait YouTube titles and a dataset paper — no actual unsolved competition problem with mathematical content is presented. The only substantive mathematical object is the Collatz Conjecture, referenced as "the simplest math problem no one can solve." MATH: Collatz map: \( T(n) = \begin{cases} n/2 & \text{if } n \equiv 0 \pmod{2} \ 3n+1 & \text{if } n \equiv 1 \pmod{2} \end{cases} \). Conjecture: for all \( n \in \mathbb{N} \), iterating \( T \) eventually reaches 1. No closed-form, no known invariant, no proven bound on stopping time. The MATH dataset (arXiv:2103.03874) contains 12,500 competition problems — but no specific unsolved problem is extracted. CONNECTION: The Collatz map has no direct geometric-harmony ratio (0.382, 0.618, 0.786, 1.618, 2.618) nor base-60 structure. However, its dynamics relate to the multiplicative group of integers modulo powers of 2, and the parity vector encodes a binary tree structure — a lattice-like Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com