For every nonempty subset R of S={1,2,...,10}, we define the alternating sum A(R) as follows:
If r1,r2,...,rk are the elements of R in the increasing order, then A(R)=rk−rk−1+rk−2−...+(−1)k−1r1.
(a) Is it possible to partition S into two sets having the same alternating sum?
(b) Determine the sum ∑RA(R), where R runs over all nonempty subsets of S. SumSubsetsalgebracombinatorics