Skip to main content

2019 AMC 10B Problem 7

Problem 7 of 25EasierNumber Theory

Each piece of candy in a shop 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 least possible value of n?n?

Answer choices

Show solution

Solution

Let the number of cents he has c.c. Then, cc is a multiple of 12,14,12,14, and 15.15. Thus, it must be a multiple of 420.420. Let c=420kc=420k for some k.k. Also, c=20n,c=20n, so 420k=20n,420k=20n, making n=21k.n=21k. Since kk is a whole number, the minimum possible value of nn is 21.21. Thus, the answer is B .

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.