AMC 10 · 2019 · #7
Grade 6 arithmeticPick an answer.
AMC 10 2019 problem © Mathematical Association of America (MAA AMC). Reproduced for educational use.
The hidden question is just "smallest whole-cent amount divisible by all four counts" — that's the LCM of 12, 14, 15, 20 (Tool #9 turns the candy story into a divisibility puzzle). Tool #6 / #3 lets us back-check by plugging each answer choice into 20n and asking whether it's divisible by 12, 14, 15. Tool #8 keeps us honest about cents vs. counts.
Translate the story: the total in cents must be a multiple of 12, 14, 15, and 20, so the smallest is their lcm.
"Exactly buys k candies" just means the total is a multiple of k.
6.NS.B.4Solve An Easier Related ProblemPrime-factorize 12 = 2²·3, 14 = 2·7, 15 = 3·5, 20 = 2²·5, then keep each prime's highest power: 2² · 3 · 5 · 7.
LCM grabs the strongest dose of each prime from the bunch.
6.NS.B.4Solve An Easier Related ProblemMultiply it out: 4·3·5·7 = 420 cents — Casper's smallest possible total.
420 cents = $4.20 — a believable pocket-change amount.
5.NBT.B.5Solve An Easier Related ProblemPurple is 20 cents each, so track units — cents ÷ (cents per piece) = pieces: n = 420 ÷ 20 = 21.
Total cents divided by cost per candy gives candy count.
5.NBT.B.6Analyze The UnitsBack-check: the smaller candidate 18 needs 360 cents, but 360 isn't divisible by 14 — so 21 is the true smallest, choice (B).
Try the smaller choice first; if it fails the divisibility test, the next answer survives.
4.OA.B.4Eliminate PossibilitiesThis AMC 10 problem only needs Grade 6 LCM you already know: Casper's cents must split exactly into 12, 14, 15, AND 20 pieces. The smallest such number is lcm(12,14,15,20) = 420 cents, so n = = 21.