Skoči na glavni sadržaj

Osječki matematički list, Vol. 17 No. 2, 2017.

Stručni rad

Le problème des rencontres

Snježana Majstorović orcid id orcid.org/0000-0002-3083-0932 ; Odjel za matematiku, Trg Lj. Gaja 6, Osijek
Katarina Vincetić ; Odjel za matematiku, Trg Lj. Gaja 6, Osijek

Puni tekst: hrvatski pdf 635 Kb

str. 109-123

preuzimanja: 1.700

citiraj

Sažetak

Le problème des rencontres deals with counting derangements of a set with n elements, that is, it deals with the number \(D_{n}\) of permutations of an n-element set without fixed points. Formula for \(D_{n}\) is known for more than 300 years, but it is special because of the variety of ways how to derive it. The main goal of this paper is to present the problem of derangements and offer several interesting proofs of the formula for \(D_{n}\).

Ključne riječi

derangement; permanent of a matrix; recurrence; generating function; inclusion-exclusion principle

Hrčak ID:

190875

URI

https://hrcak.srce.hr/190875

Datum izdavanja:

19.12.2017.

Podaci na drugim jezicima: hrvatski

Posjeta: 2.647 *