Abstract: A derangement is a permutation with no fixed points (i.e.no element that appears in its original position). The problem of counting derangements was introduced by de Montmort in 1708 and ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results