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?
Press Enter · cited answer in seconds
0 sources
Banach's matchbox problem
Summary
Banach's matchbox problem is a mathematical problem[1]. It draws 145 Wikipedia views per month (mathematical_problem category, ranking #22 of 128).[2]
Key Facts
- Banach's matchbox problem's image is recorded as Banach Matchbox.png[3].
- Banach's matchbox problem's instance of is recorded as mathematical problem[4].
- Stefan Banach is named after Banach's matchbox problem[5].
- matchbox is named after Banach's matchbox problem[6].
- Banach's matchbox problem's Freebase ID is recorded as /m/02pr9sb[7].
- Banach's matchbox problem's defining formula is recorded as p_{N,k}=\binom{2N-k}{N-k}2^{k-2N}[8].
- Banach's matchbox problem's maintained by WikiProject is recorded as WikiProject Mathematics[9].
Why It Matters
Banach's matchbox problem draws 145 Wikipedia views per month (mathematical_problem category, ranking #22 of 128).[2] It is known by 3 alternative names across languages and contexts.[10]