A Prisoner Problem Variation
Jerry Metzger and Thomas Richards
University of North Dakota
Department of Mathematics
Witmer Hall Room 313
101 Cornell Street Stop 8376
Grand Forks, ND 58202-8376
Consider a fair n-sided die with faces numbered 1 to n. Several
different methods are used to compute the probability that every face
has come up at least once when face n
appears for the kth time. The
results lead to a number of summation identities. The probabilities are
related to several sequences in Sloane's
On-Line Encyclopedia of Integer Sequences.
Full version: pdf,
(Concerned with sequences
October 28 2014; revised version received January 13 2015.
Published in Journal of Integer Sequences, January 25 2015.
Journal of Integer Sequences home page