Overview
Take any whole number: halve it if even, or triple it and add 1 if odd. Repeat. Every number ever tested reaches 1, but no one has proved it always will.
Enter a starting number to see its path.
Worked examples
| Inputs | Result |
|---|---|
| Starting number27 | Steps to reach 1: 111Highest value: 9,232Sequence: 27 → 82 → 41 → 124 → 62 → 31 → 94 → 47 → 142 → 71 → 214 → 107 → 322 → 161 → 484 → … |
Show 2 more examples
| Starting number7 | Steps to reach 1: 16Highest value: 52Sequence: 7 → 22 → 11 → 34 → 17 → 52 → 26 → 13 → 40 → 20 → 10 → 5 → 16 → 8 → 4 → … |
| Starting number97 | Steps to reach 1: 118Highest value: 9,232Sequence: 97 → 292 → 146 → 73 → 220 → 110 → 55 → 166 → 83 → 250 → 125 → 376 → 188 → 94 → 47 → … |
Steps to reach 1 by starting number
With the calculator's starting values, the steps to reach 1 is 111. The table shows how it changes with the starting number.
| Starting number | Steps to reach 1 |
|---|---|
| 15 | 17 |
| 20 | 7 |
| 25 | 23 |
| 27starting value | 111 |
| 30 | 18 |
| 35 | 13 |
| 40 | 8 |
How it works
The Collatz conjecture is a famous unsolved problem. The number of steps varies wildly from one starting value to the next.
The formula
| n | The current value |
Practical tips
- 27 takes 111 steps and climbs to 9,232 before falling to 1.
- Powers of 2 fall straight down.
- It has been verified by computer for extremely large numbers.
Frequently asked questions
Is it proven?
No, it remains an open problem.
Why is it hard?
The sequence behaves chaotically, resisting standard tools.