AMC 8 · 2023 · #14

Grade 4 arithmetic
optimization-countinglinear-diophantinedivisibility-rules optimization-countingsystematic-enumerationcasework ↑ Prerequisites: multi-digit-arithmeticdivisibility-rules
📏 Medium solution 💡 3 insights
📘 View easy version →

Problem

Nicolas is planning to send a package to his friend Anton, who is a stamp collector. To pay for the postage, Nicolas would like to cover the package with a large number of stamps. Suppose he has a collection of 55-cent, 1010-cent, and 2525-cent stamps, with exactly 2020 of each type. What is the greatest number of stamps Nicolas can use to make exactly $7.107.10 in postage?
(Note: The amount $$7.10correspondstocorresponds to7dollarsanddollars and10cents.Onedollarisworthcents. One dollar is worth100$ cents.)

Pick an answer.

(A)
45
(B)
46
(C)
51
(D)
54
(E)
55

AMC 8 2023 problem © Mathematical Association of America (MAA AMC). Reproduced for educational use.

Try it yourself first — the explanation is most useful after you’ve attempted it.