Skip to main content
OlympiadHQ

Browse · harp

Print

smc

counting and probability senior

Problem

There are people standing equally spaced around a circle. Each person knows exactly of the other people: the people standing next to her or him, as well as the person directly across the circle. How many ways are there for the people to split up into pairs so that the members of each pair know each other?
(A)
(B)
(C)
(D)
Solution
Consider the people to be standing in a circle, where two people opposite each other form a diameter of the circle. Let us use casework on the number of pairs that form a diameter of the circle. Case 1: diameters There are ways: either pairs with , pairs with , and so on or pairs with , pairs with , etc. Case 2: diameter There are possible diameters to draw (everyone else pairs with the person next to them). Note that there cannot be diameters since there would be one person on either side that will not have a pair adjacent to them. The only scenario forced is when the two people on either side would be paired up across a diameter. Thus, a contradiction will arise. Case 3: diameters There are possible sets of diameters to draw. Notice we are technically choosing the number of ways to choose a pair of two diameters that are neighbors to each other. This means we can choose the first diameter in the pair, and have only two diameters to choose from for the second in the pair. This means we have possibilities for choosing 5 neighboring diameters. However, notice that there are duplicates, so we divide the possibilities by to get . Note that there cannot be a case with diameters because then there would have to be diameters for the two remaining people as they have to be connected with a diameter. A contradiction arises. Case 4: diameters There is only way to do this. Thus, in total there are possible ways.
Final answer
C