2015 AMC 12B Problems/Problem 22

Revision as of 02:01, 4 March 2015 by Pi over two (talk | contribs) (Solution)

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?

$\textbf{(A)}\; 14 \qquad\textbf{(B)}\; 16 \qquad\textbf{(C)}\; 18 \qquad\textbf{(D)}\; 20 \qquad\textbf{(E)}\; 24$

Solution

Label the people sitting at the table $A, B, C, D, E, F,$ and assume that they are initially seated in the order $ABCDEF$. The possible new positions for $A, B, C, D, E,$ and $F$ are respectively (a dash indicates a non-allowed position):

$\texttt{--AAA-}\\ \texttt{---BBB}\\ \texttt{C---CC}\\ \texttt{DD---D}\\ \texttt{EEE---}\\ \texttt{-FFF--}$

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

CDEFAB
CEAFBD
CEFABD
CEFBAD
CFEABD
CFEBAD
DEAFBC
DEAFCB
DEFABC
DEFACB
DEFBAC
DFEABC
DFEACB
DFEBAC
EDAFBC
EDAFCB
EDFABC
EDFACB
EDFBAC
EFABCD

There are $\boxed{\textbf{(D)}\; 20}$ such permutations.

See Also

2015 AMC 12B (ProblemsAnswer KeyResources)
Preceded by
Problem 21
Followed by
Problem 23
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25
All AMC 12 Problems and Solutions

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