FS1 3.1 - Geometric and negative binomial probabilities
Some experiments stop when a success arrives, rather than after a fixed number of trials. You will model the trial of the first or a later success, calculate exact and cumulative probabilities, and see why a long run of failures does not make the next success more likely under an independent-trials model.
The trial of the first success
After nine unsuccessful attempts, have you earned a better chance on the next attempt? Keep that question in mind while building the waiting-time model.
Suppose independent trials each have success probability . A first success on trial requires the exact pattern : four failures followed by a success. Its probability is . Here “success” means the event being counted; it could even be a fault.
You already know
A discrete model needs a precise variable definition, possible values and probabilities. Independent events have probabilities that multiply. All probabilities must be non-negative and sum to .
For a geometric model, trials are independent, each has two labelled outcomes, and the success probability stays constant. Sampling without replacement, fatigue or learning may break those assumptions.
Geometric distribution
If counts the trial on which the first success occurs in independent trials with constant probability , write . Pearson counts the successful trial, so . The number of failures is , which starts at ; do not confuse the conventions.
For , reaching trial means exactly failures precede its success.
Geometric probability
For , ,
In the formula booklet.
At , with certainty. The value gives no finite success time and is excluded. For , the infinite probabilities add to , using the geometric-series sum.
Worked example 1: one final success
Question. Independent trials have success probability . Find the probability that the first success is on trial .
Plan. Require four failures, then one success.
Why this step? There is only one permitted pattern: an earlier success would stop the experiment before trial .
Answer. to significant figures.
Check. This is less than , since four earlier failures are also required.
Worked example 2 changes only the required trial, from to , adding one failure.
Worked example 2: one additional failure
Question. For the same trials, find the probability that the first success is on trial .
Plan. Use five failures followed by a success.
Why this step? One extra failure multiplies the previous probability by ; the final success probability stays fixed.
Answer. to significant figures.
Check. , the extra failure factor.
That constant ratio shows that geometric probabilities decrease with each additional trial when .
Watch out
Wrong: . That counts six failures before success on trial . Right: the exponent is , since includes the successful trial.
Add one more failure in your turn.
Tails, intervals and a trial limit
Waiting longer than a trial limit means that every trial so far has failed.
Write . The event means no success in the first trials, giving . Its complement gives success by trial . Since is integer-valued, instead requires failures in only the first trials.
Geometric tails and cumulative probabilities
For , , and positive integer :
For integers , . These consequences of the supplied probability formula are not printed explicitly. Not in the formula booklet: learn it.
“At least”, “more than” and “by” place the endpoint differently. Write the event before calculating.
Worked example 3: success by a fixed limit
Question. For independent trials with success probability , find the probability of at least one success by trial .
Plan. Subtract eight consecutive failures from .
Why this step? The complement contains no success at all, rather than a success at one particular time.
Answer. to significant figures.
Check. The remaining tail is ; the two probabilities sum to .
Worked example 4 changes the fixed trial limit into a quantity to choose: require a success probability of at least .
Worked example 4: choosing the minimum trial limit
Question. Find the least integer for which , when .
Plan. Rearrange the cumulative probability, take logarithms and check neighbouring integers.
Why this step? Dividing by negative reverses the inequality. The least allowable integer is above the real bound.
Answer. .
Check. , while .
For an interval, subtract tails with their endpoints intact: , which includes first successes on trials .
Watch out
Wrong: . Right: , because success may occur on trial . Test the boundary .
Increase the required cumulative probability in the next problem.
The trial of the rth success
For a specified later success, the last trial is still fixed as a success, but earlier successes can be arranged in several ways.
For a third success on trial , the first five trials contain exactly two successes and three failures. There are arrangements of those first five trials; the sixth trial must then succeed. Every allowed full pattern has three successes and three failures.
[DIAGRAM: asset_name: Ten ways to get the third success on trial six; asset_slug: 9fm0-fs1-106-last-success; caption: Rearrange the first five trials and keep the final success fixed; description: A table of ten exact outcome sequences lists every choice of two success positions among the first five trials, followed by a fixed sixth-trial success. S cells are pale clay and F cells pale blue. Headers identify trials 1 to 6, the last column is outlined, and a side panel explains that only the first five positions can be rearranged]

The same reasoning works for any positive integer target .
Negative binomial waiting time
Let count the trial on which success number occurs, in independent trials with constant success probability . Write , with support . Pearson counts all trials, including the successes. The number of failures is , starting at zero. The case is geometric.
Continue this lesson.
You’re previewing NovaLearn without an account. Create a free account to read the rest.
Create free account