olymmath

PL-OM 2012 Problem 4

    nn players ( n≥4n \ge 4 ) took part in the tournament. Each player played exactly one match with every other player, there were no draws. There was no four players (A,B,C,D)(A, B, C, D) , such that AA won with BB , BB won with CC , CC won with DD and DD won with AA . Determine, depending on nn , maximum number of trios of players (A,B,C)(A, B, C) , such that AA won with BB , BB won with CC and CC won with AA . (Attention: Trios (A,B,C)(A, B, C) , (B,C,A)(B, C, A) and (C,A,B)(C, A, B) are the same trio.)

    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 pl-om/2012/p4 · Tag NBTVG8GEZ3 · Edit this page on GitHub · Keys: j next, k previous