N1, N3 - Discrete and binomial distributions
Describe separate random outcomes with a probability distribution, then recognise when a count has a binomial model. N1 develops exact and cumulative probabilities; N3 helps you judge the assumptions and interpret binomial mean and spread.
Discrete probability distributions
Can a model predict an average of fourteen delayed parcels without claiming that the next delivery contains fourteen delays? First separate the possible outcomes from the probabilities attached to them. A small collection desk might have no customers waiting, one, two or three. The number waiting is random; its possible values are separate.
You already know
Mutually exclusive outcomes cannot occur together. An exhaustive list covers every possibility, so its probabilities add to . Add probabilities when an event contains several mutually exclusive outcomes.
A random variable assigns a number to each outcome of a random process. Capital names the variable; lowercase names one possible value. Thus is an event, not a claim that is always .
Discrete random variable
A discrete random variable takes separate possible values. Its probability distribution specifies those values and their probabilities. A probability function is written .
Counts have non-negative integer values, often written . Discrete variables need not be counts: possible cash prizes can be separate amounts. A distribution can be given by a table or by a function with a stated range of values. A listed value may have probability zero, but negative probabilities are impossible. Check both the range of each probability and the total. These probability rules are not in the formula booklet: learn them.
Worked example 1: completing a distribution
Question. The number waiting at a desk has the distribution below. Find , and the probability that is odd.
Plan. Use total probability to determine the scale, then add the probabilities of the included values.
Why this step? An event selects outcomes; it is their probabilities that you add, not the outcome values.
Answer. , and the odd-value probability is .
Check. The probabilities are all valid and total .
Change only the last weight from to . That changes the scale of every probability, so you must find again.
Worked example 2: one weight changes
Question. A second desk has probabilities for , respectively, and zero otherwise. Find , and the odd-value probability.
Plan. Normalise the new weights before selecting the same two events.
Why this step? The weights describe relative sizes; none is a probability until the total has been made .
Answer. , and the odd-value probability is .
Check. , and both event probabilities lie between and .
An odd event is not necessarily a single outcome. Here it contains both and .
Watch out
Wrong: . These are outcome values, and a probability cannot exceed . Right: add .
You may see for a mean and for a variance. General discrete-distribution moment calculations are not needed here; the specific binomial summaries later are required. Try another normalisation, this time with a probability function.
Binomial conditions and exact probabilities
Six devices each either pass a check or fail it. Counting passes suggests a binomial model only if the process meets four conditions: a fixed number of trials, two categories per trial, independent trials and the same success probability on every trial.
Binomial model
means that counts successes in independent trials, each with success probability . The symbol means “is distributed as”. Here is a positive integer and .
“Success” means the category you count: a faulty device can be a statistical success. Several physical outcomes can be grouped into success and failure, such as blue or not blue on a multicoloured spinner. Write for failure probability.
Independence concerns the relationship between trials; constant concerns their individual chances. Neither follows merely from calling a sample random. Devices from one faulty batch may fail together, while devices from different production lines may have different fault probabilities. Sampling a small bag without replacement usually changes conditional probabilities. Replacement and fresh independent random selection restore the same chances. Treating a tiny sample from a very large population as approximately independent requires a contextual justification. Taking shots until the third goal gives a random trial count, so it is not a fixed-trial binomial experiment.
For , one particular sequence with successes and failures has probability . There are possible success positions.
Exact binomial probability
For ,
with .
In the formula booklet.
For a positive integer , , and . The same coefficients occur in , whose value confirms that all binomial probabilities sum to . Recognise the boundary cases directly: makes certain; makes certain. The support is always within .
Worked example 3: exact success count
Question. Six independent devices each pass with probability . Let count passes. Find .
Plan. State the count model, then use the exact binomial probability function.
Why this step? Multiplying by includes every arrangement, rather than just two passes followed by four failures.
Answer. .
Check. The calculator's exact binomial function with gives the same result.
Change only the requested count from two passes to three. Both the arrangement count and the success/failure powers must change.
Worked example 4: a different exact count
Question. For the same six independent devices, each passing with probability , find .
Plan. Keep the model and change the event entered into the exact probability function.
Why this step? There are arrangements of three passes, not the arrangements used for two passes.
Answer. .
Check. Dividing this probability by the previous one gives ; the ratio also follows by dividing the two formula expressions.
Use your calculator for numerical binomial probabilities; the formula explains what its exact function computes.
Watch out
Wrong: . This counts one arrangement. Right: multiply by to count all possible positions of the three passes.
In the next check, define the counted category before entering the parameters.
Continue this lesson.
You’re previewing NovaLearn without an account. Create a free account to read the rest.
Create free account