## With Safari, you learn the way you learn best. Get unlimited access to videos, live online training, learning paths, books, tutorials, and more.

No credit card required

## Solving Montmort’s Problem by Recursion

An alternative, everyday formulation of the President/term matching problem discussed in the introduction is the so-called Dinner Problem :

Suppose n people are invited to a dinner party. Seats are assigned and a name card made for each guest. However, floral arrangements on the table unexpectedly obscure the name cards. When the n guests arrive, they seat themselves randomly [for a more precise explanation of just what “random seating” means, read on]. What is the probability that no guest sits in his or her assigned seat?

This is vos Savant’s president/term matching problem with the presidents ...

## With Safari, you learn the way you learn best. Get unlimited access to videos, live online training, learning paths, books, interactive tutorials, and more.

No credit card required