Maths Olympiad Prep

Library / /42 of 71

Algebra Difficulty 5.2 AIME, harder Find the answer United States

Problem:

FemtoPravis is walking on an 8×88 \times 8 chessboard that wraps around at its edges (so squares on the left edge of the chessboard are adjacent to squares on the right edge, and similarly for the top and bottom edges). Each femtosecond, FemtoPravis moves in one of the four diagonal directions uniformly at random. After 2012 femtoseconds, what is the probability that FemtoPravis is at his original location?

A number or a short expression. Fractions can be typed as 3/2, and spacing doesn't matter.

Solution

Solution:

Answer: (1+2100521007)2\left(\frac{1+2^{1005}}{2^{1007}}\right)^{2}

We note the probability that he ends up in the same row is equal to the probability that he ends up in the same column by symmetry. Clearly these are independent, so we calculate the probability that he ends up in the same row.

Now we number the rows 070-7 where 00 and 77 are adjacent. Suppose he starts at row 00. After two more turns, the probability he is in row 22 (or row 66) is 14\frac{1}{4}, and the probability he is in row 00 again is 12\frac{1}{2}. Let an,bn,cna_{n}, b_{n}, c_{n} and dnd_{n} denote the probability he is in row 0,2,4,60,2,4,6 respectively after 2n2n moves.

We have a0=1a_{0}=1, and for n0n \geq 0 we have the following equations:
an+1=12an+14bn+14dnbn+1=12bn+14an+14cncn+1=12cn+14bn+14dndn+1=12dn+14an+14cn \begin{aligned} a_{n+1} & =\frac{1}{2} a_{n}+\frac{1}{4} b_{n}+\frac{1}{4} d_{n} \\ b_{n+1} & =\frac{1}{2} b_{n}+\frac{1}{4} a_{n}+\frac{1}{4} c_{n} \\ c_{n+1} & =\frac{1}{2} c_{n}+\frac{1}{4} b_{n}+\frac{1}{4} d_{n} \\ d_{n+1} & =\frac{1}{2} d_{n}+\frac{1}{4} a_{n}+\frac{1}{4} c_{n} \end{aligned}
From which we get the following equations:
an+cn=12xn=ancn=12(an1cn1)=xn12 \begin{gathered} a_{n}+c_{n}=\frac{1}{2} \\ x_{n}=a_{n}-c_{n}=\frac{1}{2}\left(a_{n-1}-c_{n-1}\right)=\frac{x_{n-1}}{2} \end{gathered}
So
a1006+c1006=12x0=1, x1006=121006a1006=1+2100521007 \begin{gathered} a_{1006}+c_{1006}=\frac{1}{2} \\ x_{0}=1,\ x_{1006}=\frac{1}{2^{1006}} \\ a_{1006}=\frac{1+2^{1005}}{2^{1007}} \end{gathered}
And thus the answer is (1+2100521007)2\left(\frac{1+2^{1005}}{2^{1007}}\right)^{2}.

Want a route through all this instead of an archive? The track puts 2,000 problems in a working order, from AMC 10 level to the IMO shortlist.

Source: MathNet, licensed CC-BY-4.0. Statement reproduced verbatim; metadata (topic, difficulty) added by this project.