Art of Problem Solving
AoPS Online
Math texts, online classes, and more
for students in grades 5-12.
Visit AoPS Online ‚
Books for Grades 5-12 Online Courses
Beast Academy
Engaging math books and online learning
for students ages 6-13.
Visit Beast Academy ‚
Books for Ages 6-13 Beast Academy Online
AoPS Academy
Small live classes for advanced math
and language arts learners in grades 2-12.
Visit AoPS Academy ‚
Find a Physical Campus Visit the Virtual Campus

Difference between revisions of "2020 AMC 8 Problems/Problem 8"

(→‎Solution 3 (Similar to the above 2))
(→‎Video Solution by Math-X (First understand the problem!!!))
 
(9 intermediate revisions by 6 users not shown)
Line 2: Line 2:
 
Ricardo has <math>2020</math> coins, some of which are pennies (<math>1</math>-cent coins) and the rest of which are nickels (<math>5</math>-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?
 
Ricardo has <math>2020</math> coins, some of which are pennies (<math>1</math>-cent coins) and the rest of which are nickels (<math>5</math>-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?
  
−
<math>\textbf{(A) }\text{8062} \qquad \textbf{(B) }\text{8068} \qquad \textbf{(C) }\text{8072} \qquad \textbf{(D) }\text{8076}\qquad \textbf{(E) }\text{8082}</math>
+
<math>\textbf{(A) }\text{806} \qquad \textbf{(B) }\text{8068} \qquad \textbf{(C) }\text{8072} \qquad \textbf{(D) }\text{8076}\qquad \textbf{(E) }\text{8082}</math>
  
 
==Solution 1==
 
==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 <math>2019</math>, giving a total of <math>(2019\cdot 5 + 1)</math> 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 <math>2019</math>, giving a total of <math>(2019\cdot 1 + 5)</math> cents. Hence the required difference is <cmath>(2019\cdot 5 + 1)-(2019\cdot 1 + 5)=2019\cdot 4-4=4\cdot 2018=\boxed{\textbf{(C) }8072}</cmath>
+
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 <math>2019</math>, giving a total of <math>(2019\cdot 5 + 1)</math> 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 <math>2019</math>, giving him a total of <math>(2019\cdot 1 + 5)</math> cents. Hence the required difference is <cmath>(2019\cdot 5 + 1)-(2019\cdot 1 + 5)=2019\cdot 4-4=4\cdot 2018=\boxed{\textbf{(C) }8072}</cmath>
  
 
==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 by NiuniuMaths (Easy to understand!)==
 +
https://www.youtube.com/watch?v=8hgK6rESdek&t=9s
 +
 +
~NiuniuMaths
 +
 +
==Video Solution by Math-X (First understand the problem!!!)==
 +
https://youtu.be/UnVo6jZ3Wnk?si=5OsfZIo0eURrtNri&t=845
 +
 +
~Math-X
 +
 +
==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==
Line 28: Line 43:
  
 
~Interstigation
 
~Interstigation
 +
 +
==Video Solution by STEMbreezy==
 +
https://youtu.be/U27z1hwMXKY?list=PLFcinOE4FNL0TkI-_yKVEYyA_QCS9mBNS&t=181
 +
 +
~STEMbreezy
  
 
==See also==  
 
==See also==  
 
{{AMC8 box|year=2020|num-b=7|num-a=9}}
 
{{AMC8 box|year=2020|num-b=7|num-a=9}}
 
{{MAA Notice}}
 
{{MAA Notice}}

Latest revision as of 06:17, 24 January 2024

Problem

Ricardo has $2020$ coins, some of which are pennies ($1$-cent coins) and the rest of which are nickels ($5$-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?

$\textbf{(A) }\text{806} \qquad \textbf{(B) }\text{8068} \qquad \textbf{(C) }\text{8072} \qquad \textbf{(D) }\text{8076}\qquad \textbf{(E) }\text{8082}$

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 $2019$, giving a total of $(2019\cdot 5 + 1)$ 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 $2019$, giving him a total of $(2019\cdot 1 + 5)$ 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}\]

Solution 2

Suppose Ricardo has $p$ pennies, so then he has $(2020-p)$ nickels. In order to have at least one penny and at least one nickel, we require $p \geq 1$ and $2020 - p \geq 1$, i.e. $1 \leq p \leq 2019$. The number of cents he has is $p+5(2020-p) = 10100-4p$, so the maximum is $10100-4 \cdot 1$ and the minimum is $10100 - 4 \cdot 2019$, and the difference is therefore \[(10100 - 4\cdot 1) - (10100 - 4\cdot 2019) = 4\cdot 2019 - 4 = 4\cdot 2018 = \boxed{\textbf{(C) }8072}\]

Video Solution by NiuniuMaths (Easy to understand!)

https://www.youtube.com/watch?v=8hgK6rESdek&t=9s

~NiuniuMaths

Video Solution by Math-X (First understand the problem!!!)

https://youtu.be/UnVo6jZ3Wnk?si=5OsfZIo0eURrtNri&t=845

~Math-X

Video Solution (🚀Very Fast🚀)

https://youtu.be/SkEGB5NSjxU

~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

https://youtu.be/OWNZBPIzQXQ

~savannahsolver

Video Solution

https://youtu.be/61c1MR9tne8

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. AMC logo.png

Retrieved from "https://artofproblemsolving.com/wiki/index.php?title=2020_AMC_8_Problems/Problem_8&oldid=212547"