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

Main Page/Suggestions

Revision as of 12:45, 25 June 2025 by Aoum (talk | contribs)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
If you want to edit something on the main page, just edit this page and the administrators will take your suggestions into consideration.


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're new to editing a wiki, we recommend starting with the tutorial. You can also check out what AoPS Wiki is not to better understand its scope.

Before you start editing, please familiarize yourself with the articles related to AoPS Wiki, especially the policies and guidelines. Additionally, take a moment to read why AoPS Wiki stands apart from other online resources.

AoPS Wiki is powered by MediaWiki software.