JC2 · H2 Mathematics · Study guide
Choose a binomial model, translate tails and conditions, solve unknown parameters and sample sizes, and count packets, inspections and modes.
Count successes in a fixed number of trials
Name one trial and its success condition. If there are n trials, each has the same success probability p, and all trials are independent, the success count is . Success is just the event being counted; a defect can be a “success” in this mathematical sense.
State the assumptions in context
Count flavoured chocolates in one packet
A large production run contains 20% mint chocolates. A packet contains 20 randomly selected chocolates. Let X be its number of mint chocolates. State the model assumptions, then find the probability of exactly four mint chocolates.
Assume that whether each chocolate is mint is independent of the others, and that the probability of being mint is constant at 0.2 for every selection. A small sample from a very large mixed run makes these assumptions plausible; a shared batch fault could invalidate independence.
Selecting chocolates until the first mint one appears is a different experiment: the number of selections is not fixed, so that waiting count is not binomial. Sampling a substantial fraction of a finite bag without replacement also changes the success probability.
Translate the integer boundaries before calculating
At least three; more than four but not more than eight
For the same packet, find and . A cumulative binomial calculation returns .
The second event contains 5, 6, 7 and 8. Subtracting would wrongly include four mint chocolates.
Intersect the condition with the requested event
Fewer mint than plain, given at least three mint
Find the probability that a packet has fewer mint than plain chocolates, given that it has at least three mint chocolates.
Together with the given condition, the numerator event is .
Here q is the requested conditional probability. The denominator is the probability of the given event alone. The strict inequality excludes the 10–10 tie.
Unknown parameters: form equations from what is given
Recover n and p from the mean and variance
A binomial variable has mean 6 and variance 4.2. Find n and p, then the probability of no successes.
Check that n is a positive integer and . An impossible parameter value means the proposed binomial model or the input equations must be reconsidered.
An unknown probability inside a mixed pack
A pack contains two toys with independent fault probability 0.02 and three keychains with independent fault probability p. All five fault events are independent. Given at most one faulty item in a pack, the probability that its only fault is a toy is 0.035. Find p.
Let A count faulty toys and K count faulty keychains. The denominator contains only the mutually exclusive cases :
Write the numerator N and denominator D separately to keep the conditional equation clear:
The conditioning event has positive probability, so . Divide by , then solve:
A single binomial model for all five items would be invalid because toys and keychains do not have a common fault probability.
Count packets or count individual chocolates?
Find the least sample size
Each chocolate is independently mint with probability 0.2. Find the least n such that the probability of fewer than three mint chocolates in n selections is at most 0.3.
Use a table with n restricted to integers. The boundary values are:
| n | P(X ≤ 2) | Meets condition? |
|---|---|---|
| 17 | 0.309622 | No |
| 18 | 0.271342 | Yes |
Thus the least n is 18. As n increases, adding an independent trial cannot lower the success count, so decreases. The preceding integer verifies minimality.
Ten packets: every packet versus the total
A box contains ten independent packets of 20 chocolates. Find the probability every packet has at least three mint chocolates, then the probability the box contains at least 30 mint chocolates.
For one packet, . Every packet qualifies only when all ten independent packet events occur:
For the second event count all 200 individual chocolates. Their success probability is still 0.2:
Every packet having three mint chocolates guarantees at least 30 in total. The converse fails: packets may compensate for each other. This explains the larger second probability.
If asked instead for exactly eight qualifying packets, define :
The 10 trials are now packets, and their success probability is q, not 0.2.
Split off a specified trial or inspection stage
The eighth selection is the sixth blue
Balls are selected with replacement, independently, with blue probability 0.6. Find the probability that selection 8 is the sixth blue selection.
Exactly five of the first seven must be blue, and selection 8 must itself be blue. Its position is fixed, so the combination applies only to the first seven:
If the question additionally says the sixth and last blue in ten selections, selections 9 and 10 must both be non-blue: multiply this result by .
An inspection may require a second sample
Each independent sample contains 10 items with defect probability 0.1 per item. Accept immediately if the first sample has at most one defect; reject if it has at least three. With exactly two, take a second independent sample and accept only if it has at most one defect. Find the acceptance probability, then the chance a second sample was needed given acceptance.
Here and . The branch that triggers retesting is not itself acceptance. It must be followed by a successful second inspection.
Most probable means the largest probability
Find a range of p for a unique mode
For , find the range of p for which 2 is the unique most probable count. Compare its two neighbours, using .
Hence . Binomial probabilities increase up to a mode and then decrease; the adjacent ratios decrease with k, so these two comparisons establish the global maximum.
At , counts 1 and 2 tie. At , counts 2 and 3 tie. If “2 is a mode” allows a tie, include both endpoints; “unique” excludes them.
Watch the boundary cases produce a tie
p = 0.40: mode 2; highest probability 0.3456.
A total over many independent samples
If independently, each has mean 4 and variance 3.2. For 50 packets, the total has mean 200 and variance 160; the mean has mean 4 and variance . An exact combined count is also available: . Use the Sampling guide to work through the CLT and a probability for a sample mean.