2020 AMC 8 Problems/Problem 21: Difference between revisions
SirCalcsALot (talk | contribs) |
|||
| Line 6: | Line 6: | ||
<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== | |||
We count paths. Noticing that we can only go along white squares, to get to a white square we can only go from the two whites beneath it. Here is a diagram: | |||
<asy> | |||
int N = 7; | |||
for (int i = 0; i < 8; ++i) { | |||
for (int j = 0; j < 8; ++j) { | |||
draw((i,j)--(i+1,j)--(i+1,j+1)--(i,j+1)--(i,j)); | |||
if ((i+j) % 2 == 0) { | |||
filldraw((i,j)--(i+1,j)--(i+1,j+1)--(i,j+1)--(i,j)--cycle,black); | |||
} | |||
} | |||
} | |||
label("$1$", (5.5, .5)); | |||
label("$1$", (4.5, 1.5)); | |||
label("$1$", (6.5, 1.5)); | |||
label("$1$", (3.5, 2.5)); | |||
label("$1$", (7.5, 2.5)); | |||
label("$2$", (5.5, 2.5)); | |||
label("$1$", (2.5, 3.5)); | |||
label("$3$", (6.5, 3.5)); | |||
label("$3$", (4.5, 3.5)); | |||
label("$4$", (3.5, 4.5)); | |||
label("$3$", (7.5, 4.5)); | |||
label("$6$", (5.5, 4.5)); | |||
label("$10$", (4.5, 5.5)); | |||
label("$9$", (6.5, 5.5)); | |||
label("$19$", (5.5, 6.5)); | |||
label("$9$", (7.5, 6.5)); | |||
label("$\boxed{\textbf{(A)}28}$", (6.5, 7.5)); | |||
</asy> | |||
~yofro (Diagram credits to franzliszt) | |||
==See also== | ==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}} | ||
Revision as of 01:27, 18 November 2020
Problem 21
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.)
![[asy]//diagram by SirCalcsALot size(200); int[] x = {6, 5, 4, 5, 6, 5, 6}; int[] y = {1, 2, 3, 4, 5, 6, 7}; int N = 7; for (int i = 0; i < 8; ++i) { for (int j = 0; j < 8; ++j) { draw((i,j)--(i+1,j)--(i+1,j+1)--(i,j+1)--(i,j)); if ((i+j) % 2 == 0) { filldraw((i,j)--(i+1,j)--(i+1,j+1)--(i,j+1)--(i,j)--cycle,black); } } } for (int i = 0; i < N; ++i) { draw(circle((x[i],y[i])+(0.5,0.5),0.35)); } label("$P$", (5.5, 0.5)); label("$Q$", (6.5, 7.5)); [/asy]](http://latex.artofproblemsolving.com/2/1/0/210b98fc88e4c297773b0400a31787193c0d4338.png)
Solution
We count paths. Noticing that we can only go along white squares, to get to a white square we can only go from the two whites beneath it. Here is a diagram:
int N = 7;
for (int i = 0; i < 8; ++i) {
for (int j = 0; j < 8; ++j) {
draw((i,j)--(i+1,j)--(i+1,j+1)--(i,j+1)--(i,j));
if ((i+j) % 2 == 0) {
filldraw((i,j)--(i+1,j)--(i+1,j+1)--(i,j+1)--(i,j)--cycle,black);
}
}
}
label("$1$", (5.5, .5));
label("$1$", (4.5, 1.5));
label("$1$", (6.5, 1.5));
label("$1$", (3.5, 2.5));
label("$1$", (7.5, 2.5));
label("$2$", (5.5, 2.5));
label("$1$", (2.5, 3.5));
label("$3$", (6.5, 3.5));
label("$3$", (4.5, 3.5));
label("$4$", (3.5, 4.5));
label("$3$", (7.5, 4.5));
label("$6$", (5.5, 4.5));
label("$10$", (4.5, 5.5));
label("$9$", (6.5, 5.5));
label("$19$", (5.5, 6.5));
label("$9$", (7.5, 6.5));
label("$\boxed{\textbf{(A)}28}$", (6.5, 7.5));
(Error making remote request. Unknown error_msg)
~yofro (Diagram credits to franzliszt)
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 | ||
These problems are copyrighted © by the Mathematical Association of America. 
