Suppose that is a finite set of positive integers. If the greatest integer in is removed from , then the average value (arithmetic mean) of the integers remaining is . If the least integer in is also removed, then the average value of the integers remaining is . If the greatest integer is then returned to the set, the average value of the integers rises to . The greatest integer in the original set is greater than the least integer in . What is the average value of all the integers in the set ?
- A)
- B)
- C)
- D)
- E)
Answer
D
Key insight
Both 'remove the greatest' and 'remove the least' leave n − 1 numbers, and their sums differ by 72, so 72/(n − 1) = 40 − 32.
Solution
Let have elements with total , greatest element and least element . Turn each average into a sum:
- Remove ( elements): .
- Remove and ( elements): .
- Put back, so only is missing ( elements): .
- .
Subtract (1) from (3): . With (4), , so .
Now (1) gives and (2) gives , so , hence and .
The average of is .
The answer is .
Why this works
Averages hide sums; once each statement is written as "sum average count," the problem is a small linear system. The efficient move is to compare the two statements with the same count (): their sums differ by exactly , which the problem hands you. Always look for two equations that share a count and subtract.
The trap
Setting up the third average with n − 2 elements, forgetting that the greatest integer was put back and the set again has n − 1 elements.
Common mistakes
- Setting up the third average with n − 2 elements, forgetting that the greatest integer was put back and the set again has n − 1 elements.
- Solving for correctly but then averaging or reporting over instead of over .
Techniques
Set up the equation/formula and compute; no special trick needed