In the country of Sugarland, there are students in the IMO team selection camp. team selection tests were taken and the results have come out. Assume that no students have the same score on the same test. To select the IMO team, the national committee of math Olympiad have decided to choose a permutation of these tests and starting from the first test, the person with the highest score between the remaining students will become a member of the team. The committee is having a session to choose the permutation.
Is it possible that all students have a chance of being a team member?
Solution
The answer of the problem is yes.
Although the statement is discussed on students, here is an example for students, all having a chance of being a team member. (students are labelled by .)
| Test Rank | #1 | #2 | #3 | #4 | #5 | #6 |
|---|---|---|---|---|---|---|
| #1 | 1 | 1 | 1 | 1 | 1 | 1 |
| #2 | 2 | 2 | 2 | 2 | 2 | 2 |
| #3 | 3 | 3 | 4 | 4 | 5 | 5 |
| #4 | 6 | 7 | 6 | 8 | 7 | 8 |
| #5 | 9 | 10 | 11 | 12 | 13 | 14 |
| ... | ... | ... | ... | ... | ... | ... |
Note that the fifth person in each test can become a team member, only if all the other four persons above already have been chosen as a team member. Therefore, to prove that the example works, it suffices to show that the fifth person in each test can become a team member. For each of the students , consider these permutations of tests
Want a route through all this instead of an archive? The track
puts 2,000 problems in a working order, from AMC 10 level to the IMO shortlist.