IB AA: Counting Principles and Probability

Mastering counting principles is not just about solving abstract puzzles; it is the essential foundation for calculating probabilities in complex, real-world scenarios. In the IB AA HL curriculum, these techniques transform vague questions about "how many ways" or "what is the chance" into precise, solvable mathematical problems. This knowledge is critical for success in Paper 1 and Paper 2, where questions often blend combinatorics with probability distributions and algebra.

The Foundation: The Fundamental Counting Principle

The journey begins with the most intuitive rule. The Fundamental Counting Principle states that if one event can occur in $m$ ways and a second independent event can occur in $n$ ways, then the number of ways the two events can occur in sequence is $m\times n$. This principle extends to any number of sequential events.

Consider planning an outfit: you have 5 shirts and 4 pairs of trousers. The total number of shirt-trouser combinations is $5\times 4=20$. This principle is your first tool for any multi-stage counting problem. Its power lies in its simplicity—it requires only multiplication, but you must correctly identify that the choices are sequential and independent. A common trap is applying it to non-independent events; for example, if choosing a chairperson and a secretary from a group of 10 people, the choice for secretary is not independent of the chairperson choice (you can't pick the same person twice), so a simple $10\times 10$ would be incorrect.

Organizing Choices: Factorials and Permutations

When order matters in your arrangement, you are in the realm of permutations. The concept of a factorial, denoted by $n!$, is the building block. It represents the number of ways to arrange $n$ distinct objects in a line: $$n!=n\times (n-1)\times (n-2)\times ...\times 2\times 1$$ For instance, the number of ways to arrange 5 different books on a shelf is $5!=120$.

Often, you don't arrange all objects. A permutation calculates the number of ways to select and arrange $r$ objects from a set of $n$ distinct objects. The formula is: $$P(n,r)=\frac{n!}{(n-r)!}$$ For example, finding the 1st, 2nd, and 3rd place winners (order matters) from 8 runners is $P(8,3)=\frac{8!}{5!}=8\times 7\times 6=336$.

What if some objects are identical? Permutations with repetition (or permutations of multiset) adjusts for this. If you have $n$ items where there are $n_1$ identical of type 1, $n_2$ identical of type 2, etc., the number of distinct arrangements is: $$\frac{n!}{n_1!\times n_2!\times ...\times n_k!}$$ Arranging the letters in "MISSISSIPPI" ($n=11$, with 4 I's, 4 S's, 2 P's) gives $\frac{11!}{4!4!2!}$ unique arrangements.

When Order Doesn't Matter: Combinations

The pivotal shift in reasoning occurs when the order of selection is irrelevant. Choosing a committee of 3 people from 10 is a classic example—the committee {Ana, Ben, Chloe} is the same as {Chloe, Ben, Ana}. This is a combination.

The number of ways to choose $r$ objects from $n$ distinct objects, without regard to order, is given by: $$C(n,r)=\left(\genfrac{}{}{0ex}{}{n}{r}\right)=\frac{n!}{r!(n-r)!}$$ The symbol $\left(\genfrac{}{}{0ex}{}{n}{r}\right)$ is a binomial coefficient, which you'll see has profound connections beyond simple counting. The number of 3-person committees from 10 people is $\left(\genfrac{}{}{0ex}{}{10}{3}\right)=\frac{10!}{3!7!}=120$. Notice this is significantly smaller than the $P(10,3)=720$ permutations, because it disregards the 3! internal arrangements of each selected group.

The Power of Binomial Coefficients

Binomial coefficients $\left(\genfrac{}{}{0ex}{}{n}{r}\right)$ are far more than just combination notation. They are the numerical coefficients in the expansion of a binomial expression, as given by the Binomial Theorem: $$(a+b{)}^n=\sum _{r=0}^n(\genfrac{}{}{0ex}{}{n}{r})a^{n-r}{b}^r$$ For example, the coefficient of $a^2{b}^3$ in $(a+b{)}^5$ is $\left(\genfrac{}{}{0ex}{}{5}{3}\right)=10$. This dual identity—as a combination count and an algebraic coefficient—is a favorite IB synthesis point. These coefficients also exhibit elegant patterns, such as symmetry $\left(\genfrac{}{}{0ex}{}{n}{r}\right)=\left(\genfrac{}{}{0ex}{}{n}{n-r}\right)$ and the recursive relationship that forms Pascal's Triangle.

Synthesizing for Probability

The ultimate application is solving complex probability problems. The basic probability formula is: $$\text{Probability}=\frac{\text{Number of favorable outcomes}}{\text{Total number of equally likely outcomes}}$$ Counting principles allow you to accurately compute both the numerator and denominator.

Worked Example: A bag contains 4 red (R) and 5 blue (B) marbles. You draw 3 marbles without replacement. What is the probability you get exactly 2 red marbles?

Step 1: Total Outcomes. Choosing any 3 marbles from 9: $\left(\genfrac{}{}{0ex}{}{9}{3}\right)=84$.

Step 2: Favorable Outcomes. You need exactly 2 red and 1 blue.

• Choose 2 red from 4: $\left(\genfrac{}{}{0ex}{}{4}{2}\right)=6$.
• Choose 1 blue from 5: $\left(\genfrac{}{}{0ex}{}{5}{1}\right)=5$.

Apply the Fundamental Counting Principle for the combined selection: $6\times 5=30$.

Step 3: Calculate Probability. $P(\text{exactly 2 R})=\frac{30}{84}=\frac{5}{14}$.

The logical process is key: 1) Define the experiment (combinations, as order doesn't matter in a random draw). 2) Calculate the total possible outcomes. 3) Carefully construct the favorable event using combinations and the counting principle. 4) Compute the ratio.

Common Pitfalls

1. Confusing Permutations and Combinations: This is the most frequent error. Ask yourself: "If I change the order of the selected items, do I have a different outcome?" If yes (like competition rankings), use permutations $P(n,r)$. If no (like committee members), use combinations $\left(\genfrac{}{}{0ex}{}{n}{r}\right)$.

1. Misusing the Fundamental Counting Principle for Dependent Events: Remember, the principle applies to independent stages. If choices from one stage reduce the pool for the next (like selecting people without replacement), you cannot simply multiply the initial number of choices. Instead, adjust the numbers for each stage: for choosing a chair and secretary from 10 people, calculate $10\times 9=90$.

1. Overcounting or Undercounting in Complex Arrangements: When a problem involves constraints (e.g., "this person must be on the committee" or "these two cannot sit together"), avoid applying a standard formula blindly. Often, it's safer to count the constrained scenario directly or use the complement principle (Total - Unfavorable).

1. Incorrectly Handling Identical Items: In arrangements, failing to divide by the factorial of identical items will overcount. In probability problems involving identical items, ensure you are counting distinct selections or arrangements, as the physical indistinguishability affects what constitutes an "equally likely outcome."

Summary

• The Fundamental Counting Principle ($m\times n$) is your go-to for sequential, independent choices, while factorials ($n!$) count arrangements of all distinct items.
• Permutations $P(n,r)$ are used when selecting and arranging items where order matters. Adjust with division for permutations with identical items.
• Combinations $\left(\genfrac{}{}{0ex}{}{n}{r}\right)$ are used for pure selection where order does not matter. This value is a binomial coefficient, central to the Binomial Theorem.
• For probability, clearly define the sample space and favorable event using these techniques, ensuring outcomes are equally likely. The formula is the ratio of correctly counted favorable outcomes to total outcomes.
• Your first and most crucial step for any counting problem is to decisively answer the question: Does order matter? This determines your entire solution path.