8.3 Combinatorics: Permutations, Combinations & Binomial Theorem

8.3 Combinatorics: Permutations, Combinations & Binomial Theorem

Combinatorics is the branch of discrete mathematics dedicated to counting, arranging, and analyzing finite structures. In the secondary curriculum, combinatorial reasoning bridges arithmetic multiplication and advanced probability, algebra, and discrete modeling. For accomplished mathematics educators, instructional excellence demands guiding students past formulaic memorization toward structural understanding: determining whether order matters, accounting for identical elements and rotational symmetries, applying Pascal's identities, and expanding polynomials via the Binomial Theorem.

---

1. The Fundamental Counting Principle & Factorials

Every combinatorial formula originates from two basic counting principles:

The Fundamental Counting Principle (Multiplication Principle)

If a compound procedure consists of $k$ consecutive stages, where stage 1 can be completed in $n_1$ ways, stage 2 in $n_2$ ways (regardless of the outcome of stage 1), and so on up to stage $k$ in $n_k$ ways, then the total number of distinct outcomes for the composite sequence is:

$$N = n_1 \cdot n_2 \cdot n_3 \cdots n_k$$

The Addition Principle: If an event can occur through either one of $m$ mutually exclusive alternatives in set $A$ or one of $n$ mutually exclusive alternatives in set $B$ (where $A \cap B = \emptyset$), the total number of ways the event can occur is $|A| + |B| = m + n$.

Factorial Notation and the Axiom $0! = 1$

For any positive integer $n \in \mathbb{Z}^+$, the factorial $n!$ represents the product of all positive integers less than or equal to $n$:

$$n! = n \cdot (n - 1) \cdot (n - 2) \cdots 3 \cdot 2 \cdot 1$$

Why does $0! = 1$? Secondary students frequently ask why $0!$ is not $0$. Accomplished teachers provide two rigorous justifications:

1. Recursive Consistency: The recursive relation $(n - 1)! = \frac{n!}{n}$ must hold for all $n \ge 1$. Setting $n = 1$ yields: $$0! = \frac{1!}{1} = \frac{1}{1} = 1$$
2. Combinatorial Set Theory: The factorial $n!$ counts the number of bijections (permutations) from an $n$-element set to itself. For the empty set $\emptyset$ ($n = 0$), there exists exactly one function from $\emptyset$ to $\emptyset$ (the empty function, which is vacuously a bijection). Hence, there is exactly 1 way to arrange 0 items: $0! = 1$.

---

2. Permutations: Linear, Multiset & Circular

A permutation is an ordered arrangement of distinct objects selected from a set.

Linear Permutations of Distinct Objects

The number of distinct ordered sequences of length $r$ chosen from a pool of $n$ distinct objects ($0 \le r \le n$) without replacement is denoted $P(n, r)$ or $_n P_r$:

$$P(n, r) = n \cdot (n - 1) \cdot (n - 2) \cdots (n - r + 1) = \frac{n!}{(n - r)!}$$

When $r = n$ (arranging all $n$ distinct objects), $P(n, n) = \frac{n!}{0!} = \frac{n!}{1} = n!$.

Permutations with Repetition (Multisets / Indistinguishable Items)

When arranging $n$ total objects where some objects are identical to one another, standard permutations overcount. If a set contains $n_1$ identical items of type 1, $n_2$ identical items of type 2, ..., and $n_k$ identical items of type $k$ (where $\sum_{i=1}^k n_i = n$), the number of distinct linear permutations is:

$$\text{Arrangements} = \frac{n!}{n_1! \cdot n_2! \cdot n_3! \cdots n_k!}$$

Classic Anagram Example: For the word MISSISSIPPI, total letters $n = 11$, with letter counts: $\text{M} = 1, \text{I} = 4, \text{S} = 4, \text{P} = 2$. The number of distinct anagrams is:

$$\frac{11!}{1! \cdot 4! \cdot 4! \cdot 2!} = \frac{39,916,800}{1 \cdot 24 \cdot 24 \cdot 2} = \frac{39,916,800}{1,152} = 34,650$$

Circular Permutations

When $n$ distinct objects are arranged around a closed circle, linear shifts that correspond to pure rotations are considered identical.

• Rotational Equivalence: Shifting every object by 1 position clockwise produces the same circular ordering. Because each distinct circular arrangement can be rotated into $n$ different linear sequences, dividing by $n$ eliminates the rotational symmetry: $$\text{Circular Permutations} = \frac{n!}{n} = (n - 1)!$$
• Reflective Equivalence (Keychains / Necklaces): If the circle can be flipped over in three dimensions (so clockwise and counterclockwise orientations are indistinguishable), we divide further by 2: $$\text{Reversible Circular Permutations} = \frac{(n - 1)!}{2} \quad (\text{for } n \ge 3)$$

---

3. Combinations & The Bridge to Permutations

A combination is an unordered selection of $r$ objects chosen from a set of $n$ distinct objects. The order of selection is entirely irrelevant.

Combination Formula

The number of $r$-element subsets chosen from an $n$-element set is denoted $C(n, r)$, $_n C_r$, or the binomial coefficient $\binom{n}{r}$ ("$n$ choose $r$"):

$$\binom{n}{r} = C(n, r) = \frac{P(n, r)}{r!} = \frac{n!}{r!(n - r)!}, \quad 0 \le r \le n$$

+-----------------------------------------------------------------------------+
|                  PERMUTATIONS VS. COMBINATIONS COMPARISON                   |
|                                                                             |
|   Criterion               Permutation P(n, r)       Combination C(n, r)     |
|   -----------------------------------------------------------------------   |
|   Does Order Matter?      YES (Arrangement)         NO (Selection/Group)    |
|   Formula                 n! / (n - r)!             n! / [ r! (n - r)! ]    |
|   Example Contexts        Podium (1st, 2nd, 3rd)    Committee of 3 members  |
|                           Password codes            Hands of playing cards  |
|                           Batting orders            Toppings on a pizza     |
|   Structural Link         P(n, r) = r! · C(n, r)    C(n, r) = P(n, r) / r!  |
+-----------------------------------------------------------------------------+

The "Division by $r!$" Concept

The division by $r!$ is the conceptual heart of combinations. Any specific unordered subset of $r$ items can be ordered in exactly $r!$ distinct ways. Since $P(n, r)$ counts each of these orderings as a separate event, dividing $P(n, r)$ by $r!$ collapses all $r!$ permutations of that subset into a single combination.

Fundamental Symmetry Property

Choosing $r$ objects to include in a subset is mathematically identical to choosing the remaining $n - r$ objects to exclude:

$$\binom{n}{r} = \frac{n!}{r!(n - r)!} = \frac{n!}{(n - r)![n - (n - r)]!} = \binom{n}{n - r}$$

---

4. Pascal's Triangle & Combinatorial Identities

Pascal's Triangle is a geometric arrangement of the binomial coefficients $\binom{n}{r}$, where row $n$ lists $\binom{n}{0}, \binom{n}{1}, \dots, \binom{n}{n}$.

Row 0:                      1
Row 1:                    1   1
Row 2:                  1   2   1
Row 3:                1   3   3   1
Row 4:              1   4   6   4   1
Row 5:            1   5  10  10   5   1

Pascal's Identity (Addition Rule)

Every interior entry in Pascal's Triangle is the sum of the two entries directly above it:

Combinatorial Proof: Let $S$ be a set of $n$ people containing one designated person, Alex. We wish to choose a committee of $r$ people from $S$. We partition the selections into two mutually exclusive cases:

1. Alex is on the committee: We must choose the remaining $r - 1$ committee members from the other $n - 1$ people. This can be done in $\binom{n - 1}{r - 1}$ ways.
2. Alex is NOT on the committee: We must choose all $r$ committee members from the other $n - 1$ people. This can be done in $\binom{n - 1}{r}$ ways.

By the Addition Principle, the total number of committees is $\binom{n - 1}{r - 1} + \binom{n - 1}{r} = \binom{n}{r}$.

Row Sum Property & Power Sets

Summing all entries in row $n$ yields $2^n$:

$$\sum_{k=0}^n \binom{n}{k} = \binom{n}{0} + \binom{n}{1} + \dots + \binom{n}{n} = 2^n$$

