MathDB
Casper the Candy-Loving Ghost

Source: 2019 AMC 10B #7/12B #5

February 14, 2019

Problem Statement

Each piece of candy in a store costs a whole number of cents. Casper has exactly enough money to buy either 12 pieces of red candy, 14 pieces of green candy, 15 pieces of blue candy, or nn pieces of purple candy. A piece of purple candy costs 20 cents. What is the smallest possible value of nn?
<spanclass=latexbold>(A)</span>18<spanclass=latexbold>(B)</span>21<spanclass=latexbold>(C)</span>24<spanclass=latexbold>(D)</span>25<spanclass=latexbold>(E)</span>28<span class='latex-bold'>(A) </span> 18 \qquad <span class='latex-bold'>(B) </span> 21 \qquad <span class='latex-bold'>(C) </span> 24\qquad <span class='latex-bold'>(D) </span> 25 \qquad <span class='latex-bold'>(E) </span> 28