Collatz Conjecture Dominates Search; No Unsolved Competition Problem Found — E8 Intelligence Research

FINDING: Search returned no unsolved competition problem; dominant result is the Collatz Conjecture (3n+1), an open problem, plus benchmark datasets (MATH: 12,500 problems) and live-solve streams. | MATH: Collatz map T(n) = n/2 if n even; 3n+1 if n odd. Conjecture: ∀n∈ℕ⁺, ∃k: Tᵏ(n)=1. Verified computationally to ~2⁶⁸. No proof of termination or non-trivial cycle existence. | CONNECTION: No geometric-harmony constants (0.382, 0.618, 0.786, 1.618, 2.618) appear in the sourced material. Collatz orbits exhibit empirical scaling ~log n but no established φ-ratio, base-60, or crystallographic/lattice structure in the evidence. | DEPTH: 2 Notes on the other findings (low mathematical content): - MATH dataset (arXiv 2103.03874): 12,500 competition problems, 7 subject areas; measures model capability, not a mathematical discovery. No constants. - "Live Solve" (Poshen Loh) and Olympiad videos: pedagogical, no novel theorem or constant. - "99% can't solve" / "Only 10% can solve": clickbait frami Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com