olymmath

KöMaL 2009 B4152

    Given nn different subsets of the set of numbers 1,2,3,...,nn, prove that there exists a number, such that if it is left out of each subset, the remaining subsets will still be different.

    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/2009/b4152 · Tag B8GQ1HWGXK · Edit this page on GitHub · Keys: j next, k previous