McGraw Hill Glencoe Algebra 2, 2012
MH
McGraw Hill Glencoe Algebra 2, 2012 View details
4. Counting Techniques
Continue to next subchapter

Exercise 14 Page P12

Is the order important?

Permutations or combinations? Combinations
Answer: 816

Practice makes perfect

We want to find how many ways there are to select 3 backup singers out of 18 who try out. Note that, in this case, the order is not important. Thus, the situation involves combinations. To calculate the answer, we will use the formula for combinations of n singers taken r at a time. _n C_r = _n P_r/r! ⇔ _n C_r = n!/(n-r)!r! In our exercise, n= 18 and r= 3. Let's substitute these values into the above formula.

_n C_r = n!/(n-r)! r!
_(18) C_3 = 18!/( 18- 3)! 3!
â–¼
Simplify
_(18) C_3 = 18!/15! 3!

Write as a product

_(18) C_3 = 18* 17* 16* 15!/15! 3!
_(18) C_3 = 18* 17* 16/3!

Write as a product

_(18) C_3 = 18* 17* 16/3* 2* 1
_(18) C_3 = 4896/6
_(18) C_3 = 816

There are 816 ways to select 3 out of 18 singers.