The Additive Rule and
the Binomial Distribution – An Example
We have a two color bowl, with equal probabilities for each color: blue at 50% and green at 50%.
Our experiment consists of five draws with replacement from the bowl – we track the number of blue draws among the five.
How likely is a blue
count of zero?
There is only one way to get zero blues, and that is to get five greens. Under the mutual independence of the five draws induced by sampling with replacement, we can use the multiplication rule and write
Pr
But the probability of drawing green on any particular draw is .50, so:
Pr
How likely is a blue
count of one?
There are five ways to get exactly one blue draw in five: BGGGG, GBGGG, GGBGG, GGGBG and GGGGB. We can then write:
Pr
Under the mutual independence of the five draws induced by sampling with replacement, we can use the multiplication rule and write:
Pr
But the probability of drawing green on any particular draw is .50, and the probability of drawing blue on any particular draw is .50:
Pr
Pr
Pr
Pr
Pr
So then:
Pr
and then
Pr
The position of the blue and greens among the five draws is irrelevant: if we have b blue draws and g green draws, then the probability is (.50)b(.50)g
How likely is a blue
count of two?
How can two blue draws show among five draws? Ten ways: BBGGG, GBBGG, GGBBG, GGGBB; BGBGG,GBGBG, GGBGB, BGGBG,GBGGB, BGGGB
The probability for each way is (.50)2(.50)3, so
Pr
Pr
How likely is a blue
count of three?
How can three blue draws show among five draws? Ten ways, since this is the same as placing two green draws among the five draws.
GGBBB, BGGBB, BBGGB, BBBGG; GBGBB,BGBGB, BBGBG, GBBGB,BGBBG, GBBBG
The probability for each way is (.50)3(.50)2, so
Pr
Pr
How likely is a blue
count of four?
This is the same as getting exactly one green, and there are five ways to get exactly one green draw in five: GBBBB, BGBBB, BBGBB, BBBGB and BBBBG. We can then write:
Pr
Under the mutual independence of the five draws induced by sampling with replacement, we can use the multiplication rule and write:
Pr
But the probability of drawing green on any particular draw is .50, and the probability of drawing blue on any particular draw is .50:
Pr{GBBBB} = (.50)* (.50)* (.50)* (.50)*
(.50) = (1/2)5 = 1/25 =
1/(2*2*2*2*2) = 1/32 »
.03125 (3.125%).
Pr{BGBBB} = (.50)*(.50)* (.50)* (.50)* (.50) = (1/2)5 = 1/25 = 1/(2*2*2*2*2) =
1/32 » .03125 (3.125%).
Pr{BBGBB} = (.50)* (.50)* (.50)* (.50)* (.50) = (1/2)5
= 1/25 = 1/(2*2*2*2*2) = 1/32 » .03125 (3.125%).
Pr{BBBGB}= (.50)* (.50)* (.50)* (.50)* (.50) = (1/2)5 = 1/25 = 1/(2*2*2*2*2) =
1/32 » .03125 (3.125%).
Pr{BBBBG} = (.50)* (.50)* (.50)* (.50)* (.50)
= (1/2)5 = 1/25 = 1/(2*2*2*2*2) = 1/32 » .03125 (3.125%).
So then:
Pr
and then
Pr
How likely is a blue
count of five?
There is only one way to get five blues, and that is to get zero greens. Under the mutual independence of the five draws induced by sampling with replacement, we can use the multiplication rule and write
Pr
But the probability of drawing blue on any particular draw is .50, so:
Pr
In total:
Pr
Pr
Pr
Pr
Pr
Pr
There is a general
formula for probabilities in this sort of experiment:
Pr
where C(n,k) = (n*(n-1)*(n-2)*…*1)/[(k*(k-1)*(k-2)*…*1)((n-k)*(n-k-1)*(n-k-2)*…*1)]
There is shorthand for n*(n-1)*(n-2)*…*1: n!, known as n factorial.
Pr
For example:
5! = 5*4*3*2*1 = 20*3*2*1 = 60*2*1 = 120
4! = 4*3*2*1 = 12*2*1 = 24*1 = 24
3! = 3*2*1 = 6*1 = 6
2! = 2*1 = 2
1! = 1
0! =1 (By definition)
Expected Count for
Blue
Expected Blue Count
for n=5 is
EBlue,n=5
=
0*Pr{Blue Count = 0} + 1*Pr
+ 5*Pr
0*(1/32) + 1*(5/32) + 2*(10/32) + 3*(10/32) + 4*(5/32) + 5*(1/32) = 80/32 = 2.5
E = nP = 5(.50) = 2.5