|
A path formula for the sock sorting problem
S. Korbel, P. Mörters Mathematisches Institut, Universität zu Köln, Weyertal 86-90, Köln, Germany
Abstract:
Suppose that $n$ different pairs of socks are put in a tumble dryer. When the dryer is finished, socks are taken out one by one. If a sock matches one of the socks on the sorting table, both are removed; otherwise, it is put on the table until its partner emerges from the dryer. We note the number of socks on the table after each of the $2n$ socks is taken from the dryer, and we give an explicit formula for the probability that this sequence equals a given sequence of length $2n$.
Keywords:
Daniel Bernoulli's matching problem, sorting of socks.
Received: 09.06.2021 Accepted: 06.07.2021
Citation:
S. Korbel, P. Mörters, “A path formula for the sock sorting problem”, Teor. Veroyatnost. i Primenen., 66:4 (2021), 889–894; Theory Probab. Appl., 66:4 (2022), 708–712
Linking options:
https://www.mathnet.ru/eng/tvp5506https://doi.org/10.4213/tvp5506 https://www.mathnet.ru/eng/tvp/v66/i4/p889
|
Statistics & downloads: |
Abstract page: | 134 | Full-text PDF : | 38 | References: | 23 | First page: | 9 |
|