Olympiad Maths Prep

Track / Stage 5 / 339 of 400 #939 of 2000

Problem 939

AIME late
Number theory Difficulty 5.8 Prove it Berkeley Math Circle: Monthly Contest 2 · United States

Problem:
To play the lottery game Sum Thing, you choose five distinct numbers from 11 to 5050, then the lottery master chooses five distinct numbers from 11 to 5050. 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.

This one wants a proof. Work it on paper, read the official solution, then mark yourself honestly — the ladder only means something if the record is true.

Official solution

Solution:
Yes, there is such a set. One such set is {4,8,16,32,42}\{4,8,16,32,42\}.
With this ticket, the subsums are all multiples of 44 from 44 to 6060, and all integers congruent to 2(mod4)2 \pmod{4} from 4242 to 102102. 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 11 to 5050 into three types: evens (EE), large odds (OO), and small odds (oo). An odd is "large" if it exceeds 2020, 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 EE's chosen by the lottery master must be 2(mod4)2 \pmod{4}, and must be no larger than 3838. The lottery master can't choose three EE's, since either two of them would add up to a multiple of 44 from 44 to 6060, or all three would add up to an integer that is 2(mod4)2 \pmod{4} from 4242 to 102102. It is also easy to see that any two OO's chosen by the lottery master must be in different classes (mod4)\pmod{4}; in particular, the lottery master can't choose three OO's. Finally, any two oo's chosen by the lottery master must be in the same class (mod4)\pmod{4}, and the lottery master can't choose four oo's.

The lottery master must choose at least one EE. The only other possibility not yet ruled out is OOOooOOOoo, but in this case, the smallest oo combines with whichever OO is not in the same class modulo 44 to make a multiple of 44 less than or equal to 6060.

Now we have two overlapping cases: the lottery master can have Eoo??Eoo?? or EEoOOEEoOO.

- Case Eoo??Eoo??: The EE and two oo's will add up to a multiple of 44, which must be at least 6464. This implies that EE is 30,3430, 34, or 3838. We must avoid sums of the form O+OO+O that are 2(mod4)2 \pmod{4} and 42\geq 42, but we must also avoid sums of the form E+o+OE+o+O that are 2(mod4)2 \pmod{4} and 102\leq 102.
- If any oo is 1919, then these two considerations rule out all OO except 4949 (which requires that the EE is 3838).
- If any oo is 1717, then these considerations rule out all OO except 2121.
- If any oo is 1515, then these considerations rule out all OO except 2323.
- It isn't possible for all oo to be less than 1515.

Since we have at least two oo's, we can't have any OO. We already ruled out four oo's, so we must have EEoooEEooo. But the smaller EE and the smallest two oo's will add up to a multiple of 44 that's at most 6060, so this is a dead end.

- Case EEoOOEEoOO: The two EE's must add up to at least 6464, so one of them is at least 3434. Pick the OO that's not congruent to the oo modulo 44. Add these together, then add the smaller of the two EE's. The result is 2(mod4)2 \pmod{4}, and is in the range 4242 to 102102, so we are finished.

Source: MathNet, licensed CC-BY-4.0. Statement and solution reproduced as published; topic, difficulty and ordering added by this site.