Difference between revisions of "2020 AMC 8 Problems/Problem 21"
Scrabbler94 (talk | contribs) (clarify solution 1) |
(→Video Solution by North America Math Contest Go Go Go) |
||
(36 intermediate revisions by 17 users not shown) | |||
Line 1: | Line 1: | ||
− | ==Problem | + | ==Problem== |
A game board consists of <math>64</math> squares that alternate in color between black and white. The figure below shows square <math>P</math> in the bottom row and square <math>Q</math> in the top row. A marker is placed at <math>P.</math> A step consists of moving the marker onto one of the adjoining white squares in the row above. How many <math>7</math>-step paths are there from <math>P</math> to <math>Q?</math> (The figure shows a sample path.) | A game board consists of <math>64</math> squares that alternate in color between black and white. The figure below shows square <math>P</math> in the bottom row and square <math>Q</math> in the top row. A marker is placed at <math>P.</math> A step consists of moving the marker onto one of the adjoining white squares in the row above. How many <math>7</math>-step paths are there from <math>P</math> to <math>Q?</math> (The figure shows a sample path.) | ||
Line 7: | Line 7: | ||
<math>\textbf{(A) }28 \qquad \textbf{(B) }30 \qquad \textbf{(C) }32 \qquad \textbf{(D) }33 \qquad \textbf{(E) }35</math> | <math>\textbf{(A) }28 \qquad \textbf{(B) }30 \qquad \textbf{(C) }32 \qquad \textbf{(D) }33 \qquad \textbf{(E) }35</math> | ||
+ | ==Solution 1== | ||
+ | Notice that, in order to step onto any particular white square, the marker must have come from one of the <math>1</math> or <math>2</math> white squares immediately beneath it (since the marker can only move on white squares). This means that the number of ways to move from <math>P</math> to that square is the sum of the numbers of ways to move from <math>P</math> to each of the white squares immediately beneath it. To solve the problem, we can accordingly construct the following diagram, where each number in a square is calculated as the sum of the numbers on the white squares immediately beneath that square (and thus will represent the number of ways to remove from <math>P</math> to that square, as already stated). | ||
− | |||
− | |||
<asy> | <asy> | ||
int N = 7; | int N = 7; | ||
Line 38: | Line 38: | ||
label("$28$", (6.5, 7.5)); | label("$28$", (6.5, 7.5)); | ||
</asy> | </asy> | ||
− | + | ||
− | + | The answer is therefore <math>\boxed{\textbf{(A) }28}</math>. | |
==Solution 2== | ==Solution 2== | ||
− | Suppose we "extend" the chessboard | + | Suppose we "extend" the chessboard infinitely with <math>2</math> additional columns to the right, as shown below. The red line shows the right-hand edge of the original board. |
<asy> | <asy> | ||
Line 60: | Line 60: | ||
label("$Y$", (8.5,5.5)); | label("$Y$", (8.5,5.5)); | ||
</asy> | </asy> | ||
− | |||
− | ==See also== | + | The total number of paths from <math>P</math> to <math>Q</math>, including invalid paths which cross over the red line, is then the number of paths which make <math>4</math> steps up-and-right and <math>3</math> steps up-and-left, which is <math>\binom{4+3}{3} = \binom{7}{3} = 35</math>. We need to subtract the number of invalid paths, i.e. the number of paths that pass through <math>X</math> or <math>Y</math>. To get to <math>X</math>, the marker has to make <math>3</math> up-and-right steps, after which it can proceed to <math>Q</math> with <math>3</math> steps up-and-left and <math>1</math> step up-and-right. Thus, the number of paths from <math>P</math> to <math>Q</math> that pass through <math>X</math> is <math>1 \cdot \binom{3+1}{3} = 4</math>. Similarly, the number of paths that pass through <math>Y</math> is <math>\binom{4+1}{1}\cdot 1 = 5</math>. However, we have now double-counted the invalid paths which pass through both <math>X</math> and <math>Y</math>; from the diagram, it is clear that there are only <math>2</math> of these (as the marker can get from <math>X</math> to <math>Y</math> by a step up-and-left and a step-up-and-right in either order). Hence the number of invalid paths is <math>4+5-2=7</math>, and the number of valid paths from <math>P</math> to <math>Q</math> is <math>35-7 = \boxed{\textbf{(A) }28}</math>. |
+ | |||
+ | ==Solution 3== | ||
+ | On any white square, we may choose to go left or right, as long as we do not cross over the border of the board. Call the moves <math>L</math> and <math>R</math> respectively. Every single legal path consists of <math>4</math> <math>R's</math> and <math>3</math> <math>L's</math>, so now all we have to find is the number of ways to order <math>4 R's</math> and <math>3 L's</math> in any way, which is <math>{7 \choose 3}=35</math>. However, we originally promised that we will not go over the border, and now we have to subtract the paths that do go over the border. The paths that go over the border are any paths that start with RRR(1 path), RR(5 paths) and LRRR(1 path) so our final number of paths is <math>35-7=\boxed{(A)=28}.</math> | ||
+ | ~PEKKA | ||
+ | |||
+ | ==Solution 4: Intuitive Approach== | ||
+ | |||
+ | We label the rows starting from the bottom. At row 1, there is <math>1</math> way: at P. We draw all the possible ways to get to Q. There are two ways to choose for row 2, and another two ways to choose for row 3. However, you can go to the "edge" or the farthest possible square westward of Q, so you can't multiply by 2 again. Notice how, at the first step, we figured that the answer was even, so choice D and E are eliminated, and after the second row, we realized it must be a multiple of 4, so choice B is eliminated. When we get to the fourth row, we do not multiply by 2 again, since we have limited possibilities rather than multiplying by 2 again. Choice C implies that there are two possibilities per row; however, we know that if you go to the farthest possible, you only have one possibility, so it is not <math>2^5 = 32</math> so we know that the answer is choice <math>\boxed{\textbf{(A)}}</math>. | ||
+ | ~hh99754539 | ||
+ | |||
+ | |||
+ | |||
+ | ==Video Solution by MathisCool== | ||
+ | |||
+ | https://www.youtube.com/watch?v=LvpCYn8Ze6c | ||
+ | |||
+ | |||
+ | ==Video Solution by North America Math Contest Go Go Go== | ||
+ | |||
+ | https://www.youtube.com/watch?v=rWxhlItMAN0 | ||
+ | |||
+ | ~North America Math Contest Go Go Go | ||
+ | |||
+ | ==Video Solution by WhyMath== | ||
+ | https://youtu.be/YR3oghbziBA | ||
+ | |||
+ | ~savannahsolver | ||
+ | |||
+ | ==Video Solutions== | ||
+ | https://youtu.be/hGCxt8G9g-s | ||
+ | |||
+ | ==Video Solution by Interstigation== | ||
+ | https://youtu.be/YnwkBZTv5Fw?t=1247 | ||
+ | |||
+ | ~Interstigation | ||
+ | |||
+ | ==See also== | ||
{{AMC8 box|year=2020|num-b=20|num-a=22}} | {{AMC8 box|year=2020|num-b=20|num-a=22}} | ||
{{MAA Notice}} | {{MAA Notice}} |
Latest revision as of 19:17, 30 January 2022
Contents
Problem
A game board consists of squares that alternate in color between black and white. The figure below shows square in the bottom row and square in the top row. A marker is placed at A step consists of moving the marker onto one of the adjoining white squares in the row above. How many -step paths are there from to (The figure shows a sample path.)
Solution 1
Notice that, in order to step onto any particular white square, the marker must have come from one of the or white squares immediately beneath it (since the marker can only move on white squares). This means that the number of ways to move from to that square is the sum of the numbers of ways to move from to each of the white squares immediately beneath it. To solve the problem, we can accordingly construct the following diagram, where each number in a square is calculated as the sum of the numbers on the white squares immediately beneath that square (and thus will represent the number of ways to remove from to that square, as already stated).
The answer is therefore .
Solution 2
Suppose we "extend" the chessboard infinitely with additional columns to the right, as shown below. The red line shows the right-hand edge of the original board.
The total number of paths from to , including invalid paths which cross over the red line, is then the number of paths which make steps up-and-right and steps up-and-left, which is . We need to subtract the number of invalid paths, i.e. the number of paths that pass through or . To get to , the marker has to make up-and-right steps, after which it can proceed to with steps up-and-left and step up-and-right. Thus, the number of paths from to that pass through is . Similarly, the number of paths that pass through is . However, we have now double-counted the invalid paths which pass through both and ; from the diagram, it is clear that there are only of these (as the marker can get from to by a step up-and-left and a step-up-and-right in either order). Hence the number of invalid paths is , and the number of valid paths from to is .
Solution 3
On any white square, we may choose to go left or right, as long as we do not cross over the border of the board. Call the moves and respectively. Every single legal path consists of and , so now all we have to find is the number of ways to order and in any way, which is . However, we originally promised that we will not go over the border, and now we have to subtract the paths that do go over the border. The paths that go over the border are any paths that start with RRR(1 path), RR(5 paths) and LRRR(1 path) so our final number of paths is ~PEKKA
Solution 4: Intuitive Approach
We label the rows starting from the bottom. At row 1, there is way: at P. We draw all the possible ways to get to Q. There are two ways to choose for row 2, and another two ways to choose for row 3. However, you can go to the "edge" or the farthest possible square westward of Q, so you can't multiply by 2 again. Notice how, at the first step, we figured that the answer was even, so choice D and E are eliminated, and after the second row, we realized it must be a multiple of 4, so choice B is eliminated. When we get to the fourth row, we do not multiply by 2 again, since we have limited possibilities rather than multiplying by 2 again. Choice C implies that there are two possibilities per row; however, we know that if you go to the farthest possible, you only have one possibility, so it is not so we know that the answer is choice . ~hh99754539
Video Solution by MathisCool
https://www.youtube.com/watch?v=LvpCYn8Ze6c
Video Solution by North America Math Contest Go Go Go
https://www.youtube.com/watch?v=rWxhlItMAN0
~North America Math Contest Go Go Go
Video Solution by WhyMath
~savannahsolver
Video Solutions
Video Solution by Interstigation
https://youtu.be/YnwkBZTv5Fw?t=1247
~Interstigation
See also
2020 AMC 8 (Problems • Answer Key • Resources) | ||
Preceded by Problem 20 |
Followed by Problem 22 | |
1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15 • 16 • 17 • 18 • 19 • 20 • 21 • 22 • 23 • 24 • 25 | ||
All AJHSME/AMC 8 Problems and Solutions |
The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions.