A bored gamber rolls nine (six-sided) fair dice. Let P be the probability that each of the six possible results ( 1 − 6 ) of a die roll happens at least once among the nine dice.
What is ⌊ 1 0 0 0 0 P ⌋ ?
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
Great generalization!
Divide this problem into three cases.
CASE ONE: 123456ABC
CASE TWO: 123456AAB
CASE THREE: 123456AAA
THEREFORE
Problem Loading...
Note Loading...
Set Loading...
So let us generalize this beauty. Consider a dice with m sides and we throw it n times. We are first interested in the number of outcomes that do NOT appear among the n throws. For i ∈ { 1 , . . . , m } , we let A i be the event that the outcome i does not appear. For K ⊆ { 1 , . . . , m } ,We count the number of outcomes such that none of the elements of K appear. So we have # i ∈ K ⋂ A i = ( m − # K ) n Using the inclusion exclusion rule, we get # i = 1 ⋃ m A i = k = 1 ∑ n ( − 1 ) k − 1 ( k m ) ( m − k ) n Now by using De Morgan's law, we get # i = 1 ⋂ m A i c = k = 0 ∑ n ( − 1 ) k ( k m ) ( m − k ) n Now we find all the samples which exclude exactly j of the m values. To generate those, we can first choose the j values to be excluded, which can happen in ( j m ) ways. Then we find the number of samples such that the remaining are not excluded. From our previous calculation, we get k = 0 ∑ n ( − 1 ) k ( k m − j ) ( m − j − k ) n Thus the total number of samples that excludes exactly j values is ( j m ) k = 0 ∑ n ( − 1 ) k ( k m − j ) ( m − j − k ) n The probability that j values are excluded is then just the above number divided by all possible samples, which is m n , we get k = 0 ∑ n ( − 1 ) k ( k m − j ) ( 1 − m j + k ) n The probability that 0 values are excluded is then just setting j = 0 : k = 0 ∑ n ( − 1 ) k ( k m ) ( 1 − m k ) n So specializing to m = 6 and n = 9 , we get k = 0 ∑ 9 ( − 1 ) k ( k 6 ) ( 1 − 6 k ) 9 This gives 1 2 9 6 2 4 5 ∼ 0 . 1 8 9 0 4 3 2 0 9 8 7 6 5 4 3 2 0 9 8 7 6 5 4 3 2 0 9 8 7 6 5 4 3 2 0 9 8 7 6 5 4 3 2 0 9 8 7 6 5 4 3 2 0 9 8 7 6 5 4 3 . . .