Let X be the length of the initial run in a random ordering of n ones and m zeros. That is, if the first k values are the same (either all ones or all zeros), then X ≥ k. Find E[X].
We need at least 10 more requests to produce the solution.
0 / 10 have requested this problem solution
The more requests, the faster the answer.