Difference between revisions of "Template:Weeklyproblem"
m (Protected "Template:Weeklyproblem" ([Edit=Allow only administrators] (indefinite) [Move=Allow only administrators] (indefinite))) |
|
(No difference)
| |
Latest revision as of 01:53, 29 November 2018
Problem of the Week
1983 AIME, Problem 13
For
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
is
and for
it is simply
. Find the sum of all such alternating sums for
.