How many nonempty subsets of have the property that the sum of the largest element and the smallest element is 13?
Solution
If is the smallest element of such a set, then is the largest element, and for the remaining elements we may choose any (or none) of the elements . Thus there are such sets whose smallest element is . Also, clearly implies . Summing over all , we get a total of possible sets.
Want a route through all this instead of an archive? The track
puts 2,000 problems in a working order, from AMC 10 level to the IMO shortlist.