Re: A problem over morning coffee
That is the probability that the first B are all black, but that is not required for the problem. We only require that B of the first B+n be black, for any n < A. You have solved for n = 0.
You can do this problem without any combinatorics at all, in a simple one-line argument.
|