Skip to the main content

Osječki matematički list, Vol. 23 No. 2, 2023.

Professional paper

A bit of combinatorics

Petar Žugec orcid id 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

* Corresponding author.

Full text: croatian pdf 1.678 Kb

page 147-159

downloads: 222

cite

Abstract

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.

Keywords

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

Hrčak ID:

311968

URI

https://hrcak.srce.hr/311968

Publication date:

21.12.2023.

Article data in other languages: croatian

Visits: 713 *