Difference between revisions of "2024 AIME I Problems/Problem 6"

Revision as of 09:44, 10 February 2024

Problem

Consider the paths of length $16$ that follow the lines from the lower left corner to the upper right corner on an $8\times 8$ grid. Find the number of such paths that change direction exactly four times, as in the examples shown below.

$[asy] size(10cm); usepackage("tikz");label("\begin{tikzpicture}[scale=.5]\draw(0,0)grid(8,8);\draw[line width=2,red](0,0)--(2,0)--(2,3)--(5,3)--(5,8)--(8,8);\end{tikzpicture}",origin); label("\begin{tikzpicture}[scale=.5]\draw(0,0)grid(8,8);\draw[line width=2,red](0,0)--(0,3)--(3,3)--(3,5)--(8,5)--(8,8);\end{tikzpicture}",E); [/asy]$

Solution 1

We divide the path into eight “ $R$ ” movements and eight “ $U$ ” movements. Five sections of alternative $RURUR$ or $URURU$ are necessary in order to make four “turns.” We use the first case and multiply by $2$ .

For $U$ , we have seven ordered pairs of positive integers $(a,b)$ such that $a+b=8$ .

For $R$ , we subtract $1$ from each section (to make the minimum stars of each section $0$ ) and we use Stars and Bars to get ${7 \choose 5}=21$ .

Thus our answer is $7\cdot21\cdot2=\boxed{294}$ .

~eevee9406

Solution 2

Draw a few examples of the path. However, notice one thing in common - if the path starts going up, there will be 3 "segments" where the path goes up, and two horizontal "segments." Similarly, if the path starts going horizontally, we will have three horizontal segments and two vertical segments. Those two cases are symmetric, so we only need to consider one. If our path starts going up, by stars and bars, we can have $\binom{7}{2}$ ways to split the 8 up's into 3 lengths, and have $\binom{7}{1}$ to split the 8-horizontals into 2 lengths. We multiply them together, and multiply by 2 for symmetry, giving us $2*\binom{7}{2}*\binom{7}{1}=294.$

~nathan27 (original by alexanderruan)

Solution 3

Notice that the $RURUR$ case and the $URURU$ case is symmetrical. WLOG, let's consider the RURUR case.

Now notice that there is a one-to-one correspondence between this problem and the number of ways to distribute 8 balls into 3 boxes and also 8 other balls into 2 other boxes, such that each box has a nonzero amount of balls.

There are ${8+2-3 \choose 2}$ ways for the first part, and ${8+1-2 \choose 1}$ ways for the second part, by stars and bars.

The answer is $2\cdot {7 \choose 2} \cdot {7 \choose 1} = \boxed{294}$ .

~northstar47

Feel free to edit this solution

Solution 4

Starting at the origin, you can either first go up or to the right. If you go up first, you will end on the side opposite to it (the right side) and if you go right first, you will end up on the top. It can then be observed that if you choose the turning points in the middle $7 \times 7$ grid, that will automatically determine your start and ending points. For example, in the diagram if you choose the point $(3,2)$ and $(5,3)$ , you must first move three up or two right, determining your first point, and move 5 up or 3 right, determining your final point. Knowing this is helpful because if we first move anywhere horizontally, we have $7$ points on each column to choose from and starting from left to right, we have $6,5,4,3,2,1$ points on that row to choose from. This gives us $7(6)+7(5)+7(4)+7(3)+7(2)+7(1)$ which simplifies to $7\cdot21$ . The vertical case is symmetrical so we have $7\cdot21\cdot2 = \boxed{294}$

~KEVIN_LIU

Solution 5

As in Solution 1, there are two cases: $RURUR$ or $URURU$ . We will work with the first case and multiply by $2$ at the end. We use stars and bars; we can treat the $R$ s as the stars and the $U$ s as the bars. However, we must also use stars and bars on the $U$ s to see how many different patterns of bars we can create for the reds. We must have $1$ bar in $8$ blacks, so we use stars and bars on the equation $x + y = 8$ . However, each divider must have at least one black in it, so we do the change of variable $x' = x-1$ and $y' = x-1$ . Our equation becomes $x' + y' = 6$ . By stars and bars, this equation has $\binom{6 + 2 - 1}{1} = 7$ valid solutions. Now, we use stars and bars on the reds. We must distribute two bars amongst the reds, so we apply stars and bars to $x + y + z = 8$ . Since each group must have one red, we again do a change of variables with $x' = x-1$ , $y' = y-1$ , and $z' = z-1$ . We are now working on the equation $x' + y' + z' = 5$ . By stars and bars, this has $\binom{5 + 3 - 1}{2} = 21$ solutions. The number of valid paths in this case is the number of ways to create the bars times the number of valid arrangements of the stars given fixed bars, which equals $21 \cdot 7 = 147$ . We must multiply by two to account for both cases, so our final answer is $147 \cdot 2 = \boxed{294}$ .

~ cxsmi

Video Solution

https://youtu.be/6QIP4_EYZcM

