Streaks. in this problem we consider the problem of testing whether a randomly generated sequence is truly random. a certain computer program is supposed to generate bernoulli iid sequences with parameter 0.5. when you try it out, you are surprised that it contains long streaks of 1s. in particular, you generate a sequence of length 200, which turns out to contain a sequence of 8 ones in a row. a. let s be equal to the longest streak of 1s in an iid bernoulli sequence of length 5. compute the pmf of s exactly.

Step-by-step explanation:

Let X be a sequence of iid Bernoulli with paramenter 0.5. X has Binomial distribution with parameters n = 5, p = 0.5.

S will be 0 only if your sequence of length 5 has only 0s, thus

Note that each configuration of the list is one equally probable case out of 32.

S will be 1 only when X doesnt take the value 1 two times in a row. X can take the value 1 only once, which are 5 total cases out of 32, it can take the value 1 on the first element and the third/ fourth/fifth, the value 1 on the second element and the fourth/fifth, the value 1 on the third and fifth element or the value 1 on the first, third and fifth element. In total, we have  12 favourable cases from a total of 32, hence

S will take the value 2 if any 2 consecutive values are 1 and the rest 0. Lets divide in cases:

As a conclusion

For S to be equal to 3 we have 5 possibilities: the first 3 elements are 1, the fourth is 0 and the fifth is either 1 or 0, the last 3 elements are 1, the second is 0 and the first one is either 1 or 0, or the first and fifth elements are 0 and the rest 1. Therefore,

S is 4 only in 2 possible cases (an extreme is 0, and the rest is 1). So

There is only one favourable case for 5, so

i believe the answer is 68cm

step-by-step explanation:

i just took 34 x 2 because the space between v and y is the same as y to k.