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

AoPS Wiki:Sandbox

Revision as of 16:38, 13 March 2025 by Charking (talk | contribs)

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

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$.

New to the AoPS Wiki?

If you don't know much about how to edit a wiki, you might want to read the tutorial and the help files. You can also read what AoPS Wiki is not. Lastly, please read the policies and guidelines of the AoPS Wiki before editing, and why AoPS Wiki is different from other online resources.

AoPS Wiki runs on the MediaWiki software.