<p>Let <img alt="$n$" height="8" src="https://latex.artofproblemsolving.com/1/7/4/174fadd07fd54c9afe288e96558c92e0c1da733a.png" width="10" /> be the number of ways <img alt="$10$" height="13" src="https://latex.artofproblemsolving.com/f/c/6/fc606f7f1e530731ab4f1cc364c01dc64a4455ee.png" width="17" /> dollars can be changed into dimes and quarters, with at least one of each coin being used. Then <img alt="$n$" height="8" src="https://latex.artofproblemsolving.com/1/7/4/174fadd07fd54c9afe288e96558c92e0c1da733a.png" width="10" /> equals:</p>

Question No: 222

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:

Editorial

Tags: Algebra

Question Details