You are not currently logged in.
Access JSTOR through your library or other institution:
If You Use a Screen ReaderThis content is available through Read Online (Free) program, which relies on page scans. Since scans are not currently available to screen readers, please contact JSTOR User Support for access. We'll provide a PDF copy for your screen reader.
How Many Random Digits Are Required until Given Sequences Are Obtained?
Gunnar Blom and Daniel Thorburn
Journal of Applied Probability
Vol. 19, No. 3 (Sep., 1982), pp. 518-531
Published by: Applied Probability Trust
Stable URL: http://www.jstor.org/stable/3213511
Page Count: 14
You can always find the topics here!Topics: Mathematical sequences, Generating function, Mathematical theorems, Mathematical problems, Conditional probabilities, Probability distributions, Prisoners, Infinite series
Were these topics helpful?See something inaccurate? Let us know!
Select the topics that are inaccurate.
Since scans are not currently available to screen readers, please contact JSTOR User Support for access. We'll provide a PDF copy for your screen reader.
Preview not available
Random digits are collected one at a time until a given k-digit sequence is obtained, or, more generally, until one of several k-digit sequences is obtained. In the former case, a recursive formula is given, which determines the distribution of the waiting time until the sequence is obtained and leads to an expression for the probability generating function. In the latter case, the mean waiting time is given until one of the given sequences is obtained, or, more generally, until a fixed number of sequences have been obtained, either different sequences or not necessarily different ones. Several results are known before, but the methods of proof seem to be new.
Journal of Applied Probability © 1982 Applied Probability Trust