Art of Problem Solving
AoPS Online
Math texts, online classes, and more
for students in grades 5-12.
Visit AoPS Online ‚
Books for Grades 5-12 Online Courses
Beast Academy
Engaging math books and online learning
for students ages 6-13.
Visit Beast Academy ‚
Books for Ages 6-13 Beast Academy Online
AoPS Academy
Small live classes for advanced math
and language arts learners in grades 2-12.
Visit AoPS Academy ‚
Find a Physical Campus Visit the Virtual Campus

Difference between revisions of "2014 AMC 12B Problems/Problem 22"
Line 1: Line 1:
−
A long, but straightforward bash:
+
==Problem==
  
 +
In a small pond there are eleven lily pads in a row labeled 0 through 10.  A frog is sitting on pad 1.  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 0 it will be eaten by a patiently waiting snake.  If the frog reaches pad 10 it will exit the pond, never to return.  What is the probability that the frog will escape without 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}\qquad</math>A long, but straightforward bash:
 +
 +
 +
==Solution==
  
 
Define <math>P(N)</math> to be the probability that the frog survives starting from pad N.
 
Define <math>P(N)</math> to be the probability that the frog survives starting from pad N.

Revision as of 22:06, 20 February 2014

Problem

In a small pond there are eleven lily pads in a row labeled 0 through 10. A frog is sitting on pad 1. When the frog is on pad $N$, $0<N<10$, it will jump to pad $N-1$ with probability $\frac{N}{10}$ and to pad $N+1$ with probability $1-\frac{N}{10}$. Each jump is independent of the previous jumps. If the frog reaches pad 0 it will be eaten by a patiently waiting snake. If the frog reaches pad 10 it will exit the pond, never to return. What is the probability that the frog will escape without being eaten by the snake?

$\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}\qquad$A long, but straightforward bash:


Solution

Define $P(N)$ to be the probability that the frog survives starting from pad N.


Then note that by symmetry, $P(5) = 1/2$, since the probabilities of the frog moving subsequently in either direction from pad 5 are equal.


We therefore seek to rewrite $P(1)$ in terms of $P(5)$, using the fact that


$P(N) = \frac {N} {10}P(N - 1) + \frac {10 - N} {10}P(N + 1)$


as said in the problem.


Hence $P(1) = \frac {1} {10}P(0) + \frac {9} {10}P(2) = \frac {9} {10}P(2)$


$\Rightarrow P(2) = \frac {10} {9}P(1)$


Returning to our original equation:


$P(1) = \frac {9} {10}P(2) = \frac {9} {10}\left(\frac{2} {10}P(1) + \frac{8} {10}P(3)\right)$


$= \frac {9} {50}P(1) + \frac {18} {25}P(3) \Rightarrow P(1) - \frac {9} {50}P(1)$ $= \frac {18} {25}P(3)$


$\Rightarrow P(3) = \frac {41} {36}P(1)$


Returning to our original equation:


$P(1) = \frac {9} {50}P(1) + \frac {18} {25}\left(\frac {3} {10}P(2) + \frac {7} {10}P(4)\right)$


$= \frac {9} {50}P(1) + \frac {27} {125}P(2) + \frac {63} {125}P(4)$


$= \frac {9} {50}P(1) + \frac {27} {125}\left(\frac {10} {9}P(1)\right) + \frac {63} {125}\left(\frac {4} {10}P(3) + \frac {6} {10}P(5)\right)$


Cleaing up the coefficients, we have:


$= \frac {21} {50}P(1) + \frac {126} {625}P(3) + \frac {189} {625}P(5)$


$= \frac {21} {50}P(1) + \frac {126} {625}\left(\frac {41} {36}P(1)\right) + \frac {189} {625}\left(\frac {1} {2}\right)$


Hence, $P(1) = \frac {525} {1250}P(1) + \frac {287} {1250}P(1) + \frac {189} {1250}$


$\Rightarrow P(1) - \frac {812} {1250}P(1) = \frac {189} {1250} \Rightarrow P(1) = \frac {189} {438}$


$= \boxed{\frac {63} {146}\, (C)}$


-Dukejukem

Retrieved from "https://artofproblemsolving.com/wiki/index.php?title=2014_AMC_12B_Problems/Problem_22&oldid=60298"