Jacob uses the following procedure to write down a sequence of numbers. First he chooses the first term to be 6. To generate each succeeding term, he flips a fair coin. If it comes up heads, he doubles the previous term and subtracts 1. If it comes up tails, he takes half of the previous term and subtracts 1. What is the probability that the fourth term in Jacob's sequence is an integer?
- A)
- B)
- C)
- D)
- E)
Answer
D
Key insight
Only three flips separate the first and fourth terms, so trace all eight equally likely paths, tracking actual values; five of the eight end at an integer.
Solution
The first term needs no flip, so the fourth term is determined by three flips: equally likely sequences. Write for "double, then subtract " and for "halve, then subtract ," and trace every path from .
After flip 1: , .
After flip 2:
- from : , ;
- from : , .
After flip 3:
- from : , ;
- from : , ;
- from : , ;
- from : , .
The eight fourth terms are . Five of them are integers.
The probability is , so the answer is .
Why this works
With only eight outcomes, an organized tree is faster and safer than any clever shortcut. The structure to notice while tracing: preserves integers, preserves integers only from an even input, and can rescue a half-integer (). Because that rescue exists, "integer or not" is not enough state to carry; you must track the actual values (or at least the fractional part).
The trap
Assuming a non-integer term can never become an integer again; doubling 4.5 gives 8, and missing that path yields 4/8 = 1/2 (choice C).
Common mistakes
- Assuming a non-integer term can never become an integer again; doubling 4.5 gives 8, and missing that path yields 4/8 = 1/2 (choice C).
- Using four flips (sixteen paths) because the question says "fourth term," forgetting the first term needs no flip.
- Forgetting that halving an even number such as or still gives an integer, and discarding the branches too early.
Techniques
Organized listing / direct enumeration