Skip to main content

2014 AMC 10B Problem 25

Problem 25 of 25HarderCounting & Probability

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

Answer choices

Show solution

Solution

Let pip_i be the probability that the frog eventually escapes starting from pad ii. Then p0=0p_0=0, p10=1p_{10}=1, and by symmetry p5=12p_5=\frac12. For 1i41\le i\le 4, pi=i10pi1+10i10pi+1p_i=\frac{i}{10}p_{i-1}+\frac{10-i}{10}p_{i+1}. Working downward from p5=12p_5=\frac12, we get p4=25p3+310p_4=\frac25p_3+\frac3{10}, then p3=310p2+710p4=512p2+724p_3=\frac3{10}p_2+\frac7{10}p_4=\frac5{12}p_2+\frac7{24}. Next p2=15p1+45p3=310p1+720p_2=\frac15p_1+\frac45p_3=\frac3{10}p_1+\frac7{20}. Finally p1=910p2p_1=\frac9{10}p_2. Substituting the expression for p2p_2 gives p1=910(310p1+720)p_1=\frac9{10}\left(\frac3{10}p_1+\frac7{20}\right), so p1=63146p_1=\frac{63}{146}. Thus, the correct answer is C .

More practice

Concepts: random walk · recursive probability · symmetry

Problem text and solution from the LIVE past-contest archive. See also the AoPS wiki page for community solutions.