AMC 10 Step by Step

2020 AMC 10B Problem 17

P16-20~7 minPrint

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 him or her, 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?

Log in to save your progress.
Show solution without answering

Key insight

Split into cases by how many pairs are 'across' pairs. Everyone left must pair with a neighbor, so each leftover stretch of the circle needs an even number of people.

Solution

Number the people 0,1,2,…,90, 1, 2, \ldots, 9 around the circle. A person can pair with a neighbor (like 33 and 44) or with the person directly across (like 33 and 88, numbers that differ by 55). There are 55 across pairs: {0,5},{1,6},{2,7},{3,8},{4,9}\{0,5\}, \{1,6\}, \{2,7\}, \{3,8\}, \{4,9\}.

A useful fact. Suppose some people are already paired. The rest sit in stretches of people standing next to each other, and they must pair with neighbors inside their stretch. A stretch like 1,2,3,41, 2, 3, 4 can be paired in only one way: {1,2},{3,4}\{1,2\}, \{3,4\}. A stretch with an odd number of people cannot be paired at all.

Now split into cases by how many across pairs are used.

  1. No across pairs. Everyone pairs with a neighbor around the full circle: either {0,1},{2,3},…,{8,9}\{0,1\}, \{2,3\}, \ldots, \{8,9\} or {1,2},{3,4},…,{9,0}\{1,2\}, \{3,4\}, \ldots, \{9,0\}. That is 22 ways.
  2. One across pair. Say {0,5}\{0,5\}. The others form two stretches, 1,2,3,41,2,3,4 and 6,7,8,96,7,8,9, each with 44 people, so each pairs up in one way. There are 55 choices of across pair, so 55 ways.
  3. Two across pairs. Try {0,5}\{0,5\} and {1,6}\{1,6\}: the stretches left are 2,3,42,3,4 and 7,8,97,8,9, with 33 people each. Try {0,5}\{0,5\} and {2,7}\{2,7\}: the stretches are 11, then 3,43,4, then 66, then 8,98,9, and the single person 11 cannot pair. Every choice of two looks like one of these, so 00 ways.
  4. Three across pairs. Now look at the two across pairs not used; those 44 people must pair with neighbors. If the unused pairs are {0,5}\{0,5\} and {1,6}\{1,6\}, then {0,1}\{0,1\} and {5,6}\{5,6\} work. If they are not next to each other, like {0,5}\{0,5\} and {2,7}\{2,7\}, then person 00 has no free neighbor. There are 55 ways to choose two neighboring across pairs ({0,5}&{1,6}\{0,5\}\&\{1,6\}, {1,6}&{2,7}\{1,6\}\&\{2,7\}, {2,7}&{3,8}\{2,7\}\&\{3,8\}, {3,8}&{4,9}\{3,8\}\&\{4,9\}, {4,9}&{0,5}\{4,9\}\&\{0,5\}), so 55 ways.
  5. Four across pairs. The two people left stand directly across from each other, and they are not neighbors. 00 ways.
  6. Five across pairs. 11 way.

Total: 2+5+0+5+0+1=132 + 5 + 0 + 5 + 0 + 1 = 13.

The answer is (C) 13\boxed{\textbf{(C)}\ 13}.

Why this works

Choosing the special across pairs first leaves people standing in rows, and a row pairs up in exactly one way when it has an even number of people and in no way when it is odd. Checking that even-or-odd rule for each case is what knocks out the cases with 22 and 44 across pairs, which students often count by mistake.

Concise solution

A shorter write-up, the way contest solutions are usually written. It may take a different route from the solution above.

Number the people 00 through 99 around the circle. The allowed pairs are neighbor pairs {i,i+1}\{i, i+1\} and the five "diameters" {i,i+5}\{i, i+5\}. Classify pairings by how many diameters kk they use.

Once the diameters are chosen, the remaining people sit in arcs of consecutive positions and must be paired with neighbors within those arcs. An arc with an even number of people can be paired in exactly one way; an odd arc is impossible.

  • k=0k = 0: pair everyone with neighbors around the full circle. Either {0,1},{2,3},…\{0,1\},\{2,3\},\dots or {1,2},{3,4},…\{1,2\},\{3,4\},\dots: 22 ways.
  • k=1k = 1: removing one diameter leaves two arcs of 44 people. Each pairs uniquely: 55 choices of diameter, 55 ways.
  • k=2k = 2: two diameters remove 44 people at positions i,j,i+5,j+5i, j, i+5, j+5. Whether i,ji, j are adjacent or two apart, some leftover arc has 33 or 11 people: 00 ways.
  • k=3k = 3: the two unused diameters must leave arcs of even size, which requires their endpoints to be adjacent, e.g. unused diameters {0,5},{1,6}\{0,5\},\{1,6\} leave arcs {0,1}\{0,1\} and {5,6}\{5,6\}. There are 55 adjacent pairs of diameters: 55 ways.
  • k=4k = 4: two leftover people sit directly across, not adjacent: 00 ways.
  • k=5k = 5: all diameters, 11 way.

Total: 2+5+0+5+0+1=132 + 5 + 0 + 5 + 0 + 1 = 13.

The answer is (C) 13\boxed{\textbf{(C)}\ 13}.

Review in the AoPS books

Similar problems

Problem © Mathematical Association of America (MAA), American Mathematics Competitions. Reproduced for non-commercial educational use. Solution and commentary are original to this site.