Where Counting Meets Chance
Probability theory didn't spring from abstract mathematics — it was born from very practical questions. In the 1600s, French aristocrats who played dice games wanted to know exactly how likely they were to win certain bets. The answer required a new kind of math: systematic ways to count all possible outcomes so you could compare the favorable ones to the total. That counting toolkit evolved into what we now call permutations and combinations, and they remain the backbone of probability today.
The central question this lesson addresses is straightforward: when an experiment has so many possible outcomes that listing them all is impractical, how do you count them efficiently and then use those counts to find probabilities? Permutations and combinations are the answer.
Core Principles & Definitions
Before you can use counting methods in probability, you need four foundational ideas. Each one builds on the last, so take them in order.
The Fundamental Counting Principle
Factorial Notation (n!)
Permutations (Order Matters)
Combinations (Order Doesn't Matter)
Visualizing Permutations vs. Combinations
The diagram below illustrates the difference between permutations and combinations using a concrete example: selecting 2 items from the set {A, B, C}. On the left you see every ordered arrangement (permutation), and on the right, the unordered groupings (combinations). Notice how each combination on the right corresponds to exactly 2! = 2 permutations on the left — the two arrangements of the same pair.
This visual relationship is the key insight: C(n, r) = P(n, r) ÷ r!. Every time you choose r items, there are r! ways to arrange that same group. When order doesn't matter, you divide out those duplicate arrangements to avoid over-counting.
The Mathematical Framework
Let's formalize the counting tools and then connect them directly to probability. In each formula below, n represents the total number of distinct objects in the set and r represents how many you are selecting (with 0 ≤ r ≤ n).
Why does this formula work? You have n choices for the first slot, n − 1 for the second, n − 2 for the third, and so on, down to n − r + 1 for the r-th slot. Multiplying those gives n × (n − 1) × … × (n − r + 1), which simplifies neatly to n! / (n − r)! because the factorial in the denominator cancels the tail of the factorial in the numerator.
ⁿCᵣ or (n choose r).As discussed in Section 3, you get this by taking the permutation count and dividing by r! — the number of ways to rearrange the same r items. This removes every duplicate group.
This is Laplace's classical definition. The process is always the same: (1) decide whether order matters, (2) count the total number of outcomes using the appropriate formula, (3) count the favorable outcomes the same way, and (4) divide. Consistency is critical — if you use combinations for the total, you must use combinations for the favorable count as well.
Complementary counting is a powerful strategy. If a problem asks for the probability that "at least one" item meets a condition, it is usually much simpler to find the probability that none do and subtract that from 1, rather than adding up many separate cases.
Choosing the Right Tool: A Decision Flowchart
One of the biggest challenges students face is deciding whether a problem requires a permutation or a combination (or just the fundamental counting principle). The flowchart below guides you through the decision every time.
Here is a quick reference table of keyword clues you'll often find in probability problems:
| Keyword / Context | Method | Reasoning |
|---|---|---|
| "Arrange," "line up," "first, second, third" | Permutation | Position matters — rearranging creates a new outcome. |
| "Choose," "select," "committee," "hand of cards" | Combination | Only the group matters, not who was picked first. |
| "License plate," "password," "PIN code" | Counting Principle | Independent slots with a fixed number of options each. |
| "At least one," "none," "no more than" | Complementary + Combinations | Count the complement first, then subtract from 1. |
Worked Example
A standard deck has 52 cards. You are dealt a 5-card hand at random. What is the probability that all 5 cards are hearts?
C(52, 5) = 52! / (5! × 47!) = 2,598,960C(13, 5) = 13! / (5! × 8!) = 1,287P(all hearts) = C(13,5) / C(52,5) = 1,287 / 2,598,960Permutations vs. Combinations: When Each Shines
The two formulas solve different problems, and mixing them up is the most common source of errors. Here is a side-by-side comparison that highlights their differences and limitations.
| Feature | Permutations P(n, r) | Combinations C(n, r) |
|---|---|---|
| Order | Matters — AB ≠ BA | Doesn't matter — {A, B} = {B, A} |
| Formula size | Larger count (more outcomes) | Smaller count (fewer outcomes) |
| Relationship | P(n, r) = C(n, r) × r! | C(n, r) = P(n, r) / r! |
| Typical scenario | Rankings, seating charts, passwords | Committees, lottery draws, card hands |
| With repetition? | Requires a modified formula: nʳ | Requires "stars and bars" method |
| Key limitation | Both assume items are distinct and selection is without replacement unless otherwise modified. | (same as left) |
Looking Ahead: Connections to Advanced Probability
The counting techniques you've learned in this lesson are foundational, but they open the door to several important topics you'll encounter in AP Statistics, college probability courses, and real-world applications.
| This Lesson | Advanced Extension | Where You'll See It |
|---|---|---|
| C(n, r) for single events | Binomial probability: C(n, r) × pr × (1−p)n−r | AP Statistics, quality control, genetics |
| Counting equally likely outcomes | Probability distributions (not all outcomes are equally likely) | Any real-world modeling beyond games of chance |
| Complementary counting | Inclusion-exclusion principle for overlapping events | Discrete math, computer science algorithms |
| Permutations of distinct items | Permutations with repetition: n! / (n₁! × n₂! × …) | Anagram problems, multinomial coefficients |
The binomial distribution is perhaps the most direct extension. It answers the question: "If I repeat an experiment n times, each with success probability p, what's the probability of getting exactly r successes?" The combination C(n, r) appears in the formula because it counts how many sequences of successes and failures produce exactly r successes, regardless of order. So the very ideas you practiced today become the combinatorial engine inside one of the most widely-used probability distributions in all of statistics.
Practice Problems
Work through these five problems in order. Each one builds on the ideas from earlier in the lesson. Try to solve each one before revealing the answer.
Lesson Summary
Permutations and combinations are the two fundamental counting techniques that power classical probability. A permutation, calculated as P(n, r) = n! / (n − r)!, counts the number of ordered arrangements of r items chosen from n distinct items — use it when the sequence or ranking matters. A combination, calculated as C(n, r) = n! / [r! × (n − r)!], counts the number of unordered groups — use it when only the selection itself matters, not the order. The fundamental counting principle (multiply choices at each independent stage) handles multi-step scenarios, including those with repetition.
To compute the probability of a compound event, divide the number of favorable outcomes by the total number of equally likely outcomes, using the same counting method for both. When a problem involves "at least one" of something, complementary counting — finding P(none) and subtracting from 1 — is almost always the most efficient strategy. The single most important decision in any counting-based probability problem is determining whether order matters: that choice alone dictates whether you reach for permutations or combinations, and getting it wrong will change your answer dramatically.