3. Section 10.3
Sign In
1 Bracelet: 4
2 Bracelets: 6
3 Bracelets: 4
4 Bracelets: 1
| Number of Bracelets | _nC_r |
|---|---|
| 0 | _4C_0 |
| 1 | _4C_1 |
| 2 | _4C_2 |
| 3 | _4C_3 |
| 4 | _4C_4 |
Next, push the MATH button, scroll to PRB, and choose the third option. Having chosen _nC_r,
we finish by entering the number of bracelets she wants to pick out.
There is only one way she can pick no bracelets. We repeat the procedure with the remaining expressions.
Let's have a look at Pascal's triangle.
n= 4, r= 2
Subtract term
Write as a product
Cancel out common factors
Simplify quotient
2!=2
Multiply
Calculate quotient
We want to select 4 bracelets, which means we start counting from r=0 until we reach r=4 on this row.
As we can see, the number of combinations when choosing 4 of 6 bracelets is 15.