Can two simple arithmetic rules really tame every positive integer into one?
In short: The Collatz conjecture is deceptively simple: take any positive integer, halve it if even, or triple it plus one if odd. Repeat this process, and you will always eventually reach the number one. Despite its elementary appearance, this problem remains one of mathematics' most notoriously difficult, unsolved mysteries.
Introduced by Lothar Collatz in 1937, the conjecture describes a process that generates sequences often called hailstone numbers. These sequences fluctuate wildly, ascending and descending like hailstones caught in a cloud, before—theoretically—collapsing to one. While the rule is easy to state, proving it holds for all positive integers has eluded mathematicians for decades. As Paul Erdős famously remarked, mathematics may simply not be ready for such problems, and Jeffrey Lagarias noted in 2010 that the conjecture remains completely out of reach of modern techniques.
If the conjecture were false, there would exist a starting number that either enters a repeating cycle excluding one or increases toward infinity. No such counterexample has ever been found. Computational efforts have verified the conjecture for all positive integers up to 2.36×10^21, yet this empirical evidence does not constitute a formal proof. The behavior of these sequences is highly unpredictable; for instance, the number 27 takes 111 steps to reach one, climbing as high as 9,232 during its trajectory. Such erratic behavior makes the underlying structure difficult to capture with current mathematical tools.
Researchers often use a shortcut form of the function, dividing by two immediately after the 3n+1 step, which accelerates the descent without altering the overall dynamics. The total stopping time—the number of steps required to reach one—varies significantly between numbers. For example, the starting value with the largest total stopping time below 100 is 97, which requires 118 steps. As the starting values increase, the maximum total stopping time grows, though not in a simple linear fashion. Powers of two represent the most efficient sequences, as they are halved repeatedly until reaching one, never triggering the 3n+1 increase. While the conjecture remains unproven, the pursuit of a solution has driven the development of new mathematical techniques and yielded numerous partial results, proving that even an unsolved problem can be a powerful engine for discovery.
Opens the Intellect+ feed with this card first. Swipe up for the next one.
Sources
- Summary by Intellect · source: Collatz conjecture
To cite this card, link to https://intellectplus.co.uk/app/science-collatz-conjecture.
How we source, check and correct cards: Editorial standards.
General information, not professional advice. Spotted an error? Flag the card or see corrections and complaints.
Intellect Plus is a visual educational discovery platform for exploring fascinating facts and ideas. Brain Food, Not Brain Rot. What is Intellect Plus?
Related
More in Number theory · More in Science · Latest · A–Z · All topics