Difference between revisions of "1968 AHSME Problems/Problem 19"
(→See also) |
m (→Solution) |
||
| Line 10: | Line 10: | ||
== Solution == | == Solution == | ||
| + | |||
<math>\fbox{E}</math> | <math>\fbox{E}</math> | ||
| − | |||
| − | |||
Revision as of 14:19, 4 November 2018
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