Binomial Distribution (Binomialverteilung)
The tasks in this topic describe a process that repeats: items are inspected, customers approached, answers guessed. Below it stand five claims about the number of successes, its probability, the expected value, or whether the model fits at all. There is little to compute; what you have to decide is which computation a claim calls for and where it swaps that computation for a convenient wrong shortcut.
The formula sheet (German: Formelsammlung) contains only the binomial coefficient , neither the formula for successes nor the expected value and the variance. If the task text does not print the formula, you assemble it from the product rule and this coefficient; the expected value and the variance you bring along from memory.
A Bernoulli chain requires four things at once
A Bernoulli trial is a random experiment with exactly two outcomes. One outcome is called a success (German: Treffer). The other is called a failure, and the task decides which is which: a success need not be anything pleasant, a defective item can be one too. The probability of a success is called ; the probability of a failure is then .
If an experiment has more than two outcomes, you merge them into two groups. With a die, “ or spots” becomes the success with , and the other four faces form the failure. Every outcome must belong to exactly one of the two groups.
A Bernoulli chain (German: Bernoulli-Kette) of length consists of Bernoulli trials for which three further conditions hold: the number is fixed before the start, the success probability is the same in every trial, and the trials do not influence each other. The random variable counts the successes and can take the values .
What is fixed in advance is the number of trials, not the number of successes. Each of the four conditions can fail on its own, and in the tasks each of them appears in disguise.
| Condition | How it fails |
|---|---|
| two outcomes | never for good: several outcomes can be merged into success and failure |
| fixed | "until the first success arrives": then the number of trials is itself random |
| same | a machine wears out, an apprentice learns with every item |
| independence | a group confers before each person votes; items are drawn without replacement from a small stock |
Your turn1 of 15
A pupil answers questions independently of each other: each of the first five correctly with probability , each of the last five with . May you compute for the number of correct answers with the binomial formula for and the average ?
Drawing without replacement (German: ohne Zurücklegen) breaks independence: every item drawn changes the stock and with it the probability for the next one. A box holds tickets, of them winners, and tickets are drawn. Drawing no winner has, without replacement, the probability
With replacement it would be . Without replacement every losing ticket drawn makes the next one rarer, and the binomial distribution would compute this wrongly.
If instead tickets with winners lie in the drum, one losing ticket drawn barely changes the share: instead of . Hence the rule of thumb: if the sample is small compared with the stock, you may compute without replacement as if items were replaced. A survey of randomly chosen people from a whole country is therefore a Bernoulli chain, a poll of of the members of a club is not.
Your turn2 of 15
Which situation can be described as a Bernoulli chain?
The formula is built from the product rule and the binomial coefficient
A hotel has reservations for one night. Each is cancelled independently of the others with probability , and counts the cancellations. We want .
- One particular sequence. That exactly the first two reservations are cancelled and the other five are not has, by the product rule for independent events, the probability .
- Every other sequence is equally likely. If the two cancellations sit at other positions, say the third and the sixth, the same factors appear in a different arrangement: twice and five times. The product does not change.
- Count the sequences. An sequence with two cancellations is fixed as soon as you decide which of the positions are cancelled. There are ways to do that, and this is the formula from the formula sheet.
The different sequences exclude each other. Their probabilities are therefore added, and equal terms give
Replace by , by and by , and the general formula appears.
If counts the successes in a Bernoulli chain of length with success probability , then is called binomially distributed. For
Each factor has a job, and that lets you check a printed expression quickly. counts the sequences, stands for the successes and for the remaining failures. The two exponents always add up to ; an expression such as can therefore be recognised as wrong from the exponent alone.
Some values need no calculator: , because there is only one sequence without successes and only one made entirely of successes, and , because a single success can sit at any of the positions. In general : choosing positions for the successes means choosing the positions for the failures.
Your turn3 of 15
The expression contains a binomial coefficient. What does stand for?
For the hotel all eight values can be computed this way. The table shows them rounded to four places.
The sum is , up to rounding in the last place, because some number of cancellations is certain to occur. If a task claims that a few values already add up to , check whether every value from to is really included; if one with positive probability is missing, the sum stays below .
Your turn4 of 15
For a Bernoulli chain with the following are known: , , and . What is ?
No success, at least, at most: special cases and the complement
For every single trial must be a failure, and there is only one sequence for that; the product rule is enough. The same holds for with nothing but successes. For the hotel, and .
The complementary event (German: Gegenereignis) of an event occurs exactly when does not occur. Its probability is .
“No success” has exactly one complement, “at least one success” (German: mindestens ein Treffer): either none of the trials is a success, or at least one is. For the hotel, . “Exactly one success” is not the complement: together with “no success” it has only , and the rest belongs to two or more successes.
The most convenient wrong computation for “at least one success” is . For the hotel it would give , more than , and no probability can be that. Even where does not exceed , the computation is wrong: for six throws of a die, would mean a six is certain, while the true value is . The product is the expected value.
| Throws | |
|---|---|
Twice as many throws therefore do not bring twice the probability, and it never reaches , because never becomes zero. If a task asks from how many trials on “at least one success” exceeds a bound, try one after another: the die exceeds for the first time at , because is still above and is already below.
The formula for can also be read backwards. If for it is known that , then and hence ; no other gives this value. If the chain is made twice as long, is not halved but squared: .
Your turn5 of 15
A commuter takes a train on four days; on each day, independently of the others, it is late with probability . How likely is at least one delay?
The words of the task translate into ranges of , and at the boundary a single word decides whether the boundary value belongs to the range.
| Wording | Event | Computation |
|---|---|---|
| exactly (genau) | one value of the formula | |
| at most (höchstens) | ||
| fewer than (weniger als) | as above, but without | |
| at least (mindestens) | or summed directly up to | |
| more than (mehr als) |
For the hotel, “at most two cancellations” covers the cases , and . They exclude each other, so their probabilities are added: . Multiplying would be wrong here, because the product rule applies to events that occur together, and there are no two different numbers of cancellations in the same night.
“At least three cancellations” is its complement and has . The detour through the complement pays off whenever it needs fewer terms; done directly, there would be five here. If lies close to , the direct way is shorter: for coin tosses, “at least nine heads” has only the terms and , that is .
Your turn6 of 15
In a Bernoulli chain of length , the value is known. Which event has the probability ?
The distribution is symmetric only when p = 0.5
The binomial coefficient is symmetric, . It does not follow that and successes are equally likely, because the powers differ. For the hotel, two and five cancellations each have sequences, yet and . Likewise “all cancelled” and “none cancelled”, at and , are rare to very different degrees.
Only at do and coincide. Then every sequence has the same probability , and is the share of sequences with successes. In ten coin tosses, three heads and seven heads each have of the sequences. Five heads has , not : half successes is the most frequent single case, but not a case with probability .
What always holds is a correspondence between two points of view. successes at success probability are the same event as failures, and a failure has probability . Exactly two cancellations mean exactly five reservations that stand, both at . It is wrong, however, to swap and in the formula and leave as it is: is not but .
Your turn7 of 15
For which Bernoulli chain does hold?
The most likely value lies near the expected value but is a whole number
In the hotel table has the largest probability, while . The most likely value lies near but is a whole number, because takes only whole numbers; a claim that it is is wrong from its form alone. Nor does it have to lie at half of . The expected value is not rounded for this: remains the mean, which need not be a whole number, and the most likely value comes from the calculation further down, not from rounding .
The most likely value of a distribution is the for which is largest. There can be two such values side by side if their probabilities are exactly equal.
Whether the distribution rises or falls from to is shown by the quotient of two neighbours: if it is greater than , the distribution rises; if smaller, it falls; if exactly , the two neighbours are equally likely. Almost all the powers cancel in it:
For the hotel the quotient from to is , so greater than , and from to it is , so smaller: the distribution rises up to and falls after it.
The quotient yields a shortcut: the most likely value is , rounded down to a whole number. If is itself a whole number, that value and the one below it share the maximum. For the hotel , so ; for and it is , so and .
Your turn8 of 15
A Bernoulli chain has length and success probability . Which value of is the most likely?
The expected value is an average over many repetitions
The expected value (German: Erwartungswert) of a binomially distributed number of successes states how many successes come out on average when the whole chain is repeated very often:
The result is plausible: in the long run the share of the trials becomes a success. For the hotel . In a single night, though, , , or more reservations are cancelled, never . The expected value need not be a whole number, and for a single chain it promises nothing, neither exactly nor at least that many successes. Nor is it a probability: if comes out as a whole number , that does not make the case certain, nor does it give it the probability .
Because grows in the same ratio as and as , the expected value doubles when is doubled, and it halves when is halved.
If each cancellation costs the hotel euros, the expected loss per night is euros. An insurance that replaces every cancellation loss therefore pays off for the hotel on average only if it costs less than euros per night. euros would be wrong: that is the loss if every reservation were cancelled.
Your turn9 of 15
A customer service team calls back customers on every working day. Each of them, independently of the others, picks up with probability . The team lead first works out how many unanswered callbacks are to be expected on one day and then scales that up to working days. Which line gives the expected number of unanswered callbacks correctly?
Variance and standard deviation measure the spread
The variance of the number of successes is . It measures how strongly fluctuates around the expected value from chain to chain, in squared units.
Taking the square root of the variance gives the standard deviation . It has the same unit as and gives the typical deviation from the expected value.
For the hotel and cancellations. Variance and standard deviation are two different numbers; they are equal only when the variance is or .
How strongly drives the spread is shown by the factor .
For the same the variance is largest at , and and give the same variance.
If is doubled, the variance doubles, but the standard deviation grows only by the factor . With reservations instead of , and . The expected value doubles, the typical deviation grows more slowly, and relative to the expected number the chain thus becomes more predictable.
Your turn10 of 15
A café has glasses in use on an evening. Each breaks independently of the others with probability , and each broken glass costs euros. What cost is to be expected per evening?
Your turn11 of 15
In a Bernoulli chain is quadrupled with the same . How do the expected value and the standard deviation of the number of successes change?
Your turn12 of 15
Chain A has trials with , chain B has trials with . Which claim about the standard deviation of the number of successes is correct?
An acceptance rule is a question about at most c defects
An acceptance rule (German: Annahmeregel) states that items from a delivery are inspected and the delivery is accepted if at most of them are defective. If each item is defective independently with probability , the acceptance probability is .
A wholesaler takes items from every delivery and accepts it as long as at most two of them are defective. The acceptance probability is made up of three cases:
| Defect rate | Sample of | Sample of |
|---|---|---|
Three things can be read off. The acceptance probability depends on , and the limit at once. With the same limit a larger sample makes the rule stricter, because among more inspected items three defective ones are easier to find. And it is neither nor the share of admitted values: , and are three of the ten possible values, but has nothing to do with .
Your turn13 of 15
An acceptance rule tests items and accepts the delivery if at most one of them is defective. Each item is defective independently with probability . Which expression is the probability that the delivery is rejected?
Five claims about a Bernoulli chain
Each of the five claims is a decision of its own. Check the model first, then translate the wording into the that are meant, take the cheap cases , and first, and check in the printed expression whether the exponents add up to . A complete example. An online shop sends customers one voucher each, every customer redeems it independently of the others with probability , and counts the redemptions.
- With not a single voucher is redeemed. Correct. All ten customers must decline, and there is only one sequence for that.
- At least one redemption occurs with . Wrong. The product is and for that reason alone cannot be a probability; the correct value is .
- Four and six redemptions are equally likely, because . Wrong. The numbers of sequences are equal, the powers are not: and . The two values would be equal only at .
- Exactly four redemptions are the most likely. Correct. rounds down to , and comparison with the neighbours confirms it: and both lie below .
- The standard deviation is . Wrong. is the variance; the standard deviation is .
Your turn14 of 15
From a box of light bulbs, of them defective, an inspector takes without replacement; counts the defective ones. Which claim is correct?
Your turn15 of 15
A Bernoulli chain has and . Which claim is correct?
Key takeaways
- Bernoulli chain. Two outcomes, fixed , same , independent trials; counts the successes.
- The formula. It is not on the formula sheet, but is; the rest is the product rule for a single sequence.
- Special cases. , , . Compute on the side with fewer terms: summed directly or via the complement.
- Key figures. is an average over many chains, , ; the most likely value is a whole number near .
Was this article helpful?