Frustration solitaire
| dc.creator | Doyle, Peter G. | |
| dc.creator | Grinstead, Charles M. | |
| dc.creator | Snell, J. Laurie | |
| dc.date | 2007-03-29 | |
| dc.date | 2009-04-02 | |
| dc.date.accessioned | 2026-07-07T12:59:13Z | |
| dc.date.available | 2026-07-07T12:59:13Z | |
| dc.description | In this expository article, we discuss the rank-derangement problem, which asks for the number of permutations of a deck of cards such that each card is replaced by a card of a different rank. This combinatorial problem arises in computing the probability of winning the game of `frustration solitaire'. The solution is a prime example of the method of inclusion and exclusion. We also discuss and announce the solution to Montmort's `Probleme du Treize', a related problem dating back to circa 1708. | |
| dc.description | Version dated 2 April 2009; GNU FDL. This revised version incorporates corrections requested by Steven Langfelder to the historical remarks | |
| dc.identifier | https://arxiv.org/abs/math/0703900 | |
| dc.identifier | http://arxiv.org/abs/math/0703900 | |
| dc.identifier | UMAP Journal, vol 16 (1995), pp. 137-145 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/225503 | |
| dc.subject | Probability | |
| dc.title | Frustration solitaire | |
| dc.type | text |