Probability
Permutations & Combinations
Count arrangements and selections with or without regard to order.
Advertisement
Theory
Use permutations when order matters and combinations when order does not matter. Both use factorials, where n! is the product of positive integers through n.
nPr = n!/(n−r)! · nCr = n!/[r!(n−r)!]
What you will learn
- Determine whether order matters.
- Apply factorial notation.
- Count selections without listing every outcome.
How to interpret it
Permutations count ordered arrangements, so changing positions creates a new outcome. Combinations count groups, so the same selected objects in a different order remain one outcome.
Assumptions and limitations
The standard formulas assume distinct objects selected without replacement. Problems involving repetition, identical objects, or replacement require modified counting rules.
Common mistakes
- Using a permutation when selection order is irrelevant.
- Forgetting that 0! equals 1.
- Using r greater than n in a without-replacement problem.
Try it yourself
Problem question
How many ways can 3 students be selected from 8 students?
Step-by-step solution
- Selection order does not matter, so use combinations.
- Compute 8! / (3! × 5!).
- The result is 56 possible groups.
Calculator results are educational estimates. Confirm important academic or professional work independently.