Course: Discrete Mathematics 1

» List of faculties » PRF » KAG
Course title Discrete Mathematics 1
Course code KAG/DM1
Organizational form of instruction Lecture + Lesson
Level of course Bachelor
Year of study not specified
Semester Winter
Number of ECTS credits 4
Language of instruction Czech, English
Status of course Compulsory
Form of instruction Face-to-face
Work placements This is not an internship
Recommended optional programme components None
Course availability The course is available to visiting students
Lecturer(s)
  • Lachman Dominik, Mgr.
Course content
1. General proof principles: mathematical induction, the sum, product, complement, and bijection principles. 2. Basic concepts of combinatorics: variations, permutations, combinations. 3. Combinatorial identities: Pascal?s triangle, the binomial theorem and its consequences, various identities involving binomial coefficients. 4. Lattice paths: deriving identities via path counting, the reflection principle, Catalan numbers and their significance in combinatorics. 5. Stirling numbers of the second kind and related enumerative problems. 6. Permutations: the relationship between permutations and symmetries of geometric figures, decomposition of permutations into transpositions, the sign of a permutation and its properties, applications in mathematical puzzles. 7. The Pigeonhole Principle and its application in various types of problems. 8. Principle of inclusion and exclusion: counting permutations without fixed points, the number of surjective mappings, Euler?s totient function. 9. Combinatorics of partitions: an introduction to the theory of integer partitions and fundamental results.

Learning activities and teaching methods
unspecified
Learning outcomes
The course aims to introduce students to the basic methods and principles of combinatorics and to develop their ability to accurately count and analyze discrete structures.

Prerequisites
unspecified

Assessment methods and criteria
unspecified
- Attendance at exercises and submission of assigned homework. - Successful completion of two tests.
Recommended literature
  • Bóna M. (2017). A walk through combinatorics: an introduction to enumeration and graph theory. World Scientific.
  • HERMAN, J., KUČERA, R., ŠIMŠA, J. (1997). Metody řešení matematických úloh II. Brno.
  • MATOUŠEK, J., NEŠETŘIL, J. (2009). Invitation to Discrete Mathematics. Oxford University Press.
  • Matoušek, J., Nešetřil, J. (2009). Kapitoly z diskrétní matematiky. Praha: Karolinum.
  • Švrček J. (2003). Úvod do kombinatoriky. VUP OLomouc.


Study plans that include the course
Faculty Study plan (Version) Category of Branch/Specialization Recommended year of study Recommended semester
Faculty: Faculty of Science Study plan (Version): Mathematics (2020) Category: Mathematics courses 1 Recommended year of study:1, Recommended semester: Winter