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 432: 7

Answer

35 ways

Work Step by Step

Ways to select r unordered elements from a set with n elements with repetition is given by C(n+r-1,r) In our case r= 3 , n= 5 So C(5+3-1,3) = C(7,3) = 35 ways
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.