Difference between revisions of "2017 AMC 8 Problems/Problem 15"
(Added solution 4) |
m (→Solution 3) |
||
| Line 19: | Line 19: | ||
There are 8 paths for each kind of path, making for <math>8 \cdot 3=\boxed{\textbf{(D)}\ 24}</math> paths. | There are 8 paths for each kind of path, making for <math>8 \cdot 3=\boxed{\textbf{(D)}\ 24}</math> paths. | ||
| − | ==Solution 3== | + | ==Solution 3(easy and recommended)== |
Notice that the <math>A</math> is adjacent to <math>4</math> <math>M</math>s, each <math>M</math> is adjacent to <math>3</math> <math>C</math>s, and each <math>C</math> is adjacent to <math>2</math> <math>8</math>'s. So for each <math>A</math>, there are <math>4</math> <math>M</math>s, and for each <math>M</math>, there are <math>3</math> <math>C</math>s, and for each <math>C</math>, there are <math>2</math> <math>8</math>s. Thus, the answer is <math>1\cdot 4\cdot 3\cdot 2 = \boxed{\textbf{(D)}\ 24}.</math> | Notice that the <math>A</math> is adjacent to <math>4</math> <math>M</math>s, each <math>M</math> is adjacent to <math>3</math> <math>C</math>s, and each <math>C</math> is adjacent to <math>2</math> <math>8</math>'s. So for each <math>A</math>, there are <math>4</math> <math>M</math>s, and for each <math>M</math>, there are <math>3</math> <math>C</math>s, and for each <math>C</math>, there are <math>2</math> <math>8</math>s. Thus, the answer is <math>1\cdot 4\cdot 3\cdot 2 = \boxed{\textbf{(D)}\ 24}.</math> | ||
Revision as of 04:39, 15 January 2023
Contents
Problem
In the arrangement of letters and numerals below, by how many different paths can one spell AMC8? Beginning at the A in the middle, a path only allows moves from one letter to an adjacent (above, below, left, or right, but not diagonal) letter. One example of such a path is traced in the picture.
![[asy] fill((0.5, 4.5)--(1.5,4.5)--(1.5,2.5)--(0.5,2.5)--cycle,lightgray); fill((1.5,3.5)--(2.5,3.5)--(2.5,1.5)--(1.5,1.5)--cycle,lightgray); label("$8$", (1, 0)); label("$C$", (2, 0)); label("$8$", (3, 0)); label("$8$", (0, 1)); label("$C$", (1, 1)); label("$M$", (2, 1)); label("$C$", (3, 1)); label("$8$", (4, 1)); label("$C$", (0, 2)); label("$M$", (1, 2)); label("$A$", (2, 2)); label("$M$", (3, 2)); label("$C$", (4, 2)); label("$8$", (0, 3)); label("$C$", (1, 3)); label("$M$", (2, 3)); label("$C$", (3, 3)); label("$8$", (4, 3)); label("$8$", (1, 4)); label("$C$", (2, 4)); label("$8$", (3, 4));[/asy]](http://latex.artofproblemsolving.com/c/3/b/c3b81f82e730c8fce3fba2c0d1e893252c432d58.png)
Solution 1 (Not Very Efficient)
Notice that the upper-most section contains a 3 by 3 square that looks like:
![[asy]label("$8$", (1, 2)); label("$C$", (2, 2)); label("$8$", (3, 2)); label("$C$", (1, 1)); label("$M$", (2, 1)); label("$C$", (3, 1)); label("$M$", (1, 0)); label("$A$", (2, 0)); label("$M$", (3, 0));[/asy]](http://latex.artofproblemsolving.com/4/e/7/4e757a2a293bbc0f2888163537a04662facfe134.png)
It has 6 paths in which you can spell out AMC8. You will find four identical copies of this square in the figure, so multiply 
to get 
total paths.
Solution 2
There are three different kinds of paths that are on this diagram. The first kind is when you directly count 
, 
, 
in a straight line. The second is when you count , turn left or right to get , then go up or down to count 
and . The third is the one where you start with , move up or down to count , turn left or right to count , then move straight again to get .
There are 8 paths for each kind of path, making for 
paths.
Solution 3(easy and recommended)
Notice that the is adjacent to 
s, each is adjacent to 
s, and each is adjacent to 
's. So for each , there are s, and for each , there are s, and for each , there are s. Thus, the answer is 
Solution 4
We can do this problem by computing how many ways there are to get to each letter (in order). There is 
way to get to the in the center. We can only get to each of the other s by going there from the , so there is way to get to each of the four s. For the s, we notice that four s are surrounded by one , and four s are surrounded by two s. Finally, each of the s is surrounded by one with one way to get there and one with two ways to get there. Therefore, there are three paths to any of the s. Since there are eight s, the answer is 
Video Solution
~savannahsolver
See Also
| 2017 AMC 8 (Problems • Answer Key • Resources) | ||
| Preceded by Problem 14 |
Followed by Problem 16 | |
| 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. 
