olymmath

SE-SKOLORNAS 1976 Problem 1

    In a tournament every team plays every other team just once. Each game is won by one of the teams (there are no draws). Each team loses at least once. Show that there must be three teams AA , BB , CC such that AA beat BB , BB beat CC and CC beat 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 se-skolornas/1976/p1 · Tag 9JEDMAM7FJ · Edit this page on GitHub · Keys: j next, k previous