factsmate.
◆ Science · Mathematics

A math problem so simple a child gets it — and no one can solve it

40 sec read

Pick any number, follow two rules, and you always seem to crash to 1. Nobody knows why.

Verified · Forum of Mathematics, Pi (Cambridge University Press)

Take any positive whole number. If it’s even, halve it; if it’s odd, triple it and add 1. Repeat. Try 27 and the sequence soars past 9,000 before plummeting — but, like every number ever tested, it eventually crashes down to 1.

The Collatz conjecture, posed by Lothar Collatz in 1937, claims this always happens, for every starting number. Despite its grade-school simplicity, it has resisted proof for nearly 90 years. Computers have verified it for every number up to roughly 2⁶⁸ — about 295 quintillion — without a single exception.

Yet checking cases isn’t proof. In 2019 Terence Tao proved that almost all numbers obey the rule, hailed as the biggest progress in decades — but the full conjecture stands open.

Mathematics may not be ready for such problems. — Paul Erdős

1937
conjecture posed
2⁶⁸
verified, no exception
0
complete proofs so far

Sources & references

2 references

Well-established. Corroborated by 2 independent sources.

1 Forum of Mathematics, Pi (Cambridge University Press) Peer-reviewed journal “Col(N) equal to 3N+1 when N is odd and N/2 when N is even; one has Col_min(N) ≤ f(N) for almost all N (in the sense of logarithmic density).” cambridge.org ↗
2 HowStuffWorks Science media “Introduced in 1937 by German mathematician Lothar Collatz; Paul Erdős is quoted as saying, Mathematics may not be ready for such problems.” science.howstuffworks.com ↗
✓ Last reviewed Jun 6, 2026

More like this