Lesson 3 of 8 · 18 min

Factorials and permutations

Count the ordered arrangements of n distinct objects with n factorial, and of r objects chosen from n with the permutation formula nPr.

What you will be able to do

  • Use factorial notation, including 0!=10! = 1, and simplify expressions involving factorials.
  • Count the arrangements of nn distinct objects in a row as n!n!.
  • Define a permutation and use nPr=n!(n−r)!{}^nP_r = \frac{n!}{(n-r)!} to count ordered arrangements of rr objects chosen from nn.
  • Evaluate permutations with and without technology, and solve simple equations involving nPr{}^nP_r.

How many ways can 5 people line up for a photo? Use slots. There are 5 choices for the first position, then 4 for the second (one person is already standing), then 3, 2 and 1:

5×4×3×2×1=120 ways.5 \times 4 \times 3 \times 2 \times 1 = 120 \text{ ways.}

Products like this come up so often in counting that they have their own notation.

Definition

Factorial notation

For a positive integer nn,

n!=n×(n−1)×(n−2)×⋯×2×1,n! = n \times (n-1) \times (n-2) \times \cdots \times 2 \times 1,

read "nn factorial". By definition, 0!=10! = 1.

Factorials grow very quickly.
nnn!n!
0011
1111
2222
3366
442424
55120120
66720720
7750405040
8840 32040\,320
10103 628 8003\,628\,800
13136 227 020 8006\,227\,020\,800

Key idea

Arranging n objects

The number of ways to arrange nn different objects in a row is n!n!.

Factorials cancel neatly because each one contains all the smaller ones: n!=n×(n−1)!n! = n \times (n-1)!. So

10!8!=10×9×8!8!=10×9=90.\frac{10!}{8!} = \frac{10 \times 9 \times 8!}{8!} = 10 \times 9 = 90.

In technology-free questions, cancel first and multiply last.

Why is 0!=10! = 1?

The rule n!=n×(n−1)!n! = n \times (n-1)! rearranges to (n−1)!=n!n(n-1)! = \frac{n!}{n}. Put n=1n = 1: 0!=1!1=10! = \frac{1!}{1} = 1.

It also makes sense as a count. There is exactly one way to arrange nothing: do nothing. Defining 0!=10! = 1 keeps formulas such as nPn=n!0!=n!{}^nP_n = \frac{n!}{0!} = n! working.

Evaluate 9!7!\frac{9!}{7!} without a calculator.

Worked example

Simplifying factorial expressions

  • Simple familiar
  • Technology free

Without a calculator:

(a) evaluate 10!7! 3!\frac{10!}{7!\,3!}

(b) simplify (n+2)!n!\frac{(n+2)!}{n!}, where nn is a positive integer.

4 steps

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

Method

  1. Write the largest factorial as a product down to the next factorial that appears.

  2. Cancel the common factorial.

  3. Multiply out what is left, cancelling common factors first.

Watch out for

  • Cancelling as if 10!7!=(107)!\frac{10!}{7!} = \left(\frac{10}{7}\right)! or 3!3!: factorials do not divide like that.

  • Writing (n+2)!=(n+2)×n!(n+2)! = (n+2) \times n!, which skips the factor n+1n + 1.

Arranging some of the objects. Often you arrange only some of the objects. Eight runners are in a 100 m final. How many ways can the gold, silver and bronze medals be awarded? Gold: 8 choices. Silver: 7. Bronze: 6. So there are 8×7×6=3368 \times 7 \times 6 = 336 ways.

Order matters here. Ana winning gold and Bo winning silver is a different result from Bo winning gold and Ana winning silver.

Definition

Permutation

A permutation is an ordered arrangement of objects. The number of permutations of rr objects chosen from nn distinct objects is

nPr=n×(n−1)×(n−2)×⋯×(n−r+1)=n!(n−r)!{}^nP_r = n \times (n-1) \times (n-2) \times \cdots \times (n-r+1) = \frac{n!}{(n-r)!}

The product has rr factors, starting at nn and counting down.

Interactive

Fill the podium

Choose runners for 1st, 2nd and 3rd. The options shrink by one at each place: 5×4×3=5P3=605 \times 4 \times 3 = {}^5P_3 = 60.

Why nPr=n!(n−r)!{}^nP_r = \frac{n!}{(n-r)!}

Multiply the product by (n−r)!(n−r)!\frac{(n-r)!}{(n-r)!}, which equals 1:

n(n−1)⋯(n−r+1)=n(n−1)⋯(n−r+1)×(n−r)!(n−r)!=n!(n−r)!n(n-1)\cdots(n-r+1) = \frac{n(n-1)\cdots(n-r+1) \times (n-r)!}{(n-r)!} = \frac{n!}{(n-r)!}

The numerator is now every whole number from nn down to 1. When r=nr = n this gives nPn=n!0!=n!{}^nP_n = \frac{n!}{0!} = n!, the number of ways to arrange all nn objects.

Evaluate 6P4{}^{6}P_{4}.

Worked example

Medals in a swimming final

  • Simple familiar

Eight swimmers race in a final. Assume there are no ties.

(a) In how many ways can the gold, silver and bronze medals be awarded?

(b) In how many of these does the swimmer in lane 4 win gold?

4 steps

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

Method

  1. Check that order matters and nothing repeats.

  2. Fill slots, or use nPr{}^nP_r.

  3. Fill any restricted slot first.

Watch out for

  • Using 8C3=56{}^8C_3 = 56, which ignores who wins which medal.

  • Using 83=5128^3 = 512, which would let one swimmer win more than one medal.

Without technology

Write 10P3{}^{10}P_3 as a product of 3 factors: 10×9×8=72010 \times 9 \times 8 = 720. Use this in technology-free questions.

With technology

On a graphics calculator, nPr is in the probability menu: enter 10, nPr, 3. Use it to check, and still write the expression you evaluated.

Find the value of nn for which nP2=56{}^nP_2 = 56.

Common mistake

Repetition or not?

nPr{}^nP_r assumes each object is used at most once. If repetition is allowed, as with the digits of a PIN, every slot has nn options and the count is nrn^r, not nPr{}^nP_r.

Exam tip

Make the method visible

For a "determine" or "calculate" question write 8P3=8×7×6=336{}^8P_3 = 8 \times 7 \times 6 = 336, not just 336. If you used technology, write the expression you entered.

Summary

  • n!=n×(n−1)×⋯×2×1n! = n \times (n-1) \times \cdots \times 2 \times 1, with 0!=10! = 1. It counts the arrangements of nn distinct objects.

  • Factorials cancel: n!=n×(n−1)!n! = n \times (n-1)!, so write the larger factorial down to the smaller one, then cancel.

  • A permutation is an ordered arrangement. nPr=n!(n−r)!{}^nP_r = \frac{n!}{(n-r)!} is the product of rr factors counting down from nn.

  • Use nPr{}^nP_r when order matters and objects are not repeated; use nrn^r when repetition is allowed.

  • Equations such as nP2=56{}^nP_2 = 56 become quadratics; reject solutions that are not positive integers.

Finished the lesson?

Try the 3 quick checks above and the lesson completes itself, or mark it complete now.

Lesson 3 of 80% read

Save your progress with a free account