College Algebra (10th Edition)

Published by Pearson
ISBN 10: 0321979478
ISBN 13: 978-0-32197-947-6

Chapter 10 - Test - Page 709: 8

Answer

See below.

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 in the set of candies, thus we have to use combinations. There are $21$ colors for $6$ spots, thus $_{21}C_{6}=\frac{21!}{(21-6)!6!}=54264$
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.