Consider an urn containing n balls numbered 1,....,n, and suppose that k of them are randomly withdrawn. Let Xi equal 1 if ball number i is removed and let Xi be 0 otherwise. Show that X1,..., Xn are exchangeable.
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.