College Algebra (6th Edition)

Published by Pearson
ISBN 10: 0-32178-228-3
ISBN 13: 978-0-32178-228-1

Chapter 8 - Summary, Review, and Test - Review Exercises - Page 790: 80

Answer

$1140$

Work Step by Step

If we want to choose $k$ elements out of $n$ disregarding the order, not allowing repetition, we can do this in $_{n}C_k=\frac{n!}{(n-k)!k!}$ ways. The order doesn't matter here when choosing the set of CDs, thus we have to use combinations and we choose $3$ sets out of $20$. Thus the number of possibilities is: $_{20}C_{3}=\frac{20!}{(20-3)!3!}=\frac{20\cdot19\cdot18}{3\cdot2\cdot1}=1140$
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.