Text
Answer the following questions, explaining the combinatorial formula you use.
(a) In how many ways can people be arranged around a table, if two arrangements are considered equal when every person has the same left and right neighbor?
(b) In how many ways can identical treats be distributed among hiding spots?
(c) In how many ways can different gifts be distributed among people (possibly all to the same person)?
(d) In how many ways can students be split into groups of (unordered groups)? Show that the answer is .
(e) In how many ways can Dobermans be chosen out of and pitbulls out of ?
Solution
(a) Circular permutations: fix one person as a reference point and arrange the remaining in the remaining seats: .
(b) Combinations with repetition (stars and bars): distributing identical objects into containers amounts to choosing dividers among positions:
(c) Each gift, being distinct, can go to any of the people independently of the others:
(d) Choose students out of for the first group, then out of the remaining for the second, and the last automatically form the third group; since the groups are unlabeled (unordered), divide by to remove permutations of the same three groups:
(e) The two choices are independent, so the combinations are multiplied: