返回题库

AIME 2014 I · 第 11 题

AIME 2014 I — Problem 11

专题
Contest Math
难度
L4
来源
AIME

题目详情

Problem 11

A token starts at the point (0,0)(0,0) of an xyxy-coordinate grid and then makes a sequence of six moves. Each move is 1 unit in a direction parallel to one of the coordinate axes. Each move is selected randomly from the four possible directions and independently of the other moves. The probability the token ends at a point on the graph of y=x|y|=|x| is mn\frac{m}{n}, where mm and nn are relatively prime positive integers. Find m+nm+n.

解析

Solution 1 (Slick Solution)

Perform the coordinate transformation (x,y)(x+y,xy)(x, y)\rightarrow (x+y, x-y). Then we can see that a movement up, right, left, or down in the old coordinates adds the vectors 1,1\langle 1, -1 \rangle, 1,1\langle 1, 1 \rangle, 1,1\langle -1, -1 \rangle, 1,1\langle -1, 1 \rangle respectively. Moreover, the transformation takes the equation y=x|y| = |x| to the union of the x and y axis. Exactly half of the moves go up in the new coordinates, and half of them go down. In order to end up on the x axis, we need to go up thrice and down thrice. The number of possible sequences of up and down moves is the number of permutations of UUUDDDUUUDDD, which is just (63)=20\binom63 = 20. The probability of any of these sequences happening is (12)6\left(\frac12\right)^6. Thus, the probability of ending on the x axis is 2026\frac{20}{2^6}. Similarly, the probability of ending on the y axis is the same.

However, we overcount exactly one case: ending at (0,0)(0, 0). Since ending on the x axis and ending on the y axis are independent events, the probability of both is simply (2026)2=25256\left(\frac{20}{2^6}\right)^2 = \frac{25}{256}. Using PIE, the total probability is 2064+206425256=135256\frac{20}{64} + \frac{20}{64} - \frac{25}{256} = \frac{135}{256}, giving an answer of 391\boxed{391}.

~sampai7

Solution 2 (Casework)

We have 4 possible moves: U, D, R, and L. The total number of paths that could be taken is 464^6, or 40964096. There are 4 possible cases that land along the line y=xy = x: x,y=±1;x,y=±2;x,y=±3;x,y = \pm 1; x,y = \pm 2; x,y = \pm 3; or x=y=0x = y = 0. We will count the number of ways to end up at (1,1),(2,2),(1,1), (2,2), and (3,3)(3,3), multiply them by 4 to account for the other quadrants, and add this to the number of ways to end up at (0,0)(0,0).

  • Case 1: The token ends at (3,3)(3, 3). In order for the token to end up here, it must have had 3 right moves, and 3 up moves. In other words, the total number of ways to get here is the ways to rearrange the letters in the sequence RRRUUURRRUUU, which is (63)=20.{6\choose 3} = 20.

  • Case 2: The token ends at (2,2)(2,2). In order for the token to end up here, it could have had 2 up moves, 3 right moves, and 1 left move; or 2 right moves, 3 up moves, and 1 down move. Thus, the total number of ways to get here is sum of the ways to rearrange the letters in the sequences RRRLUURRRLUU and UUUDRRUUUDRR, both of which are (61)(52)=60{6\choose 1}{5\choose 2} = 60, for a total of 120120 possibilities.

  • Case 3: The token ends at (1,1)(1,1). In order for the token to end up here, it could have had:

    • 1 right move, 3 up moves, and 2 down moves. In this case, the number of ways to rearrange the letters in the sequence RUUUDDRUUUDD is (61)(52)=60.{6\choose 1}{5\choose 2} = 60.
    • 1 up move, 3 right moves, and 2 left moves. In this case, the number of ways to rearrange the letters in the sequence URRRLLURRRLL is (61)(52)=60.{6\choose 1}{5\choose 2} = 60.
    • 2 right moves, 1 left move, 2 up moves, and 1 down move. In this case, the number of ways to rearrange the letters in the sequence UUDRRLUUDRRL is (61)(51)(42)=180.{6\choose 1}{5\choose 1}{4\choose 2} = 180.

Thus, the total number of ways to end up at (1,1)(1,1) is 300300.

  • Case 4: The token ends at (0,0)(0,0). In order for the token to end up here, it could have had:
    • 3 right moves and 3 left moves. In this case, the number of ways to rearrange the letters in the sequence RRRLLLRRRLLL is (63)=20.{6\choose 3} = 20.
    • 3 up moves and 3 down moves. In this case, the number of ways to rearrange the letters in the sequence UUUDDDUUUDDD is (63)=20.{6\choose 3} = 20.
    • 1 right move, 1 left move, 2 up moves, and 2 down moves. In this case, the number of ways to rearrange the letters in the sequence RLUUDDRLUUDD is (61)(51)(42)=180.{6\choose 1}{5\choose 1}{4\choose 2} = 180.
    • 1 up move, 1 down move, 2 right moves, and 2 left moves. In this case, the number of ways to rearrange the letters in the sequence RRLLUDRRLLUD is (61)(51)(42)=180.{6\choose 1}{5\choose 1}{4\choose 2} = 180.

