Collatz Sequence Practice Problems
Practice problems on the Collatz conjecture (3n+1): work out stopping times and peak values, judge true/false claims. Rising difficulty plus a boss, free.
How many steps does 10 take to reach 1?
A 4-step solution strategy
- 1Step 1 of 4
Write the sequence out cleanly
Start with the starting number and write each new value behind an arrow: n → … → 1. That way you lose nothing while counting and can check your work later.
- 2Step 2 of 4
Apply the rule per step
Even number → divide by 2. Odd number → multiply by 3 and add 1 (3n + 1). Never apply both rules to the same number.
- 3Step 3 of 4
Read off stopping time or peak value
The stopping time is the number of arrows down to 1. The peak value is the largest number anywhere in the sequence — note them separately.
- 4Step 4 of 4
Compare deliberately for claims
If a claim needs checking ("stopping time > 100?"), compute the sequence up to the point in question and compare the result with the claim.
Worked examples with full working
Common mistakes — and how to avoid them
Rule swapped
Counting the starting number
Confusing stopping time and peak value
Forgetting the +1 in the 3n+1 step
Expecting a steady decline
Practice with a plan — three quick tips
By hand first, calculator second
Note stopping time and peak value separately
Compare neighboring numbers
Frequently asked practice questions
Terms in one sentence
- Collatz conjecture
- The conjecture that the (3n+1) sequence ends at 1 from every positive starting number.
- Stopping time
- The number of steps until the sequence first reaches 1.
- Peak value
- The largest number the sequence reaches along the way.
- (3n+1) rule
- For an odd number: multiply by 3 and add 1.
- Iteration
- Repeatedly applying the same rule to each new result.
- Cycle 4 → 2 → 1
- The final loop that every Collatz sequence ends in.
- Boss question
- The last and hardest task of the practice set, here the longest sequence.