Introduction
Permutations and combinations are counting methods used to determine the number of possible arrangements or selections.
Concept
A permutation counts arrangements in which order matters. A combination counts selections in which order does not matter.
Mnemonic
Permutation: position matters. Combination: choose without caring about order.
Explanation
For n distinct objects selected r at a time, the permutation formula is nPr = n!/(n − r)!, while the combination formula is nCr = n!/[r!(n − r)!]. A combination removes the different arrangements of the same selected group.
Step By Step
Identify how many objects are available.
Identify how many objects are being selected.
Ask whether changing the order creates a different outcome.
If order matters, use permutations.
If order does not matter, use combinations.
Substitute the values into the appropriate formula.
Examples
| Problem | Solution | Result |
|---|---|---|
Choose a president and secretary from five students. | The positions are different, so changing the selected students' order changes the result. Use 5P2 = 5 × 4. | 20 arrangements |
Choose two students from five for a committee. | The committee is unchanged when the order of selection is reversed. Use 5C2 = 5!/(2!3!). | 10 combinations |
Arrange three different books selected from six books on a shelf. | Order matters. Use 6P3 = 6 × 5 × 4. | 120 arrangements |
Limitations
These formulas assume distinct objects and selection without replacement. Repetition-allowed problems and problems involving identical objects require adjusted counting methods.
Common Mistakes
Using combinations when order matters.
Using permutations when order does not matter.
Forgetting that 0! = 1.
Applying the basic formulas to repeated selections without checking the assumptions.
Practice
Choose three students from eight for a committee.
Award first, second and third places among eight competitors.
Explain why selecting two books is a combination but arranging two books is a permutation.