Difference between revisions of "2024 AMC 8 Problems/Problem 17"
(→Video Solution 3 by OmegaLearn.org) |
|||
| Line 5: | Line 5: | ||
(A) <math>20</math> (B) <math>24</math> (C) <math>27</math> (D) <math>28</math> (E) <math>32</math> | (A) <math>20</math> (B) <math>24</math> (C) <math>27</math> (D) <math>28</math> (E) <math>32</math> | ||
| − | ==Solution 1== | + | ==Solution 1== |
| − | Corners have 5 spots to go and 4 corners so 5 | + | Corners have <math>5</math> spots to go and <math>4</math> corners so <math>5 \times 4=20</math>. |
| − | Sides have 3 spots to go and 4 sides so 3 | + | Sides have <math>3</math> spots to go and <math>4</math> sides so <math>3 \times 4=12</math> |
| − | 20+12=32 in total. | + | <math>20+12=32</math> in total. |
| − | E | + | <math>\boxed{\textbf{(E)} 32)}</math> is the answer. |
| + | |||
| + | ~andliu766 | ||
==Video Solution 1 by Math-X (First understand the problem!!!)== | ==Video Solution 1 by Math-X (First understand the problem!!!)== | ||
Revision as of 18:19, 26 January 2024
Contents
Problem
A chess king is said to attack all the squares one step away from it, horizontally, vertically, or diagonally. For instance, a king on the center square of a 
x grid attacks all 
other squares, as shown below. Suppose a white king and a black king are placed on different squares of a x grid so that they do not attack each other. In how many ways can this be done?
(A) 
(B) 
(C) 
(D) 
(E) 
Solution 1
Corners have 
spots to go and 
corners so 
.
Sides have spots to go and sides so 
in total.
is the answer.
~andliu766
Video Solution 1 by Math-X (First understand the problem!!!)
~Math-X
