very simple
Source: Bosnian TST, 2008, 2.nd day
May 18, 2008
ceiling functionLaTeXcombinatorics proposedcombinatorics
Problem Statement
students took part in exam that contains questions. If it is known that each question was solved by at least students, prove that we can always find students such that each of questions was solved by at least one of them.