MathDB
Problems
Contests
International Contests
Tournament Of Towns
1996 Tournament Of Towns
(492) 5
(492) 5
Part of
1996 Tournament Of Towns
Problems
(1)
TOT 492 1996 Spring J A5 8 students 8 problems
Source:
8/16/2024
Eight students were asked to solve
8
8
8
problems (the same set of problems for each of the students).(a) Each problem was solved by
5
5
5
students. Prove that one canfind two students so that each of the problems was solved by at least one of them.(b) If each problem was solved by
4
4
4
students, then it is possible that no such pair of students exists. Prove this.(S Tokarev)
combinatorics