2019 AMC 10B Problems/Problem 7

Revision as of 13:35, 14 February 2019 by Wwt7534 (talk | contribs) (Solution)

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 $n$ pieces of purple candy. A piece of purple candy costs 20 cents. What is the smallest possible value of $n$?

$\textbf{(A) } 18 \qquad \textbf{(B) } 21 \qquad \textbf{(C) } 24\qquad \textbf{(D) } 25 \qquad \textbf{(E) } 28$

Solution

If he has enough money to buy 12 pieces of red candy, 14 pieces of green candy, and 15 pieces of blue candy, then the least money he can have is $lcm(12,14,15)$ = 420. Since a piece of purple candy costs 20 cents, the least value of n can be $\frac{420}{20} = \boxed{B) 21}$

Taemin Kim

Invalid username
Login to AoPS