olymmath

TH-TMO 2023 Problem 4

    A table tennis tournament has 101101 contestants, where each pair of contestants will play each other exactly once. In each match, the player who gets 1111 points first is the winner, and the other the loser. At the end of the tournament, it turns out that there exist matches with scores 1111 to 00 and 1111 to 1010 . Show that there exists 3 contestants A,B,CA,B,C such that the score of the losers in the matches between A,BA,B and A,CA,C are equal, but different from the score of the loser in the match between B,CB,C .

    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 th-tmo/2023/p4 · Tag Q739XPR3XV · Edit this page on GitHub · Keys: j next, k previous