2019 AMC 8 Problems/Problem 1: Difference between revisions
| Line 1: | Line 1: | ||
==Problem | ==Problem 10000000== | ||
92697808740-837987605963075 | |||
<math>\textbf{(A) }6\qquad\textbf{(B) }7\qquaUFCYHI8VEd\textbf{(C) }8\qquad\textbf{(D) }9\qquad\textbf{(E) }10</math> | |||
<math>\textbf{(A) }6\qquad\textbf{(B) }7\ | |||
==Solution 1== | ==Solution 1== | ||
Revision as of 18:18, 3 April 2020
Problem 10000000
92697808740-837987605963075 $\textbf{(A) }6\qquad\textbf{(B) }7\qquaUFCYHI8VEd\textbf{(C) }8\qquad\textbf{(D) }9\qquad\textbf{(E) }10$ (Error compiling LaTeX. Unknown error_msg)
Solution 1
We maximize the number of sandwiches Mike and Ike can buy by finding the lowest multiple of 
that is less than 
This number is 
Therefore, they can buy 
sandwiches for 
They spend the remaining money on soft drinks, so they buy 
soft drinks.
Combining the items, Mike and Ike buy 
soft drinks.
The answer is 
See Also
| 2019 AMC 8 (Problems • Answer Key • Resources) | ||
| Preceded by First Problem |
Followed by Problem 2 | |
| 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. 
