Permutations & Combinations in Probability - Statistics and Probability

Section 1

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.

1654

Blaise Pascal and Pierre de Fermat exchange a series of letters analyzing a gambling problem called the "Problem of Points." Their correspondence launches probability theory as a mathematical discipline, using early counting arguments to divide stakes fairly.

1713

Jacob Bernoulli's Ars Conjectandi is published posthumously. It formalizes the concepts of permutations and combinations, introduces the binomial theorem's role in probability, and proves the first version of the Law of Large Numbers.

1812

Pierre-Simon Laplace publishes Théorie analytique des probabilités, providing the definition we still use in many introductory courses: the probability of an event equals the number of favorable outcomes divided by the total number of equally likely outcomes.

20th Century

Combinatorial probability methods become essential tools in genetics (predicting genotype ratios), cryptography (estimating key-space sizes), quality control (sampling inspection), and computer science (algorithm analysis). The same counting principles from the 1600s now power modern applications.

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.

Section 2

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

If one event can occur in m ways and a second independent event can occur in n ways, then the two events together can occur in m × n ways. This extends to any number of stages: multiply the number of choices at each stage.

Factorial Notation (n!)

The product of all positive integers from 1 to n. For instance, 5! = 5 × 4 × 3 × 2 × 1 = 120. By convention, 0! = 1. Factorials count how many ways you can arrange n distinct objects in a line.

Permutations (Order Matters)

A permutation counts the number of ways to select r objects from n objects when the order of selection matters. Choosing president then vice-president is different from vice-president then president.

Combinations (Order Doesn't Matter)

A combination counts the number of ways to select r objects from n objects when order is irrelevant. Picking 3 pizza toppings gives the same pizza regardless of the order you choose them.

★

✦ Key Takeaway

Think of it like forming a committee versus assigning ranked officers. If you're picking 3 people for a committee (no titles), order doesn't matter — that's a combination. If those same 3 people are assigned president, secretary, and treasurer, the arrangement matters — that's a permutation. The single question "does the order of selection matter?" determines which formula you use.

Section 3

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.

Figure 1 — Each combination maps to r! permutations. Dividing removes the duplicate orderings.

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.

Section 4

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).

Permutation Formula

P(n, r) = n! / (n − r)!

Counts ordered arrangements of r items chosen from n distinct items.

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.

Combination Formula

C(n, r) = n! / [r! × (n − r)!]

Counts unordered groups of r items chosen from n distinct items. Also written as ⁿ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.

Probability via Counting

P(Event) = (favorable outcomes) / (total outcomes)

Valid when all outcomes in the sample space are equally likely. Use permutations or combinations to count both numerator and denominator.

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

P(Event) = 1 − P(Event's complement)

Often it's easier to count what you don't want, then subtract from 1.

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.

Section 5

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.

Figure 2 — A decision flowchart for selecting the right counting method.

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.

Section 6

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?

Probability of All Hearts in a 5-Card Hand

1
Step 1 — Identify the Counting Method

A "hand" of cards has no inherent order — receiving the 3♥ before the 7♥ gives the same hand as receiving them in the opposite sequence. So we use combinations for both the total and favorable counts.
2
Step 2 — Count Total Outcomes

The total number of 5-card hands from a 52-card deck is:

C(52, 5) = 52! / (5! × 47!) = 2,598,960
3
Step 3 — Count Favorable Outcomes

There are 13 hearts in the deck. The number of ways to choose 5 of them is:

C(13, 5) = 13! / (5! × 8!) = 1,287
4
Step 4 — Compute the Probability

P(all hearts) = C(13,5) / C(52,5) = 1,287 / 2,598,960

≈ 0.000495 or roughly 0.05 %
5
Step 5 — Interpret the Result

There is about a 1 in 2,019 chance of being dealt a hand consisting entirely of hearts. This very low probability aligns with intuition — getting all cards from one suit is exceptionally rare. Notice that we used the same counting method (combinations) in both numerator and denominator, which is essential for the fraction to be meaningful.

Section 7

Permutations 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)

★

✦ Key Takeaway

