2019 AMC 10B Problem 7

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

Difficulty rating: 1140

7.

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?

18 18

21 21

24 24

25 25

28 28

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 .

Problem 7 in Other Years