Art of Problem Solving
During AMC 10A/12A testing, the AoPS Wiki is in read-only mode and no edits can be made.

2010 AMC 8 Problems/Problem 7: Difference between revisions

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 a dollar?  
<cmath> \textbf{(A)}\ 6\qquad\textbf{(B)}\ 10\qquad\textbf{(C)}\ 15\qquad\textbf{(D)}\ 25\qquad\textbf{(E)}\ 99 </cmath>
 
<math> \textbf{(A)}\ 6 \qquad\textbf{(B)}\ 10\qquad\textbf{(C)}\ 15\qquad\textbf{(D)}\ 25\qquad\textbf{(E)}\ 99 </math>


==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:02, 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 a dollar?

$\textbf{(A)}\ 6 \qquad\textbf{(B)}\ 10\qquad\textbf{(C)}\ 15\qquad\textbf{(D)}\ 25\qquad\textbf{(E)}\ 99$

See Also

2010 AMC 8 (ProblemsAnswer KeyResources)
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