olymmath

IMC 2013 Problem 3

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

    Proposed by Oleksandr Rybak, Kiev, Ukraine.

    Dataset text AI-MO AoPS. Quoted with source.

    Solutions

    No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.

    Add a solution

    Similar problems

    These problems have the most words in common with this statement.

    Locator imc/2013/p3 · Tag 9616EHSZY4 · Edit this page on GitHub · Keys: j next, k previous