2013 AMC 12B Problem 10

Below is the professionally curated solution for Problem 10 of the 2013 AMC 12B, from LIVE by Po-Shen Loh. You can also try the full timed exam, view all 2013 AMC 12B 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:system of equationsinvariant

Difficulty rating: 1550

10.

Alex has 7575 red tokens and 7575 blue tokens. There is a booth where Alex can give two red tokens and receive in return a silver token and a blue token, and another booth where Alex can give three blue tokens and receive in return a silver token and a red token. Alex continues to exchange tokens until no more exchanges are possible. How many silver tokens will Alex have at the end?

6262

8282

8383

102102

103103

Solution:

After mm red-booth and nn blue-booth exchanges, Alex has 75(2mn)75 - (2m - n) red tokens, 75(3nm)75 - (3n - m) blue tokens, and m+nm + n silver tokens. Exchanges are impossible exactly when 2mn742m - n \ge 74 and 3nm73.3n - m \ge 73. Equality holds at (m,n)=(59,44),(m, n) = (59, 44), giving 59+44=10359 + 44 = 103 silver tokens. Thus, the correct answer is E.

Problem 10 in Other Years