1992 USAMO Problems/Problem 3
For a nonempty set of integers, let be the sum of the elements of . Suppose that is a set of positive integers with and that, for each positive integer , there is a subset of for which . What is the smallest possible value of ?
Let's a - set be a set such that , where , , , and for each , , , , .
(For Example is a - set and is a - set)
Furthermore, let call a - set a - good set if , and a - bad set if (note that for any - set. Thus, we can ignore the case where ).
Furthermore, if you add any amount of elements to the end of a - bad set to form another - set (with a different ), it will stay as a - bad set because for any positive integer and .
Lemma) If is a - set, .
For , or because and .
Assume that the lemma is true for some , then is not expressible with the - set. Thus, when we add an element to the end to from a - set, must be if we want because we need a way to express . Since is not expressible by the first elements, is not expressible by these elements. Thus, the new set is a - set, where
The answer to this question is .
The following set is a - set:
Note that the first 8 numbers are power of from to , and realize that any or less digit binary number is basically sum of a combination of the first elements in the set. Thus, , .
which implies that , .
Similarly , and , .
Thus, is a - set.
Now, let's assume for contradiction that such that is a - set where
is a - set where (lemma).
Let be a - set where the first elements are the same as the previous set. Then, is not expressible as . Thus, .
In order to create a - set with and the first elements being the ones on the previous set, because we need to make expressible as . Note that is not expressible, thus .
Done but not elegant...
|1992 USAMO (Problems • Resources)|
|1 • 2 • 3 • 4 • 5|
|All USAMO Problems and Solutions|
The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions.