The Collatz Conjecture: The Simplest Unsolved Problem in Mathematics

Pick any positive integer. If it's even, divide it by 2. If it's odd, multiply it by 3 and add 1. Take your result and repeat. Keep going until you can't go further.

Where do you always end up?

One.

Or at least — so the conjecture goes. Mathematicians have been trying to prove this for nearly ninety years, and the problem remains one of the most notorious unsolved puzzles in all of mathematics. It requires no calculus, no abstract algebra, no advanced training. A curious ten-year-old can understand it in five minutes. Yet the greatest mathematical minds of the twentieth and twenty-first centuries have struggled to prove something that seems almost obvious.

Welcome to the Collatz Conjecture.

The Concept

The rule is disarmingly simple. Given any positive integer n:

If n is even, compute n / 2. If n is odd, compute 3n + 1.

Apply the rule to the result, then again, and keep going. The Collatz Conjecture states that no matter what positive integer you start with, you will eventually reach 1.

Let's try it with 6:

6 → 3 → 10 → 5 → 16 → 8 → 4 → 2 → 1

Eight steps. 6 is even, so divide by 2 to get 3. Now 3 is odd, so multiply by 3 and add 1 to get 10. Then 10 is even: divide to get 5. And 5 is odd: 3×5+1 = 16. From here it's a smooth ride down: 16 → 8 → 4 → 2 → 1.

Let's try 10:

10 → 5 → 16 → 8 → 4 → 2 → 1

Six steps. Now try 27 — we'll come back to that one, because its journey is far stranger.

Once you hit 1, you enter a loop: 1 → 4 → 2 → 1 → 4 → 2 → ... forever. So the convention is to stop when you first reach 1.

The sequences these rules generate are called hailstone sequences — and the name is perfect. Like hailstones tumbling through a storm cloud, the numbers shoot upward, plunge downward, rise again, and eventually fall to earth. The trajectory is chaotic and unpredictable, but the claim is that it always comes back to ground level.

The conjecture was formulated by German mathematician Lothar Collatz in 1937, while he was working at the Technical University of Karlsruhe. Collatz was studying what happens when you apply a function to a number over and over again — the mathematics of repeated iteration. He didn't publish it formally, but circulated it among colleagues. It gained wider attention at the 1950 International Congress of Mathematicians in Cambridge, where word began to spread through the mathematical community. British mathematician Bryan Thwaites independently arrived at the same problem in 1952, which is why it goes by a small library of names: the "3n + 1 problem," the Syracuse problem, the Thwaites conjecture, the Ulam conjecture, Kakutani's problem. Each name marks a mathematician who stumbled on this same beguiling rule and couldn't let it go.

Why It Matters

At first glance, this might seem like a puzzle with no applications — a mathematical novelty, a playful riddle. But the Collatz Conjecture matters for reasons that go far deeper than the problem itself.

It reveals the limits of our mathematical tools. When even the best mathematicians in the world cannot prove something a child can understand, it suggests we are missing something fundamental — that there may be entire classes of mathematical behavior that current frameworks simply cannot reach.

It touches the foundations of computability. The Collatz Conjecture is adjacent to deep questions about what computers can and cannot decide. Some mathematicians suspect the conjecture might be undecidable — not provably true or false within the standard axioms of mathematics. This would place it alongside Gödel's Incompleteness Theorems, which showed that any sufficiently powerful mathematical system contains true statements that can never be proven within that system. We may be asking a question the universe of mathematics cannot answer from the inside.

It exposes a strange tension between simplicity and complexity. The rule has two lines. The conjecture has one sentence. And yet it has resisted every proof technique mathematicians have thrown at it for nearly a century. This tension — between the trivial statement of a problem and the impossible difficulty of resolving it — is one of the most philosophically unsettling phenomena in all of mathematics.

The most famous quote about the Collatz Conjecture came from the legendary Hungarian mathematician Paul Erdős: "Mathematics may not be ready for such problems." Erdős was known for his casual brilliance and his habit of offering small prizes to anyone who solved his favorite problems. His assessment of the Collatz Conjecture was not that it was merely difficult — it was that it might require mathematical ideas that don't yet exist.

The Details

The Wild Journey of 27

The number 27 is the most famous starting point in Collatz history. It's a small number — you can count to it in under a minute. But its hailstone sequence is extraordinary.

Starting from 27, the sequence takes 111 steps to reach 1. Along the way, it climbs to a peak value of 9,232 — more than 341 times its starting value. It rises and falls dozens of times, never settling into any rhythm, reaching 9,232 on its 77th step before finally making its long descent to 1.

For comparison, 26 reaches 1 in just 10 steps. 28 reaches 1 in 18 steps. The number 27, nestled quietly between them, embarks on a mathematical marathon that dwarfs its neighbors.

