ABSTRACT
One of the classical combinatorial problems in the theory of probability
is the famous problem of coincidences (probleme des recontres), which con-
stitutes in the computation of the ways of putting n cards, numbered from
1 to n, in a series so that, in a given number of cards their position coincides
with their number. This problem was initially formulated in the particular
case n = 13 by Montmort (1678 - 1719) and then in the general case by De
Moivre (1667 - 1754), whose solution essentially constitutes an application
of the inclusion and exclusion principle. Later, several reformulations and
generalizations of this problem were followed.
