A huge, annoying math mystery just got boiled down to a simple 'yes' or 'no' answer.
March 30, 2026
Original Paper
A Structural Reduction of the Collatz Conjecture to One-Bit Orbit Mixing
arXiv · 2603.25753
The Takeaway
The Collatz Conjecture (the 3n+1 problem) is famous for being easy to explain but impossible to prove. This paper shows that the seemingly random behavior of the system actually hinges on just one binary choice at specific points, a massive leap toward finally solving a puzzle that has stumped mathematicians for 80 years.
From the abstract
We reduce the Collatz conjecture to a fixed-modulus, one-bit orbit-mixing problem. Working with the compressed odd-to-odd Collatz map, we prove exact low-depth decomposition formulas at depths K = 3, 4, 5, reducing block-discrepancy terms to explicit run statistics. We then prove a Map Balance Theorem: among the 2^(K-3), 1 burst residues modulo 2^K that initiate gaps, the counts mapping to gap starts congruent to 3 versus congruent to 7 (mod 8) differ by exactly 1 for every K >= 5. Thus all resi