Difference between revisions of "2014 AMC 10B Problems/Problem 25"
(removed "troll solution" and improved "actual solution", redubbing it Solution) |
Eznutella888 (talk | contribs) m |
||
| Line 1: | Line 1: | ||
==Problem== | ==Problem== | ||
| − | In a small pond there are eleven lily pads in a row labeled <math>0</math> through <math>10</math>. A frog is sitting on pad <math>1</math>. When the frog is on pad <math>N</math>, <math>0<N<10</math>, it will jump to pad <math>N-1</math> with probability <math>\frac{N}{10}</math> and to pad <math>N+1</math> with probability <math>1-\frac{N}{10}</math>. Each jump is independent of the previous jumps. If the frog reaches pad <math>0</math> it will be eaten by a patiently waiting snake. If the frog reaches pad <math>10</math> it will exit the pond, never to return. | + | In a small pond there are eleven lily pads in a row labeled <math>0</math> through <math>10</math>. A frog is sitting on pad <math>1</math>. When the frog is on pad <math>N</math>, <math>0<N<10</math>, it will jump to pad <math>N-1</math> with probability <math>\frac{N}{10}</math> and to pad <math>N+1</math> with probability <math>1-\frac{N}{10}</math>. Each jump is independent of the previous jumps. If the frog reaches pad <math>0</math> it will be eaten by a patiently waiting snake. If the frog reaches pad <math>10</math> it will exit the pond, never to return. What is the probability that the frog will escape being eaten by the snake? |
<math> \textbf {(A) } \frac{32}{79} \qquad \textbf {(B) } \frac{161}{384} \qquad \textbf {(C) } \frac{63}{146} \qquad \textbf {(D) } \frac{7}{16} \qquad \textbf {(E) } \frac{1}{2} </math> | <math> \textbf {(A) } \frac{32}{79} \qquad \textbf {(B) } \frac{161}{384} \qquad \textbf {(C) } \frac{63}{146} \qquad \textbf {(D) } \frac{7}{16} \qquad \textbf {(E) } \frac{1}{2} </math> | ||
Revision as of 00:32, 21 January 2015
Problem
In a small pond there are eleven lily pads in a row labeled 
through 
. A frog is sitting on pad 
. When the frog is on pad 
, 
, it will jump to pad 
with probability 
and to pad 
with probability 
. Each jump is independent of the previous jumps. If the frog reaches pad it will be eaten by a patiently waiting snake. If the frog reaches pad it will exit the pond, never to return. What is the probability that the frog will escape being eaten by the snake?
Solution
Notice that the probabilities are symmetrical around the fifth lily pad. If the frog is on the fifth lily pad, there is a 
chance that it escapes and a that it gets eaten. Now, let 
represent the probability that the frog escapes if it is currently on pad 
. We get the following system of 
equations:
![\[N_1=\frac{9}{10}\cdot N_2\]](http://latex.artofproblemsolving.com/a/7/d/a7d092776904ed22cd4a235093209f3a0eb74bc7.png)
![\[N_2=\frac{1}{5}\cdot N_1 + \frac{4}{5}\cdot N_3\]](http://latex.artofproblemsolving.com/a/b/a/abaf27ae58ef94a5e891eac883d52aa64cfd3a39.png)
![\[N_3=\frac{3}{10}\cdot N_2 + \frac{7}{10}\cdot N_4\]](http://latex.artofproblemsolving.com/f/0/5/f059dc104e038a606d2464d2f4cacd4ddb49f4d6.png)
![\[N_4=\frac{2}{5}\cdot N_3 + \frac{3}{5}\cdot N_5\]](http://latex.artofproblemsolving.com/b/e/a/bea654dc28ed8a1d8ff0b60bcbc7011566b2b5f6.png)
![\[N_5=\frac{1}{2}\]](http://latex.artofproblemsolving.com/d/e/8/de8437ef5fc3fa34c0e146214fcbd7211e5e1652.png)
We want to find 
, since the frog starts at pad . Solving the above system yields 
, so the answer is 
.
See Also
| 2014 AMC 10B (Problems • Answer Key • Resources) | ||
| Preceded by Problem 24 |
Followed by Last Problem | |
| 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 | ||
The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions. 
