Skip to main content

2020 AMC 10B Problem 17

Problem 17 of 25IntermediateCounting & Probability

There are 1010 people standing equally spaced around a circle. Each person knows exactly 33 of the other 99 people: the 22 people standing next to her or him, as well as the person directly across the circle. How many ways are there for the 1010 people to split up into 55 pairs so that the members of each pair know each other?

Answer choices

Show solution

Solution

Label the people around the circle. Count by the number of pairs of opposite people. With no opposite pairs, everyone must be paired with a neighbor around the 1010-cycle. There are exactly 22 alternating neighbor matchings. With one opposite pair, choose that pair in 55 ways. The remaining people form two paths of four vertices, and each path has only one perfect matching by neighbor pairs, so this gives 55 matchings. With two or four opposite pairs, the remaining neighbor-pairing paths have odd length somewhere, so no perfect matching is possible. With three opposite pairs, the two opposite pairs not chosen must be adjacent around the five opposite-pair positions; otherwise the remaining people cannot be matched by neighbor pairs. There are 55 adjacent choices for the two unchosen opposite pairs, so there are 55 matchings. With all five opposite pairs, there is 11 matching. The total is 2+5+5+1=13.2+5+5+1=13. Thus, the correct answer is C .

More practice

Concepts: graph theory · casework

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