olymmath

KöMaL 2005 A370

    For any two guests on a party of knkn participants there is some guest who knows both of them. Prove that if $k

    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/2005/a370 · Tag 3SPPBD8WXM · Edit this page on GitHub · Keys: j next, k previous