|
Lecturer(s)
|
|
|
|
Course content
|
1. General combinatorial principles. 2. Variations, permutations, combinations (with repetition), the polynomial formula. 3. The Inclusion and Exclusion principle. 4. Combinatorial identities and their applications. 5. The Pigeonhole principle and its applications. 6. Distributions and partitions, partition of sets, Ferrer's graph, Bell's numbers, the Euler-Legendre theorem.
|
|
Learning activities and teaching methods
|
|
Lecture, Dialogic Lecture (Discussion, Dialog, Brainstorming)
|
|
Learning outcomes
|
Understanding to base of combinatorial principles.
1. Knowledge Describe basic principles and methods of combinatorics
|
|
Prerequisites
|
unspecified
|
|
Assessment methods and criteria
|
Seminar Work
Credit: the student has to solve 10 combinatorial problems (homework) assigned during the course and has to pass one written test (i.e. to obtain at least half of the possible points).
|
|
Recommended literature
|
-
Herman J., Kučera R., Šimša J. (1997). Metody řešení matematických úloh II. MU Brno.
-
Chen C. C., Koh K. M. (2004). Principles and Techiques in Combinatorics. World Scientific New Jersey.
-
Markus A. (1988). Combinatorics (a Problem Oriented Approach). MAA Washington.
-
Mladenovič P. (1992). Kombinatorika. Beograd.
-
Riordan J. (1968). Combinatorial Identities. New York.
-
Švrček J. (2003). Úvod do kombinatoriky. VUP OLomouc.
|