Skip to content

Mathematics · Ch 6 — Permutations and Combinations

Factorial Notation

2

Factorial Notation

Many of the counting formulas developed later in this chapter involve repeated products such as n(n−1)(n−2)⋯2⋅1n(n-1)(n-2)\cdots 2 \cdot 1. Because this pattern occurs so often, it is given its own compact notation.

For a positive integer nn, the factorial of nn, written n!n! (read "nn factorial"), is defined as

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

So 1!=11! = 1, 2!=2×1=22! = 2 \times 1 = 2, 3!=3×2×1=63! = 3 \times 2 \times 1 = 6, 4!=4×3×2×1=244! = 4 \times 3 \times 2 \times 1 = 24, and 5!=1205! = 120. Factorials grow extremely quickly: 10!=3,628,80010! = 3{,}628{,}800, and 15!15! already exceeds a trillion — this rapid growth is exactly why counting formulas are left in factorial form rather than expanded into a single huge number wherever possible.

The recurrence relation

Every factorial can be written in terms of the one before it:

n!=n×(n−1)!n! = n \times (n-1)!

This relation is useful both for computing factorials quickly (build up from 1!=11! = 1) and, just as importantly, for simplifying ratios of factorials without multiplying out either one, e.g.

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

Cancelling the common factorial tail like this — rather than computing 10!10! and 8!8! separately and dividing — is the standard technique used throughout the rest of the chapter, especially when simplifying the formulas for nPr^{n}P_{r} and nCr^{n}C_{r}.

Why 0!=10! = 1 …