Question 79
In a school there are $n$ courses and $n$ students. The students are enrolled in several courses in such a way that two different students never have exactly the same courses. Prove that one can remove a course so that no pair of students ends up with exactly the same courses.