Skip to main content Accessibility help
×
Home

Simulation of the Matching Problem of Montmort

  • Frans Schalekamp (a1)

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.

Copyright

References

Hide All
1.de Montmort, P.R. (1708). Essay d'analyse sur les jeux de hazard. Paris: J. Quillan.
2.Ross, S.M. (1997). Simulation, 2nd ed.Orlando: Academic Press.
3.Ross, S.M. (1997). Introduction to probability models, 6th ed.Orlando: Academic Press.

Related content

Powered by UNSILO

Simulation of the Matching Problem of Montmort

  • Frans Schalekamp (a1)

Metrics

Full text views

Total number of HTML views: 0
Total number of PDF views: 0 *
Loading metrics...

Abstract views

Total abstract views: 0 *
Loading metrics...

* Views captured on Cambridge Core between <date>. This data will be updated every 24 hours.

Usage data cannot currently be displayed.