Let be the ordered values of n independent uniform (0, 1) random variables. Prove that for 1 < k < n + 1,
where X(0) = 0, X(n+l)= t.
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.