1989 AIME Problems/Problem 11
Problem
A sample of 121 integers is given, each between 1 and 1000 inclusive, with repetitions allowed. The sample has a unique mode (most frequent value). Let be the difference between the mode and the arithmetic mean of the sample. What is the largest possible value of ? (For real , is the greatest integer less than or equal to .)
Solution 1
Let the mode be , which we let appear times. We let the arithmetic mean be , and the sum of the numbers be . Then As is essentially independent of , it follows that we wish to minimize or maximize (in other words, ). Indeed, is symmetric about ; consider replacing all of numbers in the sample with , and the value of remains the same. So, without loss of generality, let . Now, we would like to maximize the quantity
contains numbers that may appear at most times. Therefore, to maximize , we would have appear times, appear times, and so forth. We can thereby represent as the sum of arithmetic series of . We let , so
where denotes the sum of the remaining numbers, namely .
At this point, we introduce the crude estimate^{[1]} that , so and Expanding (ignoring the constants, as these do not affect which yields a maximum) and scaling, we wish to minimize the expression . By AM-GM, we have , with equality coming when , so . Substituting this result and some arithmetic gives an answer of .
In less formal language, it quickly becomes clear after some trial and error that in our sample, there will be values equal to one and values each of . It is fairly easy to find the maximum. Try , which yields , , which yields , , which yields , and , which yields . The maximum difference occurred at , so the answer is .
Solution 2
With the same reasoning as Solution 1, in order to get largest possible value of D, we can construct that our set of numbers as And, we need to find the value of n that makes the sum as low as possible. And, we can create a formula to make it easier. It isn't hard to find the sum. The numbers which are not 1000, average to or , and there are of them. So, they sum to . And, the sum of the numbers that are 1000 is so, our total sum gets us We want to minimize it, since the mode will always be 1000. And, testing the values n = 1, n = 2, n = 3, n = 4, we get these results.
And, as n grows larger and larger from 4, the values will start increasing. Thus, the lowest possible sum is 6340. Dividing by 121, the lowest possible mean is 52.396...., and thus, the highest possible value of is 947.604, and the floor of that is
- AlexLikeMath
Notes
- ^ In fact, when (which some simple testing shows that the maximum will occur around), it turns out that is an integer anyway, so indeed .
See also
1989 AIME (Problems • Answer Key • Resources) | ||
Preceded by Problem 10 |
Followed by Problem 12 | |
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.