A box contains 100 balls, of which r are red. Suppose that the balls are drawn from the box one at a time, at random, without replacement. Determine (a) the probability that the first ball drawn will be red; (b)the probability that the 50th ball drawn will be red; and(c)the probability that the last ball drawn will be red.
A box contains 100 balls, of which r are red. Suppose that the balls are drawn from the box one at a time, at random, without replacement. Determine (a) the probability that the first ball drawn will be red; (b)the probability that the 50th ball drawn will be red; and(c)the probability that the last ball drawn will be red.
(a) Pr (1st ball drawn will be red) = r/100
(b) Pr (50th ball drawn will be red) = r/100
(c) Pr (last ball drawn will be red) = r/100
This is what they mean to say:
We first list all possible sequences (or ways) in which 100 balls can be drawn where the ith term in the sequence is 1 if the ith draw is red and 0 otherwise. And since draws are without replacement, we list all the sequences with exactly r ones and (100 - r) zeros. And all of them are equally likely. Thus,
Pr(there is 1 in the first spot of the sequence) = Pr(there is 1 in the 50th spot of the sequence) = Pr(there is 1 in the 100th spot of the sequence) = r/100