~Steven Chen (Professor Chen Education Palace, www.professorchenedu.com)

Fast Video Solution (no stars and bars)

https://youtu.be/BGyRj4yZoAI ~Anton Levonian (Do Math or Go Home)

@@ Line 1: / Line 1: @@
 ==Problem==
-Consider the paths of length <math>16</math> that follow the lines from the lower left corner to the upper right corner on an <math>8 \times 8</math> grid. Find the number of such paths that change direction exactly four times.
+Consider the paths of length <math>16</math> that follow the lines from the lower left corner to the upper right corner on an <math>8\times 8</math> grid. Find the number of such paths that change direction exactly four times, as in the examples shown below.
 <asy>
@@ Line 22: / Line 22: @@
 ==Solution 2==
-The path can either start by going up or start by going right. Suppose it starts by going up. After a while, it will turn to the right. Then, it will go up. After that, it will go right again. There are <math>7</math> ways to choose when it will go up in the middle of the path and there are <math>\binom{7}{2}=21</math> to choose the two places it will go right. Thus, there are <math>7\cdot21=147</math> ways to create a path that starts by going up. By symmetry, this is the same as the number of paths that start by going right, so the answer is <math>147\cdot2=\boxed{294}</math>
+Draw a few examples of the path. However, notice one thing in common - if the path starts going up, there will be 3 "segments" where the path goes up, and two horizontal "segments." Similarly, if the path starts going horizontally, we will have three horizontal segments and two vertical segments. Those two cases are symmetric, so we only need to consider one. If our path starts going up, by stars and bars, we can have <math>\binom{7}{2}</math> ways to split the 8 up's into 3 lengths, and have <math>\binom{7}{1}</math> to split the 8-horizontals into 2 lengths. We multiply them together, and multiply by 2 for symmetry, giving us <math>2*\binom{7}{2}*\binom{7}{1}=294.</math>
-~alexanderruan
+~nathan27 (original by alexanderruan)
 ==Solution 3==
@@ Line 38: / Line 38: @@
 Feel free to edit this solution
+==Solution 4==
+Starting at the origin, you can either first go up or to the right. If you go up first, you will end on the side opposite to it (the right side) and if you go right first, you will end up on the top. It can then be observed that if you choose the turning points in the middle <math>7 \times 7</math> grid, that will automatically determine your start and ending points. For example, in the diagram if you choose the point <math>(3,2)</math> and <math>(5,3)</math>, you must first move three up or two right, determining your first point, and move 5 up or 3 right, determining your final point. Knowing this is helpful because if we first move anywhere horizontally, we have <math>7</math> points on each column to choose from and starting from left to right, we have <math>6,5,4,3,2,1</math> points on that row to choose from. This gives us <math>7(6)+7(5)+7(4)+7(3)+7(2)+7(1)</math> which simplifies to <math>7\cdot21</math>. The vertical case is symmetrical so we have <math>7\cdot21\cdot2 = \boxed{294}</math>
+~KEVIN_LIU
+==Solution 5==
+As in Solution 1, there are two cases: <math>RURUR</math> or <math>URURU</math>. We will work with the first case and multiply by <math>2</math> at the end. We use stars and bars; we can treat the <math>R</math>s as the stars and the <math>U</math>s as the bars. However, we must also use stars and bars on the <math>U</math>s to see how many different patterns of bars we can create for the reds. We must have <math>1</math> bar in <math>8</math> blacks, so we use stars and bars on the equation <cmath>x + y = 8</cmath>. However, each divider must have at least one black in it, so we do the change of variable <math>x' = x-1</math> and <math>y' = x-1</math>. Our equation becomes <cmath>x' + y' = 6</cmath>. By stars and bars, this equation has <math>\binom{6 + 2 - 1}{1} = 7</math> valid solutions. Now, we use stars and bars on the reds. We must distribute two bars amongst the reds, so we apply stars and bars to <cmath>x + y + z = 8</cmath>. Since each group must have one red, we again do a change of variables with <math>x' = x-1</math>, <math>y' = y-1</math>, and <math>z' = z-1</math>. We are now working on the equation <cmath>x' + y' + z' = 5</cmath>. By stars and bars, this has <math>\binom{5 + 3 - 1}{2} = 21</math> solutions. The number of valid paths in this case is the number of ways to create the bars times the number of valid arrangements of the stars given fixed bars, which equals <math>21 \cdot 7 = 147</math>. We must multiply by two to account for both cases, so our final answer is <math>147 \cdot 2 = \boxed{294}</math>.
+~ [https://artofproblemsolving.com/wiki/index.php/User:Cxsmi cxsmi]
+==Video Solution==
+https://youtu.be/6QIP4_EYZcM
+~Steven Chen (Professor Chen Education Palace, www.professorchenedu.com)
+==Fast Video Solution (no stars and bars)==
+https://youtu.be/BGyRj4yZoAI
+~Anton Levonian (Do Math or Go Home)
 ==See also==

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

Page

Toolbox

Search