Lesson 1 of 8 · 14 min
Combinations: choosing without order
Count the ways to choose r objects from n when order does not matter, by listing small cases and with the binomial coefficient nCr.
What you will be able to do
- Explain what a combination is and how it differs from an arrangement.
- Count small numbers of combinations by listing them systematically.
- Use the notation (or ) and evaluate it by hand and with a calculator.
A pizza shop lets you add 2 toppings from a choice of 4: ham, mushroom, olive and pineapple. How many different pizzas can you make?
Ham-and-olive is the same pizza as olive-and-ham. Only which toppings you pick matters, not the order you name them in. A selection like this is called a combination.
Build every pizza with 2 toppings. Then try and : why do they give the same count?
To list combinations without missing any or doubling up, work in order. Pair the first topping with each topping after it, then the second topping with each one after it, and so on.
| Starting topping | Combinations | Count |
|---|---|---|
| Ham (H) | HM, HO, HP | 3 |
| Mushroom (M) | MO, MP | 2 |
| Olive (O) | OP | 1 |
Definition
Combination
A combination is an unordered selection of objects from a set of distinct objects.
The number of combinations is written and read " choose ". You will also see , and calculators call it nCr. The pizza count is .
Listing works for small numbers, but nobody wants to list the ways of choosing 6 numbers from 45. Here is a shortcut that always works.
If order did matter, there would be 4 choices for the first topping and 3 for the second: ordered pairs. That list counts every pizza twice (HM and MH), so there are pizzas.
Two students from a group of 5 will represent the class at a forum. In how many ways can the pair be chosen?
The same idea works for any and . There are ordered selections of objects from : choices for the first, for the second, and so on for factors. Each unordered selection can be put in order in ways, so divide by that.
Note
Factorial notation
, read " factorial", means . So and . By definition .
That makes : there is one way to choose nothing, and one way to choose everything.
Worked example
Count the ways to choose 3 fillings from 6
A food truck lets you choose 3 different fillings for a wrap from the 6 on offer. How many different wraps can you make?
Step 1: Decide whether order matters
Chicken, lettuce and cheese make the same wrap in any order, so this is a combination: choose 3 from 6.
Step 2: Count ordered selections
If order mattered, there would be ordered choices.
There are 6 choices for the first filling, then 5 left for the second, then 4 for the third.
Step 3: Divide by the number of orders
Each group of 3 fillings can be ordered in ways, so there are different wraps.
Every unordered group appears 6 times in the ordered count. With chicken (C), lettuce (L) and cheese (S): CLS, CSL, LCS, LSC, SCL and SLC.
Try it yourself first, then check the working one step at a time.
Answer
There are different wraps.
Method
Check that order does not matter.
Write , with factors on top.
Cancel, then multiply.
Watch out for
Stopping at , which counts each wrap 6 times.
Evaluate without a calculator.
Key idea
Choosing what to leave out
Choosing objects to take is the same as choosing the objects to leave behind, so
This saves work: .
Without technology
Use the shorter product and cancel before you multiply:
With technology
Use the nCr function in your calculator's probability menu: enter , then nCr, then . It handles large values instantly, such as .
Worked example
Choose a team of 7 from a shortlist of 10
A coach picks 7 players from a shortlist of 10 for a team. Positions are decided later.
(a) How many different teams are possible?
(b) How many of these teams include the captain, Mia?
Step 1: Recognise a combination
Only which 7 players are picked matters, so the number of teams is .
Step 2: Use symmetry to shorten the calculation
Choosing 7 to play is the same as choosing 3 to leave out: .
Each team of 7 matches exactly one group of 3 left out, so the counts are equal, and three factors are quicker than seven.
Step 3: Put Mia in, then fill the other places
With Mia in the team, choose the other 6 players from the remaining 9: .
Fixing Mia leaves 6 places to fill from 9 players.
Step 4: Check with the teams that leave Mia out
Teams without Mia choose all 7 from the other 9: . And , matching part (a).
Every team either includes Mia or does not. This way of splitting the count is Pascal's rule, in the next lesson.
Try it yourself first, then check the working one step at a time.
Answer
(a) teams. (b) of them include Mia.
Method
Decide that order does not matter, then write .
Use to shorten the calculation.
If one object must be included, choose the remaining from the other .
Watch out for
Calculating without dividing by .
In (b), choosing 7 more players after including Mia, which makes a team of 8.
Common mistake
Order matters, or it doesn't
Use a combination only when order does not matter: a committee, a hand of cards, the toppings on a pizza. If the same objects in a different order count as a different outcome, such as a PIN or the first three places in a race, it is not a combination.
And is not a fraction. It is the whole number , not .
Which of these is counted by a combination?
Summary
A combination is an unordered selection of objects from distinct objects. The number of them is , also written .
List small cases systematically, pairing each object only with the objects after it.
Count ordered selections, then divide by the number of orders: .
, and .
Cancel before multiplying when working by hand; use nCr on a calculator for large values.
Finished the lesson?
Try the 3 quick checks above and the lesson completes itself, or mark it complete now.