14.4 Probability Principles, Counting Techniques, Permutations, Combinations, and Tree Diagrams

14.4 Probability Principles, Counting Techniques, Permutations, Combinations, and Tree Diagrams

Competency 4.4 of the FTCE General Knowledge Mathematics subtest evaluates an educator's mastery of counting techniques, combinatorial principles, and probability theory. Test items present candidates with real-world scenarios requiring them to calculate sample spaces, evaluate factorials, distinguish between order-dependent and order-independent groupings, and compute exact probabilities for simple, compound, independent, and dependent events.

---

The Fundamental Counting Principle and Factorials

Determining the total number of possible outcomes in a multi-stage experiment is the starting point for probability calculations.

The Fundamental Counting Principle

If a composite event consists of $k$ sequential stages, where the first stage can occur in $n_1$ ways, the second in $n_2$ ways, the third in $n_3$ ways, and so on, the total number of possible outcomes ($N$) is the product of the number of choices at each stage:

$$N = n_1 \times n_2 \times n_3 \times \dots \times n_k$$

• Example (Student ID Codes): A school creates a student identification code consisting of 2 letters followed by 3 single-digit numbers (digits 0–9). If letters and digits may repeat, the total possible codes is: $$N = 26 \times 26 \times 10 \times 10 \times 10 = 676 \times 1,000 = 676,000$$
• If repetition is prohibited: $$N = 26 \times 25 \times 10 \times 9 \times 8 = 650 \times 720 = 468,000$$

Factorials

A factorial (denoted $n!$) 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$$

• Special Axiom: By mathematical convention, $0! = 1$ (representing the single way to arrange an empty set).
• Common factorials: $1! = 1$, $2! = 2$, $3! = 6$, $4! = 24$, $5! = 120$, $6! = 720$.

---

Permutations vs. Combinations: The Order Test

