During AMC testing, the AoPS Wiki is in read-only mode and no edits can be made.

User:Piphi/AoPS Wiki

Problem of the Week

1983 AIME, Problem 13

For $\{1, 2, 3, \ldots, n\}$ and each of its non-empty subsets a unique alternating sum is defined as follows. Arrange the numbers in the subset in decreasing order and then, beginning with the largest, alternately add and subtract successive numbers. For example, the alternating sum for $\{1, 2, 3, 6,9\}$ is $9-6+3-2+1=5$ and for $\{5\}$ it is simply $5$. Find the sum of all such alternating sums for $n=7$.

Statistics

It is Monday November 10, 2025, 09:08 (GMT).
There have been 271,584 edits to 10,939 articles since January, 2006.

3,794 files have been uploaded. There are 290,023 users registered.