Maths Olympiad Prep

Library / IMO Hk TST /17 of 119

IMO Hk TST

Algebra Difficulty 7.5 National Olympiad, round 2 Prove it Hong Kong

In a competition, each participant can get an integral score lying between 00 and 1010 inclusive. It is found that the mean, median and mode of the scores are 33, 33, 77 respectively. Find the minimum number of participants.

Solution

The minimum number of participants is 1717.
Let ana_n be the number of participants obtaining score nn, and let m=a0+a1+⋯+a10m = a_0 + a_1 + \cdots + a_{10} be the total number of participants. Using the mean, we have ∑n=010nan=3m\sum_{n=0}^{10} n a_n = 3m. This means
∑n=410(n−3)an=3a0+2a1+a2.(1) \sum_{n=4}^{10} (n-3)a_n = 3a_0 + 2a_1 + a_2. \qquad (1)

Case 1. mm is odd
Since 33 is the median, we must have a0+a1+a2≤m−12a_0 + a_1 + a_2 \le \frac{m-1}{2}. This implies
a0+a1+a2+1≤∑n=310an.(2) a_0 + a_1 + a_2 + 1 \le \sum_{n=3}^{10} a_n. \qquad (2)
Using (1) and (2), we obtain
3a0+2a1+a2=∑n=410(n−3)an=∑n=310an+∑n=410(n−4)an−a3≥(a0+a1+a2+1)+(3a7)−a3. 3a_0 + 2a_1 + a_2 = \sum_{n=4}^{10} (n-3)a_n = \sum_{n=3}^{10} a_n + \sum_{n=4}^{10} (n-4)a_n - a_3 \\ \ge (a_0 + a_1 + a_2 + 1) + (3a_7) - a_3.
This implies 2a0+a1+a3≥3a7+12a_0 + a_1 + a_3 \ge 3a_7 + 1. Since the mode is 77, we have a0,a1,a3≤a7−1a_0, a_1, a_3 \le a_7 - 1. This yields
3a7+1≤2a0+a1+a3≤4(a7−1), 3a_7 + 1 \le 2a_0 + a_1 + a_3 \le 4(a_7 - 1),
and hence a7≥5a_7 \ge 5. Now, we have
m≥a0+a1+a3+a7=(2a0+a1+a3)−a0+a7≥(3a7+1)−(a7−1)+a7≥17. m \ge a_0 + a_1 + a_3 + a_7 = (2a_0 + a_1 + a_3) - a_0 + a_7 \ge (3a_7 + 1) - (a_7 - 1) + a_7 \ge 17.
Equality holds when a0=a1=a3=4a_0 = a_1 = a_3 = 4, a7=5a_7 = 5 and all other aja_j's are 00. One checks that all conditions are satisfied.

Case 2. mm is even
If a3>0a_3 > 0, then the two scores in the middle are 33. The bound a0+a1+a2≤m−12a_0 + a_1 + a_2 \le \frac{m-1}{2} used in case 1 still holds, and so we still have m≥17m \ge 17.
If a3=0a_3 = 0, then we only have a0+a1+a2≤m2a_0 + a_1 + a_2 \le \frac{m}{2}. This implies
a0+a1+a2≤∑n=410an.(3) a_0 + a_1 + a_2 \le \sum_{n=4}^{10} a_n. \qquad (3)
Using (1) and (3), we obtain
3a0+2a1+a2=∑n=410(n−3)an=∑n=410an+∑n=410(n−4)an≥(a0+a1+a2)+(3a7). 3a_0 + 2a_1 + a_2 = \sum_{n=4}^{10} (n-3)a_n = \sum_{n=4}^{10} a_n + \sum_{n=4}^{10} (n-4)a_n \\ \ge (a_0 + a_1 + a_2) + (3a_7).
This implies 2a0+a1≥3a72a_0 + a_1 \ge 3a_7. But then one of a0,a1a_0, a_1 is greater than or equal to a7a_7, contradicting the fact that 77 is the mode.
In any case, we have m≥17m \ge 17, and so 1717 is the minimum value.

Want a route through all this instead of an archive? The track puts 2,604 problems in a working order, from Junior Challenge level to the IMO shortlist.

Source: MathNet, licensed CC-BY-4.0. Statement reproduced verbatim; metadata (topic, difficulty) added by this project.