olymmath

AMC 12 2019b Problem 5

  • Paper

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

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

Dataset text AMC 12 2000 to 2025. Quoted with source.

Show the answer

B

Solutions

No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.

Add a solution

Similar problems

These problems have the most words in common with this statement.

Locator amc12/2019b/p5 · Tag Z2VYSBWF6R · Edit this page on GitHub · Keys: j next, k previous