The Toilet Paper Problem (Q3339841)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3874300
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The Toilet Paper Problem |
scientific article; zbMATH DE number 3874300 |
Statements
The Toilet Paper Problem (English)
0 references
1984
0 references
Banach's matchbox problem
0 references
Catalan number
0 references
Asymptotic results
0 references
0.6978073716163635
0 references
0.6957786083221436
0 references
0.6860334873199463
0 references
0.6830856204032898
0 references
0.6769519448280334
0 references
Beginning with two piles of n objects, remove one object from the larger pile with probability p and from the smaller pile with probability \(q=1- p\). Repeat ad infinitum, until both piles are empty. It is shown that the expected size of the remaining pile when one pile first empties is n- \(\sum_{1\leq k<n}(n-k)c_ kp^ kq^{k-1}\), where \(c_ k=\left( \begin{matrix} 2k-2\\ k-1\end{matrix} \right)/k\) is a Catalan number. Curiously, this is also the expected number of items removed from each pile when the piles first become equal in size again. Asymptotic results for large n are derived.
0 references