# 2019 AIME II Problems/Problem 5

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

## Problem

Four ambassadors and one advisor for each of them are to be seated at a round table with $12$ chairs numbered in order $1$ to $12$. Each ambassador must sit in an even-numbered chair. Each advisor must sit in a chair adjacent to his or her ambassador. There are $N$ ways for the $8$ people to be seated at the table under these conditions. Find the remainder when $N$ is divided by $1000$.

## Solution 1

Let us first consider the $4$ ambassadors and the $6$ even-numbered chairs. If we consider only their relative positions, they can sit in one of $3$ distinct ways: Such that the $2$ empty even-numbered chairs are adjacent, such that they are separated by one occupied even-numbered chair, and such that they are opposite each other. For each way, there are $4!=24$ ways to assign the $4$ ambassadors to the $4$ selected seats.

In the first way, there are $6$ distinct orientations. The $4$ advisors can be placed in any of the $5$ odd-numbered chairs adjacent to the ambassadors, and for each placement, there is exactly one way to assign them to the ambassadors. This means that there are $24\cdot6\cdot\binom{5}{4}=720$ total seating arrangements for this way.

In the second way, there are $6$ distinct orientations. $3$ advisors can be placed in any of the $4$ chairs adjacent to the "chunk" of $3$ ambassadors, and $1$ advisor can be placed in either of the $2$ chairs adjacent to the "lonely" ambassador. Once again, for each placement, there is exactly one way to assign the advisors to the ambassadors. This means that there are $24\cdot6\cdot\binom{4}{3}\cdot\binom{2}{1}=1152$ total seating arrangements for this way.

In the third way, there are $3$ distinct orientations. For both "chunks" of $2$ ambassadors, $2$ advisors can be placed in any of the $3$ chairs adjacent to them, and once again, there is exactly one way to assign them for each placement. This means that there are $24\cdot3\cdot\binom{3}{2}\cdot\binom{3}{2}=648$ total seating arrangements for this way.

Totalling up the arrangements, there are $720+1152+648=2520$ total ways to seat the people, and the remainer when $2520$ is divided by $1000$ is $\boxed{520}$. ~emerald_block

## Solution 2 In the diagram, the seats are numbered 1...12. Rather than picking seats for each person, however, each ambassador/assistant team picks a gap between the seats (A...L) and the ambassador sits in the even seat while the assistant sits in the odd seat. For example, if team 1 picks gap C then Ambassador 1 will sit in seat 2 while assistant 1 will sit in seat 3. No two teams can pick adjacent gaps. For example, if team 1 chooses gap C then team 2 cannot pick gaps B or D. In the diagram, the teams have picked gaps C, F, H and J. Note that the gap-gaps - distances between the chosen gaps - (in the diagram, 2, 1, 1, 4) must sum to 8. So, to get the number of seatings, we:

1. Choose a gap for team 1 ( $12$ options)
2. Choose 3 other gaps around the table with positive gap-gaps. The number of ways to do this is the number of ways to partition 8 with 4 positive integers. This is the same as partitioning 4 with 4 non-negative integers, and using stars-and-bars, this is $\dbinom{4+4-1}{4-1}=\dbinom{7}{3}=35$
3. Place the other 3 teams in the chosen gaps ( $6$ permutations)

So the total is $12\cdot35\cdot6=2520$ And the remainder is $\boxed{520}$

## Solution 3

There are $360\cdot16$ total ways to let everyone sit. However this may lead to advisors sitting in the same chair, leading to awkward situations. So we find how many ways this happens. There are 6 ways to choose which advisors end up sitting together, times 12 ways to find neighboring even seats and sitting down, 12 ways for the rest of the ambassador to sit, and 4 ways for their advisors to sit to get 3456 ways for this to happen. However we overcounted the case when two pairs of advisors run out of room to sit, where there are $6\cdot9\cdot4=216$ ways to happen. So 5760-3456+216= $2\boxed{520}$.

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