Main Page

Revision as of 13:22, 13 November 2024 by Levans (talk | contribs)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

During AMC testing week, 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 AoPSWiki is not. Lastly, please read the policies of the AoPSWiki before editing, and why AoPSWiki is different from other online resources.

AoPSWiki runs on the MediaWiki software.