A combination counts the number of ways to choose objects from distinct objects without regard to order:
where .
Problem: Find the number of ways a committee of 5 members can be formed from 8 persons.
Solution:
We need to choose 5 persons from 8, where order does not matter (a committee has no ranked positions).
Answer: The committee can be formed in 56 ways.
| Property | Formula |
|---|---|
| Symmetry | |
| Boundary | |
| Relation to permutations |
Permutations count ordered arrangements. Since a combination ignores order, we divide by (the number of ways to arrange chosen objects among themselves).
Combinations appear whenever selection without order matters: