olymmath

NL-NWO 2009 Problem 3

    A tennis tournament has at least three participants. Every participant plays exactly one match against every other participant. Moreover, every participant wins at least one of the matches he plays. (Draws do not occur in tennis matches.) Show that there are three participants A,BA, B and CC for which the following holds: AA wins against B,BB, B wins against CC , and CC wins against AA .

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