Combinations
A combination is an unordered selection of objects. Order does NOT matter!
The Formula
Choosing k objects from n without regard to order:
C(n,k)=(kn)=k!(n−k)!n!
Example: Choosing 3 people from 10:
(310)=3!⋅7!10!=3×2×110×9×8=120
Permutation vs Combination
|
Order Matters? |
Formula |
| Permutation |
Yes |
P(n,k)=(n−k)!n! |
| Combination |
No |
(kn)=k!(n−k)!n! |
Why Divide by k!?
Permutations count each selection k! times (all orderings). To get combinations, divide by k!.
Example: Choosing {A, B, C}:
- Permutations: ABC, ACB, BAC, BCA, CAB, CBA (6 ways)
- Combinations: {A, B, C} (1 way)
- Relationship: 3!6=1
Binomial Coefficients
The notation (kn) is read as “n choose k” and called a binomial coefficient.
Properties:
- (0n)=(nn)=1
- (kn)=(n−kn)
- (1n)=n
Example: Lottery
In a lottery, you choose 6 numbers from 49. How many possible tickets?
(649)=6!⋅43!49!=13,983,816