I came across the following problem:
A list of 11 positive integers has a mean of 10, a median of 9, and a unique mode of 8. What is the largest possible value of an integer in the list?
From the information, I got the following information:
- 11 integers with a mean of 10 means a total must be 110.
- A unique mode means that there must be at least two 8's.
- if there are two 8's, and the median is 9, there must be at least two numbers greater than 9 also.
However, I can't figure out exactly what to do from here. Any help would be appreciated!
Taking the numbers to be arranged smallest to largest, we have:
$x_1+x_2+x_3+x_4+x_5+9+x_7+x_8+x_9+x_{10}+x_{11}=110$
We want to make $x_{11}$ as large as possible, while keeping everything else positive, and making sure $8$ is the unique mode. This means making the sum of $x_1$ through $x_{10}$ as small as possible, while respecting the same constraints.
As a first case, we try using exactly two $8$'s, so every other number can only occur once. This gives us:
$1+2+3+8+8+9+10+11+12+13+x_{11}=110$,
or $x_{11}=33$.
As a second case, let's try three $8$'s, which allows us to use each other number twice:
$1+1+8+8+8+9+9+10+10+11+x_{11}=110$,
or $x_{11}=35$.
That seemed to help, so let's try four $8$'s:
$1+8+8+8+8+9+9+9+10+10+x_{11}=110$,
or $x_{11}=30$.
Finally, with five $8$'s, we have:
$8+8+8+8+8+9+9+9+9+10+x_{11}=110$,
or $x_{11}=24$
This exhausts the cases.