The number of ways to choose r objects from n distinct objects without regard to order is given by:
nCr=(rn)=r!(n−r)!n!
where n≥r≥0.
| Property | Statement |
|---|
| Symmetry | nCr=nCn−r |
| Identity | nC0=nCn=1 |
| Unit | nC1=n |
| Pascal's Rule | nCr+nCr−1=n+1Cr |
Example 1: Evaluate 8C3.
8C3=3!⋅5!8!=3×2×18×7×6=6336=56
Example 2: Find n if nC2=15.
2!(n−2)!n!=15⟹2n(n−1)=15⟹n(n−1)=30
Since 6×5=30, we get n=6.
Example 3: Use the symmetry property to simplify 12C10.
12C10=12C12−10=12C2=212×11=66
Example 4: In how many ways can a committee of 3 be selected from 7 people?
7C3=3!⋅4!7!=67×6×5=35 ways
- Permutation nPr: order matters — arranging r from n.
- Combination nCr: order does not matter — selecting r from n.
nCr=r!nPr