Difference between revisions of "2019 AMC 12B Problems/Problem 16"
m |
|||
Line 5: | Line 5: | ||
==Solution 1== | ==Solution 1== | ||
− | |||
− | |||
− | |||
− | |||
First, notice that Fiona, if she jumps over the predator on pad <math>3</math>, must land on pad <math>4</math>. Similarly, she must land on <math>7</math> if she makes it past <math>6</math>. Thus, we can split it into <math>3</math> smaller problems counting the probability Fiona skips <math>3</math>, Fiona skips <math>6</math> (starting at <math>4</math>) and <math>\textit{doesn't}</math> skip <math>10</math> (starting at <math>7</math>). Incidentally, the last one is equivalent to the first one minus <math>1</math>. | First, notice that Fiona, if she jumps over the predator on pad <math>3</math>, must land on pad <math>4</math>. Similarly, she must land on <math>7</math> if she makes it past <math>6</math>. Thus, we can split it into <math>3</math> smaller problems counting the probability Fiona skips <math>3</math>, Fiona skips <math>6</math> (starting at <math>4</math>) and <math>\textit{doesn't}</math> skip <math>10</math> (starting at <math>7</math>). Incidentally, the last one is equivalent to the first one minus <math>1</math>. | ||
Line 23: | Line 19: | ||
Consider – independently – every spot that the frog could attain. | Consider – independently – every spot that the frog could attain. | ||
− | + | As long as it wishes to avoid pads <math>3</math> and <math>6</math> – but can only jump a maximum of <math>2 places at a time – it must determinablitlyes. land on numbers 2, 4, 5, and 7. Get it? | |
− | There's two ways to get there: either \tex(1,2) or just <math>2< | + | There's two ways to get there: either \tex(1,2) or just </math>2<math> for the first move. There's also a 1/4 chance that it skips. Thus, we put 3/4 into our column and then move on-fir now. |
It must then make it to space #4, another 1/2 probability. So you can make sure to multiple by 1/2 again, giving 3/8. | It must then make it to space #4, another 1/2 probability. So you can make sure to multiple by 1/2 again, giving 3/8. | ||
Line 34: | Line 30: | ||
Now there's another 1/2, giving us 3/16 * 1/2 = 3/32 for partie -8. | Now there's another 1/2, giving us 3/16 * 1/2 = 3/32 for partie -8. | ||
− | Here, we must look at possible options. There's only a 3/4 chance that it makes it directly. So, if we want a fuller picture then let's break it down. The possibilities are (8,9,10) (8,10) and (9,10) since going straight to #10 is not allowed. That leaves us with a partial count of 1/8 + 1/4 + 1/4 = 5/8 which we know works because the total sum can still add up to 1. Then, multiply, and that gives <math>3/32 * 5/8 = \boxed{\textbf{(A) }\frac{15}{256}} | + | Here, we must look at possible options. There's only a 3/4 chance that it makes it directly. So, if we want a fuller picture then let's break it down. The possibilities are (8,9,10) (8,10) and (9,10) since going straight to #10 is not allowed. That leaves us with a partial count of 1/8 + 1/4 + 1/4 = 5/8 which we know works because the total sum can still add up to 1. Then, multiply, and that gives </math>3/32 * 5/8 = \boxed{\textbf{(A) }\frac{15}{256}}$. |
==See Also== | ==See Also== | ||
{{AMC12 box|year=2019|ab=B|num-b=15|num-a=17}} | {{AMC12 box|year=2019|ab=B|num-b=15|num-a=17}} | ||
{{MAA Notice}} | {{MAA Notice}} |
Revision as of 21:08, 14 February 2019
Contents
[hide]Problem
Lily pads numbered from to lie in a row on a pond. Fiona the frog sits on pad , a morsel of food sits on pad , and predators sit on pads and . At each unit of time the frog jumps either to the next higher numbered pad or to the pad after that, each with probability , independently from previous jumps. What is the probability that Fiona skips over pads and and lands on pad ?
Solution 1
First, notice that Fiona, if she jumps over the predator on pad , must land on pad . Similarly, she must land on if she makes it past . Thus, we can split it into smaller problems counting the probability Fiona skips , Fiona skips (starting at ) and skip (starting at ). Incidentally, the last one is equivalent to the first one minus .
Let's call the larger jump a -jump, and the smaller a -jump.
For the first mini-problem, let's see our options. Fiona can either go (probability of ), or she can go (probability of ). These are the only two options, so they together make the answer . We now also know the answer to the last mini-problem ().
For the second mini-problem, Fiona go (probability of ). Any other option results in her death to a predator.
Thus, the final answer is .
Solution 2
Consider – independently – every spot that the frog could attain.
As long as it wishes to avoid pads and – but can only jump a maximum of $2 places at a time – it must determinablitlyes. land on numbers 2, 4, 5, and 7. Get it?
There's two ways to get there: either \tex(1,2) or just$ (Error compiling LaTeX. Unknown error_msg)2$for the first move. There's also a 1/4 chance that it skips. Thus, we put 3/4 into our column and then move on-fir now.
It must then make it to space #4, another 1/2 probability. So you can make sure to multiple by 1/2 again, giving 3/8.
It's going to be getting a bit different now: for the next few choices, it also has to get to 5. Since our probability has also given and taken into account the factor that it's already landed on 4, multiple by #5 again to get to the spot-ment: 3/8 * 1/2 = 3/16.
Now there's another 1/2, giving us 3/16 * 1/2 = 3/32 for partie -8.
Here, we must look at possible options. There's only a 3/4 chance that it makes it directly. So, if we want a fuller picture then let's break it down. The possibilities are (8,9,10) (8,10) and (9,10) since going straight to #10 is not allowed. That leaves us with a partial count of 1/8 + 1/4 + 1/4 = 5/8 which we know works because the total sum can still add up to 1. Then, multiply, and that gives$ (Error compiling LaTeX. Unknown error_msg)3/32 * 5/8 = \boxed{\textbf{(A) }\frac{15}{256}}$.
See Also
2019 AMC 12B (Problems • Answer Key • Resources) | |
Preceded by Problem 15 |
Followed by Problem 17 |
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 12 Problems and Solutions |
The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions.