• Practice
  • About 18 min
  • 5 practice questions

Factorials and permutations of distinct objects

Calculate and simplify factorials, use 0! = 1 and the double factorial, and count arrangements of r objects chosen from n distinct objects with and without repetition.

If something looks wrong, please tell us.

By the end of this lesson you can

  • Calculate n!, simplify expressions such as 9!/(6! 3!), and explain why 0! = 1.
  • Find a double factorial and tell n!! apart from (n!)!.
  • Use ⁿPᵣ = n(n − 1)...(n − r + 1) = n!/(n − r)! and solve equations in ⁿPᵣ.
  • Count arrangements when repetition is allowed (nʳ).
  • Check the properties of ⁿPᵣ on numbers.

Products such as 5 × 4 × 3 × 2 × 1 appeared again and again in the last lesson. The factorial notation writes them in two characters, and with it the number of arrangements, the permutations, gets a short and powerful formula.

Factorials

The factorial of a natural number n, written n! and read n factorial, is the product of the first n natural numbers: n! = 1 × 2 × 3 × ... × n. So 1! = 1, 2! = 2, 3! = 6, 4! = 24, 5! = 120, 6! = 720 and 7! = 5040. The textbook notes that the notation n! was introduced by the French mathematician Christian Kramp in 1808.

The most useful fact is the step-down rule n! = n × (n − 1)!, and so n! = n(n − 1)(n − 2)! and so on. Putting n = 1 in (n + 1)! = (n + 1) × n! gives 1! = 1 × 0!, so we define 0! = 1. Factorials are therefore defined for all non-negative integers, but not for negative integers in this course.

Worked example 1: simplifying

(i) 7!/4! = (7 × 6 × 5 × 4!)/4! = 7 × 6 × 5 = 210. (ii) 9!/(6! × 3!) = (9 × 8 × 7 × 6!)/(6! × 6) = 504/6 = 84. (iii) 7! − 6! = 7 × 6! − 6! = (7 − 1) × 6! = 6 × 720 = 4320. The trick each time is to write the larger factorial down to the smaller one, then cancel.

Worked example 2: factorial equations

(i) Find x if 1/6! + 1/7! = x/8!. Multiply every term by 8!: 8!/6! + 8!/7! = x, that is 8 × 7 + 8 = x, so x = 64. (ii) Find n if (n + 2)! = 56 × n!. Divide by n!: (n + 2)(n + 1) = 56 = 8 × 7, so n + 2 = 8 and n = 6. (iii) The units digit of 1! + 2! + 3! + ... + 50!: from 5! on, every factorial contains 2 × 5 = 10 and ends in 0, so only 1 + 2 + 6 + 24 = 33 matters; the units digit is 3.

Worked example 3: a factorial identity

Show that (2n)!/n! = 2ⁿ × (1 × 3 × 5 × ... × (2n − 1)). Working: write (2n)! = 1 × 2 × 3 × ... × 2n and group odd and even factors: (2n)! = [1 × 3 × ... × (2n − 1)] × [2 × 4 × ... × 2n]. Each of the n even factors is 2 times a number from 1 to n, so 2 × 4 × ... × 2n = 2ⁿ × n!. Dividing by n! gives the result. Check with n = 3: 6!/3! = 720/6 = 120, and 2³ × (1 × 3 × 5) = 8 × 15 = 120.

The double factorial

The textbook also defines the double factorial n!!, the product of every second number down from n: for even n, n!! = n × (n − 2) × ... × 4 × 2; for odd n, n!! = n × (n − 2) × ... × 3 × 1; and 0!! = 1. So 7!! = 7 × 5 × 3 × 1 = 105 and 6!! = 6 × 4 × 2 = 48. Note that n!! is not (n!)!: 3!! = 3, but (3!)! = 6! = 720.

Permutations

A permutation is an arrangement in a definite order. Three students Arun, Bala and Chitra can stand in a row in 3 × 2 × 1 = 3! = 6 orders. In general, n distinct objects can be arranged in a row in n! ways.

Theorem. The number of permutations of n distinct objects taken r at a time (r ≤ n) is ⁿPᵣ = n(n − 1)(n − 2)...(n − r + 1). Reason: we fill r positions in a row. The first can take any of the n objects, the second any of the n − 1 left, and so on; the r-th position has n − (r − 1) = n − r + 1 choices left. The product rule gives the formula. Multiplying and dividing by (n − r)! gives the second form ⁿPᵣ = n!/(n − r)!. Special cases: ⁿP₀ = 1, ⁿPₙ = n!, and ⁿPᵣ = 0 if r > n.

With repetition. If each of the r positions may use any of the n objects again, every position has n choices, so the count is nʳ. A permutation of a finite set onto itself is also a one-one, onto (bijective) function from the set to itself, so a set of n elements has n! such functions.

