FI:MB104 Discrete mathematics - Course Information
MB104 Discrete mathematics
Faculty of InformaticsSpring 2020
- Extent and Intensity
- 2/2/0. 4 credit(s) (plus extra credits for completion). Type of Completion: zk (examination).
- Teacher(s)
- prof. RNDr. Jan Slovák, DrSc. (lecturer)
doc. Lukáš Vokřínek, PhD. (lecturer)
Mgr. Martin Dzúrik (seminar tutor)
Mgr. Jonatan Kolegar (seminar tutor)
Mgr. Radka Penčevová (seminar tutor)
Mgr. Tomáš Svoboda (seminar tutor)
Mgr. Mária Šimková (seminar tutor)
Mgr. Andrej Tokarčík (seminar tutor)
Mgr. Dominik Trnka (seminar tutor)
Mgr. Jana Volaříková, Ph.D. (seminar tutor)
Mgr. Michal Bulant, Ph.D. (assistant)
doc. RNDr. Martin Čadek, CSc. (assistant)
Mgr. Martin Panák, Ph.D. (assistant) - Guaranteed by
- prof. RNDr. Jan Slovák, DrSc.
Faculty of Informatics
Supplier department: Faculty of Science - Timetable
- Mon 17. 2. to Fri 15. 5. Wed 8:00–9:50 D1
- Timetable of Seminar Groups:
MB104/02: Mon 17. 2. to Fri 15. 5. Thu 8:00–9:50 A320, J. Kolegar
MB104/03: Mon 17. 2. to Fri 15. 5. Thu 10:00–11:50 A320, J. Kolegar
MB104/04: Mon 17. 2. to Fri 15. 5. Tue 12:00–13:50 B204, T. Svoboda
MB104/05: Mon 17. 2. to Fri 15. 5. Tue 14:00–15:50 B204, T. Svoboda
MB104/06: Mon 17. 2. to Fri 15. 5. Tue 18:00–19:50 B204, M. Dzúrik
MB104/07: Mon 17. 2. to Fri 15. 5. Wed 16:00–17:50 B204, M. Dzúrik
MB104/08: Mon 17. 2. to Fri 15. 5. Wed 18:00–19:50 B204, M. Dzúrik
MB104/09: Mon 17. 2. to Fri 15. 5. Thu 12:00–13:50 A320, D. Trnka
MB104/10: Mon 17. 2. to Fri 15. 5. Thu 16:00–17:50 A320, D. Trnka
MB104/11: Mon 17. 2. to Fri 15. 5. Thu 18:00–19:50 A320, D. Trnka - Prerequisites
- ! MB204 Discrete mathematics B && !NOW( MB204 Discrete mathematics B )
High school mathematics. Elementary knowledge of algebraic and combinatorial tasks (in the extent of MB101 or MB102). - Course Enrolment Limitations
- The course is also offered to the students of the fields other than those the course is directly associated with.
- fields of study / plans the course is directly associated with
- Image Processing and Analysis (programme FI, N-VIZ)
- Applied Informatics (programme FI, B-AP)
- Bioinformatics and systems biology (programme FI, N-UIZD)
- Bioinformatics (programme FI, B-AP)
- Computer Games Development (programme FI, N-VIZ_A)
- Computer Graphics and Visualisation (programme FI, N-VIZ_A)
- Computer Networks and Communications (programme FI, N-PSKB_A)
- Cybersecurity Management (programme FI, N-RSSS_A)
- Economics (programme ESF, M-EKT)
- Formal analysis of computer systems (programme FI, N-TEI)
- Graphic design (programme FI, N-VIZ)
- Graphic Design (programme FI, N-VIZ_A)
- Hardware Systems (programme FI, N-PSKB_A)
- Hardware systems (programme FI, N-PSKB)
- Image Processing and Analysis (programme FI, N-VIZ_A)
- Information security (programme FI, N-PSKB)
- Informatics with another discipline (programme FI, B-EB)
- Informatics with another discipline (programme FI, B-FY)
- Informatics with another discipline (programme FI, B-IO)
- Informatics with another discipline (programme FI, B-MA)
- Informatics with another discipline (programme FI, B-TV)
- Informatics (programme FI, B-INF) (2)
- Public Administration Informatics (programme FI, B-AP)
- Informatics in education (programme FI, B-IVV) (2)
- Information Security (programme FI, N-PSKB_A)
- Quantum and Other Nonclassical Computational Models (programme FI, N-TEI)
- Computer graphics and visualisation (programme FI, N-VIZ)
- Computer Graphics and Image Processing (programme FI, B-IN)
- Computer Networks and Communication (programme FI, B-IN)
- Computer Networks and Communications (programme FI, N-PSKB)
- Computer Systems and Data Processing (programme FI, B-IN)
- Principles of programming languages (programme FI, N-TEI)
- Programming and development (programme FI, B-PVA)
- Programmable Technical Structures (programme FI, B-IN)
- Embedded Systems (programme FI, N-IN)
- Cybersecurity management (programme FI, N-RSSS)
- Services development management (programme FI, N-RSSS)
- Software Systems Development Management (programme FI, N-RSSS)
- Services Development Management (programme FI, N-RSSS_A)
- Service Science, Management and Engineering (programme FI, N-AP)
- Social Informatics (programme FI, B-AP)
- Software Systems Development Management (programme FI, N-RSSS_A)
- Software Systems (programme FI, N-PSKB_A)
- Software systems (programme FI, N-PSKB)
- Machine learning and artificial intelligence (programme FI, N-UIZD)
- Teacher of Informatics and IT administrator (programme FI, N-UCI)
- Informatics for secondary school teachers (programme FI, N-UCI) (2)
- Computer Games Development (programme FI, N-VIZ)
- Processing and analysis of large-scale data (programme FI, N-UIZD)
- Natural language processing (programme FI, N-UIZD)
- Course objectives
- At the end of this course, students should be able to:
understand and use methods of number theory to solve simple tasks;
understand approximately how results of number theory are applied in cryptography:
understand basic computational context;
model and solve simple combinatorial problems. - Syllabus
- Number theory:
- divisiblity (gcd, extended Euclid algorithm, Bezout); numerics of big numbers (gcd, modular exponential); prime numbers (properties, basic theorems of arithmetics, factorization, prime number testing (Rabin-Miller, Mersenneho prime numbers); congruences (basic properties, small Fermat theorem; Euler theorem; linear congruences; binomial congruences a primitiv roots; discrete logarithm;
- Number theory applications:
- short introduction to asymetric cryptography (RSA, DH, ElGamal, DSA, ECC); basic coding theory (linear and polynomial codes);
- Combinatorics:
- reminder of basics of combinatorics; generalized binomial theorem; combinatorial identities; Catalan numbers; formal power series; (ordinary) generating functions; exponential generating functions; probabilistic generating functions; solving combinatorial problems with the help of generating functions; solving basic reccurences (Fibonacci).
- Literature
- SLOVÁK, Jan, Martin PANÁK and Michal BULANT. Matematika drsně a svižně (Brisk Guide to Mathematics). 1st ed. Brno: Masarykova univerzita, 2013, 773 pp. ISBN 978-80-210-6307-5. Available from: https://dx.doi.org/10.5817/CZ.MUNI.O210-6308-2013. Základní učebnice matematiky pro vysokoškolské studium info
- Bookmarks
- https://is.muni.cz/ln/tag/FI:MB104!
- Teaching methods
- There are standard two-hour lectures and standard tutorial.
- Assessment methods
- During the semester, two obligatory mid-term exams are evaluated (each for max 10 points). In the seminar groups there are tests during the semester being written. The seminars are evaluated in total by max 5 points. The final practical written test for max 20 points. For successful examination (the grade at least E) the student needs to obtain 20 points or more.
- Language of instruction
- Czech
- Further Comments
- Study Materials
The course is taught annually.
- Enrolment Statistics (recent)
- Permalink: https://is.muni.cz/course/fi/spring2020/MB104