Combinatorial Meaning: The sum of $\binom{n}{k}$ over all $k$ counts the total number of subsets of an $n$-element set. Since every element has 2 independent choices (either included in the subset or excluded), the total number of subsets (the cardinality of the power set $\mathcal{P}(S)$) is $2^n$.

---

5. The Binomial Theorem & Specific Term Isolation

The Binomial Theorem provides the closed-form polynomial expansion of powers of a binomial sum $(a + b)^n$.

General $(k + 1)$-th Term Formula

In standard index notation, the $(k + 1)$-th term of the expansion is:

$$T_{k+1} = \binom{n}{k} a^{n - k} b^k$$

Step-by-Step Worked Example: Finding a Specific Term

Task: Find the coefficient of $x^3$ in the expansion of $\left( 2x^2 - \frac{1}{x} \right)^9$.

1. Identify parameters: Let $a = 2x^2$, $b = -x^{-1}$, and $n = 9$.
2. Write the general term: $$T_{k+1} = \binom{9}{k} (2x^2)^{9 - k} (-x^{-1})^k = \binom{9}{k} 2^{9 - k} (x^2)^{9 - k} (-1)^k (x^{-1})^k$$
3. Isolate coefficients and powers of $x$: $$T_{k+1} = \binom{9}{k} 2^{9 - k} (-1)^k \cdot x^{2(9 - k) - k} = \binom{9}{k} 2^{9 - k} (-1)^k \cdot x^{18 - 3k}$$
4. Solve for the index $k$ matching the target exponent: $$18 - 3k = 3 \implies 3k = 15 \implies k = 5$$
5. Evaluate the numerical coefficient for $k = 5$: $$\text{Coefficient} = \binom{9}{5} 2^{9 - 5} (-1)^5 = \binom{9}{4} 2^4 (-1) = 126 \cdot 16 \cdot (-1) = -2,016$$ The term is $-2,016 x^3$, so the coefficient is $-2,016$.

---

6. Secondary Pedagogical Traps & Instructional Interventions

Accomplished educators diagnose and correct persistent combinatorial hurdles:

Misconception 1: "Order Matters" Confusion (Chronological vs. Structural Order)

Students often see words like "First pick a student, then pick another" and assume order matters because the selection happens chronologically across time.

• Pedagogical Intervention: Introduce the "Role / Label Swap Test". Ask students: "If Student A is picked first and Student B is picked second, do they hold different offices (e.g., President vs. Vice President)?" If swapping the names alters the real-world outcome, order matters $\implies$ Permutation. If swapping names results in the exact same committee, team, or hand, order does not matter $\implies$ Combination.

Misconception 2: Overcounting in Multi-Stage Combinations (The "Pick 1 Then Pick the Rest" Fallacy)

Consider the problem: From 6 math teachers and 8 science teachers, choose a committee of 4 that contains at least 1 math teacher. Students frequently argue: "Pick 1 math teacher in $\binom{6}{1} = 6$ ways, then pick any 3 remaining teachers from the remaining 13 in $\binom{13}{3} = 286$ ways, giving $6 \cdot 286 = 1,716$ committees."

• Pedagogical Intervention: Expose the overcounting by assigning names: Math teachers $M_1, M_2$ and Science teachers $S_1, S_2$. Suppose the final committee is $\{M_1, M_2, S_1, S_2\}$. Under the student's method, this exact committee is counted twice: once when $M_1$ is chosen as the "designated math teacher" and $\{M_2, S_1, S_2\}$ are chosen from the rest, and again when $M_2$ is chosen as the designated math teacher and $\{M_1, S_1, S_2\}$ are chosen from the rest! Teach students the Complementary Counting Strategy: $$\text{At least 1 Math} = \text{Total Committees} - \text{Committees with NO Math}$$ $$\binom{14}{4} - \binom{8}{4} = 1,001 - 70 = 931$$ Show that $931$ is vastly smaller than the fallacious $1,716$.

Misconception 3: Dropping Negative Signs in Binomial Expansions

When expanding $(x - 3y)^n$, students routinely forget that $b = -3y$, resulting in all positive terms rather than alternating signs.

• Pedagogical Intervention: Instruct students to rewrite subtraction explicitly as addition of a signed term: $[x + (-3y)]^n$. Isolate $(-3)^k$ within brackets during the term setup to ensure correct evaluation of $(-1)^k$.