Problem:
To play the lottery game Sum Thing, you choose five distinct numbers from to , then the lottery master chooses five distinct numbers from to . If there exist a nonempty subset of your five numbers and a nonempty subset of the lottery master's five numbers such that both subsets have the same sum, then you win.
Can you choose five numbers that guarantee a win? Either demonstrate such a set, with a proof of validity, or prove that no such set exists.
Problem 939
Official solution
Solution:
Yes, there is such a set. One such set is .
With this ticket, the subsums are all multiples of from to , and all integers congruent to from to . So we must show that any five numbers chosen by the lottery master will have a subsum equal to one of these.
We partition the numbers from to into three types: evens (), large odds (), and small odds (). An odd is "large" if it exceeds , otherwise "small". We argue by contradiction, starting from the assumption that the lottery master has found five numbers that will defeat the player.
First, some easy observations. Clearly any 's chosen by the lottery master must be , and must be no larger than . The lottery master can't choose three 's, since either two of them would add up to a multiple of from to , or all three would add up to an integer that is from to . It is also easy to see that any two 's chosen by the lottery master must be in different classes ; in particular, the lottery master can't choose three 's. Finally, any two 's chosen by the lottery master must be in the same class , and the lottery master can't choose four 's.
The lottery master must choose at least one . The only other possibility not yet ruled out is , but in this case, the smallest combines with whichever is not in the same class modulo to make a multiple of less than or equal to .
Now we have two overlapping cases: the lottery master can have or .
- Case : The and two 's will add up to a multiple of , which must be at least . This implies that is , or . We must avoid sums of the form that are and , but we must also avoid sums of the form that are and .
- If any is , then these two considerations rule out all except (which requires that the is ).
- If any is , then these considerations rule out all except .
- If any is , then these considerations rule out all except .
- It isn't possible for all to be less than .
Since we have at least two 's, we can't have any . We already ruled out four 's, so we must have . But the smaller and the smallest two 's will add up to a multiple of that's at most , so this is a dead end.
- Case : The two 's must add up to at least , so one of them is at least . Pick the that's not congruent to the modulo . Add these together, then add the smaller of the two 's. The result is , and is in the range to , so we are finished.