Stručni rad

A bit of combinatorics

Petar Žugec orcid.org/0000-0001-6933-3100 ; Fizički odsjek, Prirodoslovno-matematički fakultet, Sveučilište u Zagrebu
Eric Andreas Vivoda ; Fizički odsjek, Prirodoslovno-matematički fakultet, Sveučilište u Zagrebu

Sažetak

We find the number of words that can be composed by avoiding a
consecutive appearance of two selected characters. We make use of the
recurrence relations in solving the problem, after a short review on the
history of their use.

Ključne riječi

enumeration, recurrence relations, initial values, expected value, variance, statistical uncertainty

Hrčak ID:

311968

URI

https://hrcak.srce.hr/311968

Datum izdavanja:

21.12.2023.

Podaci na drugim jezicima: hrvatski

Posjeta: 210 *