2003 AIME I Problems/Problem 3
Contents
Problem
Let the set Susan makes a list as follows: for each two-element subset of she writes on her list the greater of the set's two elements. Find the sum of the numbers on the list.
Solution
Order the numbers in the set from greatest to least to reduce error: Each element of the set will appear in two-element subsets, once with each other number.
- will be the greater number in subsets.
- will be the greater number in subsets.
- will be the greater number in subsets.
- will be the greater number in subsets.
- will be the greater number in subsets.
- will be the greater number in subsets.
- will be the greater number in subsets.
- will be the greater number in subsets.
Therefore the desired sum is .
Solution
Thinking of this problem algorithmically, one can "sort" the array to give:
Now, notice that when we consider different pairs, we are only going to fixate one element and look at the all of the next elements in the array, basically the whole shebang. Then, we see that if we set the sum of the whole array to we get out answer to be
Finding isn't hard, and we see that it is equal to :
See also
2003 AIME I (Problems • Answer Key • Resources) | ||
Preceded by Problem 2 |
Followed by Problem 4 | |
1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15 | ||
All AIME Problems and Solutions |
The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions.