Collatz Sequence Calculator
Starting Number (positive integer ≤ 1,000,000)
The Collatz conjecture states that for any positive integer, repeatedly applying the rule: if even divide by 2, if odd multiply by 3 and add 1 — will always eventually reach 1. It remains one of mathematics' most famous unsolved problems.
- 1If n is even: next = n / 2
- 2If n is odd: next = 3n + 1
- 3Continue until reaching 1
- 4The number of steps is called the "stopping time"
n = 6=6 → 3 → 10 → 5 → 16 → 8 → 4 → 2 → 1 (8 steps)
n = 27=111 steps, reaches maximum of 9,232
| Starting n | Steps to 1 | Maximum reached |
|---|---|---|
| 6 | 8 | 16 |
| 11 | 14 | 52 |
| 27 | 111 | 9232 |
| 100 | 25 | 200 |
| 1000 | 111 | 13120 |
References
🔒
100% Gratis
Ingen registrering
✓
Korrekt
Verifierade formler
⚡
Omedelbar
Resultat direkt
📱
Mobilanpassad
Alla enheter