Difference between revisions of "2021 JMPSC Sprint Problems/Problem 2"
| Line 8: | Line 8: | ||
-OofPirate | -OofPirate | ||
| + | |||
| + | |||
| + | ==See also== | ||
| + | #[[2021 JMPSC Sprint Problems|Other 2021 JMPSC Sprint Problems]] | ||
| + | #[[2021 JMPSC Sprint Answer Key|2021 JMPSC Sprint Answer Key]] | ||
| + | #[[JMPSC Problems and Solutions|All JMPSC Problems and Solutions]] | ||
| + | {{JMPSC Notice}} | ||
Revision as of 17:12, 11 July 2021
Problem
Brady has an unlimited supply of quarters ($0.25), dimes ($0.10), nickels ($0.05), and pennies ($0.01). What is the least number (quantity, not type) of coins Brady can use to pay off $
?
Solution
It is generally best to use the smallest number of coins with the most value, specifically the quarters, for taking away a big chunk of the problem. We are able to fit 
quarters, or 
into 
. That only leaves 
cents. We cannot put any nickels nor dimes, therefore we require three pennies to get a total of .
The least number of coins Brady can use to pay off will be 
coins.
-OofPirate
See also
The problems on this page are copyrighted by the Junior Mathematicians' Problem Solving Competition. 
