Home > Combinatorics, Olympiad > IMC 2013 Problem 3

## IMC 2013 Problem 3

Problem 3. There are ${2n}$ students in a school ${(n \in \Bbb{N},\ n \geq 2}$). Each week ${n}$ students go on a trip. After several trips the following condition was fulfilled: every two students were together on at least one trip. What is the minimum number of trips needed for this to happen?