Think of the permutation count as the "maximum detail" count — it distinguishes every possible ordering. The combination count is the "big picture" count — it only cares about which items are chosen, not the sequence. In probability, your job is to match the counting method to the way the problem defines a distinct outcome. If the problem says "a committee of 4," that signals combinations; if it says "a president, VP, secretary, and treasurer," that signals permutations, even though both involve choosing 4 people.

Section 8

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) × p^r × (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.

Section 9

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.

Question 1: Problem 1 — Conceptual

A student is asked to find the number of ways to select a 3-person committee from 10 volunteers. She calculates P(10, 3) = 720. Explain why her answer overcounts, and state the correct count.

Show answer

A committee has no ranked positions, so the order in which the 3 people are chosen is irrelevant. By using P(10, 3), she counted every possible ordering of each group of 3 as a separate outcome. Each group of 3 people can be arranged in 3! = 6 different orders, so she overcounted by a factor of 6. The correct count is C(10, 3) = 720 / 6 = 120. The general principle: use combinations when the problem defines an outcome by which items are chosen, not the sequence of selection.

Question 2: Problem 2 — Basic Calculation

A bag contains 8 red marbles and 5 blue marbles (13 total). You draw 3 marbles at random without replacement. What is the probability that all 3 marbles are red?

Show answer

Order doesn't matter (a handful of marbles is a group, not a sequence), so we use combinations. Total ways to choose 3 from 13: C(13, 3) = 13! / (3! × 10!) = 286. Favorable ways (all red): C(8, 3) = 8! / (3! × 5!) = 56. P(all red) = 56 / 286 = 28/143 ≈ 0.196, or about 19.6 %.

Question 3: Problem 3 — Intermediate

From a class of 12 students (7 girls and 5 boys), a 4-person team is chosen at random. What is the probability that the team has exactly 2 girls and 2 boys?

Show answer

Total ways to choose 4 from 12: C(12, 4) = 495. Ways to choose 2 girls from 7: C(7, 2) = 21. Ways to choose 2 boys from 5: C(5, 2) = 10. By the counting principle, favorable outcomes = 21 × 10 = 210. P(2 girls, 2 boys) = 210 / 495 = 14/33 ≈ 0.424, or about 42.4 %. Notice that we multiplied the two combination counts because the girl-selection and boy-selection are independent stages — a direct application of the fundamental counting principle layered on top of combinations.

Question 4: Problem 4 — Applied / Multi-Step

A school raffle has 40 tickets, and you purchase 6 of them. Three winning tickets are drawn at random (without replacement) for three identical gift cards. What is the probability that at least one of your tickets is drawn?

Show answer

Since the prizes are identical, order doesn't matter — use combinations. Use complementary counting: "at least one of your tickets wins" is the complement of "none of your tickets wins." Total ways to draw 3 from 40: C(40, 3) = 9,880. Ways none of your 6 tickets are among the 3 winners (i.e., all 3 winners come from the other 34 tickets): C(34, 3) = 5,984. P(none of yours) = 5,984 / 9,880 ≈ 0.6056. P(at least one of yours) = 1 − 0.6056 = ≈ 0.394, or about 39.4 %. Complementary counting avoids the messy work of separately calculating the cases for exactly 1, exactly 2, and exactly 3 of your tickets winning.

Question 5: Problem 5 — Synthesis / Critical Thinking

A lock has a 4-digit code where each digit is 0–9 and digits may repeat. Your friend argues: "There are C(10, 4) = 210 possible codes." Explain the flaw in this reasoning, determine the correct count of codes, and then find the probability of guessing the correct code on a single random attempt.

Show answer

Your friend's reasoning has two critical flaws. First, a lock code is an ordered sequence — the code 1-2-3-4 is different from 4-3-2-1 — so combinations (which ignore order) are inappropriate. Second, digits can repeat, so we aren't selecting 4 distinct items from 10; each of the 4 positions independently has 10 options. The correct approach is the fundamental counting principle: 10 × 10 × 10 × 10 = 10,000 possible codes. P(guessing correctly) = 1 / 10,000 = 0.0001, or 0.01 %. This problem illustrates why you must ask both "does order matter?" and "is repetition allowed?" before choosing a formula. Neither permutations P(10, 4) = 5,040 nor combinations C(10, 4) = 210 gives the right answer here — because both assume selection without replacement.

Summary

Lesson Summary

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.