Assignment:
Q1. In how many ways can a man divide 7 gifts among his 3 children if the eldest is to receive 3 gifts and the others 2 each?
Q2. From a group of n people, suppose that we want to choose a committee of k, k ≤ n, one of whom is to be designated as a chairperson. (You don’t have to solve this if you can’t…but I really want to see a solution on this problem.)
(a) By focusing first on the choice of the committee and then on the choice of the chair, argue that there are (n choose k)•k possible choices.
(b) By focusing first on the choice of the nonchair committee members and then on the choice of the chair, argue that there are (n choose k-1)•(n – k + 1) possible choices.
(c) By focusing first on the choice of the chair and then on the choice of the other committee members, argue that there are n•(n-1 choose k-1) possible choices.
(d) Conclude from parts (a), (b), and (c) that
k•(n choose k) = (n – k + 1)•(n choose k-1) = n•(n-1 choose k-1)
(e) Use the factorial definition of (m choose r) to verify the identity in part(d).
Provide complete and step by step solution for the question and show calculations and use formulas.