10182

# A Variation of Banach Matchbox Problem

We have two rolls of toilet paper. Assume that there are two kinds of people. Big-choosers always take a piece of paper from the roll that is currently larger, and little-choosers always take a piece of paper from the roll that is currently smaller. When the two rolls are the same size, or when only one roll is nonempty, everybody chooses the nonempty roll to which there is the smallest distance.
People come independently at random, with probability that they are big-choosers and probability that they are little-choosers. Initially, both rolls are of the same length. We are interested in the mean number of papers left on one roll when the other roll runs out. (Assume that everyone uses the same amount of paper and that the lengths of the rolls are expressed in terms of this unit.)
The Demonstration shows sample paths of the rolls and the mean number of papers left on one roll when the other roll runs out.

### DETAILS

Donald Knuth presented and analyzed this problem in [1]. It is also studied in problem 8 of [2]; our Demonstration is based on this book.
The first snapshot shows that when the probability of a big-chooser is small, most people use the smaller roll so that when it runs out, the other roll contains lots of paper. The second snapshot shows that when the probability of a big-chooser is greater than 0.5, most people use the bigger roll, so that the sizes of the rolls stay close to each other.
The third snapshot shows the mean number of papers left on one roll when the other roll runs out. The curve shows how this number depends on the probability of big-choosers. We can see a dramatic change in the nature of the curve: when the probability of big-choosers increases from 0 to 0.5, the mean value steadily decreases, but when the probability of big-choosers increases from 0.5, the mean value stays very small. If the probability of big-choosers is, say, 0.4, then on average about 35 papers are left on the other roll, if the rolls initially contain 100 papers.
To calculate the mean value, Nahin develops recursive formulas. They are easy to implement with Mathematica.
References
[1] D. Knuth, "The Toilet Paper Problem," American Mathematical Monthly, 91(8), 1984 pp. 465–470.
[2] P. J. Nahin, Digital Dice: Computational Solutions to Practical Probability Problems, Princeton: Princeton University Press, 2008.

### PERMANENT CITATION

 Share: Embed Interactive Demonstration New! Just copy and paste this snippet of JavaScript code into your website or blog to put the live Demonstration on your site. More details » Download Demonstration as CDF » Download Author Code »(preview ») Files require Wolfram CDF Player or Mathematica.

#### Related Topics

 RELATED RESOURCES
 The #1 tool for creating Demonstrations and anything technical. Explore anything with the first computational knowledge engine. The web's most extensive mathematics resource. An app for every course—right in the palm of your hand. Read our views on math,science, and technology. The format that makes Demonstrations (and any information) easy to share and interact with. Programs & resources for educators, schools & students. Join the initiative for modernizing math education. Walk through homework problems one step at a time, with hints to help along the way. Unlimited random practice problems and answers with built-in Step-by-step solutions. Practice online or make a printable study sheet. Knowledge-based programming for everyone.