A fair, 6 -sided die is rolled 2 0 times, and the sequence of the rolls is recorded.
C is the number of times in the 20-number sequence that a subsequence (of any length from one to six) of rolls adds up to 6 . These subsequences don't have to be separate and can overlap each other. For example, the sequence of 2 0 rolls 1 2 3 3 4 2 2 2 1 1 1 3 6 6 1 4 1 5 2 3 contains the ten subsequences 1 2 3 , 3 3 , 4 2 , 2 2 2 , 2 2 1 1 , 1 1 1 3 , 6 , 6 , 1 4 1 , 1 5 which all add up to 6 , so C = 1 0 in this case.
The expected value of C is equal to b a for coprime positive integers a and b .
What is a + b ?
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.
積乱雲 asodk aosdkosas
Hooray for the linearity of expectation!
Log in to reply
Hahah, I was to say the same! One must simply love this property.
"C is the number of times...". Just from that "number of times" C should be a natural. And it cannot be presented as two comprime a/b, because to get natural number here, b should be a divisor of a, which means they are not comprime. I think that some definition are wrong in this task.
Log in to reply
The definitions are correct. The number of times an event occurs (C) can be different than its expected value (a/b).
Suppose that a total of N ≥ 6 dice are rolled. For integers 1 ≤ u ≤ 6 and u ≤ v ≤ N , let X u v be the indicator random variable that is equal to 1 if a consecutive subsequence of u dice rolls (ending with the v th in the main sequence) adds to 6 , and which is equal to 0 otherwise. Thus X u v = { 1 0 d v + d v − 1 + . . . + d v + 1 − u = 6 o w where d k is the value of the k th die roll for 1 ≤ k ≤ N . Then C = u = 1 ∑ 6 v = u ∑ N X u v and hence, by the linearity of expectation, E [ C ] = u = 1 ∑ 6 v = u ∑ N E [ X u v ] = u = 1 ∑ 6 v = u ∑ N P [ X u v = 1 ] Now P [ X u v = 1 ] is the probability that the sum of u dice rolls is equal to 6 , and hence is 6 u n u , where n u is the number of ways in which u dice rolls can total 6 , which is the coefficient of x 6 in the expansion of ( x + x 2 + x 3 + x 4 + x 5 + x 6 ) u . Since x + x 2 + x 3 + x 4 + x 5 + x 6 = 1 − x x ( 1 − x 6 ) we see that n u is the coefficient of x 6 in x u ( 1 − x ) − u , and hence is the coefficient of x 6 − u in ( 1 − x ) − u . Thus we deduce that n u = ( u − 1 u + ( 6 − u ) − 1 ) = ( u − 1 5 ) 1 ≤ u ≤ 6 Therefore E [ C ] = u = 1 ∑ 6 v = u ∑ N 6 u n u = u = 1 ∑ 6 6 u n u ( N + 1 − u ) = u = 1 ∑ 6 6 u N + 1 − u ( u − 1 5 ) = u = 0 ∑ 5 6 u + 1 N − u ( u 5 ) = 6 1 N ( 1 + 6 1 ) 5 − 3 6 5 ( 1 + 6 1 ) 4 = 4 6 6 5 6 2 4 0 1 ( 7 N − 5 ) In particular, when N = 2 0 we have E [ C ] = 1 7 2 8 1 2 0 0 5 , making the answer 1 2 0 0 5 + 1 7 2 8 = 1 3 7 3 3 .
Nice generalization. I would, personally, prefer stars and bars over generating functions here because it seems to me that it's the faster way. If we consider subsequence length u then:
Nice solution! (I also used indicator variables :) )
I would only remark that to see that n u = ( u − 1 5 ) you can just write six ones in a row, and insert u-1 separators in the 5 spaces between them.
We can find the expected value of C by making a list of all possible subsequences that add to 6 and their expected values, then adding up all of the expected values. 1 1 1 1 1 1 1 5 ( 6 1 ) 6 1 1 1 1 2 1 6 ( 6 1 ) 5 ⋅ 5 1 1 1 3 1 7 ( 6 1 ) 4 ⋅ 4 1 1 2 2 1 7 ( 6 1 ) 4 ⋅ 6 1 1 4 1 8 ( 6 1 ) 3 ⋅ 3 1 2 3 1 8 ( 6 1 ) 3 ⋅ 6 2 2 2 1 8 ( 6 1 ) 3 1 5 1 9 ( 6 1 ) 2 ⋅ 2 2 4 1 9 ( 6 1 ) 2 ⋅ 2 3 3 1 9 ( 6 1 ) 2 6 2 0 ( 6 1 ) For the expected value part of this table, we have the number of places the subsequence could start within the 20 length sequence times the probability of rolling exactly that sequence times the number of ways to rearrange the sequence. For example, the 11112 subsequence could start in 16 different places, the probability of rolling all five dice perfectly is ( 6 1 ) 5 and it could be rearranged 5 different ways. If we add up all of the expected values, we get 1 7 2 8 1 2 0 0 5
What is this I am in class 7 now in india
Problem Loading...
Note Loading...
Set Loading...
There is 1 way to make a 6 with a 1 -digit subsequence (with a 6 ), out of a total of 6 1 -digit combinations, and there are 2 0 1 -digit subsequences in the 2 0 -digit sequence, for an expected value of 6 1 ⋅ 2 0 = 3 1 0 .
There are 5 different ways to make a 6 with a 2 -digit subsequence (with a 1 5 , 2 4 , 3 3 , 4 2 , or 5 1 ), out of a total of 6 2 2 -digit combinations, and there are 1 9 2 -digit subsequences in the 2 0 -digit sequence, for an expected value of 6 2 5 ⋅ 1 9 = 3 6 9 5 .
There are 1 0 different ways to make a 6 with a 3 -digit subsequence (with the digits of 1 1 4 there are 2 ! 3 ! = 3 ways, with the digits of 1 2 3 there are 3 ! = 6 ways, and with the digits of 2 2 2 there is 3 ! 3 ! = 1 way, for a total of 3 + 6 + 1 = 1 0 different ways), out of a total of 6 3 3 -digit combinations, and there are 1 8 3 -digit subsequences in the 2 0 -digit sequence, for an expected value of 6 3 1 0 ⋅ 1 8 = 6 5 .
There are 1 0 different ways to make a 6 with a 4 -digit subsequence (with the digits of 1 1 1 3 there are 3 ! 4 ! = 4 ways, with the digits of 1 1 2 2 there are 2 ! 2 ! 4 ! = 6 ways, for a total of 4 + 6 = 1 0 different ways), out of a total of 6 4 4 -digit combinations, and there are 1 7 4 -digit subsequences in the 2 0 -digit sequence, for an expected value of 6 4 1 0 ⋅ 1 7 = 6 4 8 8 5 .
There are 5 different ways to make a 6 with a 5 -digit subsequence (with the digits of 1 1 1 1 2 there are 4 ! 5 ! = 5 ways), out of a total of 6 5 5 -digit combinations, and there are 1 6 5 -digit subsequences in the 2 0 -digit sequence, for an expected value of 6 5 5 ⋅ 1 6 = 4 8 6 5 .
Finally, there is 1 way to make a 6 with a 6 -digit subsequence (with a 1 1 1 1 1 1 ), out of a total of 6 6 6 -digit combinations, and there are 1 5 6 -digit subsequences in the 2 0 -digit sequence, for an expected value of 6 6 1 ⋅ 1 5 = 1 5 5 5 2 5 .
The combined expected value is 3 1 0 + 3 6 9 5 + 6 5 + 6 4 8 8 5 + 4 8 6 5 + 1 5 5 5 2 5 = 1 7 2 8 1 2 0 0 5 , so a = 1 2 0 0 5 and b = 1 7 2 8 , and a + b = 1 3 7 3 3 .