Prove that and , where
Romanian Mathematical Olympiad
Solution
An integer belongs to if and only if there exists disjoint subsets , of the set , with , so that , where is the sum of the elements of and is the sum of the elements of (the sum of the elements of the empty set being ).
Then and, since , it follows that
.
This shows that is divisible by , hence .
In order to prove that , it is enough to find with the sum of its elements .
An example is when is the union of pairs of elements of with sum , for instance , , ..., .
So, taking and , we get .
Want a route through all this instead of an archive? The track
puts 2,604 problems in a working order, from Junior Challenge level to the IMO shortlist.