Given n distinct positive numbers a1,a2,...,an.
We construct all the possible sums (from 1 to n terms).
Prove that among those 2^n1 sums there are at least n(n+1)/2 different ones.
Source: a problem from Soviet Union 1963 contest


perplexus dot info 


