Abstract
Choose m numbers from the set {1, 2, …, n} at random without replacement. In this paper we first establish the limiting distribution of the longest length of consecutive integers and then apply the result to test randomness of selecting numbers without replacement.
Similar content being viewed by others
References
Mood, A. M.: The distribution theory of runs. The Annals of Mathematical Statistics, 11, 367–392 (1940)
Wald, A., Wolfowitz, J.: On a test whether two samples are from the same polulation. The Annals of Mathematical Statistics, 11, 147–162 (1940)
Bateman, G.: On the power functions of the longest run as a test for randomness in a sequence of alternatives. Biometrika, 35, 97–112 (1948)
Burr, E. J., Cane, G.: Longest run of consecutive observations having a specified attribute. Biometrika, 48, 461–465 (1961)
Földes, A.: The limit distribution of the length of the longest head-run. Periodica Mathematica Hungarica, 10, 301–310 (1979)
Fu, J. C., Wang, L. Q., Lou, W. Y. W.: On exact and large deviation approximation for the distribution of the longest run in a sequence of two-state Markov dependent trials. J. Appl. Prob., 40, 346–360 (2003)
József, T.: Limit theorems for the longest run. Annales Mathematicae et Informaticae, 36, 133–141 (2009)
Author information
Authors and Affiliations
Corresponding author
Additional information
Dedicated to Professor Hua Loo-keng on his 100th birth anniversary
The first author is supported by National Natural Science Foundation of China (Grant Nos. 10601047, 11001070) and Zhejiang Provincial Natural Science Foundation of China (Grant No. J20091364); the second author is partially supported by Hong Kong RGC CERG (Grant Nos. 602608 and 603710)
Rights and permissions
About this article
Cite this article
Zhao, M.Z., Shao, QM. On the longest length of consecutive integers. Acta. Math. Sin.-English Ser. 27, 329–338 (2011). https://doi.org/10.1007/s10114-011-0496-7
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10114-011-0496-7