Adaptation DM 20-21 — различия между версиями
| Строка 26: | Строка 26: | ||
|| 23.10.20 || Divisibility. Great common dividers.|| [https://drive.google.com/file/d/1U0gZdpLF6LrRdKiHPmb8Jl0Yuc1G4oU3/view?usp=sharing PS 5] || | || 23.10.20 || Divisibility. Great common dividers.|| [https://drive.google.com/file/d/1U0gZdpLF6LrRdKiHPmb8Jl0Yuc1G4oU3/view?usp=sharing PS 5] || | ||
|- | |- | ||
| − | || 30.10.20 || The Euclidean algorithm. Bezout equations. || [https://drive.google.com/file/d/1MVjpyg-m5fTHTajUWNGwVHI2qbHAgmWj/view?usp=sharing PS 6] || | + | || 30.10.20 || The Euclidean algorithm. Bezout equations. || [https://drive.google.com/file/d/1MVjpyg-m5fTHTajUWNGwVHI2qbHAgmWj/view?usp=sharing PS 6] || [https://drive.google.com/file/d/1cZ5k64kPsxg-tmgbbxBZ-SNYNlZ5eVw4/view?usp=sharing Notes 6] |
|- | |- | ||
| − | || 6.11.20 || Euler's and Fermat's Little Theorems || [https://drive.google.com/file/d/1y1Vg2j6bXRvK3I3bOnrMuBV75QfR6-Zq/view?usp=sharing PS 7] || | + | || 6.11.20 || Euler's and Fermat's Little Theorems || [https://drive.google.com/file/d/1y1Vg2j6bXRvK3I3bOnrMuBV75QfR6-Zq/view?usp=sharing PS 7] ||[https://drive.google.com/file/d/1Ez2qbJ2S5R8N3aW-FICGjMhgd7gbEXS9/view?usp=sharing Notes 7] |
|- | |- | ||
| − | || 13.11.20 || Bezout equalities and sotition of congruences || [https://drive.google.com/file/d/1T1POBCTXMVUgdHBxtr3KatnZC6jPMGV4/view?usp=sharing PS 8] || | + | || 13.11.20 || Bezout equalities and sotition of congruences || [https://drive.google.com/file/d/1T1POBCTXMVUgdHBxtr3KatnZC6jPMGV4/view?usp=sharing PS 8] ||[https://drive.google.com/file/d/1xO3eUBxxC01sBqAM3NpJ5xZsw12JJftt/view?usp=sharing Notes 8] |
|- | |- | ||
|| 20.11.20 || Logics, induction and number theory || [https://drive.google.com/file/d/1huwfDBQkGTujwaypXbhVN_Vkh1X4YaGD/view?usp=sharing PS 9] || | || 20.11.20 || Logics, induction and number theory || [https://drive.google.com/file/d/1huwfDBQkGTujwaypXbhVN_Vkh1X4YaGD/view?usp=sharing PS 9] || | ||
Версия 14:50, 20 ноября 2020
General Information
The main goal of the Discrete Mathematics Adaptation Course is to help students keep up with the course curriculum by discussing the most important and challenging topics in detail. The second very important goal of the course is to teach students to work competently with mathematical definitions and proofs, correctly logically build solutions to problems and prove statements. The topics of the course are coordinated with the "basic" course of the DSBA and SE program, but its study will also be useful for the direction of AMI. The approximate order of topics is sets and logic, combinatorics, functions and relations, graphs, the beginning of number theory, the foundations of probability theory, generating functions.
Schedule
The classes are organised online on Fridays at 11:10.
Course materials
First semester
| Date | Topic | Problem Set | Class notes |
|---|---|---|---|
| 25.09.20 | Statements, connectives, quantifiers | PS 1 | |
| 2.10.20 | Logics and inductive definitions | The same PS | |
| 9.10.20 | Mathematical Induction. Formal Proofs. | PS 3 | |
| 16.10.20 | Divisibity. | PS 4 | |
| 23.10.20 | Divisibility. Great common dividers. | PS 5 | |
| 30.10.20 | The Euclidean algorithm. Bezout equations. | PS 6 | Notes 6 |
| 6.11.20 | Euler's and Fermat's Little Theorems | PS 7 | Notes 7 |
| 13.11.20 | Bezout equalities and sotition of congruences | PS 8 | Notes 8 |
| 20.11.20 | Logics, induction and number theory | PS 9 |
