kent davidge said:
Oh I see
This is very interesting. Is it because we know for sure that player 1 picked a certain amount of balls? I mean, let's take the most interesting case, that player 1 removes 9 balls. Following your early notation, any refers to any type of balls removed by player 1,
##P(G2 | \text{any}1) = P( \text{any}1 | G2) P(G2) / P( \text{any} 1)## in which both ##P( \text{any}1 | G2)## and ##P( \text{any} 1)## would be 1 because what matters is that player 1 removes 9 balls and we know that this has happened.
For the more general problem (more than 2 balls drawn) the easiest way is to avoid using conditional probabilities and Bayes' rule, but instead to go back to sample-space fundamentals.
Say player 1 draws (k-1) balls (without showing the results to player 2) and player 2 draws ball k. You can view this as a permutation problem: number the balls from 1-10; balls 1-9 are green and ball 10 is white. Now any drawing of balls corresponds to a permutation of the numbers from 1-10. Basically, we lay out the entire permutation (of which there are 10! equally-likely candidates) and just ignore the remaining entries. So, when drawing just 1 ball we lay out all 10! complete permutations and just ignore the outcomes 2--10, (That is, we include all the drawings we
could have made, but didn't.) The number of permutations with a green ball in position #1 is 9*9!, because any of the 9 green balls can be first and then the other 9 balls can have any permutation. Thus, the probability that the first ball is green is P = 9*9!/10! = 9/10.
In the original version of your problem we are really asking for the probability that the ball in position 2 is green. There are 9*9! such permutations, because there are 9 green balls that can be in position 2 and then the other 9 balls (in positions 1,3,4,...,10) can have any permutation. So, the probability continues to be P = 9(9!/10! = 9/10.
If player 1 draws 9 balls, the probability that player 2 draws green is again P = 9*9!/10!, because there are 9*9! permutations in which a green ball is in position 10.
It works the same way for any position k.