A person hosts a party of 13 guests and places 5 of them on one table and the remaining on the other table, the tables being round. In how many ways can he arrange the guests?
A person hosts a party of 13 guests and places 5 of them on one table and the remaining on the other table, the tables being round. In how many ways can he arrange the guests?
Solution
Let me break this down into simple steps that anyone can follow!
We have guests total. We're putting guests at one round table and guests at another round table. We need to find ALL possible ways to do this.
First, we need to decide which guests (out of ) sit at the first table.
Number of ways to choose guests from =
Why do we use combinations here? Because at this step, we only care about WHO sits at which table, not WHERE they sit at the table.
The remaining guests automatically go to the second table.
Now we arrange the people around each circular table.
Key concept: For a round table with people, we fix one person's position (to avoid counting rotations as different arrangements) and arrange the remaining people. This gives us arrangements.
First table ( people): ways
Second table ( people): ways
Since each choice is independent, we multiply:
Total arrangements = (Ways to choose groups) (Ways to arrange table ) (Ways to arrange table )
Total =
Let me show you a shortcut:
Since and :
Final Answer: