AFCAT Numerical Ability · Probability
Coin Tosses: Counting Heads, At Least One, Order and Given That
n fair coins, or one coin tossed n times, give 2ⁿ equally likely outcomes; count the favourable ones by listing, by choosing which tosses are heads, or by taking away the ones you do not want.
Why this matters
The page asks for exactly, at least, at most and patterns of heads among up to five coins, and about a fifth of it is HARD. The HARD ones are about order: a first head on a given toss, heads side by side, or a condition you are given. Marks go when a listed sample space misses an outcome, or when 'at least two' is counted as 'exactly two'.
Concept 1 of 5: Listing the outcomes for up to three coins
Definition
- n coins tossed together, or one coin tossed n times, give equally likely outcomes: 2, 4, 8, 16, 32 for n = 1 to 5.
- HT and TH are different outcomes. Treating 'one head and one tail' as a single outcome gives a wrong total of 3 for two coins.
- Build the list by branching: write every outcome that starts with H, then every one that starts with T.
- Read the favourable outcomes off the list, then divide by .
Outcomes for n coins
Worked example
Practice this conceptself-check · 3 quick reps
The same idea in a practice question:
Example 1 · Probability · Coin Tosses
HT and TH are two outcomes
Write the list in order
Concept 2 of 5: Exactly k heads from n coins: choose the positions
Definition
- is the number of ways to choose k things from n. , , and .
- The probability of exactly k heads in n tosses is .
- Exactly k tails is exactly heads, so it has the same count.
- For a range ('at least 3', 'more heads than tails', 'differ by 2'), turn it into a list of exact head counts, then add their counts.
- The counts for 4 coins are 1, 4, 6, 4, 1 (total 16); for 6 coins, 1, 6, 15, 20, 15, 6, 1 (total 64).
Exactly k heads in n tosses
Worked example
Practice this conceptself-check · 4 quick reps
The same idea in a practice question:
Example 2 · Probability · Coin Tosses
Exactly is not at least
The total is 2 to the power n
Concept 3 of 5: At least one: one minus none
Definition
- The probability of at least one head in n tosses is .
- 'At most k' is everything except more than k. At most 3 heads from 4 coins leaves out only HHHH: .
- If the probability is given, work back: gives , so .
- A repeated go: two coins tossed together give at least one head with probability . For that to happen on each of k goes, multiply: .
At least one
Worked example
Practice this conceptself-check · 4 quick reps
The same idea in a practice question:
Example 3 · Probability · Coin Tosses
None is one outcome
On every go means multiply the goes
Concept 4 of 5: Order matters: given tosses, a first head, patterns and a biased coin
Definition
- A condition on particular tosses ignores the rest: 'the first two tosses are heads', out of 6 tosses, is .
- A first head on toss k needs tails and then a head: probability .
- Patterns such as alternating faces or heads side by side: list the sequences that fit, then divide by .
- 'Tossed until' a pattern appears: the pattern must finish exactly on the last toss and must not have appeared earlier.
- A biased coin with : multiply each toss's own probability, then add the orders. Exactly one head in two tosses is .
One sequence of n tosses
Worked example
Practice this conceptself-check · 4 quick reps
The same idea in a practice question:
Example 4 · Probability · Coin Tosses
Positions are not counts
The pattern must not finish early
Concept 5 of 5: Given that: count inside the condition
Definition
- When outcomes are equally likely, . Read it as 'A given B'.
- List the outcomes in B first, then count those that are also in A.
- The same idea comes back later in the chapter with dice, cards and bags.
Conditional probability
Worked example
Practice this conceptself-check · 3 quick reps
The same idea in a practice question:
Example 5 · Probability · Coin Tosses
Divide by the condition, not by everything
Summary — formulas & gotchas at a glance
A revision cheat-sheet for the formulas and gotchas above. Click any concept name to jump back to its full explanation.
Formulas (5)
- Listing the outcomes for up to three coins
Outcomes for n coins
- Exactly k heads from n coins: choose the positions
Exactly k heads in n tosses
- At least one: one minus none
At least one
- Order matters: given tosses, a first head, patterns and a biased coin
One sequence of n tosses
- Given that: count inside the condition
Conditional probability
Watch out for (9)
- HT and TH are two outcomes→ Listing the outcomes for up to three coins
- Write the list in order→ Listing the outcomes for up to three coins
- Exactly is not at least→ Exactly k heads from n coins: choose the positions
- The total is 2 to the power n→ Exactly k heads from n coins: choose the positions
- None is one outcome→ At least one: one minus none
- On every go means multiply the goes→ At least one: one minus none
- Positions are not counts→ Order matters: given tosses, a first head, patterns and a biased coin
- The pattern must not finish early→ Order matters: given tosses, a first head, patterns and a biased coin
- Divide by the condition, not by everything→ Given that: count inside the condition
Drill the questions on this topic
46 questions from the bank, with cart and Word export.