Skip to main content

2016 AMC 12B Problem 20

Problem 20 of 25HarderCounting & Probability

A set of teams held a round-robin tournament in which every team played every other team exactly once. Every team won 1010 games and lost 1010 games; there were no ties. How many sets of three teams {A,B,C}\{A,B,C\} were there in which AA beat B,B, BB beat C,C, and CC beat A?A?

Answer choices

Show solution

Solution

Since each team won 1010 and lost 10,10, there are 2121 teams and (213)=1330\binom{21}{3}=1330 triples. A triple is not cyclic exactly when one team beats both others. Choosing that team (2121 ways) and 22 of the 1010 teams it beat gives 21(102)=2145=94521\cdot\binom{10}{2}=21\cdot45=945 non-cyclic triples. Thus the cyclic triples number 1330945=385.1330-945=385. Thus, the correct answer is A.

More practice

Concepts: graph theory · complementary counting · combinations

Problem text and solution from the LIVE past-contest archive. See also the AoPS wiki page for community solutions.