2021 JMPSC Problems/Problem 2

Revision as of 19:23, 10 July 2021 by Mathdreams (talk | contribs)

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 $\text{$ (Error compiling LaTeX. Unknown error_msg)}2.78$?

== Solution ==

To minimize the number of coins, we need to maximize the amount of high-valued coins we use. 11 quarters are worth$ (Error compiling LaTeX. Unknown error_msg)\text{$}2.75$ (Error compiling LaTeX. Unknown error_msg), which is the most quarters we can use to get a value less than or equal to $\text{$ (Error compiling LaTeX. Unknown error_msg)}2.78$. Finally, we can add 3 pennies to get a total of$\text{$}2.87$ (Error compiling LaTeX. Unknown error_msg), so the answer is $11+3=14$.