Maths Olympiad Prep

Track / Stage 4 / 103 of 340 #843 of 2444

Problem 843

AMC 12 late, AIME early
Combinatorics Difficulty 4.6 Prove it HMMO · United States · 2020

Chelsea goes to La Verde's at MIT and buys 100 coconuts, each weighing 4 pounds, and 100 honeydews, each weighing 5 pounds. She wants to distribute them among nn bags, so that each bag contains at most 13 pounds of fruit. What is the minimum nn for which this is possible?

This one wants a proof. Work it on paper, then read the official solution and mark yourself. Be honest about it: the record is only any use to you if it is.

Next problem →

Official solution

Solution:

The answer is n=75n=75, given by 50 bags containing one honeydew and two coconuts (13 pounds), and 25 bags containing two honeydews (10 pounds).

To show that this is optimal, assign each coconut 1 point and each honeydew 2 points, so that 300 points worth of fruit are bought in total. Then, we claim that each bag can contain at most 4 points of fruit, thus requiring n300/4=75n \geq 300 / 4 = 75. To see this, note that each bag containing greater than 4 points must contain either five coconuts (20 pounds), three coconuts and a honeydew (17 pounds), one coconut and two honeydews (14 pounds), or three honeydews (15 pounds).

Source: MathNet, licensed CC-BY-4.0. Statement reproduced verbatim; metadata (topic, difficulty, ordering) added by this project.