Lesson 32 of 36 · Quantitative reasoning
Counting and probability
Count arrangements and selections with the product rule, permutations and combinations, then turn counts into probabilities, using complements.
About 24 minutes
In this lesson
- Decide whether order matters and count with the product rule, permutations or combinations.
- Compute a probability as favourable over total when outcomes are equally likely.
- Use complements, independence and draws without replacement correctly.
The idea
The product rule
If a choice is made in stages, with options at the first stage and at the second whatever happened first, there are ways in all. A sandwich with 3 breads and 4 fillings can be made in ways. The rule extends to any number of stages, and nearly every counting formula is built from it.
Order matters: permutations
Arranging different items in a row: choices for the first place, for the second, and so on, giving
Values to know: , , , .
Filling only ordered places from items gives with factors. Electing a president, a secretary and a treasurer from 7 people: ways. If repetition is allowed, each place has all options: a 3-digit code using the digits 1 to 5 with repeats allowed has possibilities.
Order does not matter: combinations
Choosing a committee of 3 from 7 people, where the three seats are identical, counts each group once rather than once per ordering. Each group of 3 can be ordered in ways, so
In general, , and choosing to take is the same as choosing to leave: . Useful values: , , , .
The deciding question is whether swapping two chosen items gives a different outcome. Different roles, positions or a code: order matters. A team, a hand of cards, a set of books to take: it does not.
Probability as counting
When every outcome is equally likely,
Count the top and the bottom the same way: both ordered or both unordered. A probability always lies between 0 and 1; an answer outside that range signals an error.
With two dice, the 36 ordered pairs are the equally likely outcomes, not the 11 possible sums. A sum of 7 arises in 6 ways, so it has probability , while a sum of 2 arises only as .
Rules for combining events
- Complement: . "At least one" is almost always easiest as .
- And, for independent events: multiply. Two fair coin tosses both landing heads: .
- Or: . Subtract the overlap, which would otherwise be counted twice. If the events cannot both happen, the overlap is 0 and you simply add.
For a number chosen at random from 1 to 20, the multiples of 2 are 10 numbers and the multiples of 5 are 4 numbers (5, 10, 15, 20). The multiples of both, 10 and 20, are counted in each list, so there are numbers that are multiples of 2 or 5, and the probability is .
Without replacement
When items are drawn and not put back, later draws depend on earlier ones. From a bag of 5 red and 3 blue balls, two drawn without replacement are both red with probability
because after one red is gone, 4 of the remaining 7 are red. Counting gives the same answer: . Using would treat the draws as if the ball were put back.
Worked examples
Example 1: Committee or officers?
From 7 club members, (a) how many 3-person committees can be formed, and (b) in how many ways can a president, a secretary and a treasurer be chosen?
(b) has distinct roles, so order matters: .
(a) has identical seats. Each committee of 3 appears times among the 210 ordered choices, once for each way of handing out the roles.
So the number of committees is , which is .
Check by the formula: .
Answer
(a) 35 committees; (b) 210 ways to choose officers. Giving 210 for the committee question counts each group six times over.
Example 2: At least one six
Two fair dice are rolled. What is the probability that at least one shows a six?
Use the complement: "at least one six" fails only if neither die shows a six.
, and the dice are independent, so .
.
Check by counting ordered pairs: 6 pairs have a six on the first die, 6 on the second, and is in both, so of the 36 pairs.
Answer
. Adding counts the double six twice.
Example 3: One of each colour
A bag holds 5 red and 3 blue balls. Two are drawn without replacement. What is the probability of getting one red and one blue?
Count unordered pairs: there are pairs in all.
Pairs with one red and one blue: .
Probability .
Check in order: red then blue , blue then red , total . Also, the three cases add to 1: two red , two blue , mixed .
Answer
. Computing only "red then blue", , misses the other order.
Common traps
Counting ordered outcomes when order does not matter
A team, a hand or a sample is a set: choosing Ana then Ben is the same team as Ben then Ana. Using for such a question overcounts by a factor of . Ask whether swapping two chosen items changes the outcome.
Mixing ordered and unordered counts
In a probability, the top and bottom must be counted the same way. An ordered numerator over an unordered denominator can double an answer, or worse.
Adding probabilities that overlap
"A or B" is only when A and B cannot happen together. Otherwise subtract . An "or" probability above 1 is a sure sign of double counting.
Treating draws without replacement as independent
Once an item is removed, the bag has changed. Reduce both the total and, if relevant, the favourable count before the next draw.
Check yourself
Answer each question before you open its answer.
Question 1: Codes with different digits
Quantitative reasoning: counting
A code is made of 3 different digits chosen from 1, 2, 3, 4 and 5, and the order of the digits matters. How many codes are possible?
- A.10
- B.15
- C.60
- D.125
Show the answer
Answer: C. 60
Working
5 choices for the first digit, 4 for the second, 3 for the third: . Check: each of the sets of digits can be ordered in ways, and .
Why the other options are wrong
- A. This is , the number of sets of 3 digits; it ignores that 123 and 321 are different codes.
- B. Multiplies the 5 digits by the 3 places; the number of choices shrinks at each place, and the places multiply with each other.
- D. This is , which allows repeated digits such as 113; the digits must be different.
What carries over
Order matters and no repeats: multiply the shrinking number of choices.
Question 2: Two black cards
Quantitative reasoning: probability
A box holds 4 red cards and 2 black cards. Two cards are drawn at random without replacement. What is the probability that both are black?
- A.
- B.
- C.
- D.
Show the answer
Answer: A.
Working
Step by step: . By counting: there are pairs, and only 1 of them is the two black cards, so .
Why the other options are wrong
- B. This is , which puts the first card back; without replacement only 1 black card remains among 5.
- C. Counts the black pair in both orders on top but uses the 15 unordered pairs underneath; top and bottom must be counted the same way.
- D. This is the chance that the first card alone is black; the second card must be black too.
What carries over
Without replacement, update the counts after each draw, or count unordered pairs top and bottom.
Question 3: At least one head
Quantitative reasoning: probability
A fair coin is tossed three times. What is the probability of at least one head?
- A.
- B.
- C.
- D.
Show the answer
Answer: C.
Working
The only outcome with no head is tails three times, with probability . So . Check: of the 8 equally likely sequences, all but TTT contain a head.
Why the other options are wrong
- A. This is the probability of a head on a single toss; three tosses give three chances.
- B. This is the probability of exactly one head; "at least one" also includes two or three heads.
- D. Adds three times, double counting outcomes with several heads; a probability can never exceed 1.
What carries over
"At least one" is one minus the probability of none.
Key points
If swapping two chosen items changes the outcome, order matters; otherwise use combinations.
is the ordered count divided by .
Probability is favourable over total, with both counted the same way.
"At least one" is .
Without replacement, change the counts after every draw.
All questions here are original and written for UniExamer; none comes from the test maker.
Written by the UniExamer team with AI assistance. Every worked example and check question was re-solved by an independent checker before publication. No subject expert has reviewed this lesson yet. If you find a mistake, write to support@uniexamer.com.