2010 AMC 8 Problems/Problem 7: Difference between revisions
No edit summary |
Basketball8 (talk | contribs) |
||
| Line 1: | Line 1: | ||
==Problem== | ==Problem== | ||
Using only pennies, nickels, dimes, and quarters, what is the smallest number of coins Freddie would need so he could pay any amount of money less than one dollar? | Using only pennies, nickels, dimes, and quarters, what is the smallest number of coins Freddie would need so he could pay any amount of money less than one dollar? | ||
< | <cmath> \textbf{(A)}\ 6\qquad\textbf{(B)}\ 10\qquad\textbf{(C)}\ 15\qquad\textbf{(D)}\ 25\qquad\textbf{(E)}\ 99 </cmath> | ||
==See Also== | ==See Also== | ||
{{AMC8 box|year=2010|num-b=6|num-a=8}} | {{AMC8 box|year=2010|num-b=6|num-a=8}} | ||
Revision as of 22:01, 12 November 2012
Problem
Using only pennies, nickels, dimes, and quarters, what is the smallest number of coins Freddie would need so he could pay any amount of money less than one dollar?
![\[\textbf{(A)}\ 6\qquad\textbf{(B)}\ 10\qquad\textbf{(C)}\ 15\qquad\textbf{(D)}\ 25\qquad\textbf{(E)}\ 99\]](http://latex.artofproblemsolving.com/c/7/4/c74f69083a8c7c1cf56dfc01f250e6c527b6baea.png)
See Also
| 2010 AMC 8 (Problems • Answer Key • Resources) | ||
| Preceded by Problem 6 |
Followed by Problem 8 | |
| 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 | ||
