IB Math AA: Counting Principles and Probability

Mastering the principles of counting and probability is essential for navigating the quantitative aspects of the modern world, from algorithm design to risk assessment. For IB Math Analysis and Approaches students, this topic forms a rigorous bridge between algebra and statistics, demanding precise logical reasoning. Success here hinges on your ability to distinguish between different types of counting problems and to apply the correct probabilistic framework systematically.

The Foundation: The Fundamental Counting Principle

Everything in combinatorics builds from the Fundamental Counting Principle. It 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; you simply multiply the number of ways for each step.

Consider a practical scenario: you are creating a computer password that must be exactly 4 characters long, where the first character must be a letter (A-Z, 26 options) and the next three must be digits (0-9, 10 options each). Using the Fundamental Counting Principle, the total number of possible passwords is: $$26\times 10\times 10\times 10=26,000$$ This principle is your first tool for any multi-stage process where choices are independent. A common exam trick is to introduce a dependency, such as "the first digit cannot be zero," which changes the count for that specific stage. Always map out the stages and note any restrictions before multiplying.

Arrangements and Selections: Permutations vs. Combinations

This is the core conceptual hurdle. Permutations count arrangements where order matters. Combinations count selections where order does not matter.

The number of permutations of $r$ objects chosen from $n$ distinct objects is given by: $${}^n{P}_r=\frac{n!}{(n-r)!}$$ For example, the number of ways to award Gold, Silver, and Bronze medals (distinct, ordered positions) to 8 athletes is ${}^8{P}_3=\frac{8!}{5!}=8\times 7\times 6=336$.

The number of combinations of $r$ objects chosen from $n$ distinct objects is given by: $${}^n{C}_r=\left(\genfrac{}{}{0ex}{}{n}{r}\right)=\frac{n!}{r!(n-r)!}$$ For example, the number of ways to select a committee of 3 people from 8 candidates (all members equal, order irrelevant) is ${}^8{C}_3=\frac{8!}{3!5!}=56$.

The key is to ask yourself: "If the items selected were rearranged, would that constitute a different outcome?" If yes, use permutations. If no, use combinations. Exam questions often test this by describing a "committee" (combination) versus a "president, treasurer, and secretary" (permutation).

From Counting to Probability

Probability quantifies likelihood as a number between 0 and 1. For an event $A$ in a finite sample space where all outcomes are equally likely, the probability is: $$P(A)=\frac{\text{Number of outcomes favorable to }A}{\text{Total number of outcomes in the sample space}}$$ Your counting skills directly feed into this. For compound events (like drawing two cards), you must correctly count both the numerator (favorable outcomes) and the denominator (total possible outcomes).

Let's solve a classic problem: "What is the probability of being dealt a 5-card poker hand that is a flush (all cards of the same suit)?" First, count the total number of 5-card hands from a 52-card deck: $\left(\genfrac{}{}{0ex}{}{52}{5}\right)$. This is a combination because the order you receive the cards doesn't matter. Next, count favorable outcomes: choose 1 of the 4 suits, then choose 5 cards from that suit's 13 cards. This is $\left(\genfrac{}{}{0ex}{}{4}{1}\right)\times \left(\genfrac{}{}{0ex}{}{13}{5}\right)$. Therefore, the probability is: $$P(\text{Flush})=\frac{\left(\genfrac{}{}{0ex}{}{4}{1}\right)\times \left(\genfrac{}{}{0ex}{}{13}{5}\right)}{\left(\genfrac{}{}{0ex}{}{52}{5}\right)}$$ This application shows how combinations are used for both the denominator and numerator in probability calculations of unordered selections.

Conditional Probability and Independent Events

Conditional probability, denoted $P(A|B)$, is the probability of event $A$ occurring given that event $B$ has already occurred. Its formula is: $$P(A|B)=\frac{P(A\cap B)}{P(B)},\text{provided }P(B)>0$$ This concept models situations where information updates likelihood. For instance, the probability a student passes an exam given that they completed all practice problems is likely higher than the overall pass rate.

Events $A$ and $B$ are independent if the occurrence of one does not affect the probability of the other. The test for independence is: $$P(A\cap B)=P(A)\times P(B)$$ If this equation holds true, the events are independent. A common mistake is to assume events are independent without verification. In many real-world contexts, like drawing cards without replacement, successive draws are not independent.

Bayes' Theorem: Reversing Conditionals

Bayes' Theorem is a powerful tool for updating probabilities based on new evidence. It allows you to find $P(A|B)$ if you know $P(B|A)$, $P(A)$, and $P(B)$. The theorem states: $$P(A|B)=\frac{P(B|A)\times P(A)}{P(B)}$$ Where $P(B)$ can often be found using the Law of Total Probability: $P(B)=P(B|A)P(A)+P(B|A^{\prime })P(A^{\prime })$.

Consider a diagnostic test scenario: Suppose 1% of a population has a disease ($P(D)=0.01$). A test is 99% accurate if you have the disease ($P(T^{+}|D)=0.99$) and 95% accurate if you are healthy ($P(T^{-}|D^{\prime })=0.95$, so $P(T^{+}|D^{\prime })=0.05$). If a person tests positive, what is the probability they actually have the disease? We want $P(D|T^{+})$. Using Bayes' Theorem: $$P(D|T^{+})=\frac{P(T^{+}|D)P(D)}{P(T^{+}|D)P(D)+P(T^{+}|D^{\prime })P(D^{\prime })}=\frac{0.99\times 0.01}{(0.99\times 0.01)+(0.05\times 0.99)}$$ Calculating this gives approximately 0.167, or 16.7%. This counterintuitive result—a positive test on a highly accurate test does not guarantee the disease—highlights the importance of prior probability ($P(D)$) and is a classic application of Bayes' Theorem.

Common Pitfalls

1. Confusing Permutations and Combinations: This is the most frequent error. Always perform the "rearrangement test." If swapping two selected items creates a new outcome, you need permutations. If it's the same outcome, you need combinations.
2. Misapplying the Fundamental Counting Principle to Dependent Events: The principle only works for sequential independent choices. If a choice reduces the options for the next (like picking people without replacement), you must adjust the counts for each stage accordingly. For complex dependencies, often combinations are a safer approach.
3. Misinterpreting Conditional Probability: $P(A|B)$ and $P(B|A)$ are not the same. Confusing them is known as the "prosecutor's fallacy." Use the formula $P(A|B)=\frac{P(A\cap B)}{P(B)}$ to keep your reasoning clear.
4. Forgetting the Prior in Bayes' Theorem: When using Bayes' Theorem, the prior probabilities ($P(A)$ and $P(A^{\prime })$) are crucial. Ignoring them, as in the medical test example, leads to dramatically incorrect conclusions. Always explicitly state and include the prior in your calculation.

Summary

• The Fundamental Counting Principle ($m\times n$) is the basis for counting sequential, independent events.
• Permutations (${}^n{P}_r$) count arrangements where order is important, while Combinations (${}^n{C}_r$ or $\left(\genfrac{}{}{0ex}{}{n}{r}\right)$) count unordered selections. Your key decision is to determine if order matters.
• Basic probability relies on the ratio of favorable to total equally likely outcomes, with counting principles providing these numbers.
• Conditional Probability $P(A|B)$ revises the likelihood of $A$ based on the knowledge that $B$ occurred. Events are independent only if $P(A\cap B)=P(A)\times P(B)$.
• Bayes' Theorem provides a formal mechanism for reversing conditional probabilities and updating beliefs with new evidence, heavily reliant on prior probabilities.