Difference between revisions of "2008 AMC 10A Problems/Problem 22"
(solution) |
I like pie (talk | contribs) (Replaced array with cases) |
||
Line 5: | Line 5: | ||
==Solution== | ==Solution== | ||
− | We construct a tree showing all possible outcomes that Jacob may get after <math>3</math> flips | + | We construct a tree showing all possible outcomes that Jacob may get after <math>3</math> flips: |
− | < | + | <cmath> |
− | + | 6\quad\begin{cases} | |
− | \quad | ||
− | \text{H}: 11 &\quad | + | \ \text{H}: 11 &\quad |
− | |||
− | + | \begin{cases} | |
− | |||
− | |||
− | |||
− | |||
− | \text{ | + | \ \text{H}: 21 &\quad |
− | + | \begin{cases} | |
− | \text{H}: \boxed{ | + | \ \text{H}: \boxed{41}\ |
− | \text{T}: | + | \ \text{T}: 9.5 |
− | \end{ | + | \end{cases}\\ |
− | \ | + | \ \text{T}: 4.5 &\quad |
+ | \begin{cases} | ||
+ | \ \text{H}: \boxed{8}\\ | ||
+ | \ \text{T}: 1.25 | ||
+ | \end{cases} | ||
− | \ | + | \end{cases}\ |
− | |||
− | |||
− | \ | + | \ \text{T}: 2 &\quad |
− | |||
− | \text{T}: | ||
− | |||
− | \text{ | + | \begin{cases} |
− | \ | + | |
− | \text{H}: \boxed{-1}\ | + | \ \text{H}: 3 &\qquad\! |
− | \text{T}: \boxed{-1} | + | \begin{cases} |
− | \end{ | + | \ \text{H}: \boxed{5}\ |
− | \end{ | + | \ \text{T}: 0.5 |
− | \end{ | + | \end{cases}\ |
+ | |||
+ | \ \text{T}: 0 &\qquad\! | ||
+ | \begin{cases} | ||
+ | \ \text{H}: \boxed{-1}\ | ||
+ | \ \text{T}: \boxed{-1} | ||
+ | \end{cases} | ||
+ | \end{cases} | ||
+ | \end{cases} | ||
</cmath> | </cmath> | ||
− | There is a <math>\frac | + | There is a <math>\frac{5}{8}</math> chance that Jacob ends with an integer, so the answer is <math>\mathrm{(D)}</math>. |
==See also== | ==See also== |
Revision as of 11:24, 26 April 2008
Problem
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?
Solution
We construct a tree showing all possible outcomes that Jacob may get after flips: There is a chance that Jacob ends with an integer, so the answer is .
See also
2008 AMC 10A (Problems • Answer Key • Resources) | ||
Preceded by Problem 21 |
Followed by Problem 23 | |
1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15 • 16 • 17 • 18 • 19 • 20 • 21 • 22 • 23 • 24 • 25 | ||
All AMC 10 Problems and Solutions |