AMC 10 Daily Practice Round 2
Complete problem set with solutions and individual problem pages
Problem 21 Hard
Jacob uses the following procedure to write down a sequence of numbers. First he chooses the first term to be . To generate each succeeding term, he flips a fair coin. If it comes up heads, he doubles the previous term and subtracts . If it comes up tails, he takes half of the previous term and subtracts
. The probability that the th term is an integer is less than . What is the minimum value of ?
- A.
- B.
- C.
- D.
- E.
Answer:D
We construct a tree showing all possible outcomes that Jacob may get after flips; we can do this because there are only possibilities:
Similarily, we found the probabililty for the th term to be an integer is , for the th term to be an integer is . So the answer is .
