The short answer: ask whether swapping two chosen items gives a different result. If yes, it is a permutation (nPr = n! ÷ (n − r)!). If no, it is a combination (nCr = n! ÷ (r! × (n − r)!)). President and secretary from a group is a permutation; a two-member team from the same group is a combination.
The two formulas
| Quantity | Formula | Use when |
|---|---|---|
| nPr | n! ÷ (n − r)! | Order matters |
| nCr | n! ÷ (r! × (n − r)!) | Order does not matter |
| Arrangements with repeats | n! ÷ (p! × q! ...) | Some items are identical |
Remember that n! means n × (n − 1) × ... × 1, and nCr = nC(n − r). So 10C8 = 10C2 = (10 × 9) ÷ 2 = 45, which is much easier than expanding 10C8.
Example 1: forming numbers with a condition
How many 3-digit numbers can be made from the digits 1, 2, 3, 4, 5 without repeating a digit? That is 5P3 = 5 × 4 × 3 = 60. Now, how many of these are even? Fill the units place first: it must be 2 or 4, so 2 ways. The hundreds place then has 4 digits left and the tens place 3. Total = 2 × 4 × 3 = 24. Always fill the restricted place first.
Example 2: a simple committee
In how many ways can a committee of 3 be chosen from 8 people? Order does not matter, so it is 8C3 = (8 × 7 × 6) ÷ (3 × 2 × 1) = 336 ÷ 6 = 56.
Example 3: choosing from two groups
A committee of 4 is chosen from 5 men and 4 women, with exactly 2 women. Choose the women: 4C2 = 6. Choose the men for the other 2 places: 5C2 = 10. The two choices are independent, so multiply: 6 × 10 = 60. The word 'and' means multiply; 'or' (separate cases) means add.
Example 4: repeated letters
How many different arrangements are there of the letters of LEVEL? There are 5 letters, with L twice and E twice. Arrangements = 5! ÷ (2! × 2!) = 120 ÷ 4 = 30. If all five letters were different, the answer would be 120, so dividing removes the duplicate arrangements.
Always together and never together
Suppose 4 friends sit in a row and two of them, A and B, must sit together. Treat A and B as one block. Then 3 items (the block and the two others) can be arranged in 3! = 6 ways, and A and B can swap inside the block in 2! = 2 ways, giving 6 × 2 = 12 arrangements. For 'never together', subtract this from all arrangements: 4! − 12 = 24 − 12 = 12. The two answers are equal here only by coincidence of these numbers, not by any rule.
How to decide which formula
- Read the verb: arrange, rank, line up, form a number means order matters. Choose, select, pick, form a team means order does not matter.
- Check for conditions such as 'exactly', 'at least' and 'always together' and split into cases.
- Fill any restricted position first.
- Estimate: a combination is never larger than the matching permutation.
Mistakes
- Using nPr when the question only asks for a selection.
- Adding where the cases are independent choices (multiply), or multiplying separate cases (add).
- Forgetting to divide for repeated letters.
- Counting a fixed-position case with the unrestricted formula.
- Expanding large factorials instead of cancelling.
Course · Beginner · Free
Higher Mathematics — Permutations and Combinations: Foundation
Foundation course on Permutations and Combinations (Higher Mathematics): the basics, explained from the start.
Try permutation and combination questions in a practice test.
Take a practice testFrequently asked questions
What is the difference between a permutation and a combination?
In a permutation the order of the selected items matters; in a combination it does not.
What is 0! equal to?
0! = 1, by definition. This makes nC0 = nCn = 1.
How many ways can n different things be arranged in a row?
n!. For 5 books on a shelf that is 120 ways.
How do I handle 'always together'?
Treat the group that must stay together as one item, arrange the items, then multiply by the arrangements inside the group.
Is nCr always smaller than nPr?
For r above 1, yes. nPr = nCr × r!, so permutations are r! times larger.