Difference between revisions of "1983 AIME Problems/Problem 13"
m |
I_like_pie (talk | contribs) |
||
Line 8: | Line 8: | ||
Because there are <math>63</math> of these pairs, the sum of all possible subsets of our given set is <math>63*7</math>. However, we forgot to include the subset that only contains <math>7</math>, so our answer is <math>64\cdot 7=448</math>. | Because there are <math>63</math> of these pairs, the sum of all possible subsets of our given set is <math>63*7</math>. However, we forgot to include the subset that only contains <math>7</math>, so our answer is <math>64\cdot 7=448</math>. | ||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
== See also == | == See also == | ||
+ | {{AIME box|year=1983|num-b=12|num-a=14}} | ||
* [[AIME Problems and Solutions]] | * [[AIME Problems and Solutions]] | ||
* [[American Invitational Mathematics Examination]] | * [[American Invitational Mathematics Examination]] |
Revision as of 13:13, 6 May 2007
Problem
For 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 is and for it is simply . Find the sum of all such alternating sums for .
Solution
Let be a non- empty subset of .
Then the alternating sum of plus the alternating sum of with 7 included is 7. In mathematical terms, . This is true because when we take an alternating sum, each term of has the opposite sign of each corresponding term of .
Because there are of these pairs, the sum of all possible subsets of our given set is . However, we forgot to include the subset that only contains , so our answer is .
See also
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 |