1968 AHSME Problems/Problem 19

Revision as of 02:15, 29 September 2014 by Timneh (talk | contribs) (Created page with "== Problem == Let <math>n</math> be the number of ways <math>10</math> dollars can be changed into dimes and quarters, with at least one of each coin being used. Then <math>n</m...")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Problem

Let $n$ be the number of ways $10$ dollars can be changed into dimes and quarters, with at least one of each coin being used. Then $n$ equals:

$\text{(A) } 40\quad \text{(B) } 38\quad \text{(C) } 21\quad \text{(D) } 20\quad \text{(E) } 19$

Solution

$\fbox{}$

See also

1968 AHSME (ProblemsAnswer KeyResources)
Preceded by
Problem 18
Followed by
Problem 20
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 26 27 28 29 30
All AHSME Problems and Solutions

The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions. AMC logo.png