1968 AMC 12 Problem 19

Attempt Problem 19 of the 1968 AMC 12 below, then check your answer against the professionally curated solution from LIVE by Po-Shen Loh. You can also try the full timed exam, view all 1968 AMC 12 solutions, or check the answer key.

All problems are used with official legal permission of the Mathematical Association of America (MAA).

19.

Let nn be the number of ways that 1010 dollars can be changed into dimes and quarters, with at least one of each coin being used. Then nn equals:
4040
3838
2121
2020
1919
Answer: E
Concepts:Diophantine Equationcounting integers in a rangedivisibility
Small hint:
In cents, solve 10d+25q=100010d+25q=1000
Big hint:
Use parity to write q=2kq=2k, then enforce positive coin counts
Solution:
The equation 10d+25q=100010d+25q=1000 reduces to 2d+5q=200.2d+5q=200. Thus qq must be even; write q=2k,q=2k, giving d=100−5k.d=100-5k. Positivity requires k=1,k=1, 2,2, …,\ldots, 19,19, so there are 1919 ways.
Therefore, the correct answer is E.
LIVE by Po-Shen Loh
Programs

LIVE Classes

Self-Paced Classes

Stars

Scholarship

About Us

Who Is Po-Shen Loh?

Email Contact

Newsletter

Jobs

Become a Star

For a more Thought Full world.

© 2026 Expii, Inc.