Template:WeeklyProblem

Revision as of 12:38, 2 March 2015 by Phxu (talk | contribs) (Created page with "<div style="background-color:#ffffff; border-top:10px solid #204079;padding:0.5em;padding-top: 0px;"> <h2 style="margin:5px 0px 0px 0px;border-bottom: 1px solid; color: #20458...")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

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