Skip to main content

2019 AMC 12B Problem 5

Problem 5 of 25EasierNumber Theory

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 n?n?

Answer choices

Show solution

Solution

Let MM be Casper’s money in cents. Since he can exactly buy 12,12, 14,14, or 1515 whole-cent pieces, MM is a multiple of lcm(12,14,15)=420.\operatorname{lcm}(12,14,15)=420. Purple candy costs 2020 cents, so n=M20.n=\dfrac{M}{20}. The smallest MM is 420,420, giving n=42020=21.n=\dfrac{420}{20}=21. Thus, B is the correct answer.

More practice

Concepts: least common multiple · divisibility

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