There are 20 students in a class, numbered to . They have taken a test with 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 , or any combination that includes all students from one of the two groups mentioned above. Find the smallest possible value of .
Solution
Answer:
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 , , , .
(3) Students , , , , (i.e. all even students except student ) cannot solve all questions (since any choice of the teacher must include either all even students or all students whose numbers are multiples of ). By (1), there must be a question which was solved by student but not by any other even student.
(4) For the same reason in (3), there must be a question which was solved by student but not by any other even student.
(5) We claim that there exist at least two questions that were solved by student 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 . Now neither student nor solved , so by (2) we know that either student or solved . Without loss of generality suppose student did it. Consider students , , , , , , , , , (i.e. all even students but with student replaced by student ). Since student and student are missing, these students together did not solve all questions. That means there is a question which cannot be solved by these students (note that since student solved ). As student cannot solve either (since is the only question solved by student but not any other even student), that means no even student could solve , which contradicts (1). This proves the claim.
(6) For the same reason in (5), for each of students , , , , , , , 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 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 questions as follows:
* Question — solved by student only
* Question — solved by student only
* Question for each — solved by students and only
* Question for each — solved by students and only
It can be easily checked that all even students together solved all questions, all students whose numbers are multiples of together solved all questions, and that if not all even students are present and not all students whose numbers are multiples of are present, then at least one question is not solved by the students picked. The answer is thus .