Originally Posted by
David Franklin
Yes it is. Or, formally, let P be the probability black comes up, and P(n) the probability black comes up in the first n tries. Then we have P(n) <= P (because if it comes up in n tries, it certainly comes up). So we have P(n) <= P <= 1. That is, 1-2^-n <= P <= 1. This is true for all n, so P = 1.
[Looking at it really formally, there's a set of disjoint events E_n = "black comes up for the first time on trial n". So that P(E_n) = 2^-n. P(black comes up) = P(union E_n); I can't remember which convergence theorem you use, but basically the fact that everything is disjoint and bounded and there's only a countable number of sets means all the limits have to come out as you'd expect].
Bookmarks