16.1 Fundamental Counting Principle, Permutations & Combinations

16.1 Fundamental Counting Principle, Permutations & Combinations

The Fundamental Counting Principle & Factorial Operations

Combinatorics provides the structural mathematical foundation for discrete probability theory. Calculating the probability of an event requires determining the exact cardinality of favorable outcomes relative to the total cardinality of the sample space. Enumerating outcomes one by one is impractical for complex systems, necessitating rigorous algebraic counting principles.

The foundational bedrock of enumerative combinatorics is the Fundamental Counting Principle (Multiplication Rule of Counting): If a composite procedure can be partitioned into a sequence of $k$ independent operational stages, where Stage 1 produces $n_1$ possible outcomes, Stage 2 produces $n_2$ possible outcomes regardless of the outcome of Stage 1, and so on through Stage $k$ producing $n_k$ possible outcomes, then the total number of distinct sequence outcomes is the product: $N = n_1 \times n_2 \times n_3 \times \dots \times n_k = \prod_{i=1}^k n_i$

When a counting procedure requires sequential selections without replacement from a finite set of $n$ distinct objects, the multiplication rule naturally generates the factorial function. For any non-negative integer $n$, the factorial $n!$ (read '$n$ factorial') represents the product of all positive integers less than or equal to $n$: $n! = n \times (n - 1) \times (n - 2) \times \dots \times 3 \times 2 \times 1$ with the baseline definition that $1! = 1$.

A crucial algebraic convention tested on the FTCE Mathematics 6-12 examination is the definition of zero factorial: $0! = 1$. This is not an arbitrary assignment; it is an algebraic requirement dictated by the recurrence relation governing all factorials: $n! = n \times (n - 1)! \implies (n - 1)! = \frac{n!}{n}$ Evaluating this identity at $n = 1$ forces the definition: $0! = (1 - 1)! = \frac{1!}{1} = \frac{1}{1} = 1$ Combinatorially, $0! = 1$ corresponds to the fact that there is exactly one way to arrange an empty set of zero objects (the empty arrangement).

---

Linear Permutations: When Order Matters

A permutation is an ordered arrangement of elements selected from a finite set without replacement. The defining diagnostic criterion of a permutation is that order matters: altering the sequential position of any element yields a distinct, unique outcome. For example, selecting a President, Vice President, and Secretary produces an ordered sequence $(A, B, C) \ne (B, A, C)$, even though both groups contain identical individuals.

To derive the formula for the number of permutations of $n$ distinct objects taken $r$ at a time (denoted $nPr$ or $P(n, r)$, with $0 \le r \le n$), we apply the Fundamental Counting Principle across $r$ consecutive positions:

• Position 1 can be filled by any of the $n$ available objects.
• Position 2 can be filled by any of the remaining $n - 1$ objects.
• Position $r$ can be filled by any of the remaining $n - (r - 1) = n - r + 1$ objects.

Multiplying these consecutive choices gives: $nPr = n(n - 1)(n - 2) \dots (n - r + 1)$ To express this product compactly using factorials, we multiply and divide by $(n - r)!$: $nPr = \frac{n(n - 1)(n - 2) \dots (n - r + 1) \times (n - r)!}{(n - r)!} = \frac{n!}{(n - r)!}$

Two critical boundary cases follow directly from this formula:

1. Arranging all $n$ objects in a linear sequence ($r = n$): $nPn = \frac{n!}{(n - n)!} = \frac{n!}{0!} = \frac{n!}{1} = n!$
2. Arranging zero objects from a set of $n$ ($r = 0$): $nP0 = \frac{n!}{(n - 0)!} = \frac{n!}{n!} = 1$

---

Multiset and Circular Permutations

Standard linear permutations assume all $n$ objects are unique and distinguishable. When items repeat or geometric symmetry exists, standard formulas overcount distinct physical outcomes.

Multiset Permutations (Identical / Indistinguishable Objects)

When arranging $n$ total objects where some objects are identical to one another, exchanging the positions of identical items does not generate a new physical arrangement. If a set contains $n$ objects consisting of $k$ distinct types, with $n_1$ identical objects of type 1, $n_2$ of type 2, and so on up to $n_k$ of type $k$ (such that $\sum_{i=1}^k n_i = n$), the number of distinct permutations is: $\text{Distinguishable Permutations} = \frac{n!}{n_1! \times n_2! \times \dots \times n_k!}$ The denominator eliminates redundant permutations: because the $n_1$ identical items can be internally reordered in $n_1!$ ways without altering the arrangement, dividing by $n_1!$ corrects the overcount.

Circular Permutations

When $n$ distinct objects are arranged in a closed circle rather than a line, sequential positions have no absolute beginning or end. Shifting every object by one position clockwise preserves relative order, meaning that $n$ distinct linear sequences correspond to a single circular arrangement. To break rotational symmetry, we fix one arbitrary object in place to serve as the reference point, and then arrange the remaining $n - 1$ objects in the remaining positions: $\text{Circular Permutations} = \frac{n!}{n} = (n - 1)!$

If the circular arrangement can be flipped over in three-dimensional space—such as keys on a key ring or beads on an unclasped necklace—clockwise and counter-clockwise orientations become physically indistinguishable. This reflectional symmetry divides the count by 2: $\text{Circular Permutations with Reflection} = \frac{(n - 1)!}{2}$

---

Combinations: When Order Does Not Matter

A combination is an unordered collection or subset of $r$ objects selected from a set of $n$ distinct objects without replacement (denoted $nCr$, $C(n, r)$, or $\binom{n}{r}$, with $0 \le r \le n$). The essential criterion is that order does not matter: the subset ${A, B, C}$ is identical to ${C, B, A}$.

The Algebraic Bridge Between Permutations and Combinations