Thus, the total number of ways to end up at (0,0)(0,0) is 400400.

Adding these cases together, we get that the total number of ways to end up on y=xy = x is 4(20+120+300)+400=21604(20 + 120 + 300) + 400 = 2160. Thus, our probability is 21604096\frac{2160}{4096}. When this fraction is fully reduced, it is 135256\frac{135}{256}, so our answer is 135+256=391.135 + 256 = \boxed{391}.

Solution 3 (Casework)

We split this into cases by making a chart. In each row, the entries (±1)(\pm1) before the dividing line represent the right or left steps (without regard to order), and the entries after the dividing line represent the up or down steps (again, without regard to order). This table only represents the cases where the ending position (x,y)(x,y) satisfies x=yx=y.

\multicolumn5cR(+)L()\multicolumn5cU(+)D()+1+1+1+1+1+1+1+11+1+11+111+111111111+1+1+11+1+1+1+111+11+111111(×2 for symmetry by swapping RL and UD)+1+1+111+1+1+11111(×2 symmetry)+1+1+1111(×2 symmetry)\begin{array}{ccccccccccccl} \multicolumn{5}{c}{R (+)\qquad L (-)}& |&\multicolumn{5}{c}{U (+)\qquad D (-)}\\ +1&& +1&& +1&| & +1&& +1&& +1\\ +1&& +1&& -1& | & +1&& +1&& -1\\ +1&& -1&& -1& | & +1&& -1&& -1\\ -1 && -1&& -1& | & -1&& -1&& -1\\ \\ +1&& +1&& +1&& -1 &|& +1&& +1\\ +1&& +1&& -1 && -1 &|& +1 && -1\\ +1&& -1&& -1 && -1 &|& -1 && -1 &&(\times 2 \text{ for symmetry by swapping }R-L\text{ and }U-D)\\ \\ +1&& +1 &&+1 &&-1&& -1& |& +1\\ +1&& +1 &&-1&& -1&& -1 &|& -1&& (\times 2\text{ symmetry})\\ \\ +1&& +1 &&+1&& -1&& -1 &&-1&| & (\times2 \text{ symmetry})\\ \end{array} Note that to account for the cases when x=yx=-y, we can simply multiply the UDU-D steps by 1-1, so for example, the first row would become

+1+1+1       111.+1 \qquad+1\qquad +1 \ \ \ \ |\ \ \ -1\qquad -1\qquad -1. Therefore, we must multiply the number of possibilities in each case by 22, except for when x=y=0x=y=0.

Now, we compute the number of possibilities for each case. In particular, we must compute the number of RLUDRLUD words, where RR represents +1+1 to the left of |, LL represents 1-1 to the left of |, UU represents +1+1 to the right of |, and DD represents 1-1 to the right of |. Using multinomials, we compute the following numbers of possibilities for each case.

(63)2+6!2!2!2+6!2!2!2+(63)2=2(20+180+180+20)=800{6\choose 3}\cdot 2+ \frac{6!}{2!2!}\cdot 2 + \frac{6!}{2!2!} \cdot 2 + {6\choose 3} \cdot 2 = 2(20 + 180 + 180 + 20) = 800 6!3!2!2+6!2!2!+6!3!2!2=120+180+120=420 (×2 for symmetry)\frac{6!}{3!2!}\cdot 2 + \frac{6!}{2!2!} + \frac{6!}{3!2!}\cdot 2 = 120 + 180 + 120 = 420\ (\times2\text{ for symmetry}) 6!3!2!2+6!3!2!2=120+120=240 (×2 for symmetry)\frac{6!}{3!2!} \cdot 2 + \frac{6!}{3!2!} \cdot 2 = 120 + 120 = 240\ (\times2\text{ for symmetry}) (63)=20 (×2 for symmetry){6\choose 3} = 20\ (\times 2\text{ for symmetry}) Thus, there are 800+840+480+40=2160800 + 840 + 480 + 40 = 2160 possibilities where x=y|x|=|y|. Because there are 464^6 total possibilities, the probability is 216046=135256\frac{2160}{4^6} = \frac{135}{256}, so the answer is 391.\boxed{391}.

Solution 4 (States)

Denote (x,y)n(x, y)_n the probability that starting from point (x,y)(x, y), the token reaches a point on the graph of y=x|y| = |x| in exactly nn moves. The problem asks us to find (0,0)6(0, 0)_6. We start by breaking this down:

(0,0)6=14((0,1)5+(0,1)5+(1,0)5+(1,0)5)(0, 0)_6 = \frac14 \cdot ((0, 1)_5 + (0, -1)_5 + (1, 0)_5 + (-1, 0)_5) Notice that by symmetry, (0,1)5=(0,1)5=(1,0)5=(1,0)5(0, 1)_5 = (0, -1)_5 = (1, 0)_5 = (-1, 0)_5, so the equation simplifies to

(0,0)6=(0,1)5(0, 0)_6 = (0, 1)_5 We now expand (0,1)5(0, 1)_5.

