1968 AHSME Problems/Problem 19

Revision as of 15:19, 4 November 2018 by Blossomstream (talk | contribs) (Solution)

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{E}$