Algebra 2 (1st Edition)

Published by McDougal Littell
ISBN 10: 0618595414
ISBN 13: 978-0-61859-541-9

Chapter 10 Counting Methods and Probability - 10.2 Use Combinations and the Binomial Theorem - 10.2 Exercises - Problem Solving - Page 696: 52b


See below

Work Step by Step

We know that if we want to select $r$ objects out of $n$ disregarding the order, we can do this in $_nC_r=\frac{n!}{r!(n-r)!}$ ways. Choose 5 out of 15 students to wash fire trucks. Here we have $n_1=15,r_1=5$: $_{15}C_5=\frac{15!}{10!5!}=3003$ Choose 7 out of 10 students to repair the station's interior. Here we have $n_1=10,r_1=7$: $_{15}C_5=\frac{10!}{3!7!}=120$ Choose 3 out of 3 students to do the maintenance. Here we have $n_1=3,r_1=3$: $_{15}C_5=\frac{3!}{0!3!}=1$ The number of possible job assignments is $_{15}C_5 \times_{10}C_7\times_3C_3=3003\times120\times1=360360$
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.