Banach's matchbox problem
problem in probability: Banach has 2 matchboxes (initially with 𝑁 matches) in left and right pockets; if he reaches into his pocket and finds for the 1st time that the box picked is empty, what’s the probability that there are 𝑘 matches in the other?
Facts
3 properties- Instance of
- mathematical problem
- Defining formula
- p_{N,k}=\binom{2N-k}{N-k}2^{k-2N}[4]
- Named after
- Stefan Banach, matchbox[2][3]
🏷️ Also known as
en Banach's matchbox problem
en Banach's match problem
el πρόβλημα σπιρτόκουτου του Μπάναχ
fa مسئله کبریت باناخ
fa مسئله قوطی کبریت باناخ
fa مساله کبریت باناخ
fi Banachin tulitikkuongelma
ja バナフのマッチブック問題
nl Banachs lucifersprobleem
🔖 Identifiers · 2
- Image (Wikimedia Commons)
- Banach Matchbox.png ↗
- Freebase ID
- /m/02pr9sb
🔗 Connections
Named after 2
Instance of 1
Maintained by WikiProject 1
Press Enter · cited answer in seconds
0 sources
Summary
Banach's matchbox problem is a mathematical problem[1].