Skip to main content

2023 AMC 12B Problem 16

Problem 16 of 25IntermediateNumber Theory

In Coinland, there are three types of coins, each worth 6,6, 10,10, and 15.15. What is the sum of the digits of the maximum amount of money that is impossible to have?

Answer choices

Show solution

Solution

The amounts 30,31,32,33,34,3530,31,32,33,34,35 are all attainable (for instance 30=65,30=6\cdot 5, 31=6+10+15,31=6+10+15, 32=62+102,32=6\cdot 2+10\cdot 2, 33=63+15,33=6\cdot 3+15, 34=64+10,34=6\cdot 4+10, 35=10+10+1535=10+10+15). Adding 66’s then reaches every larger amount. Checking below, 2929 is impossible: without a 1515-coin a sum of 66’s and 1010’s is even, while with one 1515-coin the remaining 1414 cannot be written as 6a+10b;6a+10b; two 1515-coins already exceed 29.29. So the largest impossible amount is 29,29, whose digit sum is 2+9=11.2+9=11. Thus, the correct answer is D.

More practice

Concepts: Chicken McNugget Theorem

Problem text and solution from the LIVE past-contest archive. See also the AoPS wiki page for community solutions.