No CrossRef data available.
Article contents
Simulation of the Matching Problem of Montmort
Published online by Cambridge University Press: 27 July 2009
Abstract
This note presents an efficient algorithm for the simulation of the number of invariant positions in a random permutation of the integers 1,..., n. An application to the famous matching problem of Montmort is discussed.
- Type
- Research Article
- Information
- Probability in the Engineering and Informational Sciences , Volume 12 , Issue 3 , July 1998 , pp. 325 - 328
- Copyright
- Copyright © Cambridge University Press 1998