Combinations
A combination counts the ways to choose r items from n different items when order does not matter. If you count by lining them up (permutations), the same r items get counted times, once for each order. So you divide the number of permutations by .
Formulas
- ()
When to use it
Use it when you only choose and order does not matter, such as picking representatives or a team.
Worked example
Choose 2 representatives from 5 people. Step 1: choosing in order gives ways. Step 2: but (A, B) and (B, A) are the same pair, so divide by 2. Step 3: , so the answer is 10 ways.
Common mistake
If the chosen people get different roles, like president and vice president, order matters, so use a permutation, not a combination. First ask whether swapping the chosen people gives the same case.