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
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/}
}
Cité par Sources :