Skip to main content

2016 AMC 10B Problem 22

Problem 22 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

The total number of teams is 10+10+1=21.10+10+1=21. The total number of sets is therefore (213)=1330.\binom{21}{3} = 1330. Now, we must subtract the total number of sets such that there is no cycle. This only happens if one team beats the other two teams. There are 2121 choices for the team that beat the other two and (102)=45\binom{10}{2} = 45 ways to choose the teams they beat. Thus, the total of non-cycles is 2145=945.21\cdot 45=945. This means the total number of cycles is 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.