Difference between revisions of "1968 AHSME Problems/Problem 19"
m (→Solution) |
m (→See Also) |
||
Line 12: | Line 12: | ||
<math>\fbox{E}</math> | <math>\fbox{E}</math> | ||
+ | |||
+ | == See also == | ||
+ | {{AHSME 35p box|year=1968|num-b=18|num-a=20}} | ||
+ | |||
+ | [[Category: Introductory Algebra Problems]] | ||
+ | {{MAA Notice}} |
Revision as of 00:52, 16 August 2023
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 AHSC (Problems • Answer Key • Resources) | ||
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 • 31 • 32 • 33 • 34 • 35 | ||
All AHSME Problems and Solutions |
The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions.