Probability with Permutations and Combinations

Algebra 2Module 12: ProbabilityProblem-Solving and Data Analysis

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.

P(event) = (number of favorable outcomes) / (number of possible outcomes)
Study Tip — Randomness: When outcomes are decided at random, they are equally likely to occur, so their probabilities can be calculated using permutations and combinations.

2. Vocabulary

Permutation — an arrangement of objects in which order is important. Shuffling 7 songs into the order Track 5, 7, 1, 2, 6, 4, 3 is one permutation of the playlist.
Factorial — the factorial of a positive integer n is the product of the positive integers less than or equal to n, written n!.
Combination — a selection of objects in which order is not important. Choosing 3 people for a committee is a combination.
Fundamental Counting Principle — if one stage has a outcomes and the next has b, the pair of stages has a × b outcomes. Everything below is built from this.
Key Concept · Factorial
Words: The factorial of a positive integer n is the product of the positive integers less than or equal to n, and is written n!.
Symbols: n! = n · (n − 1) · (n − 2) · … · 2 · 1,  where 0! = 1
1! = 1    2! = 2    3! = 6    4! = 24    5! = 120
6! = 720    7! = 5040    8! = 40,320    9! = 362,880
Watch Out! 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.

Does Order Matter? — the decision map
Choose r objects from n distinct objects Does ORDER matter? NO COMBINATION nCr = n! / ((n − r)! · r!) AB and BA are the SAME YES PERMUTATION nPr = n! / (n − r)! AB and BA are DIFFERENT nCr = nPr ÷ r!  —  divide out the r! orderings
One question decides everything. Combinations are permutations with the duplicate orderings divided away.

Order MATTERS → permutation

• first, second, third place
• 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

• a committee of 3
• 4 flavors on one cone
• which 6 people replied
• a set of 3 points
• "in any order", "a group of", "chosen"
Study Tip — Permutations and Combinations: Use permutations when the order of an arrangement is important, and use combinations when the order is not important.

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.

Key Concept · Permutations
Words: The number of permutations of n distinct objects taken r at a time is denoted by 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.

Key Concept · Combinations
Symbols: The number of combinations of n distinct objects taken r at a time is denoted by 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

7P3 = 7!/(7 − 3)!
= 7!/4!
= (7·6·5·4!)/4!
= 7·6·5
= 210 ordered triples

Combination — 7C3

7C3 = 7!/((7 − 3)!·3!)
= 7!/(4!·3!)
= (7·6·5)/(3·2·1)
= 210/6
= 35 unordered groups
7P3 ÷ 3! = 210 ÷ 6 = 35 = 7C3   ∴   r! · nCr = nPr

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
1A B—{A, B}
2B Arow 1already counted
3A C—{A, C}
4C Arow 3already counted
5B C—{B, C}
6C Brow 5already counted
6 permutations÷ 2! = 2 each3 combinations
6 Permutations Collapse Into 3 Combinations
3P2 = 6 permutations AB BA AC CA BC CB 3C2 = 3 combinations {A, B} {A, C} {B, C}
Each unordered set on the right was counted 2! = 2 times on the left. That factor of r! is the entire difference between nPr and nCr.

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.

Key Concept · Permutations with Repetition
The number of distinguishable permutations of n objects in which one object is repeated r1 times, another is repeated r2 times, and so on, is
n! / (r1! · r2! · … · rk!)
Digits 2, 2, 5, 5, 8 → n = 5, two 2s, two 5s, one 8
5! / (2! · 2! · 1!) = 120 / 4 = 30 distinguishable arrangements
Watch Out! Only divide by the factorial of counts that are 2 or more — but dividing by 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

Read for the order clue. Words like first, second, in that order, arranged, lined up, ranked mean order matters. Words like chosen, selected, a group of, in any order mean it does not.
Count the possible outcomes (the denominator). Order matters → nPr. Order does not → nCr. Identical objects present → n!/(r1!·r2!·…).
Count the favorable outcomes (the numerator) with the same kind of counting. If the specified objects may appear in any order among themselves, the numerator is r!; if their order is pinned down, it is 1.
Divide and simplify. Cancel factorials before multiplying — 30!/32! = 1/(32·31) is far easier than computing 32!.
Sanity-check. The answer must be between 0 and 1, and the denominator you used must be at least as large as the numerator.
2
Two shortcuts worth memorising: 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.
n
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

32 performers are assigned all 32 slots at random. What is the probability that a specified performer takes slot 1 and a second specified performer takes slot 2?
1possible = 32!all 32 orders are equally likely
2favorable = (32 − 2)! = 30!slots 1, 2 fixed; arrange the other 30
3P = 30! / 32!favorable ÷ possible
4= 30! / (32 · 31 · 30!)expand 32! and divide out 30!
5= 1 / 992simplify (32 · 31 = 992)
P = 1/992 ≈ 0.001 = about 0.1%
Trap: Do not reach for 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.
Check: 1/32P2 = 1/(32·31) = 1/992 ✓
A slideshow plays 12 distinct photographs in random order with no repeats. Three are of the whole family, three of a brother, two of the subject, and four of a sister. What is the probability that the first four pictures shown are the four sister photos?
1order matters → permutationsthe photos will not repeat and position counts
2possible = 12P4 = 12!/(12 − 4)! = 12!/8!12 photos taken 4 at a time
3= (12 · 11 · 10 · 9 · 8!)/8! = 11,880divide out 8!
4favorable = 4! = 24the 4 sister photos in any order
5P = 24 / 11,880favorable ÷ possible
6= 1 / 495divide numerator and denominator by 24
P = 1/495 ≈ 0.002
Check: Same answer as a combination: the 4 sister photos are one specific group out of 12C4 = 11,880/4! = 495 possible groups, so P = 1/495 ✓
Five number tiles showing 2, 2, 5, 5, and 8 are arranged at random in a row. What is the probability that the row reads 2 5 8 5 2?
1n = 5; the digit 2 occurs 2 times, 5 occurs 2 times, 8 occurs 1 timeidentify the repeats
2possible = 5! / (2! · 2!)distinguishable permutations
3= 120 / 4 = 30simplify
4favorable = 1only one arrangement is the target
P = 1/30 ≈ 0.033
Trap: The denominator is not 5! = 120. Swapping the two 2s produces a row that looks identical, so those 120 arrangements only give 30 distinguishable outcomes.
Check: Choose which 2 of the 5 positions hold the 2s (5C2 = 10), then which 2 of the remaining 3 hold the 5s (3C2 = 3): 10 · 3 = 30 ✓
Ten points are named on pentagon ACEGJ: the 5 vertices A, C, E, G, J and the 5 side midpoints B, D, F, H, K. If three of the ten points are chosen at random, what is the probability that all three lie on the same line segment?
1order does not matter → combinationsa set of 3 points is a set, not a list
2possible = 10C3 = 10!/((10 − 3)! · 3!)10 points taken 3 at a time
3= (10 · 9 · 8 · 7!)/(7! · 3!) = 720/6 = 120divide out 7!
4favorable = 5the 5 sides AC, CE, EG, GJ, JA each carry 3 named points
5P = 5/120 = 1/24simplify
P = 1/24 ≈ 0.042
Check: Each side holds exactly 3 named points (two vertices and its midpoint), so it contributes exactly 3C3 = 1 favorable set. 5 sides × 1 = 5 ✓
Seven finalists give speeches in a random order. Three of them are specified in advance. (a) P(those three give the first three speeches, in any order)? (b) P(they give speeches 1, 2, 3 in one specified order)?

(a) In ANY order

possible = 7P3 = 7·6·5 = 210
favorable = 3! = 6
P = 6/210 = 1/35

Or by combinations:
possible = 7C3 = 35, favorable = 1
P = 1/35 ✓

(b) In THAT order

possible = 7P3 = 210
favorable = 1
P = 1/210

Combinations are not usable here —
the order is part of the event.
1(a) ÷ (b) = (1/35) ÷ (1/210) = 6 = 3!exactly the r! factor
(a) 1/35     (b) 1/210     ratio = 3! = 6
Trap: "In any order" makes the numerator 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.
A set contains 15 objects of type G and 15 objects of type B (30 total). Four objects are drawn at random with no regard to order. What is the probability that all four are of type G?
1possible = 30C4 = (30·29·28·27)/(4·3·2·1)order does not matter
2= 657,720/24 = 27,405simplify
3favorable = 15C4 = (15·14·13·12)/24 = 32,760/24 = 1365all four from the 15 type-G objects
4P = 1365/27,405favorable ÷ possible
5= 13/261divide both by 105
P = 13/261 ≈ 0.0498
Trap: The answer is not (15/30)4 = 1/16. Once an object is drawn it is gone, so the draws are not independent — that is exactly why you count with combinations instead of multiplying probabilities.

Try It Yourself

Practice 1

Evaluate 9P3 and 9C3, then verify that their quotient is 3!.
19P3 = 9 · 8 · 7 = 5043 descending factors from 9
29C3 = 504/3! = 504/6 = 84divide out the orderings
3504 ÷ 84 = 6 = 3!verified
9P3 = 504,  9C3 = 84,  quotient = 3! = 6

Practice 2

The digits 7, 7, 7, 2, 2 are arranged at random in a row. What is the probability that the row reads 7 2 7 2 7?
1n = 5, with 7 repeated 3 times and 2 repeated 2 timescount the repeats
2possible = 5!/(3! · 2!) = 120/12 = 10permutations with repetition
3favorable = 1one target arrangement
P = 1/10 = 0.1

Practice 3

Six distinct objects are placed in a random order. What is the probability that two specified objects occupy positions 1 and 2, in that order?
1possible = 6! = 720all arrangements equally likely
2favorable = 4! = 24positions 1, 2 fixed; arrange the other 4
3P = 24/720 = 1/30simplify
P = 1/30
Check: 1/6P2 = 1/(6·5) = 1/30 ✓

Practice 4

Four objects are selected at random from a set of 10 distinct objects, order irrelevant. What is the probability that one specified group of four is the one selected?
1possible = 10C4 = (10 · 9 · 8 · 7)/(4 · 3 · 2 · 1)order does not matter
2= 5040/24 = 210simplify
3favorable = 1exactly one group qualifies
P = 1/210

Practice 5

Solve for n: nP2 = 56.
1nP2 = n(n − 1)two descending factors
2n2 − n = 56set equal to 56
3n2 − n − 56 = 0 → (n − 8)(n + 7) = 0factor
4n = 8 or n = −7; reject n = −7n must be a positive integer
n = 8   (8 · 7 = 56 ✓)

Practice 6

From 12 distinct objects, 3 are chosen at random. Find P(three specified objects are the ones chosen) and compare it with P(those three are chosen as 1st, 2nd, 3rd in a specified order).
112C3 = (12 · 11 · 10)/6 = 1320/6 = 220order irrelevant
2P(unordered) = 1/220one favorable group
312P3 = 12 · 11 · 10 = 1320order matters
4P(ordered) = 1/1320one favorable arrangement
1/220 and 1/1320  —  the ratio is 3! = 6

Summary

SituationWhat to doResult
Arrange all n distinct objectsUse n!nPn = n!
Arrange r of n distinct objects (order matters)Use nPrn!/(n − r)!
Select r of n distinct objects (order irrelevant)Use nCrn!/((n − r)! · r!)
Arrange n objects, some identicalDivide n! by each repeat count factorialn!/(r1! · r2! · …)
Specified objects in specified positionsNumerator = 1 (or (n−r)! if you use full arrangements)1/nPr
Specified objects in the first r slots, any orderNumerator = r!r!/nPr = 1/nCr
One specified group of r is chosenNumerator = 1 over combinations1/nCr
All r chosen from a sub-pool of kRatio of two combinationskCr / nCr
One specified arrangement of repeated objects1 over distinguishable permutations(r1!·r2!·…)/n!
n! = n(n−1)…2·1 0! = 1 nPr = n!/(n−r)! nCr = n!/((n−r)!r!) nCr = nPr ÷ r! r!·nCr = nPr nC(n−r) = nCr nC0 = nCn = 1 nPn = nP(n−1) = n! n!/(r1!·r2!·…) P = favorable/possible
Common mistakes to avoid
  • Writing 0! = 0. It equals 1.
  • Using nCr when the problem says "first", "second", or "in that order" — those need nPr.
  • Using nPr for a group with no ranking — that overcounts by a factor of r!.
  • 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)4 when objects are removed and not replaced.
  • Expanding huge factorials instead of cancelling — 30!/32! is 1/(32·31), no calculator required.
  • Assuming nPr = nCr. That is true only for r = 0 or r = 1.

Practice Quiz

15 questions · click an answer to check it instantly

0/15

๐Ÿ“ Test your understanding