NO-ABEL 1999 Problem 4
For every nonempty subset of , we define the alternating sum as follows: If are the elements of in the increasing order, then . (a) Is it possible to partition into two sets having the same alternating sum? (b) Determine the sum , where runs over all nonempty subsets of .
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.
Similar problems
These problems have the most words in common with this statement.