The Collatz conjecture: 27 takes 111 steps
Need a hint?
There is no shortcut known: run the rule. Start 27, 82, 41, 124, 62, 31, 94, …
27 reaches 1 after 111 steps and climbs as high as 9232 on the way. Whether every number reaches 1 is an open problem.
How to work it out
The path begins and climbs up to before falling.
Counting every application of the rule until the number is 1:
(1)The Collatz conjecture says that every starting number reaches 1. It has been checked for all numbers up to about , but nobody has a proof.
LaTeX source of the formulas on this page
\[ 111\text{ steps, peak }9232 \]
\[ 27\ \xrightarrow{\ 111\text{ steps}\ }\ 1,\qquad\max=9232 \]Questions
What is the answer to: The Collatz conjecture: 27 takes 111 steps?
27 reaches 1 after 111 steps and climbs as high as 9232 on the way. Whether every number reaches 1 is an open problem.
What is the key idea?
No formula is known; the problem is famous because the rule is so simple and the proof so hard.
Is there a hint?
There is no shortcut known: run the rule. Start 27, 82, 41, 124, 62, 31, 94, …