A2.K.1 — Permutations and combinations.
Step 01 of 04
Both COUNT arrangements of items, but they answer different questions.
| Permutation | →order MATTERS — different orders count separately |
| Combination | →order does NOT matter — only the chosen set counts |
"Choosing a president, VP, secretary" → permutation (the roles distinguish the order). "Choosing a 3-person committee" → combination (no roles, just the set of three).
Step 02 of 04
Formulas.
("n factorial") = . By convention .
The combination formula has an extra in the denominator — that "kills" the orderings within the chosen set, since order doesn't matter.
Step 03 of 04
Worked examples.
How many ways to arrange the letters in ? .
How many ways to pick 3 desserts from a menu of 8? Order doesn't matter: .
How many ways to seat 5 people in a row from a group of 10? Order matters: .
Step 04 of 04
Quick decision tree.
| "Arrange / order / lineup / first-second-third" | →permutation |
| "Choose / select / pick / committee / group" | →combination |
| "How many subsets of size k" | →combination |
| Tied to specific positions | →permutation |