AMC 10 Step by Step

2019 AMC 10B Problem 7

P1-10~2 minPrint

Each piece of candy in a store costs a whole number of cents. Casper has exactly enough money to buy either 1212 pieces of red candy, 1414 pieces of green candy, 1515 pieces of blue candy, or nn pieces of purple candy. A piece of purple candy costs 2020 cents. What is the smallest possible value of nn ?

Log in to save your progress.
Show solution without answering

Key insight

Casper's money can be split evenly into 12, 14 or 15 equal prices, so it is a common multiple of those numbers. The smallest is 420 cents.

Solution

Every price is a whole number of cents, so the money must split evenly in each case.

1. Let Casper have MM cents. He can buy exactly 1212 red candies, so MM divides evenly by 1212. In the same way, MM divides evenly by 1414 and by 1515.
2. The smallest number that divides evenly by 1212, 1414 and 1515 is their least common multiple. Break each into primes:
12=22⋅3,14=2⋅7,15=3⋅5.12 = 2^2 \cdot 3, \qquad 14 = 2 \cdot 7, \qquad 15 = 3 \cdot 5.
Take the highest power of each prime: 22⋅3⋅5⋅7=4202^2 \cdot 3 \cdot 5 \cdot 7 = 420.
3. So MM is 420420, or 840840, or 12601260, and so on.
4. Purple candy costs 2020 cents, so n=M÷20n = M \div 20. For M=420M = 420 this is n=21n = 21, a whole number.
5. Larger choices of MM give larger nn (840÷20=42840 \div 20 = 42, and so on), so the smallest is 2121.

Check that 420420 cents really works: red costs 420÷12=35420 \div 12 = 35 cents, green 420÷14=30420 \div 14 = 30 cents, blue 420÷15=28420 \div 15 = 28 cents. All whole numbers.

The answer is (B) 21\boxed{\textbf{(B)}\ 21}.

Why this works

"Exactly enough money to buy 1212 items at a whole-number price" means the money is a multiple of 1212. Several such facts together mean the money is a common multiple, and "smallest possible" points to the least common multiple. Then the purple price turns the money into a number of candies.

Concise solution

A shorter write-up, the way contest solutions are usually written. It may take a different route from the solution above.

Let MM be Casper's money in cents. Since MM buys exactly 1212 red candies at a whole-cent price, 12∣M12 \mid M. Likewise 14∣M14 \mid M and 15∣M15 \mid M. Therefore MM is a multiple of
lcm⁡(12,14,15)=lcm⁡(22⋅3, 2⋅7, 3⋅5)=22⋅3⋅5⋅7=420.\operatorname{lcm}(12, 14, 15) = \operatorname{lcm}(2^2 \cdot 3,\ 2 \cdot 7,\ 3 \cdot 5) = 2^2 \cdot 3 \cdot 5 \cdot 7 = 420.

Also M=20nM = 20n. Every multiple of 420420 is a multiple of 2020, so M=420kM = 420k gives n=21kn = 21k. The smallest value is k=1k = 1: M=420M = 420 cents, red candy at 3535 cents, green at 3030, blue at 2828, purple at 2020, and n=21n = 21.

The answer is (B) 21\boxed{\textbf{(B)}\ 21}.

Review in the AoPS books

Similar problems

Problem © Mathematical Association of America (MAA), American Mathematics Competitions. Reproduced for non-commercial educational use. Solution and commentary are original to this site.