Skip to content

Statistics · Ch 6 — Permutations, Combinations and Binomial Expansion

Factorial Notation

2

Factorial Notation

Repeatedly applying the multiplication principle to arrange a set of distinct objects produces the same kind of product again and again — n×(n−1)×(n−2)×⋯×1n \times (n-1) \times (n-2) \times \cdots \times 1. Because this product shows up so often in counting problems, it is given its own compact notation: the factorial.

Definition

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

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

By convention, 0!=10! = 1. This is not something to derive from the product formula (the product would be empty) — it is a definition adopted purely so that the permutation and combination formulas below stay valid even when r=0r = 0 or r=nr = n.

Recurrence relation

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

This relation is often the fastest way to simplify an expression that mixes two different factorials, since it lets us peel off (or build up) factors one at a time instead of expanding both factorials in full.

A short table of values

nnn!n!
01
11
22
36
424
5120
6720
75040
840320

Notice how quickly factorials grow — this rapid growth is exactly why counting problems need a compact notation rather than writing out every arrangement by hand; a Gujarat Std-11 Commerce student is expected to compute factorial-based expressions confidently, not just quote the definition.

Simplifying factorial expressions …

Definition 1Factorial ($n!$)

The product of all positive integers from nn down to 11: n!=n(n−1)(n−2)⋯2⋅1n! = n(n-1)(n-2)\cdots 2 \cdot 1, with the special …