Collatz conjecture

The Collatz conjecture is one of the most famous unsolved problems in mathematics. It asks a simple question about how numbers behave when you apply specific arithmetic rules. The conjecture suggests that if you start with any positive integer, a specific sequence of operations will always eventually reach the number 1.

This sequence is often called a hailstone sequence. This name comes from the way the values rise and fall like hailstones in a storm cloud. Despite its simple rules, the problem remains a deep mystery that modern mathematics cannot yet solve.

To understand the mechanism, you must follow a specific set of instructions. Start with any positive integer. If the number is even, the next term in your sequence is found by dividing it by two. If the number is odd, the next term is found by multiplying the number by three and then adding one.

You then take that result and apply the same rules again. This process repeats, creating a chain of numbers. You can also use a shortcut version of this function. In the shortcut, you multiply an odd number by three and add one, then immediately divide by two. This works because multiplying an odd number by three and adding one always results in an even number.

Mathematicians track how long these sequences last using two different terms. The stopping time is the smallest number of steps required for a value to fall below its starting value. The total stopping time is the number of steps required to reach exactly 1.

If the conjecture is false, a sequence would either increase without bound or enter a repeating cycle that never includes the number 1. A cycle is a set of distinct numbers that repeat the same pattern indefinitely. So far, the only known cycle is the trivial cycle involving the numbers 4, 2, and 1.

History shows that this puzzle emerged in 1937. A mathematician named Lothar Collatz introduced the idea just two years after receiving his doctorate.

Since then, the problem has challenged many great minds. The famous mathematician Paul Erdős once remarked that mathematics might not be ready for such problems. In 2010, Jeffrey Lagarias described it as an extraordinarily difficult problem that is completely out of reach for present-day mathematics. Even though it remains unsolved, the effort to crack it has created many new mathematical techniques.

We can use computers to look for evidence that the conjecture is true. Scientists have tested all starting values up to approximately 2 to the 71st power.

Every single one of these massive numbers eventually reaches 1. However, computer testing is not a formal proof. A proof must cover every possible number, including those that are too large for any computer to reach. A number could still exist that grows forever or enters a different loop. For example, the number 27 is a notable case. It takes 111 steps to reach 1 and climbs as high as 9232 during its journey.

Researchers have made significant progress in understanding the behavior of these sequences. In 2019, Terence Tao published a major result using logarithmic density. He showed that almost all Collatz orbits descend below any given function of the starting point, provided that function grows to infinity. This means that for almost all numbers, the sequence will eventually drop below its starting value.

Other researchers have studied the potential for cycles. For instance, mathematicians have proven that there are no "1-cycles" or "2-cycles" other than the trivial one. They have even ruled out many more complex types of cycles through exhaustive searches.

This problem connects to many different areas of mathematical study. One way to view it is through the Collatz graph. This is a graph built by looking at the process in reverse. Instead of starting at a number and going to 1, you start at 1 and work backward to see which numbers lead there.

This inverse relation is conjectured to form a tree structure for all positive integers. The problem can also be studied using binary code. In base two, the operations of the Collatz function can be viewed as a machine handling strings of bits. This shows how a simple arithmetic rule can connect to complex patterns in computer science and number theory.