Every unordered combination of $r$ elements can be arranged internally into $r!$ distinct linear orders. By the Fundamental Counting Principle, the total number of ordered permutations $nPr$ equals the number of unordered combinations $nCr$ multiplied by the number of internal orderings $r!$: $nPr = r! \times nCr$ Solving for $nCr$ yields the combination formula: $nCr = \binom{n}{r} = \frac{nPr}{r!} = \frac{n!}{r!(n - r)!}$

Algebraic Symmetry and Pascal's Triangle Connections

Combinations satisfy structural algebraic properties vital for advanced problem-solving:

1. Reflective Symmetry: $\binom{n}{r} = \binom{n}{n - r}$ Choosing $r$ elements to include in a subset from $n$ available items is mathematically identical to choosing the remaining $n - r$ elements to exclude from the subset. For example, $\binom{100}{98} = \binom{100}{2} = \frac{100 \times 99}{2} = 4,950$.
2. Pascal's Recurrence Identity: $\binom{n}{r} + \binom{n}{r - 1} = \binom{n + 1}{r}$ This identity governs the construction of Pascal's Triangle, where every interior entry is the sum of the two entries directly above it. Combinatorially, consider selecting a committee of $r$ individuals from a group of $n + 1$ people that includes a distinguished person $X$. The selections can be partitioned into two disjoint subsets: committees that exclude person $X$ (which requires choosing all $r$ members from the other $n$ people, $\binom{n}{r}$) and committees that include person $X$ (which requires choosing the remaining $r - 1$ members from the other $n$ people, $\binom{n}{r - 1}$).
3. Sum of Row Entries (Power Set Summation): $\sum_{r=0}^n \binom{n}{r} = \binom{n}{0} + \binom{n}{1} + \dots + \binom{n}{n} = 2^n$ Setting $x = 1$ and $y = 1$ in the Binomial Theorem $(x + y)^n = \sum_{r=0}^n \binom{n}{r} x^{n - r} y^r$ proves that the total number of all possible subsets (the cardinality of the power set) of an $n$-element set is exactly $2^n$.

---

Constrained Group Selections and Multi-Stage Groupings

Standard examination problems frequently impose structural constraints on group selection, such as selecting representatives from distinct sub-populations or requiring minimum representation ('at least one').

When forming a multi-category group (e.g., choosing teachers and students), the selection process divides into independent stages combined via the Fundamental Counting Principle: $\text{Total Ways} = \binom{n_1}{r_1} \times \binom{n_2}{r_2} \times \dots \times \binom{n_k}{r_k}$

When constraints specify 'at least $k$' or 'at most $k$' members of a particular category, two analytical strategies are available:

1. Direct Partitioning (Addition Rule): Deconstruct the problem into mutually exclusive sub-cases and sum the individual combinatorial counts.
2. Complementary Counting: When favorable cases outnumber unfavorable cases, subtract the unfavorable outcomes from the total unconstrained outcomes: $\text{Favorable Outcomes} = \text{Total Unconstrained Outcomes} - \text{Unfavorable Outcomes}$ This is especially powerful for 'at least one' conditions: $\text{Ways with } \ge 1 = \text{Total Ways} - \text{Ways with } 0$.

---

Permutations vs. Combinations Comparison Matrix

---

Worked Exemplar: Committee Selection with Sub-Constraints

Problem: A high school governance council must form a 5-member curriculum committee. The committee is selected from a candidate pool of 8 teachers and 6 students. The district policy requires that the committee must contain at least 3 teachers. In how many distinct ways can this committee be formed?

Solution Strategy

The selection requires choosing 5 individuals from a total pool of $8 + 6 = 14$ candidates. Because member roles are unranked, order does not matter; this is a combination problem. The constraint 'at least 3 teachers' means the committee can contain 3, 4, or 5 teachers.

Method 1: Direct Partitioning (Summing Mutually Exclusive Cases)

• Case 1: Exactly 3 teachers and 2 students $\binom{8}{3} \times \binom{6}{2} = \left(\frac{8 \times 7 \times 6}{3 \times 2 \times 1}\right) \times \left(\frac{6 \times 5}{2 \times 1}\right) = 56 \times 15 = 840$
• Case 2: Exactly 4 teachers and 1 student $\binom{8}{4} \times \binom{6}{1} = \left(\frac{8 \times 7 \times 6 \times 5}{4 \times 3 \times 2 \times 1}\right) \times 6 = 70 \times 6 = 420$
• Case 3: Exactly 5 teachers and 0 students $\binom{8}{5} \times \binom{6}{0} = \binom{8}{3} \times 1 = 56 \times 1 = 56$

Summing these disjoint cases: $\text{Total Favorable Committees} = 840 + 420 + 56 = 1,316$

Method 2: Complementary Counting Verification

• Total Unconstrained Committees (choosing 5 from 14): $\binom{14}{5} = \frac{14 \times 13 \times 12 \times 11 \times 10}{5 \times 4 \times 3 \times 2 \times 1} = 2,002$
• Unfavorable Committees (fewer than 3 teachers: 0, 1, or 2 teachers):
  • Exactly 0 teachers (5 students): $\binom{8}{0} \times \binom{6}{5} = 1 \times 6 = 6$
  • Exactly 1 teacher (4 students): $\binom{8}{1} \times \binom{6}{4} = 8 \times 15 = 120$
  • Exactly 2 teachers (3 students): $\binom{8}{2} \times \binom{6}{3} = 28 \times 20 = 560$ $\text{Total Unfavorable} = 6 + 120 + 560 = 686$
• Subtracting Unfavorable from Total: $\text{Total Favorable} = 2,002 - 686 = 1,316$ Both analytic pathways yield exactly 1,316 distinct committee configurations.