Why must 0! equal 1?
0! = 1 is not a convention — it is forced by requiring the binomial coefficient formula n! / (r!(n−r)!) to match the combinatorial count of ways to choose r items from n.
A complete interactive classroom, not just a preview.
Start when you are ready to enter this Stage's 8 scenes and explore, respond, and learn as you go.
How do binomial coefficients confirm that 0! must equal 1?
A factorial that counts nothing yet equals one — a small mystery hiding in every formula that uses n!.
Intuition says 0 things should give 0, but the binomial coefficient formula breaks unless 0! = 1.
Compare small Pascal-triangle rows to the formula C(n, r) = n! / (r!(n−r)!), and watch how the identity only holds when 0! = 1.
A direct derivation: setting r = 0 (or r = n) in the binomial coefficient forces 0! = 1 as the only consistent value.
Since 0 items mean nothing is being counted, it is natural to guess that 0! should be 0.
- Gamma function generalization
- Permutation counting proofs without binomials
- Historical disputes about the definition of 0
- 01The mystery of 0!slideQuestion
Pose the driving question and surface the tension between intuition (0 things → 0) and the algebraic need for a non-zero value.
- Factorials grow fast: 1! = 1, 2! = 2, 3! = 6, 4! = 24
- Intuition expects 0! = 0 because zero items means zero arrangements
- Yet binomials and Pascal's triangle seem to assume 0! = 1
- 02Commit to a guessquizPrediction
Ask the learner to choose what 0! must equal before the binomial evidence is shown.
- One independent choice
- 03Build Pascal's triangle and compare two definitionsinteractiveEvidence
Let the learner step through rows of Pascal's triangle using the additive rule C(n,r) = C(n−1,r−1) + C(n−1,r), and display the closed-form values C(n,r) = n! / (r!(n−r)!) for the same cells.
- Each row's edges are 1, corresponding to choosing 0 or all items
- Closed-form formula uses factorials in both numerator and denominator
- First divergence appears when any denominator term is evaluated as 0!
- 04Computing C(n, 0) two waysslideEvidence
Show a side-by-side calculation: combinatorially there is exactly one way to choose 0 items from n, and the formula n! / (0!·n!) must equal that 1.
- Combinatorial count: choosing nothing is one single way
- Algebraic count: n! / (0!·n!) simplifies to 1 / 0!
- For these to agree, 0! must be 1
- 05Why the algebra forces itslideExplanation
Derive the equality step by step: n! / (0!·n!) = n! / (0!·n!) cancels to 1 / 0!, and matching the combinatorial answer of 1 demands 0! = 1. Mirror the argument with r = n.
- n! cancels on top and bottom, leaving 1 / 0!
- Combinatorially, C(n, 0) = 1 and C(n, n) = 1
- Only 0! = 1 makes 1 / 0! = 1, consistent across all n
- 06What if 0! were anything else?slideBoundary
Test 0! = 0 and 0! = 6 in the binomial formula and show the resulting rows would not match Pascal's triangle or counting arguments.
- 0! = 0 makes every binomial coefficient undefined
- 0! = 6 makes C(n, r) values fractional for small n
- Only 0! = 1 keeps the integers that Pascal's triangle requires
- 07Apply the same reasoning elsewhereinteractiveTransfer
Have the learner pick another formula that uses 0! — such as the number of permutations of zero items or the empty product — and verify the same conclusion holds.
- Permutations of 0 items: 0! / 0! = 1
- Empty product convention matches factorial convention
- Consistency across counting formulas confirms the choice
- 080! = 1, by binomial necessityslideResolution
Directly answer the driving question: binomial coefficients require 0! = 1 because C(n, 0) and C(n, n) must each equal 1, and the closed-form formula only delivers 1 when 0! = 1.
- Combinatorial meaning: one way to choose nothing or everything
- Algebraic meaning: n! / (0!·n!) = 1 forces 0! = 1
- Result is a definition forced by internal consistency, not a mere convention
Discussion threads for a Stage aren't available yet.
This path ends here.
