π Combinatorics Notes
1. Factorial (n!)
- n! = n Γ (n-1) Γ (n-2) Γ ... Γ 1
- 0! = 1 (by definition) π Counts the number of ways to arrange n distinct objects.
---
2. Permutations (Order matters)
a) Without Repetition
P(n,r) = n! Γ· (n-r)! π Choose r objects from n, order matters, no repeats allowed.
Example: Seating 3 students out of 10 chairs β order matters.
b) With Repetition
n^r π Each position can be filled in n ways, repeats allowed.
Example: 4-digit PIN code using 0β9 (digits can repeat).
---
3. Combinations (Order does not matter)
a) Without Repetition
C(n,r) = n! Γ· ( r! Γ (n-r)! ) π Choose r objects from n, order doesnβt matter, no repeats.
Example: Picking 3 team members out of 10 students.
b) With Repetition
C(n+r-1, r) = ( (n+r-1)! ) Γ· ( r! Γ (n-1)! ) π Choose r objects from n, order doesnβt matter, repeats allowed.
Example: Choosing 3 scoops of ice cream from 5 flavors (flavors can repeat).
---
4. Key Differences
- Permutation = Order matters
- Without repeat β P(n,r)
- With repeat β n^r
- Combination = Order does not matter
- Without repeat β C(n,r)
- With repeat β C(n+r-1, r)
π Trick to remember:
- PIN codes β Permutations (order matters)
- Teams β Combinations (order doesnβt matter)
- Ice cream scoops β Combination with repetition