In an exam every question is solved by exactly four students, every pair of questions is solved by exactly one student, and none of the students solved all of the questions. Find the maximum possible number of questions in this exam.
Junior Turkish Mathematical Olympiad
Solution
Suppose solved , but not where . Since is solved by exactly 4 students, and and are solved by exactly one student for each , there must be another student who solved two of the questions besides , a contradiction. Therefore . Since is solved by exactly four students, the number of questions cannot be more than .
On the other hand, an exam with 13 questions where
is solved by ; is solved by ; is solved by ; is solved by ; is solved by ; is solved by ; is solved by ; is solved by ; is solved by ; is solved by ; is solved by ; is solved by ; is solved by
satisfies the conditions of the question.
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.