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 (nr)\binom{n}{r} (or nCr{}^nC_r) 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.

Interactive

Choose 2 toppings from 4

Build every pizza with 2 toppings. Then try r=1r = 1 and r=3r = 3: 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.

Every combination of 2 toppings from 4 (H, M, O, P): 3+2+1=63 + 2 + 1 = 6 in all.
Starting toppingCombinationsCount
Ham (H)HM, HO, HP3
Mushroom (M)MO, MP2
Olive (O)OP1

Definition

Combination

A combination is an unordered selection of rr objects from a set of nn distinct objects.

The number of combinations is written (nr)\binom{n}{r} and read "nn choose rr". You will also see nCr{}^nC_r, and calculators call it nCr. The pizza count is (42)=6\binom{4}{2} = 6.

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: 4×3=124 \times 3 = 12 ordered pairs. That list counts every pizza twice (HM and MH), so there are 12÷2=612 \div 2 = 6 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 nn and rr. There are n(n−1)(n−2)⋯(n−r+1)n(n - 1)(n - 2)\cdots(n - r + 1) ordered selections of rr objects from nn: nn choices for the first, n−1n - 1 for the second, and so on for rr factors. Each unordered selection can be put in order in r(r−1)⋯2×1r(r - 1)\cdots 2 \times 1 ways, so divide by that.

The number of combinations of rr objects from nn
(nr)=n(n−1)(n−2)⋯(n−r+1)r(r−1)⋯2×1=n!r! (n−r)!\binom{n}{r} = \frac{n(n - 1)(n - 2)\cdots(n - r + 1)}{r(r - 1)\cdots 2 \times 1} = \frac{n!}{r!\,(n - r)!}

Note

Factorial notation

n!n!, read "nn factorial", means n×(n−1)×⋯×2×1n \times (n - 1) \times \cdots \times 2 \times 1. So 4!=244! = 24 and 5!=1205! = 120. By definition 0!=10! = 1.

That makes (n0)=(nn)=1\binom{n}{0} = \binom{n}{n} = 1: there is one way to choose nothing, and one way to choose everything.

Worked example

Count the ways to choose 3 fillings from 6

  • Simple familiar
  • Technology free

A food truck lets you choose 3 different fillings for a wrap from the 6 on offer. How many different wraps can you make?

3 steps

Try it yourself first, then check the working one step at a time.

Method

  1. Check that order does not matter.

  2. Write (nr)=n(n−1)⋯(n−r+1)r!\binom{n}{r} = \frac{n(n - 1)\cdots(n - r + 1)}{r!}, with rr factors on top.

  3. Cancel, then multiply.

Watch out for

  • Stopping at 6×5×4=1206 \times 5 \times 4 = 120, which counts each wrap 6 times.

Evaluate (73)\binom{7}{3} without a calculator.

Key idea

Choosing what to leave out

Choosing rr objects to take is the same as choosing the n−rn - r objects to leave behind, so

(nr)=(nn−r)\binom{n}{r} = \binom{n}{n - r}

This saves work: (108)=(102)=10×92×1=45\binom{10}{8} = \binom{10}{2} = \frac{10 \times 9}{2 \times 1} = 45.

Without technology

Use the shorter product and cancel before you multiply:

(97)=(92)=9×82×1=36\binom{9}{7} = \binom{9}{2} = \frac{9 \times 8}{2 \times 1} = 36

With technology

Use the nCr function in your calculator's probability menu: enter nn, then nCr, then rr. It handles large values instantly, such as (456)=8 145 060\binom{45}{6} = 8\,145\,060.

Worked example

Choose a team of 7 from a shortlist of 10

  • Complex familiar
  • Technology free

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?

4 steps

Try it yourself first, then check the working one step at a time.

Method

  1. Decide that order does not matter, then write (nr)\binom{n}{r}.

  2. Use (nr)=(nn−r)\binom{n}{r} = \binom{n}{n - r} to shorten the calculation.

  3. If one object must be included, choose the remaining r−1r - 1 from the other n−1n - 1.

Watch out for

  • Calculating 10×9×8×7×6×5×410 \times 9 \times 8 \times 7 \times 6 \times 5 \times 4 without dividing by 7!7!.

  • 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 (73)\binom{7}{3} is not a fraction. It is the whole number 3535, not 73\frac{7}{3}.

Which of these is counted by a combination?

Choose one answer

Summary

  • A combination is an unordered selection of rr objects from nn distinct objects. The number of them is (nr)\binom{n}{r}, also written nCr{}^nC_r.

  • List small cases systematically, pairing each object only with the objects after it.

  • Count ordered selections, then divide by the number of orders: (nr)=n(n−1)⋯(n−r+1)r!=n!r! (n−r)!\binom{n}{r} = \frac{n(n - 1)\cdots(n - r + 1)}{r!} = \frac{n!}{r!\,(n - r)!}.

  • (nr)=(nn−r)\binom{n}{r} = \binom{n}{n - r}, and (n0)=(nn)=1\binom{n}{0} = \binom{n}{n} = 1.

  • 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.

Lesson 1 of 80% read

Save your progress with a free account