Understanding Permutations vs. Combinations
In combinatorics, it is crucial to distinguish between Permutations and Combinations. Both concepts involve selecting items from a group, but the deciding factor is order.
Permutations (nPr)
Order Matters. Use this when the sequence or arrangement of items is important.
- ✅ Combination locks
- ✅ Race podiums (1st, 2nd, 3rd)
- ✅ URL slugs
Combinations (nCr)
Order Does Not Matter. Use this when you just need to know which items are selected, regardless of sequence.
- ✅ Lottery numbers
- ✅ Card hands (Poker)
- ✅ Pizza toppings
Permutation Formula (nPr)
The number of ways to arrange r items from a set of n distinct items is given by:
Where n! (n factorial) is the product of all positive integers less than or equal to n. To calculate factorials, use our Factorial Calculator.
Combination Formula (nCr)
The number of ways to choose r items from a set of n distinct items is given by:
Notice the extra r! in the denominator. This removes the duplicates that occur when order doesn't matter (e.g., "A, B" is the same as "B, A").
Comparison Table
| Feature | Permutations (nPr) | Combinations (nCr) |
|---|---|---|
| Order | Matters | Does Not Matter |
| Keywords | Arrange, Order, Sequence | Select, Choose, Group |
| Magnitude | High (More possibilities) | Low (Fewer possibilities) |
Related Math Calculators
Permutations and combinations are built on factorials and are related to other mathematical concepts:
Frequently Asked Questions
- What is the difference between permutations and combinations?
- The key difference is order. In permutations (nPr), the order of arrangement matters (e.g., a combination lock code). In combinations (nCr), the order does not matter (e.g., lottery numbers). If swapping two items changes the outcome, use permutations.
- How do I calculate permutations (nPr)?
- The formula for permutations is nPr = n! / (n - r)!. This calculates the number of ways to arrange 'r' distinct items from a set of 'n' items.
- How do I calculate combinations (nCr)?
- The formula for combinations is nCr = n! / (r! * (n - r)!). It acts like the permutation formula but divides by r! to remove duplicate orderings, as order does not matter.
- Can nPr be smaller than nCr?
- No. Permutations (nPr) are always greater than or equal to Combinations (nCr) for the same n and r (where r > 0), because permutations count every specific order as unique.