Building ⁿPᵣ place by place

  1. Place 1: n choices Any of the n objects.
  2. Place 2: n − 1 choices One object is already used.
  3. Place 3: n − 2 choices Two objects are used.
  4. Place r: n − r + 1 choices r − 1 objects are used.
  5. Multiply ⁿPᵣ = n(n − 1)...(n − r + 1) = n!/(n − r)!

Properties of ⁿPᵣ

Properties, checked with numbers
PropertyCheck
ⁿPₙ = ⁿPₙ₋₁⁴P₄ = 24 and ⁴P₃ = 4 × 3 × 2 = 24
ⁿPᵣ = n × ⁽ⁿ⁻¹⁾Pᵣ₋₁⁶P₃ = 120 and 6 × ⁵P₂ = 6 × 20 = 120
ⁿPᵣ = ⁽ⁿ⁻¹⁾Pᵣ + r × ⁽ⁿ⁻¹⁾Pᵣ₋₁⁵P₂ = 20 and ⁴P₂ + 2 × ⁴P₁ = 12 + 8 = 20

The third property has a counting meaning: an arrangement of r objects from n either leaves out one particular object (⁽ⁿ⁻¹⁾Pᵣ ways) or uses it, in which case choose its position (r ways) and arrange r − 1 of the others in the remaining places (⁽ⁿ⁻¹⁾Pᵣ₋₁ ways).

Worked example 4: evaluating and solving

(i) ⁹P₄ = 9 × 8 × 7 × 6 = 3024. (ii) Solve ⁿP₂ = 56: n(n − 1) = 56 = 8 × 7, so n = 8. (iii) Solve ⁿP₄ = 20 × ⁿP₂: n(n − 1)(n − 2)(n − 3) = 20 n(n − 1); dividing by n(n − 1), (n − 2)(n − 3) = 20 = 5 × 4, so n − 2 = 5 and n = 7. Check: ⁷P₄ = 840 and 20 × ⁷P₂ = 20 × 42 = 840.

Worked example 5: prizes and codes

(i) Ten runners compete for gold, silver and bronze. The order matters, so the medals can go in ¹⁰P₃ = 10 × 9 × 8 = 720 ways. (ii) A 4-digit lock code uses the digits 0 to 9. With all digits different there are ¹⁰P₄ = 10 × 9 × 8 × 7 = 5040 codes; if digits may repeat there are 10⁴ = 10000 codes.

n! = n × (n − 1)!, 0! = 1. ⁿPᵣ = n!/(n − r)! = n(n − 1)...(n − r + 1). With repetition: nʳ.

— Factorials and permutations

Key takeaways: simplify factorial expressions by writing the larger factorial down to the smaller and cancelling. ⁿPᵣ counts ordered arrangements of r out of n distinct objects; repetition turns the count into nʳ. To solve an equation in ⁿPᵣ, write both sides as products, cancel common factors and match consecutive numbers.

Check your understanding

  1. 1. What is the value of 8!/6!?

    1. 28
    2. 56
    3. 48
    4. 336
    Show answer

    Answer: B. 8! = 8 × 7 × 6!, so 8!/6! = 8 × 7 = 56.

  2. 2. What is ⁷P₃?

    1. 35
    2. 343
    3. 210
    4. 5040
    Show answer

    Answer: C. ⁷P₃ = 7 × 6 × 5 = 210. 343 = 7³ would allow repetition, and 35 is ⁷C₃, which ignores order.

  3. 3. If ⁿP₂ = 90, what is n?

    1. 9
    2. 45
    3. 11
    4. 10
    Show answer

    Answer: D. ⁿP₂ = n(n − 1) = 90 = 10 × 9, so n = 10. Check: ¹⁰P₂ = 10 × 9 = 90.

  4. 4. Why is 0! taken to be 1?

    1. Because a product of no numbers is 0
    2. Because putting n = 0 in (n + 1)! = (n + 1) × n! gives 1! = 1 × 0!
    3. Because 0! is undefined, and 1 is used as a placeholder
    4. Because 0! = 0 × (−1)!
    Show answer

    Answer: B. The rule (n + 1)! = (n + 1) × n! with n = 0 gives 1! = 1 × 0!. Since 1! = 1, we must have 0! = 1. (−1)! is not defined, so 0! = 0 × (−1)! makes no sense.

  5. 5. What is the double factorial 7!!?

    1. 105
    2. 5040
    3. 35
    4. 15
    Show answer

    Answer: A. For odd n, n!! multiplies every second number down to 1: 7!! = 7 × 5 × 3 × 1 = 105. 5040 is 7!, and 35 and 15 stop too early.

Privacy · Terms · Refunds · Delivery