Difference between revisions of "2014 AIME I Problems/Problem 11"

Latest revision as of 22:54, 4 February 2022

Problem 11

A token starts at the point $(0,0)$ of an $xy$ -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|$ is $\frac{m}{n}$ , where $m$ and $n$ are relatively prime positive integers. Find $m+n$ .

Solution 1 (Slick Solution)

Perform the coordinate transformation $(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 $\langle 1, -1 \rangle$ , $\langle 1, 1 \rangle$ , $\langle -1, -1 \rangle$ , $\langle -1, 1 \rangle$ respectively. Moreover, the transformation takes the equation $|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 $UUUDDD$ , which is just $\binom63 = 20$ . The probability of any of these sequences happening is $\left(\frac12\right)^6$ . Thus, the probability of ending on the x axis is $\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)$ . Since ending on the x axis and ending on the y axis are independent events, the probability of both is simply $\left(\frac{20}{2^6}\right)^2 = \frac{25}{256}$ . Using PIE, the total probability is $\frac{20}{64} + \frac{20}{64} - \frac{25}{256} = \frac{135}{256}$ , giving an answer of $\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 $4^6$ , or $4096$ . There are 4 possible cases that land along the line $y = x$ : $x,y = \pm 1; x,y = \pm 2; x,y = \pm 3;$ or $x = y = 0$ . We will count the number of ways to end up at $(1,1), (2,2),$ and $(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)$ .

