hrcak mascot   Srce   HID

Stručni rad

Le problème des rencontres

Snježana Majstorović   ORCID icon 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: 502* citiraj
APA 6th Edition
Majstorović, S. i Vincetić, K. (2017). Totalna zbrka. Osječki matematički list, 17 (2), 109-123. Preuzeto s https://hrcak.srce.hr/190875
MLA 8th Edition
Majstorović, Snježana i Katarina Vincetić. "Totalna zbrka." Osječki matematički list, vol. 17, br. 2, 2017, str. 109-123. https://hrcak.srce.hr/190875. Citirano 14.12.2019.
Chicago 17th Edition
Majstorović, Snježana i Katarina Vincetić. "Totalna zbrka." Osječki matematički list 17, br. 2 (2017): 109-123. https://hrcak.srce.hr/190875
Harvard
Majstorović, S., i Vincetić, K. (2017). 'Totalna zbrka', Osječki matematički list, 17(2), str. 109-123. Preuzeto s: https://hrcak.srce.hr/190875 (Datum pristupa: 14.12.2019.)
Vancouver
Majstorović S, Vincetić K. Totalna zbrka. Osječki matematički list [Internet]. 2017 [pristupljeno 14.12.2019.];17(2):109-123. Dostupno na: https://hrcak.srce.hr/190875
IEEE
S. Majstorović i K. Vincetić, "Totalna zbrka", Osječki matematički list, vol.17, br. 2, str. 109-123, 2017. [Online]. Dostupno na: https://hrcak.srce.hr/190875. [Citirano: 14.12.2019.]

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

[hrvatski]

Posjeta: 688 *