Lesson 6 of 8 · 18 min
Combinations: choosing without order
Count unordered selections with nCr, see how combinations come from permutations, and decide which one a problem needs.
What you will be able to do
- Define a combination as a selection where order does not matter.
- Use , and explain how it follows from .
- Use to simplify calculations.
- Decide whether a problem needs a permutation or a combination, and solve problems with combinations.
A coach picks 3 of 5 players (Ana, Bo, Cai, Dev and Eli) for a training drill. Picking Ana, Bo and Cai gives the same drill group as picking Cai, Ana and Bo. Order does not matter: this is a selection, not an arrangement.
Definition
Combination
A combination is a selection of objects in which order does not matter. The number of combinations of objects chosen from distinct objects is written or , read " choose ".
Count the ordered line-ups first: . Every group of 3 players appears in different orders among those 60. So the number of different groups is .
| Group | Its 6 orders |
|---|---|
| ABC, ACB, BAC, BCA, CAB, CBA | |
| ABD, ADB, BAD, BDA, DAB, DBA | |
| 10 groups | orders |
Key idea
The combinations formula
Choosing objects and then arranging them produces every permutation exactly once, so .
Choose 3 players. Reordering them does not change the group, so there are only different groups.
Evaluate without a calculator.
Worked example
A squad or a relay team?
A coach has 10 swimmers.
(a) In how many ways can she choose a squad of 4 to travel to a carnival?
(b) In how many ways can she choose a relay team of 4 and decide who swims each of the four legs?
(c) Explain the connection between your answers.
Step 1: Does order matter in (a)?
A squad is a group. Swapping two chosen swimmers gives the same squad, so order does not matter: use a combination.
Step 2: Evaluate the combination
Step 3: Does order matter in (b)?
Legs 1, 2, 3 and 4 are different jobs, so order matters: .
Step 4: Connect the answers
Each squad of 4 can be assigned to the 4 legs in ways, so . That is, .
Try it yourself first, then check the working one step at a time.
Answer
(a) 210 (b) 5040 (c) Each squad gives relay orders, so .
Method
Ask: does swapping two chosen objects change the outcome?
No: use . Yes: use .
links the two.
Watch out for
Using for the squad, which counts each squad 24 times.
Symmetry. Choosing the 3 players who train is the same as choosing the 2 who rest. So . In general:
Row , entry (both counted from 0) is . The highlighted entry is . Each row reads the same forwards and backwards, which is the symmetry .
Note
Values worth knowing
(one way to choose nothing, or everything), , and .
Pascal's rule: each entry is the sum of the two above it
Pick one particular object, say Ana. Every selection of objects from either includes Ana or does not. These two cases cannot overlap, so by the addition principle:
- selections that include Ana: choose the other from the remaining , in ways;
- selections that leave Ana out: choose all from the remaining , in ways.
That is exactly how each row of Pascal's triangle is built from the row above. Mathematical Methods links the triangle to the binomial theorem.
Order matters: permutation
Arrangements, rankings, different roles, codes, seating.
A president, secretary and treasurer from 12 members: .
Order does not matter: combination
Groups, teams, committees, hands of cards, toppings.
A committee of 3 from 12 members: .
Which of these is counted by ?
Worked example
Working backwards from the number of handshakes
At a meeting, every person shakes hands with every other person exactly once. There are 66 handshakes. How many people are at the meeting?
Step 1: Model a handshake as a selection
A handshake is a pair of people, and the pair Ali and Bo is the same handshake as Bo and Ali. With people there are handshakes.
Step 2: Write the equation
.
Step 3: Solve the quadratic
, so , which factorises to .
Step 4: Reject the impossible solution
counts people, so it must be a positive integer. Reject , so . Check: .
Try it yourself first, then check the working one step at a time.
Answer
There are 12 people at the meeting.
Method
Decide whether the count is a permutation or a combination, and write it in terms of .
Simplify the factorials to a polynomial.
Solve, and keep only positive integer solutions.
Watch out for
Writing , which forgets to divide by 2 and counts ordered pairs.
Leaving in the answer.
Common mistake
Using a permutation for a committee
A committee of 3 has no first, second or third member. Using counts each committee times. Ask yourself: if I swap two of the chosen objects, is it a different outcome? If not, use combinations.
Without technology
Cancel before multiplying:
Use symmetry first if it helps: .
With technology
Enter 12, nCr, 3 in the probability menu. For large values such as , technology is the sensible choice. Still write the expression.
Summary
A combination is a selection where order does not matter.
, because each selection of appears times among the permutations.
: choosing what to take is choosing what to leave.
Useful values: , , .
Test for order: if swapping two chosen objects gives a different outcome, use a permutation; if not, a combination.
Finished the lesson?
Try the 2 quick checks above and the lesson completes itself, or mark it complete now.