Banach's match problem is a classic problem in probability attributed to Stefan Banach. Feller [1] says that the problem was inspired by a humorous reference to Banach's smoking habit in a speech honouring him by Hugo Steinhaus, but that it was not Banach who set the problem or provided an answer.
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 for the first time that the box picked is empty. If it is assumed that each of the matchboxes originally contained
N
k
Without loss of generality consider the case where the matchbox in his right pocket has an unlimited number of matches and let
M
(N+1)
M
(N+1)
p=1/2
P[M=m]=\binom{N+m}{m}\left(
1 | |
2 |
\right)N+1+m
Returning to the original problem, we see that the probability that the left pocket is found to be empty first is
P[M<N+1]
1/2
K
P[K=k]=P[M=N-k|M<N+1]=2P[M=N-k]=\binom{2N-k}{N-k}\left(
1 | |
2 |
\right)2N-k
The expectation of the distribution is approximately
2\sqrt{N/\pi}-1
N=40
6