Difference between revisions of "2020 AMC 8 Problems/Problem 8"
(→Video Solution (CREATIVE THINKING!!!)) |
(→Solution 2) |
||
| Line 9: | Line 9: | ||
==Solution 2== | ==Solution 2== | ||
Suppose Ricardo has <math>p</math> pennies, so then he has <math>(2020-p)</math> nickels. In order to have at least one penny and at least one nickel, we require <math>p \geq 1</math> and <math>2020 - p \geq 1</math>, i.e. <math>1 \leq p \leq 2019</math>. The number of cents he has is <math>p+5(2020-p) = 10100-4p</math>, so the maximum is <math>10100-4 \cdot 1</math> and the minimum is <math>10100 - 4 \cdot 2019</math>, and the difference is therefore <cmath>(10100 - 4\cdot 1) - (10100 - 4\cdot 2019) = 4\cdot 2019 - 4 = 4\cdot 2018 = \boxed{\textbf{(C) }8072}</cmath> | Suppose Ricardo has <math>p</math> pennies, so then he has <math>(2020-p)</math> nickels. In order to have at least one penny and at least one nickel, we require <math>p \geq 1</math> and <math>2020 - p \geq 1</math>, i.e. <math>1 \leq p \leq 2019</math>. The number of cents he has is <math>p+5(2020-p) = 10100-4p</math>, so the maximum is <math>10100-4 \cdot 1</math> and the minimum is <math>10100 - 4 \cdot 2019</math>, and the difference is therefore <cmath>(10100 - 4\cdot 1) - (10100 - 4\cdot 2019) = 4\cdot 2019 - 4 = 4\cdot 2018 = \boxed{\textbf{(C) }8072}</cmath> | ||
| + | |||
| + | ==Video Solution (🚀Very Fast🚀)== | ||
| + | https://youtu.be/SkEGB5NSjxU | ||
| + | |||
| + | ~Education, the Study of Everything | ||
==Video Solution by North America Math Contest Go Go Go== | ==Video Solution by North America Math Contest Go Go Go== | ||
Revision as of 16:48, 29 July 2023
Contents
Problem
Ricardo has 
coins, some of which are pennies (
-cent coins) and the rest of which are nickels (
-cent coins). He has at least one penny and at least one nickel. What is the difference in cents between the greatest possible and least amounts of money that Ricardo can have?
Solution 1
Clearly, the amount of money Ricardo has will be maximized when he has the maximum number of nickels. Since he must have at least one penny, the greatest number of nickels he can have is 
, giving a total of 
cents. Analogously, the amount of money he has will be least when he has the greatest number of pennies; as he must have at least one nickel, the greatest number of pennies he can have is also , giving him a total of 
cents. Hence the required difference is ![\[(2019\cdot 5 + 1)-(2019\cdot 1 + 5)=2019\cdot 4-4=4\cdot 2018=\boxed{\textbf{(C) }8072}\]](http://latex.artofproblemsolving.com/7/a/a/7aad883b32b506008cba937df84f736d314828c0.png)
Solution 2
Suppose Ricardo has 
pennies, so then he has 
nickels. In order to have at least one penny and at least one nickel, we require 
and 
, i.e. 
. The number of cents he has is 
, so the maximum is 
and the minimum is 
, and the difference is therefore ![\[(10100 - 4\cdot 1) - (10100 - 4\cdot 2019) = 4\cdot 2019 - 4 = 4\cdot 2018 = \boxed{\textbf{(C) }8072}\]](http://latex.artofproblemsolving.com/6/8/6/68604d817623e85842cbf1a05bab0254725f67d3.png)
Video Solution (🚀Very Fast🚀)
~Education, the Study of Everything
Video Solution by North America Math Contest Go Go Go
https://www.youtube.com/watch?v=w4S6K9XbHJg
~North America Math Contest Go Go Go
Video Solution by WhyMath
~savannahsolver
Video Solution
Video Solution by Interstigation
https://youtu.be/YnwkBZTv5Fw?t=300
~Interstigation
Video Solution by STEMbreezy
https://youtu.be/U27z1hwMXKY?list=PLFcinOE4FNL0TkI-_yKVEYyA_QCS9mBNS&t=181
~STEMbreezy
See also
| 2020 AMC 8 (Problems • Answer Key • Resources) | ||
| Preceded by Problem 7 |
Followed by Problem 9 | |
| 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. 
