Maths Olympiad Prep

Library / /14 of 19

Combinatorics Difficulty 5.3 AIME, harder Prove it United States

Problem:

Several weights are given, each of which is not heavier than 1lb1 \mathrm{lb}. It is known that they cannot be divided into two groups such that the weight of each group is greater than 1lb1 \mathrm{lb}. Find the maximum possible total weight of these weights.

Solution

Solution:

Suppose you start putting weights into two pans of a scale and stop when you cannot add another weight to either pan without it exceeding 1lb1 \mathrm{lb}. At this point, you have put at most 2lb2 \mathrm{lb} of weight on the scale, and there can only be one weight left, otherwise you could add a weight to each pan and both would exceed 1lb1 \mathrm{lb}. This remaining weight weighs at most 1lb1 \mathrm{lb}, so the weights add up to at most 3lb3 \mathrm{lb} total. It is possible to have exactly 3lb3 \mathrm{lb} with three 1lb1 \mathrm{lb} weights, so this is the largest possible.

Want a route through all this instead of an archive? The track puts 2,000 problems in a working order, from AMC 10 level to the IMO shortlist.

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