Coding challenge

The Collatz Conjecture (or $3n+1$ problem) says: take any positive integer $n$. If $n$ is even, the next number is $n/2$. If $n$ is odd, the next number is $3n+1$. It is conjectured that all positive integers eventually reach $1$.

The number of steps to reach $1$ is called the "stopping time." Write a program to test starting integers from $n = 1$ to $100$. Which starting number takes the greatest number of steps to reach $1$, and how many steps does it take?

(Hint: the answer is a two-digit number taking over 100 steps!)

← Back to challenges | Lessons