The Fundamental Principles
If one choice has options and a second, independent choice has options, the pair has options. Overlapping or exclusive choices are handled by splitting into cases and adding.
In plain terms. When decisions don't affect each other, multiply the number of options. When they can't happen together, add.
Example. A menu with mains and drinks gives meals.
Why multiply: draw the choices as a tree. The first decision makes branches, and each of them splits into the same branches for the second decision, so the tree ends in groups of leaves — outcomes. The word that matters is "same": if the number of second options depends on the first choice, split into cases and add instead.
Ordered picks of from : . Unordered picks: .
In plain terms. If rearranging counts as different, use permutations; if it does not, use combinations. The only difference is dividing out the orderings.
Example. Seat of in a row (order matters): . Choose a committee of (order doesn't): .
Two shirts (red, blue) and three pairs of pants (jeans, khakis, shorts). How many outfits of one shirt and one pair of pants?
Step 1 — choose the shirt: ways.
Step 2 — for each shirt, choose pants: ways, the same three whichever shirt was chosen.
Step 3 — outfits, one for each leaf of the tree.
A code is two different letters followed by three digits, where the first digit is not . How many codes are there?
Step 1 — fill the positions in order and count the options at each: first letter ; second letter (different from the first); first digit (not ); then and .
Step 2 — the number of options at each position does not depend on which earlier choices were made, so multiply: .
Five people sit in a row. In how many orders do Ana and Ben sit next to each other?
Step 1 — glue Ana and Ben into one block. Now there are units to arrange: orders.
Step 2 — inside the block they can sit as Ana–Ben or Ben–Ana: ways.
Step 3 — . (Out of orders in all.)
Using combinations when order matters. Choosing a president and a vice-president from people is , not : Ana-president-Ben-vice and Ben-president-Ana-vice are different outcomes. Ask: "if I swap two chosen items, is it a different result?"
A club of members chooses a president, then a secretary, then a -person committee from the remaining members. In how many ways?
Show the answerHide the answer
President , secretary (order matters: different jobs). The committee is of the remaining , unordered: . Total .
Complementary Counting and Probability
For "at least one," compute (total) (ways it fails). The complement usually avoids messy casework.
In plain terms. Counting what you don't want and subtracting is often far easier than counting what you do want.
Example. Probability of at least one head in flips: the only failure is all tails, , so the answer is .
Why it works: every outcome either has the property or does not, never both, so (with) (without) (total). When "with" splits into many cases — at least one, some, not all — "without" is often a single product, because it is a condition on every item at once: "no heads" means "every flip is tails".
For equally likely outcomes, .
In plain terms. Probability is just "good outcomes over all outcomes" — so counting carefully is the whole task.
Example. Rolling a sum of with two dice: favorable pairs out of , so .
A bag holds red, blue and green marbles. One is drawn at random. What is the probability it is not blue?
Step 1 — equally likely marbles, of them blue: .
Step 2 — complement: . (Counting directly, of , agrees.)
Two fair dice are rolled. What is the probability that the product of the numbers is even?
Step 1 — "even product" happens in many ways; its complement is simple: the product is odd only when BOTH dice are odd.
Step 2 — each die is odd in of ways, so odd products fill of the cells.
Step 3 — .
Three friends each pick a whole number from to at random. What is the probability that at least two pick the same number?
Step 1 — total outcomes .
Step 2 — complement: all three different, ways.
Step 3 — . The direct count would need separate cases for "exactly two match" and "all three match".
Adding probabilities of events that can happen together. "At least one six in two rolls is " counts the roll twice. The complement gives , a little less than — the difference is exactly that double-counted roll.
A fair die is rolled three times. What is the probability that at least one roll is a ?
Show the answerHide the answer
Complement: no sixes, . So .
Casework Without Double Counting
Choose a feature that every arrangement has exactly one value of (the largest element, the position of a special item, the number of red balls). Count each case, then add.
The discipline is in the words "exactly one": if a case boundary lets an object appear twice, the sum is wrong, and if it misses an object the sum is short. A good test is to name the case an example belongs to before adding anything — if the answer is "both" or "neither", the split is broken and needs redrawing, not patching.
Count the opposite and subtract from the total: .
Probability that two dice show at least one : total , none-a-six , so . The phrase "at least" is the signal — direct counting there needs cases for exactly one and exactly two, while the complement needs one product. The same move handles "at least one repeat" (birthday-style) and "not all the same".
How many three-digit numbers have at least two digits the same?
Step 1 — total three-digit numbers: (from to ).
Step 2 — count those with ALL DIGITS DIFFERENT: choices for the hundreds digit (not ), for the tens (any digit except the first), for the units: .
Step 3 — subtract: . Counting the repeats directly would need three overlapping cases; the complement needs none.
How many three-digit numbers have digits whose sum is ?
Step 1 — split on the hundreds digit , which is to (not ); every number is in exactly one case.
Step 2 — for each , the tens and units digits add to , and a sum of can be made in ways ().
Step 3 — give numbers. Total .
If the condition is a small number of very different situations ("the digit sum is ", "the path turns exactly twice"), casework is clearer. If the condition contains "at least", "some" or "not all", reach for the complement first.
Four fair coins are flipped. What is the probability of at least one head?
Show the answerHide the answer
Complement: all tails has probability , so at least one head has probability .
Probability With Tables and Trees
For two-stage experiments, make the sample space visible. A table lists every pair when the two stages are independent (two dice, two spinners). A tree handles stages that depend on each other: the probability of a path is the PRODUCT of the probabilities on its branches, and the probability of an event is the SUM over the paths that make it happen.
Multiplying along a branch is the product rule from counting in disguise: of all the equally likely ways the experiment can go, a fraction start with red, and of those, a fraction continue with red, so of all the ways do both. Adding across branches is allowed because different paths are different outcomes — they never overlap.
Spinner A shows , or and spinner B shows , , or , each value equally likely. What is the probability the sum is ?
Step 1 — the table has equally likely cells.
Step 2 — the sum appears as , , : three cells.
Step 3 — .
A bag holds red and blue marbles. Two are drawn without replacement. What is the probability they are the same color?
Step 1 — first draw: red , blue .
Step 2 — the bag now has marbles: after a red, red and blue remain; after a blue, red and blue.
Step 3 — both red: ; both blue: .
Step 4 — add: .
Amy and Bo take turns flipping a fair coin, Amy first. The first to flip heads wins. What is the probability that Amy wins?
Step 1 — Amy wins at once with probability .
Step 2 — otherwise both flip tails (probability ) and the game is back where it started, with Amy to flip.
Step 3 — so her winning probability satisfies , giving and . Going first is worth twice as much as going second.
Treating draws without replacement as independent. is the answer for drawing WITH replacement; after one red is gone, the chance of a second red is , not .
Two different cards are drawn at random from seven cards numbered to . What is the probability that their sum is even?
Show the answerHide the answer
An even sum needs two odds or two evens. There are odd cards and even cards. Pairs: odd–odd and even–even, out of . .
Putting It Together
A four-digit PIN uses the digits –, repeats allowed. How many PINs have at least one repeated digit, and what is the probability that a random PIN does?
Step 1 — "at least one repeat" is the complement signal.
Step 2 — total ; all different .
Step 3 — with a repeat: .
Step 4 — probability , just under a half.
Independent stages: multiply. Order matters: permutations; order does not: divide by the orders. "At least", "some", "not all": complement. Stages that depend on each other: a tree. Small, lopsided conditions: casework on one feature. Whatever the method, check against a tiny case you can list.
Four different books are placed on a shelf. In how many orders is the math book not at either end?
Show the answerHide the answer
Directly: the math book takes one of the middle spots, and the other three books fill the rest in ways: . By complement: orders, of which have the math book at an end; .