Mathematics · Ch 12 — Permutations and Combination
Factorial Notation
Factorial Notation
This section introduces factorial notation, the essential shorthand that underlies every formula developed later in the chapter for permutations and combinations.
Definition: for a natural number , the factorial of , written (read 'n factorial'), is the product of the natural numbers from 1 to : . Equivalently, and often more usefully for computation, it can be written in the reverse order: . For example, , read as '5 factorial is equal to 120'. A short table of illustrations builds this up from the smallest cases: ; ; ; , and so on, with each new factorial naturally being the previous one multiplied by the next integer.
A crucial convention closes the definition: although 0 is not itself a natural number, we DEFINE . This convention is not arbitrary — it is exactly what is needed to keep later formulas (like and ) consistent without a separate special case.
The section then lists eight properties of factorial notation, for positive integers : (1) ; (2) for , ; (3) for , — these three properties are simply the same 'peel off the leading factors' idea taken one, two, or three steps deep, and are the basis of the cancellation technique used throughout the chapter to simplify ratios of factorials. (4) is always divisible by BOTH and — for example, is divisible by both and . Properties (5)–(8) are deliberately-stated WARNINGS against common misconceptions: (5) ; (6) ; (7) for , , although IS divisible by ; and (8) — factorials simply do not distribute over addition, subtraction, multiplication, or division the way ordinary exponents or coefficients might, and several exercise problems in this section are built specifically to test whether this distinction has been understood.
Solved Example 1 asks for the value of : directly, .
Solved Example 2 asks to show that : computing the left side, ; computing the right side, and , so . Since , indeed , confirming property (7) above with a concrete numerical case.
Solved Example 3 asks to find if . Writing and dividing both sides by the common gives . Rather than expanding this into a quadratic and using the quadratic formula, the solution writes 56 directly as a product of two consecutive integers: . Matching the larger factor on each side, , so . This 'reduce the factorial ratio to a product of consecutive integers, then factor the target number into the same count of consecutive integers' technique is the standard method used repeatedly for 'find n' factorial equations throughout the rest of the chapter, including several exercise problems in this very section. …
1! = 1 | 2! = 2×1 = 2 | 3! = 3×2×1 = 6 | 4! = 4×3 …
(1) n!=n(n-1)! | (2) n>1: n!=n(n-1)(n-2)! | (3) n>2: n!=n(n-1)(n-2)(n-3)! | (4) (m+n)! divisible by m! and by n! | (5) (m×n)! ≠ m!×n! | (6) (m+n)! ≠ m!+n! | (7) m>n: (m-n)! ≠ m!-n!, but m! is d …