IMC 2013 · Problem 3

Day 120th IMC · Blagoevgrad, Bulgaria

Statement

There are 2n2n students in a school (nNn \in \mathbb{N}, n2n \ge 2). Each week nn 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?

Official solution

Hidden so you can work on the problem first.

Proposed by Oleksandr Rybak, Kiev, Ukraine.