Maths Olympiad Prep

Library / /3 of 7

Combinatorics Difficulty 5.0 AIME, harder Prove it Hong Kong

There are 20 students in a class, numbered 11 to 2020. They have taken a test with nn questions. After the test, the teacher tried to pick some students to draft the solutions, and as such it is necessary that the picked students together can solve all questions. The teacher found that this can be only done by choosing all students whose class numbers are even, or all students whose class numbers are multiples of 55, or any combination that includes all students from one of the two groups mentioned above. Find the smallest possible value of nn.

Solution

Answer: 1818

For convenience we shall call 'a student whose class number is even' an even student. We make the following observations.

(1) Every question is solved by at least one even student (as the teacher could choose all even students).

(2) Similarly, every question is solved by at least one of students 55, 1010, 1515, 2020.

(3) Students 22, 44, 66, \ldots, 1818 (i.e. all even students except student 2020) cannot solve all questions (since any choice of the teacher must include either all even students or all students whose numbers are multiples of 55). By (1), there must be a question which was solved by student 2020 but not by any other even student.

(4) For the same reason in (3), there must be a question which was solved by student 1010 but not by any other even student.

(5) We claim that there exist at least two questions that were solved by student 22 but not any other even student. Using the same argument as in (3), we can show that there is at least one such question. Now suppose there is exactly one such question PP. Now neither student 1010 nor 2020 solved PP, so by (2) we know that either student 55 or 1515 solved PP. Without loss of generality suppose student 55 did it. Consider students 44, 55, 66, 88, 1010, 1212, 1414, 1616, 1818, 2020 (i.e. all even students but with student 22 replaced by student 55). Since student 22 and student 1515 are missing, these students together did not solve all questions. That means there is a question QQ which cannot be solved by these students (note that PQP \neq Q since student 55 solved PP). As student 22 cannot solve QQ either (since PP is the only question solved by student 22 but not any other even student), that means no even student could solve QQ, which contradicts (1). This proves the claim.

(6) For the same reason in (5), for each of students 44, 66, 88, 1212, 1414, 1616, 1818, there must be at least two questions that were solved by that student but not any other even student.

From (3), (4), (5) and (6), there are at least 1+1+2+2×7=181 + 1 + 2 + 2 \times 7 = 18 questions, and they are clearly distinct (by considering which even student solved each question). On the other hand, we can construct a paper with exactly 1818 questions as follows:

* Question 1010 — solved by student 1010 only
* Question 2020 — solved by student 2020 only
* Question xx for each x{2,4,6,8,12,14,16,18}x \in \{2, 4, 6, 8, 12, 14, 16, 18\} — solved by students 55 and xx only
* Question xx' for each x{2,4,6,8,12,14,16,18}x' \in \{2, 4, 6, 8, 12, 14, 16, 18\} — solved by students 1515 and xx only

It can be easily checked that all even students together solved all questions, all students whose numbers are multiples of 55 together solved all questions, and that if not all even students are present and not all students whose numbers are multiples of 55 are present, then at least one question is not solved by the students picked. The answer is thus 1818.

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.

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