2002 AMC 10A Problem 21
The mean, median, unique mode, and range of a collection of eight integers are all equal to 8. The largest integer that can be an element of this collection is
Show solution without answering
Key insight
The mean makes the total 64, and the range makes the smallest number equal the largest minus 8. Push the largest up until the other conditions break.
Solution
This asks for the greatest possible largest number, so there are two halves: show (or more) is impossible, then give a list that works with .
What the conditions say.
- Mean with eight numbers: the total is .
- Range : smallest largest .
- Median : with eight numbers in order, the 4th and 5th average to .
- Unique mode : the number appears more often than any other number.
Part 1: the largest cannot be or more.
- Suppose the largest is . Then the smallest is , so all eight numbers are at least . The other seven numbers add to , and seven numbers that are each at least add to at least . So they must all be exactly : the list is . Its median and mode are , not . So fails.
- Suppose the largest is or more. Then the smallest is at least , so the total is at least , which is more than . That fails too.
Part 2: the largest can be .
7. With largest , the smallest is . The other seven numbers must add to . Put s in the middle for the median, and use as many s as possible to keep the total down. Three s and four s give . The list is
8. Check every condition:
- total , so the mean is ;
- the 4th and 5th numbers are and , so the median is ;
- appears four times and only three times, so is the only mode;
- range .
The largest number can be but not more.
The answer is .
Why this works
With statistics conditions, the mean fixes the total, so making one number bigger forces the others to shrink. The range ties the smallest number to the largest, and the unique mode limits how many copies of a small number you can use. Test the largest choice, find which rule it breaks, then build a list for the next choice and check every rule.
Concise solution
A shorter write-up, the way contest solutions are usually written. It may take a different route from the solution above.
Let the largest value be . The constraints: total ; the smallest value is ; the 4th and 5th values average to ; and appears strictly more often than any other value.
Try . Then every value is at least . With mean , the seven other values sum to , so they average exactly and all equal : then is the mode, contradiction. Larger fails the same way (the minimum would be or more, making the total exceed ).
Try . Minimum ... but we may use as the minimum only if , i.e. gives minimum . Take : sum , median , mode (four times versus three), range . All conditions hold.
The answer is .
Review in the AoPS books
- Prealgebra, Chapter 13: Data and Statistics
- Introduction to Counting & Probability, Chapter 2: Basic Counting Techniques (§2.2)
- Prealgebra, Chapter 14: Counting (§14.3)
Similar problems
Problem © Mathematical Association of America (MAA), American Mathematics Competitions. Reproduced for non-commercial educational use. Solution and commentary are original to this site. Also appeared as 2002 12A #15.