1986 AIME Problems/Problem 12
Let the sum of a set of numbers be the sum of its elements. Let be a set of positive integers, none greater than 15. Suppose no two disjoint subsets of have the same sum. What is the largest sum a set with these properties can have?
By using the greedy algorithm, we obtain , with . We must now prove that no such set has sum greater than 61. Suppose such a set existed. Then must have more than 4 elements, otherwise its sum would be at most .
can't have more than 5 elements. To see why, note that at least of its subsets have at most four elements (the number of subsets with no elements plus the number of subsets with one element and so on), and each of them have sum at most 54. By the Pigeonhole Principle, two of these subsets would have the same sum. If those subsets were disjoint, we would directly arrive at a contradiction; if not, we could remove the common elements to get two disjoint subsets.
Thus, would have to have 5 elements. contains both 15 and 14 (otherwise its sum is at most ). It follows that cannot contain both and for any , or the subsets and would have the same sum. So now must contain 13 (otherwise its sum is at most ), and cannot contain 12, or the subsets and would have the same sum.
Now the only way could have sum at least would be if . But the subsets and have the same sum, so this set does not work. Therefore no with sum greater than 61 is possible and 61 is indeed the maximum.
|1986 AIME (Problems • Answer Key • Resources)|
|1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15|
|All AIME Problems and Solutions|