Introduction to Combinations
Learn how to count selections where order doesn't matter using the combinations formula.
Definition
A combination is a selection of items where the order does not matter.
If you're choosing items from a group of items, the number of combinations is:
Key difference from permutations:
- Permutation: Order matters (arranging)
- Combination: Order doesn't matter (selecting)
Example: Choosing 2 people from Alice, Bob, and Carol:
- {Alice, Bob} is the same as {Bob, Alice}
- There are only 3 combinations: {A,B}, {A,C}, {B,C}
Try it now
Which formula represents the number of combinations when choosing items from items?
Interactive Visual
Choosing a group
Choose 2 of 5: A, B, C, D, E
10 groups
P(5, 2) = 5 × 4 = 20
C(5, 2) = P(5, 2) / 2! = 20 / 2 = 10
Every group of 2 can be ordered in 2! = 2 ways, so the number of ordered lists is divided by 2!. Tap a group to see its orders.
Pascal's triangle
C(8, 3) = 56 = 21 + 35
Row 8: 1 + 8 + 28 + 56 + 70 + 56 + 28 + 8 + 1 = 256 = 2⁸
Tap a number: it is the sum of the two numbers above it, and it equals C(n, k).
Interactive Sandbox
Expression Calculator
Try these:
History
No calculations yet
Practice Problems
16 problemsProblem 1 of 16
Easy
Which formula represents the number of combinations when choosing items from items?
Glossary
- Combination
- A selection of items where order does not matter
- Factorial
- The product of all positive integers up to n, written as
- Binomial coefficient
- Another name for , written as
- n choose r
- Common way to read , meaning 'the number of ways to choose r from n'
Formula Card
Combinations Formula
n = total items, r = items chosen. Symmetry: $C(n,r) = C(n, n-r)$. Special cases: $C(n,0) = C(n,n) = 1$