美国数学竞赛2017 AMC 12A (解析版).pdfVIP

  • 205
  • 0
  • 约2.11万字
  • 约 15页
  • 2023-09-23 发布于北京
  • 举报
2017-AMC-12A-1 Problem-1 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 We can take two 5-popsicle boxes and one 3-popsicle box with . Note that it is optimal since one popsicle is at the rate of per popsicle, three popsicles at per popsicle and finally, five popsicles at per popsicle, hence we want as many sets as possible. It is clear that the above is the optima

您可能关注的文档

文档评论(0)

1亿VIP精品文档

相关文档