2014 AMC 12A Problems/Problem 13

Revision as of 19:27, 7 February 2014 by Infiniteturtle (talk | contribs) (Created page with "==Problem== ==Solution== We can discern three cases. [b]Case 1: Each room houses one guest.[/b] In this case, we have <math>5</math> guests to choose for the first room, <ma...")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Problem

Solution

We can discern three cases.

[b]Case 1: Each room houses one guest.[/b] In this case, we have $5$ guests to choose for the first room, $4$ for the second, ..., for a total of $5!=120$ assignments. [b]Case 2: Three rooms house one guest; one houses two.[/b] We have $\binom{5}{3}$ ways to choose the three rooms with $1$ guest, and $\binom{2}{1}$ to choose the remaining one with $2$. There are $5\cdot4\cdot3$ ways to place guests in the first three rooms, with the last two residing in the two-person room, for a total of $\binom{5}{3}\binom{2}{1}\cdot5\cdot4\cdot3=1200$ ways. [b]Case 3: Two rooms house two guests; one houses one.[/b] We have $\binom{5}{2}$ to choose the two rooms with two people, and $\binom{3}{1}$ to choose one remaining room for one person. Then there are $5$ choices for the lonely person, and $\binom{4}{2}$ for the two in the first two-person room. The last two will stay in the other two-room, so there are $\binom{5}{2}\binom{3}{1}\cdot5\cdot\binom{4}{2}=900$ ways.

In total, there are $120+1200+900=\boxed{2220}$ assignments, or $\textbf{(B)}$.