Case 1: The token ends at $(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 $RRRUUU$ , which is ${6\choose 3} = 20.$

Case 2: The token ends at $(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 $RRRLUU$ and $UUUDRR$ , both of which are ${6\choose 1}{5\choose 2} = 60$ , for a total of $120$ possibilities.

Case 3: The token ends at . 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 $RUUUDD$ is ${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 $URRRLL$ is ${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 $UUDRRL$ is ${6\choose 1}{5\choose 1}{4\choose 2} = 180.$

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

Case 4: The token ends at . 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 $RRRLLL$ is ${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 $UUUDDD$ is ${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 $RLUUDD$ is ${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 $RRLLUD$ is ${6\choose 1}{5\choose 1}{4\choose 2} = 180.$

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

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

Solution 3 (Casework)

We split this into cases by making a chart. In each row, the entries $(\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)$ satisfies $x=y$ . $\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=-y$ , we can simply multiply the $U-D$ steps by $-1$ , so for example, the first row would become $+1 \qquad+1\qquad +1 \ \ \ \ |\ \ \ -1\qquad -1\qquad -1.$ Therefore, we must multiply the number of possibilities in each case by $2$ , except for when $x=y=0$ .

Now, we compute the number of possibilities for each case. In particular, we must compute the number of $RLUD$ words, where $R$ represents $+1$ to the left of $|$ , $L$ represents $-1$ to the left of $|$ , $U$ represents $+1$ to the right of $|$ , and $D$ represents $-1$ to the right of $|$ . Using multinomials, we compute the following numbers of possibilities for each case. ${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$ $\frac{6!}{3!2!}\cdot 2 + \frac{6!}{2!2!} + \frac{6!}{3!2!}\cdot 2 = 120 + 180 + 120 = 420\ (\times2\text{ for symmetry})$ $\frac{6!}{3!2!} \cdot 2 + \frac{6!}{3!2!} \cdot 2 = 120 + 120 = 240\ (\times2\text{ for symmetry})$ ${6\choose 3} = 20\ (\times 2\text{ for symmetry})$

Thus, there are $800 + 840 + 480 + 40 = 2160$ possibilities where $|x|=|y|$ . Because there are $4^6$ total possibilities, the probability is $\frac{2160}{4^6} = \frac{135}{256}$ , so the answer is $\boxed{391}.$

Solution 4 (States)

Denote $(x, y)_n$ the probability that starting from point $(x, y)$ , the token reaches a point on the graph of $|y| = |x|$ in exactly $n$ moves. The problem asks us to find $(0, 0)_6$ . We start by breaking this down: $(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$ , so the equation simplifies to $(0, 0)_6 = (0, 1)_5$ We now expand $(0, 1)_5$ . $(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, 1)_3$ $(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 = \frac34$ , $(0, 2)_2 = \frac{7}{16}$ , and $(1, 1)_2 = \frac58$ . Therefore, $(0, 1)_3 = \frac14 \cdot (\frac34 + \frac{7}{16} + 2 \cdot \frac58)$ $(0, 1)_3 = \frac{39}{64}$ Next, we find $(0, 2)_4$ . $(0, 2)_4 = \frac14 \cdot ((0, 1)_3 + (0, 3)_3 + 2(1, 2)_3)$ We already calculated $(0, 1)_3$ , so we just need to find $(0, 3)_3$ and $(1, 2)_3$ $(0, 3)_3 = \frac14 \cdot ((0, 2)_2 + (0, 4)_2 + 2(1, 3)_2)$ $(0, 3)_3 = \frac14 \cdot (\frac{7}{16} + 0 + 2 \cdot \frac{1}{4})$ $(0, 3)_3 = \frac{15}{64}$ $(1, 2)_3 = \frac14 \cdot ((1, 3)_2 + (1, 1)_2 + (0, 2)_2 + (2, 2)_2)$ $(1, 2)_3 = \frac14 \cdot (\frac14 + \frac58 + \frac{7}{16} + \frac12)$ $(1, 2)_3 = \frac{29}{64}$ Therefore, $(0, 2)_4 = \frac14 \cdot (\frac{39}{64} + \frac{15}{64} + 2 \cdot \frac{29}{64})$ $(0, 2)_4 = \frac{7}{16}$ Finally, we find $(1, 1)_4$ . $(1, 1)_4 = \frac12 \cdot ((0, 1)_3 + (1, 2)_3)$ $(1, 1)_4 = \frac12 \cdot (\frac{39}{64} + \frac{29}{64})$ $(1, 1)_4 = \frac{17}{32}$ Putting it all together, $(0, 0)_6 = (0, 1)_5 =\frac14 \cdot (\frac{39}{64} + \frac{7}{16} + 2 \cdot \frac{17}{32})$ $(0, 0)_6 = \frac{135}{256}$ Thus, the answer is $135 + 256 = \boxed{391}$ .

Solution 5 (Generating Functions)

For any point $(x,y)$ on the coordinate plane, we can represent it as the term $a^xb^y$ . Then, moving right is equivalent to multiplying by $a$ , moving left is equivalent to multiplying by $1/a$ , and similarly for up/down with $b$ and $1/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+\frac{1}{a}+b+\frac{1}{b}$ . Thus, the possibilities after $6$ moves are the same as the coefficients of $\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),\text{ and }(3,3)$ . By the multinomial theorem, the coefficient of $a^3b^3$ is $\binom{6}{3,3}=20$ . Similarly, the coefficient of $a^2b^2$ is $2\binom{6}{3,2,1}=120$ . The coefficient of $ab$ is $\binom{6}{2,2,1,1}+2\binom{6}{3,2,1}=300$ . Finally, the constant term is $2\binom{6}{2,2,1,1}+2\binom{6}{3,3}=400$ . Because the total number of possibilities is $4^6$ , the probability is $\frac{4(20+120+300)+400}{4^6}=\frac{5+30+75+25}{4^4}=\frac{135}{256},$ and the answer is $391$ . --brainiacmaniac31

@@ Line 3: / Line 3: @@
 A token starts at the point <math>(0,0)</math> of an <math>xy</math>-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 <math>|y|=|x|</math> is <math>\frac{m}{n}</math>, where <math>m</math> and <math>n</math> are relatively prime positive integers. Find <math>m+n</math>.
-== Solution (casework) ==
+== Solution 1 (Slick Solution) ==
+Perform the coordinate transformation <math>(x, y)\rightarrow (x+y, x-y)</math>. Then we can see that a movement up, right, left, or down in the old coordinates adds the vectors <math>\langle 1, -1 \rangle</math>, <math>\langle 1, 1 \rangle</math>, <math>\langle -1, -1 \rangle</math>, <math>\langle -1, 1 \rangle</math> respectively. Moreover, the transformation takes the equation <math>|y| = |x|</math> 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 <math>UUUDDD</math>, which is just <math>\binom63 = 20</math>. The probability of any of these sequences happening is <math>\left(\frac12\right)^6</math>. Thus, the probability of ending on the x axis is <math>\frac{20}{2^6}</math>. Similarly, the probability of ending on the y axis is the same.
+However, we overcount exactly one case: ending at <math>(0, 0)</math>. Since ending on the x axis and ending on the y axis are independent events, the probability of both is simply <math>\left(\frac{20}{2^6}\right)^2 = \frac{25}{256}</math>. Using PIE, the total probability is <math>\frac{20}{64} + \frac{20}{64} - \frac{25}{256} = \frac{135}{256}</math>, giving an answer of <math>\boxed{391}</math>.
+~sampai7
+== Solution 2 (Casework) ==
 We have 4 possible moves: U, D, R, and L. The total number of paths that could be taken is <math>4^6</math>, or <math>4096</math>. There are 4 possible cases that land along the line <math>y = x</math>: <math>x,y = \pm 1; x,y = \pm 2; x,y = \pm 3;</math> or <math>x = y = 0</math>. We will count the number of ways to end up at <math>(1,1), (2,2),</math> and <math>(3,3)</math>, multiply them by 4 to account for the other quadrants, and add this to the number of ways to end up at <math>(0,0)</math>.
@@ Line 26: / Line 34: @@
 Adding these cases together, we get that the total number of ways to end up on <math>y = x</math> is <math>4(20 + 120 + 300) + 400 = 2160</math>. Thus, our probability is <math>\frac{2160}{4096}</math>. When this fraction is fully reduced, it is <math>\frac{135}{256}</math>, so our answer is <math>135 + 256 = \boxed{391}.</math>
-==Solution (casework 2)==
+==Solution 3 (Casework)==
-Make a chart:
+We split this into cases by making a chart. In each row, the entries <math>(\pm1)</math> 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 <math>(x,y)</math> satisfies <math>x=y</math>.
+<cmath>
-R (+) L (-) |  U (+) D (-)
+\begin{array}{ccccccccccccl}
-+1 +1 +1 | +1 +1 + 1
+\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\\
-+1 +1 +1 -1 | +1 +1
+\\
-+1 +1 -1  -1 | +1  -1
++1&& +1&& +1&& -1 &|& +1&& +1\\
-+1 -1  -1  -1 | -1   -1 (x2 symmetry by swapping R-L and U-D)
++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}
+</cmath>
+Note that to account for the cases when <math>x=-y</math>, we can simply multiply the <math>U-D</math> steps by <math>-1</math>, so for example, the first row would become  <cmath>+1 \qquad+1\qquad +1 \ \ \ \ |\ \ \  -1\qquad -1\qquad -1.</cmath> Therefore, we must multiply the number of possibilities in each case by <math>2</math>, except for when <math>x=y=0</math>.
-+1 +1 +1 -1 -1 | +1
+Now, we compute the number of possibilities for each case. In particular, we must compute the number of <math>RLUD</math> words, where <math>R</math> represents <math>+1</math> to the left of <math>|</math>, <math>L</math> represents <math>-1</math> to the left of <math>|</math>, <math>U</math> represents <math>+1</math> to the right of <math>|</math>, and <math>D</math> represents <math>-1</math> to the right of <math>|</math>. Using multinomials, we compute the following numbers of possibilities for each case.
-+1 +1 -1  -1 -1 | -1 (x2 symmetry)
+<cmath>{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</cmath>
+<cmath>\frac{6!}{3!2!}\cdot 2 + \frac{6!}{2!2!} + \frac{6!}{3!2!}\cdot 2 = 120 + 180 + 120 = 420\  (\times2\text{ for symmetry})</cmath>
+<cmath>\frac{6!}{3!2!} \cdot 2 + \frac{6!}{3!2!} \cdot 2 = 120 + 120 = 240\  (\times2\text{ for symmetry})</cmath>
+<cmath>{6\choose 3} = 20\ (\times 2\text{ for symmetry})</cmath>
-+1 +1 +1 -1 -1 -1 | (x2 symmetry)
+Thus, there are <math>800 + 840 + 480 + 40 = 2160</math> possibilities where <math>|x|=|y|</math>. Because there are <math>4^6</math> total possibilities, the probability is <math>\frac{2160}{4^6} = \frac{135}{256}</math>, so the answer is <math>\boxed{391}.</math>
-Note we have to multiply by two to account for cases like +1 +1 +1 | -1 -1 -1.
+==Solution 4 (States)==
+Denote <math>(x, y)_n</math> the probability that starting from point <math>(x, y)</math>, the token reaches a point on the graph of <math>|y| = |x|</math> in exactly <math>n</math> moves. The problem asks us to find <math>(0, 0)_6</math>. We start by breaking this down:
+<cmath>(0, 0)_6 = \frac14 \cdot ((0, 1)_5 + (0, -1)_5 + (1, 0)_5 + (-1, 0)_5)</cmath>
+Notice that by symmetry, <math>(0, 1)_5 = (0, -1)_5 = (1, 0)_5 = (-1, 0)_5</math>, so the equation simplifies to
+<cmath>(0, 0)_6 = (0, 1)_5</cmath>
+We now expand <math>(0, 1)_5</math>.
+<cmath>(0, 1)_5 = \frac14 \cdot ((0, 0)_4 + (0, 2)_4 + 2(1, 1)_4)</cmath>
+First, we find <math>(0, 0)_4</math>.
+<cmath>(0, 0)_4 = (0, 1)_3</cmath>
+<cmath>(0, 1)_3 = \frac14 \cdot ((0, 0)_2 + (0, 2)_2 + 2(1, 1)_2)</cmath>
+At this point, we can just count the possibilities to find <math>(0, 0)_2 = \frac34</math>, <math>(0, 2)_2 = \frac{7}{16}</math>, and <math>(1, 1)_2 = \frac58</math>. Therefore,
+<cmath>(0, 1)_3 = \frac14 \cdot (\frac34 + \frac{7}{16} + 2 \cdot \frac58)</cmath>
+<cmath>(0, 1)_3 = \frac{39}{64}</cmath>
+Next, we find <math>(0, 2)_4</math>.
+<cmath>(0, 2)_4 = \frac14 \cdot ((0, 1)_3 + (0, 3)_3 + 2(1, 2)_3)</cmath>
+We already calculated <math>(0, 1)_3</math>, so we just need to find <math>(0, 3)_3</math> and <math>(1, 2)_3</math>
+<cmath>(0, 3)_3 = \frac14 \cdot ((0, 2)_2 + (0, 4)_2 + 2(1, 3)_2)</cmath>
+<cmath>(0, 3)_3 = \frac14 \cdot (\frac{7}{16} + 0 + 2 \cdot \frac{1}{4})</cmath>
+<cmath>(0, 3)_3 = \frac{15}{64}</cmath>
+<cmath>(1, 2)_3 = \frac14 \cdot ((1, 3)_2 + (1, 1)_2 + (0, 2)_2 + (2, 2)_2)</cmath>
+<cmath>(1, 2)_3 = \frac14 \cdot (\frac14 + \frac58 + \frac{7}{16} + \frac12)</cmath>
+<cmath>(1, 2)_3 = \frac{29}{64}</cmath>
+Therefore,
+<cmath>(0, 2)_4 = \frac14 \cdot (\frac{39}{64} + \frac{15}{64} + 2 \cdot \frac{29}{64})</cmath>
+<cmath>(0, 2)_4 = \frac{7}{16}</cmath>
+Finally, we find <math>(1, 1)_4</math>.
+<cmath>(1, 1)_4 = \frac12 \cdot ((0, 1)_3 + (1, 2)_3)</cmath>
+<cmath>(1, 1)_4 = \frac12 \cdot (\frac{39}{64} + \frac{29}{64})</cmath>
+<cmath>(1, 1)_4 = \frac{17}{32}</cmath>
+Putting it all together,
+<cmath>(0, 0)_6 = (0, 1)_5 =\frac14 \cdot (\frac{39}{64} + \frac{7}{16} + 2 \cdot \frac{17}{32})</cmath>
+<cmath>(0, 0)_6 = \frac{135}{256}</cmath>
+Thus, the answer is <math>135 + 256 = \boxed{391}</math>.
-Now, we use multinomials and do the arithmetic:
+==Solution 5 (Generating Functions)==
-<cmath>{6\choose 3} * 2 + 6!/(2!2!) * 2 + 6!/(2!2!) * 2 + 6C3 * 2 = 2(20 + 180 + 180 + 20) = 800</cmath>
+For any point <math>(x,y)</math> on the coordinate plane, we can represent it as the term <math>a^xb^y</math>. Then, moving right is equivalent to multiplying by <math>a</math>, moving left is equivalent to multiplying by <math>1/a</math>, and similarly for up/down with <math>b</math> and <math>1/b</math>. Because, on every move, the possibilities are these four directions, and each is equally likely, each move can be represented by multiplying by <math>a+\frac{1}{a}+b+\frac{1}{b}</math>. Thus, the possibilities after <math>6</math> moves are the same as the coefficients of <math>\left(a+\frac{1}{a}+b+\frac{1}{b}\right)^6</math>. By symmetry, we just need to find the number of ways for the token to reach <math>(0,0),(1,1),(2,2),\text{ and }(3,3)</math>. By the multinomial theorem, the coefficient of <math>a^3b^3</math> is <math>\binom{6}{3,3}=20</math>. Similarly, the coefficient of <math>a^2b^2</math> is <math>2\binom{6}{3,2,1}=120</math>. The coefficient of <math>ab</math> is <math>\binom{6}{2,2,1,1}+2\binom{6}{3,2,1}=300</math>. Finally, the constant term is <math>2\binom{6}{2,2,1,1}+2\binom{6}{3,3}=400</math>. Because the total number of possibilities is <math>4^6</math>, the probability is
-<cmath>6!/(3!2!) * 2 + 6!/(2!2!) + 6!/(3!2!)) * 2 = 120 + 180 + 120 = 420 (x2)</cmath>
+<cmath>\frac{4(20+120+300)+400}{4^6}=\frac{5+30+75+25}{4^4}=\frac{135}{256},</cmath>
-<cmath>6!/(3!2!) * 2 + 6!/(3!2!) * 2 = 120 + 120 = 240 (x2)</cmath>
+and the answer is <math>391</math>.
-<cmath>{6\choose 3} = 20 (x2)</cmath>
+--brainiacmaniac31
-Thus, there are 800 + 840 + 480 + 40 = 2160 cases. Because there is <math>4^6</math> total cases, the answer is <math>\frac{2160}{4^6} = \frac{135}{256}</math>, so the answer is <math>\boxed{391}</math>.
 == See also ==
 {{AIME box|year=2014|n=I|num-b=10|num-a=12}}
 {{MAA Notice}}

2014 AIME I (Problems • Answer Key • Resources)
Preceded by Problem 10	Followed by Problem 12
1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15
All AIME Problems and Solutions

Page

Toolbox

Search