For any set of numbers, let be the sum of the elements of .
Consider the set . There are subsets of containing three elements, and their sums are:
Some of these sums occur more than once, others are unique.
For a set , let be the set of unique sums of -element subsets of , in our example we find and .
Now consider the -element set .
S has -element subsets.
Determine the sum of all integers which are the sum of exactly one of the -element subsets of , i.e. find .
Write-up coming later
The complete problem is available here. An approach, code, and answer will be added later.