2017 AMC 12A Problems/Problem 1
Revision as of 15:00, 8 February 2017 by Riemanntensor (talk | contribs) (Created page with "==Problem== Pablo buys popsicles for his friends. The store sells single popsicles for <math>\$1</math> each, 3-popsicle boxes for <math>\$2</math>, and 5-popsicle boxes for...")
Problem
Pablo buys popsicles for his friends. The store sells single popsicles for each, 3-popsicle boxes for
, and 5-popsicle boxes for
. What is the greatest number of popsicles that Pablo can buy with
?
Solution
By the greedy algorithm, we can take two 5-popsicle boxes and one 3-popsicle box with . To prove that this is optimal, consider an upper bound as follows: at the rate of
per 5 popsicles, we can get
popsicles, which is less than 14.
.