This unpredictability is the heart of the problem. You cannot look at a number and predict whether it will reach 1 quickly or embark on a tortuous journey. There's no formula, no shortcut, no pattern that reveals the length of a sequence from its starting value. You have to run it and see.

How Far Have We Checked?

Computers have verified the Collatz Conjecture for all positive integers up to approximately 2.36 × 10²¹ — about 2.36 sextillion. Every single starting number in that enormous range eventually reaches 1.

But in mathematics, checking finite cases is not a proof. There are infinitely many positive integers, and a counterexample — a number whose sequence cycles forever or shoots to infinity without ever hitting 1 — could lurk anywhere in the endless expanse beyond what computers have reached.

The history of mathematics contains cautionary tales here. Some conjectures held for millions or billions of cases before a counterexample finally emerged. So computational verification, while encouraging, is not a substitute for mathematical proof.

Terence Tao's Breakthrough

In 2019, Terence Tao — a Fields Medalist and one of the greatest mathematicians alive — made the most significant progress on the Collatz Conjecture in decades. His paper, "Almost All Collatz Orbits Attain Almost Bounded Values," proved something precise and remarkable using techniques from probability theory and harmonic analysis.

Tao showed that for almost all starting numbers (in a rigorous, probabilistic sense), the Collatz sequence will eventually descend to a value that is arbitrarily small relative to the starting number. Informally: almost every hailstone does fall back close to the ground.

Quanta Magazine described it as "one of the most significant results on the Collatz conjecture in decades." But Tao himself was careful: it was not a proof of the full conjecture. A measure-zero set of exceptional numbers could still, in theory, escape. The gap between "almost all" and "all" is precisely where the conjecture lives — and it is a very large gap.

Why Is It So Hard to Prove?

The difficulty has a specific mathematical source. The Collatz rules mix two fundamentally different kinds of arithmetic in a way that defies standard analysis.

Dividing by 2 is a multiplicative operation — it shrinks numbers geometrically, cutting them in half each time. Multiplying by 3 and adding 1 grows numbers, but unevenly: the "+1" constantly shifts the parity of results in ways that are hard to predict. When you apply the rule over and over, you never know in advance how many consecutive even numbers you'll encounter (and thus how many halvings you'll get) before hitting an odd number again.

Mathematicians have tried modeling the sequences as random walks: imagine a particle moving along the number line, stepping up or down at each move with some probability. By this model, the sequences should always reach 1 — the expected drift is slightly downward. But proving that something "should" happen probabilistically is very different from proving it happens for every single integer without exception.

The problem also connects to dynamical systems — the mathematical study of how systems evolve under repeated rules. The Collatz map is a dynamical system on the positive integers, and asking whether all orbits eventually reach 1 is like asking whether the system has a single attractor. The tools needed to answer this rigorously for the integers don't exist yet.

Visualizations of Collatz sequences reveal fractal-like patterns: the graph of how many steps each number takes to reach 1 has a jagged, self-similar structure that never resolves into regularity. This is a signature of chaotic dynamics — and chaos, almost by definition, resists the kind of orderly analysis that proofs require.

A Dangerous Problem

Jeffrey Lagarias, one of the leading researchers on the Collatz Conjecture, has warned colleagues that it is "an extraordinarily difficult problem, completely out of reach of present day mathematics." It has been called a "dangerous" problem — not because it causes harm, but because it is the kind of puzzle that can consume a mathematician's career without yielding. Brilliant minds have poured years into it. The conjecture doesn't budge.

And yet people keep trying, because the problem seems so close. Every new starting number you test confirms it. The rule is right there, two lines long. It must have an answer. Surely someone just needs to find the right angle.

That feeling — the sense that the solution is just out of reach — may be the conjecture's most dangerous property of all.

Takeaways

The rule is two lines: if a number is even, divide by 2; if odd, multiply by 3 and add 1. Repeat. The conjecture says you always reach 1, no matter where you start — but no one has proved it.
The number 27 shows how strange it gets: this small starting point takes 111 steps and climbs as high as 9,232 before finally descending, while its neighbors 26 and 28 reach 1 in 10 and 18 steps respectively.
Computers have verified it for roughly 2.36 sextillion cases, but mathematical proof requires it to hold for all positive integers — an infinite set — which computation alone can never establish.
Terence Tao's 2019 breakthrough proved that almost all Collatz sequences eventually reach small values, using probability theory and harmonic analysis — the most significant progress in decades, but still not a complete proof.
The conjecture may be unprovable within our current mathematical axioms, placing it alongside Gödel's limits of logic — a humbling reminder that simplicity of statement does not imply accessibility of proof.

Resources: - Quanta Magazine: The Simple Math Problem We Still Can't Solve - Quanta Magazine: Mathematician Proves Huge Result on 'Dangerous' Problem - Terence Tao's 2019 paper on arXiv