Pregled bibliografske jedinice broj: 876568
A Short Combinatorial Proof of Derangement Identity
A Short Combinatorial Proof of Derangement Identity // Elemente der Mathematik, 73 (2018), 1; 29-33 (podatak o recenziji nije dostupan, članak, znanstveni)
CROSBI ID: 876568 Za ispravke kontaktirajte CROSBI podršku putem web obrasca
Naslov
A Short Combinatorial Proof of Derangement Identity
Autori
Stanić, Dajana ; Martinjak, Ivica
Izvornik
Elemente der Mathematik (0013-6018) 73
(2018), 1;
29-33
Vrsta, podvrsta i kategorija rada
Radovi u časopisima, članak, znanstveni
Ključne riječi
derangements, rencontres numbers, recurrence relation, factorial, binomial coefficient
Sažetak
The $n$-th rencontres number with the parameter $r$ is the number of permutations having exactly $r$ fixed points. In particular, a derangement is a permutation without any fixed point. We presents a short combinatorial proof for a weighted sum derangement identities.
Izvorni jezik
Engleski
Znanstvena područja
Matematika
POVEZANOST RADA
Ustanove:
Prirodoslovno-matematički fakultet, Zagreb
Profili:
Ivica Martinjak
(autor)
Citiraj ovu publikaciju:
Časopis indeksira:
- Web of Science Core Collection (WoSCC)
- Emerging Sources Citation Index (ESCI)
