## Modified banach’s matchbox problem [closed]

Hi, first of all sorry for my English

Classic Banach's matchbox problem (from wiki): Suppose a mathematician carries two matchboxes at all times: one in his left pocket and one in his right. Each time he needs a match, he is equally likely to take it from either pocket. Suppose he reaches into his pocket and discovers that the box picked is empty. If it is assumed that each of the matchboxes originally contained N matches, what is the probability that there are exactly k matches in the other box?

But I need to solve a problem: Mathematician discover that the box is empty when take last match form the box. (originally he discover that the box is empty when hi want to take a match and in the box was no longer matches)

Can anyone help me ? I would ask for a solution with explanation.

-
This is equivalent to the original problem with one less match in each box. – Will Sawin Oct 1 2011 at 22:36
in that case, just insert -1 to the formula? – KuB Oct 2 2011 at 7:12
obviously in the right place :D – KuB Oct 2 2011 at 7:17
I'm closing the question because it is not at an appropriate level for MathOverflow. It seems that your question has been resolved, but you may want to ask future questions at one of the other sites listed in the FAQ. – S. Carnahan Oct 2 2011 at 15:21