Explicit Expressions for a Class of Permutation Problems
Canadian mathematical bulletin, Tome 7 (1964) no. 3, pp. 345-350
Voir la notice de l'article provenant de la source Cambridge University Press
The purpose of this paper is to give some explicit formulae for probability problems such as those dealing with maximum runs upon tossing a coin n times in succession. Although the actual computation involved is quite lengthy, and generating functions can be used for approximations, the lemmas obtained may be of some interest in themselves.
Abramson, Morton. Explicit Expressions for a Class of Permutation Problems. Canadian mathematical bulletin, Tome 7 (1964) no. 3, pp. 345-350. doi: 10.4153/CMB-1964-031-5
@article{10_4153_CMB_1964_031_5,
author = {Abramson, Morton},
title = {Explicit {Expressions} for a {Class} of {Permutation} {Problems}},
journal = {Canadian mathematical bulletin},
pages = {345--350},
year = {1964},
volume = {7},
number = {3},
doi = {10.4153/CMB-1964-031-5},
url = {http://geodesic.mathdoc.fr/articles/10.4153/CMB-1964-031-5/}
}
[1] 1. Feller, W., An Introduction to Probability Theory and Its Applications, Vol. 2, 2nd Edition, John Wiley, N. Y., Chapt. XI, p.260. Google Scholar
[2] 2. Kaplansky, I., Solution of the "Problème"des Ménages", Bull. Amer. Math. Soc., Vol. 49 (1943), pp. 784–785. Google Scholar
[3] 3. Mendelsohn, N. S., The Asymptotic Series for a Certain Class of Permutation Problems, Canadian Journal of Math., Vol. 8(1956), p. 238. Google Scholar
Cité par Sources :