(0,1)5=14((0,0)4+(0,2)4+2(1,1)4)(0, 1)_5 = \frac14 \cdot ((0, 0)_4 + (0, 2)_4 + 2(1, 1)_4) First, we find (0,0)4(0, 0)_4.

(0,0)4=(0,1)3(0, 0)_4 = (0, 1)_3 (0,1)3=14((0,0)2+(0,2)2+2(1,1)2)(0, 1)_3 = \frac14 \cdot ((0, 0)_2 + (0, 2)_2 + 2(1, 1)_2) At this point, we can just count the possibilities to find (0,0)2=34(0, 0)_2 = \frac34, (0,2)2=716(0, 2)_2 = \frac{7}{16}, and (1,1)2=58(1, 1)_2 = \frac58. Therefore,

(0,1)3=14(34+716+258)(0, 1)_3 = \frac14 \cdot (\frac34 + \frac{7}{16} + 2 \cdot \frac58) (0,1)3=3964(0, 1)_3 = \frac{39}{64} Next, we find (0,2)4(0, 2)_4.

(0,2)4=14((0,1)3+(0,3)3+2(1,2)3)(0, 2)_4 = \frac14 \cdot ((0, 1)_3 + (0, 3)_3 + 2(1, 2)_3) We already calculated (0,1)3(0, 1)_3, so we just need to find (0,3)3(0, 3)_3 and (1,2)3(1, 2)_3

(0,3)3=14((0,2)2+(0,4)2+2(1,3)2)(0, 3)_3 = \frac14 \cdot ((0, 2)_2 + (0, 4)_2 + 2(1, 3)_2) (0,3)3=14(716+0+214)(0, 3)_3 = \frac14 \cdot (\frac{7}{16} + 0 + 2 \cdot \frac{1}{4}) (0,3)3=1564(0, 3)_3 = \frac{15}{64} (1,2)3=14((1,3)2+(1,1)2+(0,2)2+(2,2)2)(1, 2)_3 = \frac14 \cdot ((1, 3)_2 + (1, 1)_2 + (0, 2)_2 + (2, 2)_2) (1,2)3=14(14+58+716+12)(1, 2)_3 = \frac14 \cdot (\frac14 + \frac58 + \frac{7}{16} + \frac12) (1,2)3=2964(1, 2)_3 = \frac{29}{64} Therefore,

(0,2)4=14(3964+1564+22964)(0, 2)_4 = \frac14 \cdot (\frac{39}{64} + \frac{15}{64} + 2 \cdot \frac{29}{64}) (0,2)4=716(0, 2)_4 = \frac{7}{16} Finally, we find (1,1)4(1, 1)_4.

(1,1)4=12((0,1)3+(1,2)3)(1, 1)_4 = \frac12 \cdot ((0, 1)_3 + (1, 2)_3) (1,1)4=12(3964+2964)(1, 1)_4 = \frac12 \cdot (\frac{39}{64} + \frac{29}{64}) (1,1)4=1732(1, 1)_4 = \frac{17}{32} Putting it all together,

(0,0)6=(0,1)5=14(3964+716+21732)(0, 0)_6 = (0, 1)_5 =\frac14 \cdot (\frac{39}{64} + \frac{7}{16} + 2 \cdot \frac{17}{32}) (0,0)6=135256(0, 0)_6 = \frac{135}{256} Thus, the answer is 135+256=391135 + 256 = \boxed{391}.

Solution 5 (Generating Functions)

For any point (x,y)(x,y) on the coordinate plane, we can represent it as the term axbya^xb^y. Then, moving right is equivalent to multiplying by aa, moving left is equivalent to multiplying by 1/a1/a, and similarly for up/down with bb and 1/b1/b. Because, on every move, the possibilities are these four directions, and each is equally likely, each move can be represented by multiplying by a+1a+b+1ba+\frac{1}{a}+b+\frac{1}{b}. Thus, the possibilities after 66 moves are the same as the coefficients of (a+1a+b+1b)6\left(a+\frac{1}{a}+b+\frac{1}{b}\right)^6. By symmetry, we just need to find the number of ways for the token to reach (0,0),(1,1),(2,2), and (3,3)(0,0),(1,1),(2,2),\text{ and }(3,3). By the multinomial theorem, the coefficient of a3b3a^3b^3 is (63,3)=20\binom{6}{3,3}=20. Similarly, the coefficient of a2b2a^2b^2 is 2(63,2,1)=1202\binom{6}{3,2,1}=120. The coefficient of abab is (62,2,1,1)+2(63,2,1)=300\binom{6}{2,2,1,1}+2\binom{6}{3,2,1}=300. Finally, the constant term is 2(62,2,1,1)+2(63,3)=4002\binom{6}{2,2,1,1}+2\binom{6}{3,3}=400. Because the total number of possibilities is 464^6, the probability is

4(20+120+300)+40046=5+30+75+2544=135256,\frac{4(20+120+300)+400}{4^6}=\frac{5+30+75+25}{4^4}=\frac{135}{256}, and the answer is 391391. --brainiacmaniac31