olymmath

KöMaL 2025 C1875

    Thanks to a generous donation, during the lunch break of the KöMaL Ankét on Saturday, mm types of books were distributed among the nn students present. There were multiple copies available of each book type, and everyone could choose freely: they could take books of several types, but at most one copy of each type. We know that for any two books there were a difference of at least three students between the set of students choosing each book. Prove that m≤2nn+1m \leq \frac{2^{n}}{n+1}.

    Official text KöMaL. 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 hu-komal/2025/c1875 · Tag TQEJN8EJ4X · Edit this page on GitHub · Keys: j next, k previous