N1, N3 - Discrete and binomial distributions

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 11. Add probabilities when an event contains several mutually exclusive outcomes.

A random variable assigns a number to each outcome of a random process. Capital XX names the variable; lowercase xx names one possible value. Thus X=2X=2 is an event, not a claim that XX is always 22.

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 p(x)=P(X=x)p(x)=\mathrm P(X=x).

Counts have non-negative integer values, often written Z0+={0,1,2,…}\mathbb Z_0^+=\{0,1,2,\ldots\}. 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 XX waiting at a desk has the distribution below. Find kk, P(X≥2)\mathrm P(X\geq2) and the probability that XX is odd.

xx00112233
P(X=x)\mathrm P(X=x)kk2k2k3k3k4k4k

Plan. Use total probability to determine the scale, then add the probabilities of the included values.

k+2k+3k+4k=1exhaustive outcomes10k=1collect termsk=110divide by 10P(X≥2)=3k+4k=0.7include 2,3P(X is odd)=2k+4k=0.6include 1,3\begin{aligned} k+2k+3k+4k&=1 && \text{exhaustive outcomes} \\ 10k&=1 && \text{collect terms} \\ k&=\frac1{10} && \text{divide by }10 \\ \mathrm P(X\geq2)&=3k+4k=0.7 && \text{include }2,3 \\ \mathrm P(X\text{ is odd})&=2k+4k=0.6 && \text{include }1,3 \end{aligned}

Why this step? An event selects outcomes; it is their probabilities that you add, not the outcome values.

Answer. k=0.1k=0.1, P(X≥2)=0.7\mathrm P(X\geq2)=0.7 and the odd-value probability is 0.60.6.

Check. The probabilities 0.1,0.2,0.3,0.40.1,0.2,0.3,0.4 are all valid and total 11.

Change only the last weight from 4k4k to 6k6k. That changes the scale of every probability, so you must find kk again.

Worked example 2: one weight changes

Question. A second desk has probabilities k,2k,3k,6kk,2k,3k,6k for X=0,1,2,3X=0,1,2,3, respectively, and zero otherwise. Find kk, P(X≥2)\mathrm P(X\geq2) and the odd-value probability.

Plan. Normalise the new weights before selecting the same two events.

(1+2+3+6)k=1total probabilityk=112solveP(X≥2)=3+612=34include 2,3P(X is odd)=2+612=23include 1,3\begin{aligned} (1+2+3+6)k&=1 && \text{total probability} \\ k&=\frac1{12} && \text{solve} \\ \mathrm P(X\geq2)&=\frac{3+6}{12}=\frac34 && \text{include }2,3 \\ \mathrm P(X\text{ is odd})&=\frac{2+6}{12}=\frac23 && \text{include }1,3 \end{aligned}

Why this step? The weights describe relative sizes; none is a probability until the total has been made 11.

Answer. k=1/12k=1/12, P(X≥2)=3/4\mathrm P(X\geq2)=3/4 and the odd-value probability is 2/32/3.

Check. (1+2+3+6)/12=1(1+2+3+6)/12=1, and both event probabilities lie between 00 and 11.

An odd event is not necessarily a single outcome. Here it contains both 11 and 33.

Watch out

Wrong: P(X≥2)=2+3=5\mathrm P(X\geq2)=2+3=5. These are outcome values, and a probability cannot exceed 11. Right: add P(X=2)+P(X=3)\mathrm P(X=2)+\mathrm P(X=3).

You may see E(X)\mathrm E(X) for a mean and Var⁡(X)\operatorname{Var}(X) 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

X∼B(n,p)X\sim \mathrm B(n,p) means that XX counts successes in nn independent trials, each with success probability pp. The symbol ∼\sim means “is distributed as”. Here nn is a positive integer and 0≤p≤10\leq p\leq1.

“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 q=1−pq=1-p for failure probability.

Independence concerns the relationship between trials; constant pp 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 0<p<10<p<1, one particular sequence with rr successes and n−rn-r failures has probability pr(1−p)n−rp^r(1-p)^{n-r}. There are (nr)\binom nr possible success positions.

Exact binomial probability

For X∼B(n,p)X\sim \mathrm B(n,p),

P(X=r)=(nr)pr(1−p)n−r,r=0,1,…,n\mathrm P(X=r)=\binom nr p^r(1-p)^{n-r},\qquad r=0,1,\ldots,n

with (nr)=nCr=n!r!(n−r)!\displaystyle\binom nr={}_nC_r=\frac{n!}{r!(n-r)!}.
In the formula booklet.

For a positive integer nn, n!=n(n−1)⋯1n!=n(n-1)\cdots1, and 0!=10!=1. The same coefficients occur in (q+p)n(q+p)^n, whose value 11 confirms that all binomial probabilities sum to 11. Recognise the boundary cases directly: p=0p=0 makes X=0X=0 certain; p=1p=1 makes X=nX=n certain. The support is always within 0,1,…,n0,1,\ldots,n.

Worked example 3: exact success count

Question. Six independent devices each pass with probability 0.30.3. Let XX count passes. Find P(X=2)\mathrm P(X=2).

Plan. State the count model, then use the exact binomial probability function.

X∼B(6,0.3)fixed independent checksP(X=2)=(62)(0.3)2(0.7)4two passes, four failures=15(0.3)2(0.7)4choose pass positions=0.324135calculator evaluation\begin{aligned} X&\sim \mathrm B(6,0.3) && \text{fixed independent checks} \\ \mathrm P(X=2)&=\binom62(0.3)^2(0.7)^4 && \text{two passes, four failures} \\ &=15(0.3)^2(0.7)^4 && \text{choose pass positions} \\ &=0.324135 && \text{calculator evaluation} \end{aligned}

Why this step? Multiplying by 1515 includes every arrangement, rather than just two passes followed by four failures.

Answer. P(X=2)=0.324135\mathrm P(X=2)=0.324135.

Check. The calculator's exact binomial function with n=6,p=0.3,x=2n=6,p=0.3,x=2 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 0.30.3, find P(X=3)\mathrm P(X=3).

Plan. Keep the model and change the event entered into the exact probability function.

P(X=3)=(63)(0.3)3(0.7)3three of each outcome=20(0.3)3(0.7)3choose three positions=0.18522calculator evaluation\begin{aligned} \mathrm P(X=3)&=\binom63(0.3)^3(0.7)^3 && \text{three of each outcome} \\ &=20(0.3)^3(0.7)^3 && \text{choose three positions} \\ &=0.18522 && \text{calculator evaluation} \end{aligned}

Why this step? There are 2020 arrangements of three passes, not the 1515 arrangements used for two passes.

Answer. P(X=3)=0.18522\mathrm P(X=3)=0.18522.

Check. Dividing this probability by the previous one gives 4/74/7; 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: P(X=3)=(0.3)3(0.7)3\mathrm P(X=3)=(0.3)^3(0.7)^3. This counts one arrangement. Right: multiply by (63)\binom63 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