The Collatz Conjecture: The Simplest Unsolved Problem in Mathematics

The Rules

Take any positive integer. If it is even, divide by 2. If it is odd, multiply by 3 and add 1. Repeat. The conjecture, proposed by Lothar Collatz in 1937, states that no matter what number you start with, you will eventually reach 1. Try 6: 6 → 3 → 10 → 5 → 16 → 8 → 4 → 2 → 1. Try 27: the sequence reaches 9,232 before eventually collapsing to 1 after 111 steps. Every number tested — and computers have checked up to 2⁶⁸ — eventually reaches 1.

Why It Is So Hard

The problem is easy to state, trivial to test, and apparently always true — yet completely resistant to proof. The sequences behave chaotically: there is no discernible pattern to predict how high a sequence will climb before descending. Standard mathematical tools for proving convergence do not apply. Mathematician Paul Erdős said: "Mathematics is not yet ready for such problems." This reflects the broader theme of Math & Algorithms: systems so simple they should be trivial, yet so complex they defeat the most powerful minds in history.

Could It Be Undecidable?

Some mathematicians suspect the Collatz Conjecture may be unprovable in standard axiomatic systems — a true but formally undecidable statement, of the kind Gödel's theorems guarantee must exist. If so, searching for a proof is not just difficult but formally impossible — and we would have no way of knowing.

What It Suggests

The Collatz Conjecture suggests that the boundary between the provable and the unprovable may run through extremely simple mathematical objects — not exotic, high-level structures but elementary operations on integers. The simplest questions may be the most permanently mysterious.