A fair 4-sided die is rolled 2 0 0 times. Let X i be the score obtained at the i -th toss ( 1 ≤ i ≤ 2 0 0 ). Define U 1 = min ( X 1 , X 2 ) , i.e. the minimum of the first two tosses. Compute ⎢ ⎢ ⎢ ⎡ ( k ∏ P ( U 1 = k ) ) − 1 ⎥ ⎥ ⎥ ⎤ where k ranges over all possible values it attains.
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.
Perfect solution. But why on earth did we roll the dice 200 times?!
Log in to reply
I don't know. Maybe there's a second part coming for U n = min ( X n , X n + 1 ) over all 1 ≤ n ≤ 1 9 9 ... Or it was just to confuse us.
Log in to reply
It was supposed to be a trick question for whom doesn't consider the indipendence of the tosses, ahah.
Problem Loading...
Note Loading...
Set Loading...
All possible outcomes of the two first rolls can be arranged in a 4 × 4 table
1 2 3 4 X 2 1 ( 1 , 1 ) ( 2 , 1 ) ( 3 , 1 ) ( 4 , 1 ) 2 ( 1 , 2 ) ( 2 , 2 ) ( 3 , 2 ) ( 4 , 2 ) 3 ( 1 , 3 ) ( 2 , 3 ) ( 3 , 3 ) ( 4 , 3 ) 4 ( 1 , 4 ) ( 2 , 4 ) ( 3 , 4 ) ( 4 , 4 ) X 1
For all black results, U 1 = 1 , for red results U 1 = 2 and so on for U 1 = 3 , 4 .
Hence, we derive the values
P ( U 1 = 1 ) = 1 6 7
P ( U 1 = 2 ) = 1 6 5
P ( U 1 = 3 ) = 1 6 3
P ( U 1 = 4 ) = 1 6 1
With this, we can now work out the product
= = = ⎢ ⎢ ⎢ ⎡ ( k ∏ P ( U 1 = k ) ) − 1 ⎥ ⎥ ⎥ ⎤ ⌈ ( 1 6 7 ⋅ 1 6 5 ⋅ 1 6 3 ⋅ 1 6 1 ) − 1 ⌉ ⌈ 1 0 5 6 5 5 3 6 ⌉ 6 2 5