Discrete Mathematics and Its Applications, Seventh Edition

Published by McGraw-Hill Education
ISBN 10: 0073383090
ISBN 13: 978-0-07338-309-5

Chapter 6 - Section 6.5 - Generalized Permutations and Combinations - Exercises - Page 433: 28

Answer

There are C(n + r − q1 − q2 ...− $q_{r}$ −1, n − q1 − q2 −...− $q_{r}$ ) selections

Work Step by Step

The order of selection does not matter. Thus we use $C$(). There are n objects of r different types. There are at least $q_{1}$ objects of type one, at least $q_{2}$ of type 2,.. at least $q_{r}$ of type r. We select $q_{1}$ objects of type one, $q_{2}$ of type 2,.. $q_{r}$ of type r. So there are, n-$q_{1}-q_{2}...-q_{r}$ that has to be selected from r different types. Using the definition of combination with repetition allowed, we obtain that there are C(n + r − q1 − q2 ...− $q_{r}$ −1, n − q1 − q2 −...− $q_{r}$ ) selections
Update this answer!

You can help us out by revising, improving and updating this answer.

Update this answer

After you claim an answer you’ll have 24 hours to send in a draft. An editor will review the submission and either publish your submission or provide feedback.