Logo ČVUT
CZECH TECHNICAL UNIVERSITY IN PRAGUE
STUDY PLANS
2024/2025

Discrete Mathematics 3

The course is not on the list Without time-table
Code Completion Credits Range Language
01DIMA3 ZK 2 2P+0C Czech
Garant předmětu:
Lecturer:
Tutor:
Supervisor:
Department of Mathematics
Synopsis:

Students get to know problems and methods of their solving from various parts of discrete mathematics.

The seminar includes individual problem solving of one’s own choice from the given literature.

Requirements:
Syllabus of lectures:

1. Three applications of Euler’s formula

2. Latin squares

3. Lattices: Pick‘s and Minkowski‘s theorem

4. Money exchange problem

5. Applications of Dirichlet’s principle

6. Isoperimetric problems

7. Integer optimization

8. Useful inequalities

9. Proofs of irrationality of some numbers

10. Antichains and systems of various representations

Syllabus of tutorials:
Study Objective:
Study materials:

Key references:

[1] M. Aigner, G. M. Ziegler, Proofs from the Book, Springer-Verlag 2004

[2] A. T. Benjamin, J. J. Quinn, Proofs that Really Count, The Art of Combinatorial Proof, The Mathematical

Association of America, 2003.

[3] V. Kumar: Discrete Mathematics, BPB Publications, 2018.

Recommended references:

[4] Kombinatorické počítání 1999 , KAM-DIMATIA Series preprint no. 451 (1999), 59 p

Note:
Further information:
No time-table has been prepared for this course
The course is a part of the following study plans:
Data valid to 2024-04-17
Aktualizace výše uvedených informací naleznete na adrese https://bilakniha.cvut.cz/en/predmet6931706.html