Collatz Conjecture — The Simplest Unsolved Problem in Math

1 2 3 4 5 6 7

difficulty levels — click green to claim

> COLLATZ CONJECTURE

collatz difficulty: 1–5 also known as: 3n+1 problem, Syracuse problem, Kakutani's problem

The idea in plain English: Pick any positive whole number. If it's even, cut it in half. If it's odd, multiply it by 3 and add 1. Then do the same thing to the result. Keep going. The conjecture says: you will always end up at 1, no matter what number you start with. Once you reach 1, a short loop kicks in: 1 → 4 → 2 → 1. From there you never leave.

Why this really exists: The Collatz Conjecture was posed by German mathematician Lothar Collatz in 1937. It looks like a simple arithmetic game — something a 10-year-old could understand — yet after over 85 years of effort by the world's best mathematicians, nobody has been able to prove it's true for all numbers. The famous mathematician Paul Erdős said about Collatz: "Mathematics is not yet ready for such problems." It's a gateway into the deep waters of dynamical systems, chaos theory, and the limits of what we can prove.

▸ Concrete Example: Starting with n = 5

Let's walk through the sequence step by step:

5 → odd → 3(5) + 1 = 16
16 → even → 16 / 2 = 8
8 → even → 8 / 2 = 4
4 → even → 4 / 2 = 2
2 → even → 2 / 2 = 1 🎯

Total steps to reach 1: 5

The sequence is: 5 → 16 → 8 → 4 → 2 → 1. The puzzle counts the number of steps taken to reach 1 for the first time. In this case, the answer is 5.

▸ The Wild Example: Starting with n = 27

A small number like 27 produces a surprisingly long and chaotic sequence. Watch what happens:

27, 82, 41, 124, 62, 31, 94, 47, 142, 71, 214, 107, 322, 161, 484, 242, 121, 364, 182, 91,
274, 137, 412, 206, 103, 310, 155, 466, 233, 700, 350, 175, 526, 263, 790, 395, 1186, 593,
1780, 890, 445, 1336, 668, 334, 167, 502, 251, 754, 377, 1132, 566, 283, 850, 425, 1276,
638, 319, 958, 479, 1438, 719, 2158, 1079, 3238, 1619, 4858, 2429, 7288, 3644, 1822, 911,
2734, 1367, 4102, 2051, 6154, 3077, 9232, 4616, 2308, 1154, 577, 1732, 866, 433, 1300,
650, 325, 976, 488, 244, 122, 61, 184, 92, 46, 23, 70, 35, 106, 53, 160, 80, 40, 20,
10, 5, 16, 8, 4, 2, 1

Total steps: 111 (sequence peaks at 9,232 before descending)

What's remarkable is that even after soaring to 9,232 — over 340× the starting value — the sequence eventually collapses back down to 1. This rise-and-collapse behavior is what makes the conjecture so mysterious. Even numbers that grow huge always seem to come back down.

▸ How to Compute Collatz Steps (Step by Step)

1. Start with any positive integer n

2. If n is even, set n = n / 2

3. If n is odd, set n = 3n + 1

4. Count this as one step

5. Repeat until n reaches 1

6. The puzzle answer is the total number of steps taken

# Python solver:
def collatz_steps(n):
    steps = 0
    while n != 1:
        if n % 2 == 0:
            n = n // 2
        else:
            n = 3 * n + 1
        steps += 1
    return steps

💡 The sequence can grow very large before shrinking. Python's big integers handle this effortlessly, but be aware: some numbers take thousands of steps and produce values exceeding 10⁶⁰⁰.

▸ Difficulty & Puzzle Patterns

Difficulty	What to Expect	Example Start	Steps
1	Small start (≤10), finishes in <10 steps	n = 6	8
2	Moderate start, some zigzag	n = 19	20
3	Larger start, peaks above 1,000	n = 27	111
4	Significant sequence, peaks above 100,000	n = 97	118
5	Long sequence, extreme peaks, many steps	n = 871	178

▸ Real-World Connections

Dynamical systems: Collatz is a classic discrete dynamical system — a simple rule producing complex, unpredictable behavior
Chaos theory: Small changes in the starting number lead to wildly different sequences, a hallmark of chaotic systems
Computational number theory: Testing Collatz has driven advances in high-performance computing and algorithm optimization
Reverse mathematics: Collatz-type functions are a proving ground for understanding what makes mathematical statements provable or unprovable
Educational tool: Used worldwide to teach recursion, iteration, modular arithmetic, and the nature of open problems

← Back to all ciphers