CTU FEE Moodle
Discrete Mathematics
B232 - Summer 23/24
This course is not present in Moodle. You can visit its homepage by clicking the "Course page (outside Moodle)" button on the right (if available).
Discrete Mathematics - B4B01DMA
| Credits | 5 |
| Semesters | Winter |
| Completion | Assessment + Examination |
| Language of teaching | Czech |
| Extent of teaching | 2P+2S |
Annotation
In this course students meet some important topics from the field of discrete mathematics. Namely, they will explore divisibility and calculations modulo n, diophantine equations, binary relations, mappings, cardinality of sets, induction, and recurrence equations. The second aim of this course is to teach students the language of mathematics, both passively and actively, and introduce them to mathematics as science.
Study targets
No data.
Course outlines
1. Divisibility, Euclid's algorithm.
2. Calculations modulo n, the set Zn of integers modulo n.
3. Diophantine equations, congruence equations and systems.
4. Binary relations and their basic properties.
5. Special relations: partial ordering and equivalence.
6. Mappings. Cardinality of sets, countable and uncountable sets.
7. Matematical induction and its applications.
8. Sequences and sums, asymptotic gowth.
9. Linear recurrence equations.
10. Computatinal complexity of algorithms, the Master theorem.
11. The inclustion and exclusion principle.
2. Calculations modulo n, the set Zn of integers modulo n.
3. Diophantine equations, congruence equations and systems.
4. Binary relations and their basic properties.
5. Special relations: partial ordering and equivalence.
6. Mappings. Cardinality of sets, countable and uncountable sets.
7. Matematical induction and its applications.
8. Sequences and sums, asymptotic gowth.
9. Linear recurrence equations.
10. Computatinal complexity of algorithms, the Master theorem.
11. The inclustion and exclusion principle.
Exercises outlines
1. Divisibility, Euclid's algorithm.
2. Calculations modulo n, the set Zn of integers modulo n.
3. Diophantine equations, congruence equations and systems.
4. Binary relations and their basic properties.
5. Special relations: partial ordering and equivalence.
6. Mappings. Cardinality of sets, countable and uncountable sets.
7. Matematical induction and its applications.
8. Sequences and sums, asymptotic gowth.
9. Linear recurrence equations.
10. Computatinal complexity of algorithms, the Master theorem.
11. The inclustion and exclusion principle.
2. Calculations modulo n, the set Zn of integers modulo n.
3. Diophantine equations, congruence equations and systems.
4. Binary relations and their basic properties.
5. Special relations: partial ordering and equivalence.
6. Mappings. Cardinality of sets, countable and uncountable sets.
7. Matematical induction and its applications.
8. Sequences and sums, asymptotic gowth.
9. Linear recurrence equations.
10. Computatinal complexity of algorithms, the Master theorem.
11. The inclustion and exclusion principle.
Literature
[1] K.H.Rosen: Discrete matematics and its aplications, McGraw-Hill, 1998.
Requirements
High-school mathematics and ability to think.