Difference between revisions of "2019 AMC 8 Problems/Problem 1"
(→Problem 1) |
(→Solution 1) |
||
Line 1: | Line 1: | ||
− | |||
− | |||
− | |||
− | |||
− | |||
== Solution 2 (Using Algebra) == | == Solution 2 (Using Algebra) == | ||
Let <math>s</math> be the number of sandwiches and <math>d</math> be the number of sodas. We have to satisfy the equation of | Let <math>s</math> be the number of sandwiches and <math>d</math> be the number of sodas. We have to satisfy the equation of |
Revision as of 18:27, 6 November 2020
Solution 2 (Using Algebra)
Let be the number of sandwiches and
be the number of sodas. We have to satisfy the equation of
In the question, it states that Ike and Mike buys as many sandwiches as possible.
So, we drop the number of sodas for a while.
We have:
We don't want a remainder so the maximum number of sandwiches is
.
The total money spent is
.
The number of dollar left to spent on sodas is
dollars.
dollars can buy
sodas leading us to a total of
items.
Hence, the answer is
-by interactivemath
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 |
The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions.