olymmath

NO-ABEL 1999 Problem 4

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

    Dataset text AI-MO AoPS. Quoted with source.

    Solutions

    No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.

    Add a solution

    Similar problems

    These problems have the most words in common with this statement.

    Locator no-abel/1999/p4 · Tag 88RHFCPSXV · Edit this page on GitHub · Keys: j next, k previous