The most critical conceptual decision on FTCE counting problems is determining whether an arrangement constitutes a permutation or a combination.

                               THE ORDER DECISION CRITERION
                                Does positional ORDER matter?
                                     ┌───────────────┐
                                     │  Selection of │
                                     │  r from n     │
                                     └───────┬───────┘
                     ┌───────────────────────┴───────────────────────┐
                     ▼                                               ▼
                  YES: ORDER MATTERS                              NO: ORDER DOES NOT MATTER
              ┌───────────────────────┐                       ┌───────────────────────┐
              │      PERMUTATION      │                       │      COMBINATION      │
              │   P(n, r) = n!/(n-r)! │                       │ C(n, r) = n!/[r!(n-r)!│
              └───────────────────────┘                       └───────────────────────┘
              • President / VP / Sec                          • Advisory Committee
              • 1st, 2nd, 3rd Place                           • Group of 4 Chaperones
              • Seating order in a row                        • Pizza topping choices

Permutations (Order Matters)

A permutation is an ordered arrangement of $r$ objects selected from a set of $n$ distinct objects without replacement:

$$P(n, r) = \frac{n!}{(n - r)!} = n \times (n - 1) \times \dots \times (n - r + 1)$$

Use permutations when roles are distinct, titles are assigned, or ranks are awarded (e.g., electing a President, Vice President, and Secretary).

Combinations (Order Does NOT Matter)

A combination is a selection of $r$ objects chosen from a set of $n$ distinct objects without regard to order:

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

Because order does not matter, selecting Person A, Person B, and Person C is identical to selecting C, B, and A. Dividing by $r!$ eliminates redundant rearrangements of the same group.

Comparative Worked Example

A department has 10 eligible faculty members:

• Scenario A (Permutation): How many ways can the department elect a Chairperson, Vice Chair, and Recording Secretary?
  • Positional titles mean order matters: $P(10, 3) = \frac{10!}{(10 - 3)!} = \frac{10!}{7!} = 10 \times 9 \times 8 = 720$ ways.
• Scenario B (Combination): How many ways can the department select a 3-person peer-review committee?
  • All 3 members share equal status; order does not matter: $C(10, 3) = \frac{10!}{3! \cdot 7!} = \frac{10 \times 9 \times 8}{3 \times 2 \times 1} = \frac{720}{6} = 120$ ways.

---

Foundational Probability Principles

Probability measures the mathematical likelihood that an event ($E$) will occur, bounded strictly on the interval from $0$ to $1$:

$$0 \le P(E) \le 1$$

• $P(E) = 0$: An impossible event (e.g., rolling a 7 on a standard 6-sided die).
• $P(E) = 1$: A certain event (e.g., drawing a numbered card between 1 and 10 from a box of cards 1–10).

Theoretical vs. Experimental Probability

1. Theoretical Probability: Calculated by analyzing physical symmetry and equiprobable sample space outcomes without conducting empirical trials: $$P(E) = \frac{n(E)}{n(S)} = \frac{\text{Number of Favorable Outcomes}}{\text{Total Number of Equally Likely Outcomes}}$$
2. Experimental (Empirical) Probability: Calculated from actual observed trials in an experiment: $$P(E) = \frac{\text{Frequency of Event Occurrence}}{\text{Total Number of Observed Trials}}$$
   • Law of Large Numbers: As the number of repetitions in an experiment increases, the empirical probability converges toward the theoretical probability.

The Complement Rule

The complement of an event $E$ (denoted $E^c$ or $\text{not } E$) represents all outcomes in the sample space that are not in $E$. The sum of an event and its complement is always strictly 1:

$$P(E) + P(E^c) = 1 \implies P(E^c) = 1 - P(E)$$

• Exam Shortcut ("At Least One"): To find the probability of obtaining "at least one success" across multiple trials, subtract the probability of zero successes from 1: $$P(\text{at least one}) = 1 - P(\text{none})$$

---

Compound Probability: Independent vs. Dependent Events

A compound event involves the joint occurrence of two or more simple events.

1. The Multiplication Rule (Joint "AND" Probability)

• Independent Events: Two events $A$ and $B$ are independent if the occurrence of $A$ has no influence on the probability of $B$. Sampling with replacement produces independent events: $$P(A \text{ and } B) = P(A) \times P(B)$$
• Dependent Events: Two events are dependent if the occurrence of $A$ alters the sample space and probability of $B$. Sampling without replacement produces dependent events: $$P(A \text{ and } B) = P(A) \times P(B \mid A)$$ where $P(B \mid A)$ represents the conditional probability of $B$ given that $A$ has already occurred.

Worked Example: Sampling Without Replacement

A container holds $8$ blue pens, $6$ black pens, and $6$ red pens (total $= 20$ pens). An instructor draws two pens at random consecutively without replacement. What is the probability that both pens drawn are blue?

• First Draw: $P(\text{Blue}_1) = \frac{8}{20} = \frac{2}{5}$.
• Second Draw: Having removed one blue pen, $7$ blue pens remain out of $19$ total pens: $P(\text{Blue}_2 \mid \text{Blue}_1) = \frac{7}{19}$.
• Joint Probability: $$P(\text{Both Blue}) = \frac{8}{20} \times \frac{7}{19} = \frac{2}{5} \times \frac{7}{19} = \frac{14}{95} \approx 0.1474$$

---

Compound Probability: Mutually Exclusive vs. Overlapping Events

2. The Addition Rule (Disjunctive "OR" Probability)

• Mutually Exclusive (Disjoint) Events: Events that cannot occur simultaneously ($P(A \text{ and } B) = 0$): $$P(A \text{ or } B) = P(A) + P(B)$$ Example: In a single roll of a fair die, rolling an odd number and rolling a 4 are mutually exclusive: $\frac{3}{6} + \frac{1}{6} = \frac{4}{6} = \frac{2}{3}$.
• Non-Mutually Exclusive (Overlapping) Events: Events that share common outcomes ($A \cap B \neq \emptyset$). Adding their individual probabilities counts the intersection twice; therefore, the joint intersection must be subtracted: $$P(A \text{ or } B) = P(A) + P(B) - P(A \text{ and } B)$$

Worked Example: Overlapping Probability in a Standard Deck

What is the probability of drawing either a King or a Diamond from a standard 52-card deck?

• Total cards $= 52$.
• Kings: $P(\text{King}) = \frac{4}{52}$.
• Diamonds: $P(\text{Diamond}) = \frac{13}{52}$.
• Overlap: Exactly one card is both a King and a Diamond (the King of Diamonds): $P(\text{King and Diamond}) = \frac{1}{52}$.
• Applying the Addition Rule: $$P(\text{King or Diamond}) = \frac{4}{52} + \frac{13}{52} - \frac{1}{52} = \frac{16}{52} = \frac{4}{13} \approx 0.3077$$

---

Visualizing Sample Spaces: Tree Diagrams and Grids

1. Tree Diagrams: A branched graph representing multi-stage probability. Each branch represents an outcome weighted by its transition probability; multiplying probabilities along a continuous path from root to leaf yields the joint probability of that specific sequence.
2. Coordinate Grids (Sample Space Grids): Ideal for two-stage experiments such as rolling two dice. A $6 \times 6$ grid displays all $36$ equiprobable ordered pairs $(d_1, d_2)$, making sums (such as rolling a sum of 7: $(1,6), (2,5), (3,4), (4,3), (5,2), (6,1) \implies \frac{6}{36} = \frac{1}{6}$) easy to identify.