1968 AHSME Problems/Problem 19
Problem
Let 
be the number of ways 
dollars can be changed into dimes and quarters, with at least one of each coin being used. Then equals:
Solution
See also
| 1968 AHSME (Problems • Answer Key • Resources) | ||
| Preceded by [[1968 AHSME Problems/Problem {{{num-b}}}|Problem {{{num-b}}}]] |
Followed by [[1968 AHSME Problems/Problem {{{num-a}}}|Problem {{{num-a}}}]] | |
| 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. 
