2015 AMC 12B Problems/Problem 22

Problem

Six chairs are evenly spaced around a circular table. One person is seated in each chair. Each person gets up and sits down in a chair that is not the same chair and is not adjacent to the chair he or she originally occupied, so that again one person is seated in each chair. In how many ways can this be done?

Solution 1

Consider shifting every person over three seats (left or right) after each person has gotten up and sat back down again. Now, instead of each person being seated not in the same chair and not in an adjacent chair, each person will be seated either in the same chair or in an adjacent chair. The problem now becomes the number of ways in which six people can sit down in a chair that is either the same chair or an adjacent chair in a circle.

Consider the similar problem of people sitting in a chair that is either the same chair or an adjacent chair in a row. Call the number of possibilities for this . Then if the leftmost person stays put, the problem is reduced to a row of chairs, and if the leftmost person shifts one seat to the right, the new person sitting in the leftmost seat must be the person originally second from the left, reducing the problem to a row of chairs. Thus, for . Clearly and , so , , and .

Now consider the six people in a circle and focus on one person. If that person stays put, the problem is reduced to a row of five chairs, for which there are possibilities. If that person moves one seat to the left, then the person who replaces him in his original seat will either be the person originally to the right of him, which will force everyone to simply shift over one seat to the left, or the person originally to the left of him, which reduces the problem to a row of four chairs, for which there are possibilities, giving possibilities in all. By symmetry, if that person moves one seat to the right, there are another possibilities, so we have a total of possibilities.

Solution 2

Label the people sitting at the table and assume that they are initially seated in the order . The possible new positions for and are respectively (a dash indicates a non-allowed position):

The permutations we are looking for should use one letter from each column, and there should not be any repeated letters:

There are such permutations.

Solution 3

We can represent each rearrangement as a permutation of the six elements in cycle notation. Note that any such permutation cannot have a 1-cycle, so the only possible types of permutations are 2,2,2-cycles, 4,2-cycles, 3,3-cycles, and 6-cycles. We deal with each case separately.

For 2,2,2-cycles, suppose that one of the 2-cycles switches the people across from each other, i.e. , , or . WLOG, we may assume it to be . Then we could either have both of the other 2-cycles be across from each other, giving the permutation , or else neither of the other 2-cycles are across from each other, in which case the only possible permutation is . This can happen for and as well. So since the first permutation is not counted twice, we find a total of permutations that are 2,2,2-cycles where at least one of the 2-cycles switches people diametrically opposite from each other. Otherwise, since the elements in a 2-cycle cannot differ by 1, 3, or 5 mod 6, they must differ by 2 or 4 mod 6, i.e. they must be of the same parity. But since we have three odd and three even elements, this is impossible. Hence there are exactly 4 such permutations that are 2,2,2-cycles.

For 4,2-cycles, we assume for the moment that 1 is part of the 2-cycle. Then the 2-cycle can be , , or . The first two are essentially the same by symmetry, and we must arrange the elements 2, 4, 5, 6 into a 4-cycle. However, 5 must have two neighbors that are not next to it, which is impossible, hence the first two cases yield no permutations. If the 2-cycle is , then we must arrange the elements 2, 3, 5, 6 into a 4-cycle. Then 2 must have the neighbors 5 and 6. We find that the 4-cycles and satisfy the desired properties, yielding the permutations and . This can be done for the 2-cycles and as well, so we find a total of 6 such permutations that are 4,2-cycles.

For 3,3-cycles, note that if 1 neighbors 4, then the third element in the cycle will neighbor one of 1 and 4, so this is impossible. Therefore, the 3-cycle containing 1 must consist of the elements 1, 3, and 5. Therefore, we obtain the four 3,3-cycles , , , and .

For 6-cycles, note that the neighbors of 1 can be 3 and 4, 3 and 5, or 4 and 5. In the first case, we may assume that it looks like -- the form is also possible, but equivalent to this case. Then we must place the elements 2, 5, and 6. Note that 5 and 6 cannot go together, so 2 must go in between them. Also, 5 cannot neighbor 4, so we are left with one possibility, namely , which has an analogous possibility . In the second case, we assume that it looks like . Clearly, the 2 must go next to the 5, and the 6 must go last (to neighbor the 3), so the only possibility here is , with the analogous possibility . In the final case, we may assume that it looks like . Then the 2 and 3 cannot go together, so the 6 must go in between them. Therefore, the only possibility is , with the analogous possibility . We have covered all possibilities for 6-cycles, and we have found 6 of them.

Therefore, there are such permutations.

==Solution 4 (Based off Aops MathJam)

Note that each person can't end up in his/her original seat, or either of the two adjacent seats. This means everyone must essentially "move across the table" to the other three seats. Notice we can recast the problem here into two steps: 1) First, everyone move to the seat diametrically across their original seat 2) Second, everyone either stays put, or moves to the chair to their immediate left or right (such that no two people attempt to sit together).

Now we can simply consider cases (Do this as an exercise): The answer is so is the answer.

- Idea came from Jeremy Copeland

See Also

The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions.