Probability with Permutations and Combinations
Learn probability with permutations and combinations step by step with worked examples you can follow. Then practise with 37 instant-feedback questions. Free Algebra 2 lesson from Mr Ahmed Hamouda.
Decide whether order matters, then use nPr or nCr to count favorable and possible outcomes and compute the probability.
Core Concepts
1. Probability is still just favorable ÷ possible
Nothing about probability changes in this lesson. The only new thing is how you count the two numbers. When the outcomes are arrangements or selections, you count them with factorials, permutations, or combinations.
2. Vocabulary
n!.a × b
outcomes. Everything below is built from this.n!.Symbols:
n! = n · (n − 1) · (n − 2) · … · 2 · 1,
where 0! = 1
6! = 720 7! = 5040 8! = 40,320 9! = 362,880
0! = 1, not 0. It is
defined that way so that the permutation and combination formulas keep working at the
edges (for example nPn = n!/0! = n!).3. The one decision that drives this whole lesson
Before you compute anything, ask a single question: if I swap two of the chosen objects, do I get a different outcome? If yes, order matters and you are counting permutations. If no, order does not matter and you are counting combinations.
Order MATTERS → permutation
• president, then vice‑president
• seat C11 vs seat C12
• a password / a phone number
• "in that order", "first from the left"
Order does NOT matter → combination
• 4 flavors on one cone
• which 6 people replied
• a set of 3 points
• "in any order", "a group of", "chosen"
4. Permutations of n objects taken r at a time
Line up 7 songs and play only 4 of them. By the Fundamental Counting Principle there are
7 · 6 · 5 · 4 = 840 playlists. The formula is just a compact way
of writing that falling product: start at n and take r factors.
nPr and given by
nPr = n! / (n − r)!.Symbols: The number of permutations of 7 objects taken 4 at a time is
7P4 = 7!/(7 − 4)! = (7·6·5·4·3·2·1)/(3·2·1) = 840.
nPr is just r descending factors starting at
n. 12P4 = 12·11·10·9 = 11,880.
You almost never need to expand the whole factorial.5. Combinations — and why nCr = nPr ÷ r!
A combination of n objects taken r at a time is calculated by dividing the
number of permutations nPr by the number of arrangements
containing the same elements, r!. Every group of r objects was counted
r! times by nPr — once for each of its own
orderings — so divide that duplication away.
nCr and given by
nCr = n! / ((n − r)! · r!).Example:
7C3 = 7!/((7−3)!·3!) = 7!/(4!·3!) = (7·6·5·4!)/(4!·6) = 35.
Same numbers, side by side. Take n = 7, r = 3.
Permutation — 7P3
= 7!/4!
= (7·6·5·4!)/4!
= 7·6·5
= 210 ordered triples
Combination — 7C3
= 7!/(4!·3!)
= (7·6·5)/(3·2·1)
= 210/6
= 35 unordered groups
Make it concrete. Choose 2 letters from {A, B, C}.
3P2 = 3·2 = 6 but
3C2 = 6/2! = 3. Here is every single outcome:
| # | Ordered pair (permutation) | Same two letters as… | Counts as combination |
|---|---|---|---|
| 1 | A B | — | {A, B} |
| 2 | B A | row 1 | already counted |
| 3 | A C | — | {A, C} |
| 4 | C A | row 3 | already counted |
| 5 | B C | — | {B, C} |
| 6 | C B | row 5 | already counted |
| 6 permutations | ÷ 2! = 2 each | 3 combinations | |
6. Permutations with repetition
If some of the objects are identical, swapping two identical objects does not create a new
arrangement. So you take the n! arrangements you would get if everything were
distinct, and divide by r1! for the first repeated object,
r2! for the second, and so on.
n! / (r1! · r2! · … · rk!)
5! / (2! · 2! · 1!) = 120 / 4 = 30 distinguishable arrangements
1! is harmless since 1! = 1. The
numerator is always n! where n is the total number of objects,
not the number of distinct types.7. The selection procedure — use this every time
nPr. Order does not →
nCr. Identical objects present →
n!/(r1!·r2!·…).r!; if their order is pinned down, it is 1.30!/32! = 1/(32·31) is far easier than computing 32!.nCn−r = nCr (choosing which
r to take is the same as choosing which n−r to leave), and
nC0 = nCn = 1.nPr = nCr is sometimes true
— exactly when r! = 1, i.e. r = 0 or r = 1. For
every r ≥ 2, nPr > nCr.nPn = n!/0! = n! and
nPn−1 = n!/1! = n! — they are equal. Arranging all
n objects is the same as arranging n−1 of them, because the last object
has no choice left.Move It Yourself
Worked Examples
32P2 and 30P30 separately
unless you are consistent. Either count full arrangements top and bottom (30!/32!) or count only
the first two slots (1/32P2 = 1/992). Both give 1/992 — mixing them
does not.(a) In ANY order
favorable = 3! = 6
P = 6/210 = 1/35
Or by combinations:
possible = 7C3 = 35, favorable = 1
P = 1/35 ✓
(b) In THAT order
favorable = 1
P = 1/210
Combinations are not usable here —
the order is part of the event.
r! (or lets you switch to combinations). "In that order" makes the
numerator 1. Misreading this phrase is the single most common error in this lesson.Try It Yourself
Practice 1
Practice 2
Practice 3
Practice 4
Practice 5
Practice 6
Summary
| Situation | What to do | Result |
|---|---|---|
| Arrange all n distinct objects | Use n! | nPn = n! |
| Arrange r of n distinct objects (order matters) | Use nPr | n!/(n − r)! |
| Select r of n distinct objects (order irrelevant) | Use nCr | n!/((n − r)! · r!) |
| Arrange n objects, some identical | Divide n! by each repeat count factorial | n!/(r1! · r2! · …) |
| Specified objects in specified positions | Numerator = 1 (or (n−r)! if you use full arrangements) | 1/nPr |
| Specified objects in the first r slots, any order | Numerator = r! | r!/nPr = 1/nCr |
| One specified group of r is chosen | Numerator = 1 over combinations | 1/nCr |
| All r chosen from a sub-pool of k | Ratio of two combinations | kCr / nCr |
| One specified arrangement of repeated objects | 1 over distinguishable permutations | (r1!·r2!·…)/n! |
- Writing
0! = 0. It equals 1. - Using
nCrwhen the problem says "first", "second", or "in that order" — those neednPr. - Using
nPrfor a group with no ranking — that overcounts by a factor ofr!. - Forgetting to divide by the repeat factorials, so 2, 2, 5, 5, 8 gets a denominator of 120 instead of 30.
- Counting the numerator one way and the denominator another (permutations on top, combinations on the bottom).
- Multiplying single-draw probabilities such as
(15/30)4when objects are removed and not replaced. - Expanding huge factorials instead of cancelling —
30!/32!is1/(32·31), no calculator required. - Assuming
nPr = nCr. That is true only forr = 0orr = 1.
Practice Quiz
15 questions · click an answer to check it instantly