2000 AMC 10 Problem 17

Below is the professionally curated solution for Problem 17 of the 2000 AMC 10, from LIVE by Po-Shen Loh. You can also try the full timed exam, view all 2000 AMC 10 solutions, or check the answer key.

All of the real AMC 8, AMC 10, AMC 12, and AIME problems in our complete solution collection are used with official legal permission of the Mathematical Association of America (MAA).

Concepts:invariantmodular arithmeticmoney

Difficulty rating: 1750

17.

Boris has an incredible coin changing machine. When he puts in a quarter, it returns five nickels; when he puts in a nickel, it returns five pennies; and when he puts in a penny, it returns five quarters. Boris starts with just one penny. Which of the following amounts could Boris have after using the machine repeatedly?

$3.63

$5.13

$6.30

$7.45

$9.07

Solution:

Trading a quarter for five nickels or a nickel for five pennies does not change the total value. Only trading a penny for five quarters changes it, adding 5251=1245 \cdot 25 - 1 = 124 cents.

Starting from 11 cent, Boris always has 1+124n1 + 124n cents for some nonnegative integer n.n.

Only $7.45\$7.45 has this form, since 745=1+1246.745 = 1 + 124 \cdot 6.

Thus, the correct answer is D.

Problem 17 in Other Years