1983 AIME Problems/Problem 13

Problem

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

Solution

Let $S$ be a non- empty subset of $\{1,2,3,4,5,6\}$ .

Then the alternating sum of $S$ plus the alternating sum of $S$ with 7 included is 7. In mathematical terms, $S+ (S\cup 7)=7$ . This is true because when we take an alternating sum, each term of $S$ has the opposite sign of each corresponding term of $S\cup 7$ .

Because there are $63$ of these pairs, the sum of all possible subsets of our given set is $63*7$ . However, we forgot to include the subset that only contains $7$ , so our answer is $64\cdot 7=\boxed{448}$ .

1983 AIME (Problems • Answer Key • Resources)
Preceded by Problem 12	Followed by Problem 14
1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15
All AIME Problems and Solutions

Page

Toolbox

Search

1983 AIME Problems/Problem 13

Problem

Solution

See also