For any finite set S, let f(S) be the sum of the elements of S (if S is empty then f(S)=0). Find the sum over all subsets E of S of f(S)f(E) for S={1,2,…,1999}.
A number or a short expression. Spacing and $ signs are ignored.
Solution
An n element set has 2n subsets, so each element of S appears in 21998 subsets E, so our sum is 21998⋅1+2+…+19991+2+…+1999=21998.
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.
Source: Omni-MATH,
licensed Apache-2.0.
Statement and solution reproduced as published; topic and difficulty added by this site.