Wiki - Факультет компьютерных наук - Вклад [ru]

Discrete Mathematics 1 DSBA 2026/2027

2026-09-15T14:34:33Z

Brdan: /* Assignment deadlines */

== Instructors ==

=== The lecturer ===
My name is Evgeny Dashkov. Feel free to contact me via email: edashkov@gmail.com, [https://t.me/edashkov Telegram], or [https://vk.com/evgeny.v.dashkov VK].

My Assistant (the person responsible for the tables etc.): [https://t.me/simonenko_fedor Fedor Simonenko].

=== Seminar Instructors and Teaching Assistants ===
{| class="wikitable" style="text-align:center"
|-
! Group !! 261 !! 262 !! 263 !! 264 !! 265 !! 266 !! 267
|-
|| Teachers || [https://t.me/edashkov Evgeny Dashkov] ||colspan="2"| [https://t.me/brdann Boris Danilov]|| [https://t.me/Palananya95 Ananya Pal] || [https://t.me/Astana_G Dmitry Gayfullin] || [https://t.me/Palananya95 Ananya Pal] || [https://t.me/Alyona_Chislova Alyona Chislova]
|-
|| Teaching Assistants || [https://t.me/crazyglue Sofya Shapovalova] || [https://t.me/LaBarBoss Ilya Strigunkov] || [https://t.me/danyadrain Danila Makarov] || [https://t.me/ Arina Zhuzhoma] || [https://t.me/darlumink Elizaveta Kadurina] || [https://t.me/anradx Angelina Radaeva] || [https://t.me/christi_dt Kristina Depershmidt]
|}

=== Whom should I ask? ===

If you have a question or comment concerning the mathematical content of our course, it is best to post it to our [https://t.me/joinchat/T_YTN4IG1vAJNWT9 student chat]. Alternatively, you may address your question to your Teaching Assistant, Seminar Instructor or the Lecturer (say, if your question discloses an important idea for a HW problem). It is much better to ask and get to know than not to ask and remain ignorant. '''Please do not hesitate to ask your mathematical questions!'''

If you need a more detailed consultation concerning the course's mathematics, please be informed that our Teaching Assistants usually hold periodic consultations while the Seminar Instructors and Lecturer have some designated time for counseling students. Still, the best thing to do is to arrange a consultation in advance via a personal communication.

Homework-grading related questions should be directed to your teaching assistant first; then to your seminar instructor and to the lecturer just in case of any disagreement.

Organizational, administrative, legal or paperwork questions must be addressed to the Student Service Center, Study Office or other relevant offices first and foremost. If you have been redirected to us with such a question nevertheless, please contact the Lecturer's Assistant first.

== Current performance ==

[https://docs.google.com/spreadsheets/d/1JOCrwoDelBSHuMzes5o1jI8mKYS0h_ukFXNCwrPCFGw/edit?usp=sharing The Table].

== Homework ==
The homework includes a few problem sets, one in a fortnight or so (the deadlines are announced on giving each set). Every problem set consists of about 10 – 15 problems. These sets may be subdivided further for students’ convenience.

We expect you to try solving '''every''' homework problem. Nevertheless, in Modules 2 and 3 we are going to grade the solutions of about one quarter of all problems. The problems chosen to be graded will be the same for all students and our choice will be revealed past the deadline for each respective problem set.

Still, we suggest you try solving '''every''' homework problem. In particular, some of these problems will be given as special 'homework tests' to be held in class. The tests are scheduled to Modules 2 and 3 late weeks.

A student may be required to 'defend' (i.e., to explain orally) his written solution to any problem. His grade for the problem may be decreased if he fails to do so properly.

== Exam 1 ==
A written examination is held past Module 1. Students may not consult any sources during the exam. The examination takes about 120 minutes. An integer weight is assigned to every problem.

== Colloquium ==
An oral colloquium is held at the beginning of Module 3. Each student is given two questions concerning statements and definitions as well as one question requiring a proof. After no less than 45 minutes of preparation (when using any literature is allowed), the student is required to answer ‘from scratch’, that is, with no recourse to any materials. The examiner may pose additional questions as he sees fit.

'''Please find the question list and rules [https://drive.google.com/file/d/1aoaj_Do8m2jm2nGGfSANRT9KKZvzgJGt/view?usp=drive_link here]'''.

== Exam 2 ==
A written examination is held past Module 3. Students may not consult any sources during the exam. The examination takes about 120 minutes. An integer weight is assigned to every problem.

== Bonus activities ==
Throughout the course, the students may be graded for a variety of ‘bonus activities’ (like quizzes, etc.) either offline or online.

== Course materials ==

Course chats are our primary outlet for course announcements, questions, and discussions. '''Please join these!'''

[https://max.ru/join/ckD-9Qf-bVBp8jJCLbdxcUh09RwXfT9SU4pZ92HqvfE Max]

[https://t.me/joinchat/T_YTN4IG1vAJNWT9 Telegram].

=== Lecture notes ===

[https://drive.google.com/file/d/1mmNLLQ0--EDihGNRKwSyXLOA1KL7A0lD/view?usp=sharing Original English version]

[https://drive.google.com/drive/folders/1cTCdJtVVtO9uDgIKE8HY0qhl285tzOo1?usp=drive_link A Russian translation by volunteering students] (you are welcome to [https://t.me/sigma_algebraa join] their ranks)

=== Classes recordings ===

=== Lecture video archive ===

=== Other resources ===
* [https://tinyurl.com/rwky5vmk The Course's Google Directory]

* [https://www.youtube.com/playlist?list=PL1Uob8iPTHGTidrmrqEHTJ96Pt3-PmML4 Past years' videos]

* We have a [https://meet.edashkov.net.ru dedicated server] to hold an online meeting if we need one.

== Problem sets ==

=== Class problems ===

* [https://drive.google.com/file/d/1EP-diSuOTn9f0ryg18Z2w0xjEp8j0bnl/view?usp=drive_link Problem Set 1]

* [https://drive.google.com/file/d/12ct99-ORd7A94Gh5g4Nf9riv7UqNMSRc/view?usp=drive_link Problem Set 2]

* [https://drive.google.com/file/d/1yKKqLsS99V4AhCYqbjafuav2CMCdQTOQ/view?usp=drive_link Problem Set 3]

* [https://drive.google.com/file/d/1YgH_AdCk4GcKC0KH7xBA4-sUnOYkUvUK/view?usp=drive_link Problem Set 4]

* [https://drive.google.com/file/d/1M556PSgTJOo5W-AxYEXjFu94VfledpF5/view?usp=drive_link Problem Set 5]

* [https://drive.google.com/file/d/1-ylVViaBgzxEM-M7Rvrz2iggtK6UiJTY/view?usp=drive_link Problem Set 6]

* [https://drive.google.com/file/d/15tcTNLW-uFqT2xPJn1imOnEzaGwlaZAq/view?usp=drive_link Problem Set 7]

* [https://drive.google.com/file/d/1N1EuCCe7NIiEa69nXHwncfQG2IOTyzLi/view?usp=drive_link Problem Set 8]

* [https://drive.google.com/file/d/1PmlR2bysnKSZrJle9Dwa4KiB23G5ORdZ/view?usp=drive_link Problem Set 9]

=== Assignment deadlines ===

{| class="wikitable"
|-
! Home problem set !! colspan="11" | Deadline
|-
| || 261 || 262 || 263 || 264 || 265 || 266 || 267
|-
| [https://drive.google.com/file/d/15vCxTrNMwagS4rqQnUzdLParTqOP8y5P/view?usp=drive_link HW1a ] || Sep 17 || Sep 22 || Sep 22 || || || || Sep 23

|}

'''Each deadline is set by the respective group's instructor.'''

== Assessment and Grading ==

=== Homework ===

The homework is graded in three batches: one (HW_A) includes everything to be submitted in Module1, another (HW_B) includes all the problems submitted in other modules '''that we will choose to be graded''' (see Homework section for an explanation). The last batch (HW_Test_B) consists of two in-class tests; each test takes about 80 minutes and contains 6 -- 8 problems from the homework problem sets or very similar to those. For each problem, the student is given a score from 0 to 1 point (in fractional values) according to the progress he made.

The homework graded are computed the following way (before rounding):

HW_A = 10 * (the sum of points given for the problems) / #(problems);
''all the problems are to be graded''.

Grade HW_B is computed similarly but for its respective period of Modules 2 and 3:

HW_B = 10 * (the sum of points given for the problems) / #(problems subject to be graded);
''a few chosen problems are to be graded''.

HW_Test_B = 10 * (the sum of points given for the problems in both the tests) / #(problems in both the tests).

=== Exam1 and the Interim Assessment ===

Each problem solution is graded with a fractional score from 0 to 1 point, and the entire exam with the value (before rounding)

Exam1 = 10 * (p1 * w1 + ... + pn * wn) / (w1 + ... + wn),
where pi is the score and wi is the weight for the i-th problem.

The Interim grade 1 is computed past Module 1 and equals:

Interim1 = round(Interim1'), where

Interim1' = 0.5 * HW_A + 0.5 * Exam1.

(Here and everywhere, rounding is according to the usual arithmetic rules.)

=== Colloquium ===
For each of the 'definition' two questions, the student is given a score from 0 to 2 points, and from 0 to 4 points for the ‘proof’ question (all in fractional values).
The Colloq grade is computed the following way (before rounding):

Colloq = 10 * (the sum of points given) / 8.

=== Bonuses ===
Each student is given a score according to his progress in bonus activities, which results in the grade

Bonus = 10 * #(points given) / #(points possible).

The number of possible points varies but it is between 1 and 25 usually.

=== Exam2, the Second Interim, and the Final Assessment ===
Each problem solution is graded with a fractional score from 0 to 1 point, and the entire exam with the value (before rounding)

Exam2 = 10 * (p1 * w1 + ... + pn * wn) / (w1 + ... + wn),

where pi is the score and wi is the weight for the i-th problem.

The Interim grade 2 is computed past Module 3 and equals:

Interim2 = round(Interim2'), where

Interim2' = 0.085 * HW_B + 0.210 * HW_Test_B + 0.295 * Colloq + 0.06 * Bonus + 0.35 * Exam2.

The final grade for the course is

Final = round(0.3 * Interim1' + 0.7 * Interim 2')

Generally, '''nobody is exempt from the examinations'''.

== Plagiarism regulations ==
Plagiarism, that is, all forms of cheating with doing your academic assignments, including any '''unauthorized help of AI''' or another person, will not be tolerated. In this course, using AI is '''not''' generally authorized. Clearly, we may not have a definitive proof that somebody is cheating (notice, however, that AI-generated solutions to mathematical problems are quite conspicuous if they have not been edited heavily). Therefore, we will reserve the right to ask a suspect student to 'defend' his any written work, that is, to explain it orally and in person. So our regulations stipulate:
<blockquote>
If plagiarism is detected (including material generated with the help of generative AI without prior approval from the teacher), the assessment element will be assigned a score of "0".
If there is a suspicion that the task was not completed independently, the teacher has the right to initiate an additional verification or a defense of this particular assessment element. The final grade for the element will be based on the results of such verification or defense.
The teacher also has the right to randomly invite any student to defend any assessment element, regardless of plagiarism or suspicion. If the student refuses or fails to defend the work, the grade for this element will be annulled and recorded as "0".
</blockquote>
A final word of advice. Using AI regularly (and this is addictive!) instead of your natural intelligence will make you stupid and intellectually impotent in no time---at the price of a slight grade advantage (assuming your cheating goes unpunished). Do you really want it in this competitive world?

== Exam retaking ==
Examinations 1 and 2 are subject to be retaken if either the Interim1 or Final grade, respectively, is unsatisfactory (i.e., < 4). Retaking an exam is similar to the regular examination. The resulting grade is substituted for that of the latter (that is, retake grade is assigned to the variable Exami in the respective formula, whose value is then reevaluated). Those whose Interim or Final grade is still unsatisfactory after the first retake will have a (tough) choice to make.

Please take into account the following regulation according to the ''ПОПАТКУС'':
<blockquote>
On the first and second retakes, the cumulative course grade is taken into consideration. In case of receiving an unsatisfactory final grade after the first retake, the student may refuse to participate in the second retake and instead repeat the course according to the individual curriculum. The cumulative grade is formed again as a result of repeated courses. After completing the repeated course, the student is given a second retake only, which the student previously refused.
</blockquote>

The 'cumulative grade' here means all the variables in the grading formulas except Exami, which are the only ones to be retaken. The 'second retake' is similar to the first one and it is evaluated according to the same formula with the same values of 'cumulative' variables. This poses an obvious risk for anyone whose 'cumulatives' are low!

== Recommended reading ==
''Please notice that '''The Book''' for our Course does not exist. The latter is based on many sources.''

# Anderson J. A., Discrete Mathematics With Combinatorics. Prentice Hall, 2003.
# Biggs N. L., Discrete mathematics. 2nd ed., New York; Oxford: Oxford University Press, 2004.
# Gavrilov G. P., Sapozhenko A. A. Problems and Exercises in Discrete Mathematics. Kluwer Texts in the Mathematical Sciences 14. Springer, 1996.
# [http://courses.csail.mit.edu/6.042/spring17/mcs.pdf Lehman E., Thomson Leighton F., Meyer A. R. Mathematics for Computer Science, 2017.]
# [http://www.cs.elte.hu/~lovasz/dmbook.ps Lovasz L., Vesztergombi K. Discrete Mathematics. Lecture Notes; Yale University, 1999.]
# Melnikov O., Sarvanov V., Tyshkevich R., Yemelichev V., Zverovich I. Exercises in Graph Theory. Kluwer Texts in the Mathematical Sciences 19. Springer, 1998.
# Rosen K. H. Discrete Mathematics and Its Applications. McGraw-Hill, 1999.
# Stein C., Drysdale R. L., Bogart K. Discrete mathematics for computer scientists. Addison-Wesley, 2010.
# Vinogradov I. M. Elements of number theory. Dover, 1954.

=== In Russian ===
''If you understand Russian (by any chance), you will probably benefit from reading the following books.''

# Виноградов И. М. Основы теории чисел. 9-е изд., М.: Наука, 1981.
# [http://rubtsov.su/public/DM-HSE-Draft.pdf Вялый М., Подольский В., Рубцов А., Шварц Д., Шень А. Лекции по дискретной математике.]
# Гаврилов Г. П., Сапоженко А. А. Задачи и упражнения по дискретной математике. 3-е изд., М.: ФИЗМАТЛИТ, 2004.
# [https://drive.google.com/file/d/1RM6KX_reBFwUXesWGUEu0sFn2NCaBgvz/view?usp=sharing Дашков Е. В. Введение в математическую логику. Множества и отношения. М.: МФТИ, 2019.]
# Зубков А. М., Севастьянов Б. А., Чистяков В. П. Сборник задач по теории вероятностей. 2-е изд., М.: Наука, 1989.
# Мельников О. И. Теория графов в занимательных задачах. 5-е изд., М.: Книжный дом "ЛИБРОКОМ", 2013.
# [http://www.mccme.ru/free-books/shen/shen-induction.pdf Шень А., Математическая индукция. 5-е изд, М.: МЦНМО, 2016.]

Discrete Mathematics 1 DSBA 2025/2026

2026-03-15T20:39:19Z

Brdan: /* Assignment deadlines */

== Instructors ==

=== The lecturer ===
My name is Evgeny Dashkov. Feel free to contact me via email: edashkov@gmail.com, [https://t.me/edashkov Telegram], or [https://vk.com/evgeny.v.dashkov VK].

My Assistant (the person responsible for the tables etc.): [https://t.me/almanmaria Maria Krotova].

=== Seminar Instructors and Teaching Assistants ===
{| class="wikitable" style="text-align:center"
|-
! Group !! 251 !! 252 !! 253 !! 254 !! 255 !! 256 !! 257
|-
|| Teachers || [https://t.me/edashkov Evgeny Dashkov] ||colspan="2"| [https://t.me/brdann Boris Danilov]|| colspan="3"| [https://t.me/DiegBuitrago Diego Buitrago] || [https://t.me/carlosbuitrago Carlos Buitrago]
|-
|| Teaching Assistants || [https://t.me/dandelii Maria Samoilova] || [https://t.me/Nixlle Danila Riazanov] || [https://t.me/svnsrg Sergey Savin] || [https://t.me/KinWiz Alexey Popov] || [https://t.me/dm9dj Maxim Kharlan] || [https://t.me/ayratmur Ayrat Murtazin] || [https://t.me/crazyglue Sofya Shapovalova]
|}

=== Whom should I ask? ===

If you have a question or comment concerning the mathematical content of our course, it is best to post it to our [https://t.me/joinchat/T_YTN4IG1vAJNWT9 student chat]. Alternatively, you may address your question to your Teaching Assistant, Seminar Instructor or the Lecturer (say, if your question discloses an important idea for a HW problem). It is much better to ask and get to know than not to ask and remain ignorant. '''Please do not hesitate to ask your mathematical questions!'''

If you need a more detailed consultation concerning the course's mathematics, please be informed that our Teaching Assistants usually hold periodic consultations while the Seminar Instructors and Lecturer have some designated time for counseling students. Still, the best thing to do is to arrange a consultation in advance via a personal communication.

Homework-grading related questions should be directed to your teaching assistant first; then to your seminar instructor and to the lecturer just in case of any disagreement.

Organizational, administrative, legal or paperwork questions must be addressed to the Student Service Center, Study Office or other relevant offices first and foremost. If you have been redirected to us with such a question nevertheless, please contact the Lecturer's Assistant first.

== Current performance ==

[https://docs.google.com/spreadsheets/d/1vRdPzhUjqiDv2rGh9A3hYvtNmo3AkoEUtXMxBgzud9U/edit?usp=sharing The Table].

== Homework ==
The homework includes a few problem sets, one in a fortnight or so (the deadlines are announced on giving each set). Every problem set consists of about 10 – 15 problems. These sets may be subdivided further for students’ convenience.

We expect you to try solving '''every''' homework problem. Nevertheless, in Modules 2 and 3 we are going to grade the solutions of about one quarter of all problems. The problems chosen to be graded will be the same for all students and our choice will be revealed past the deadline for each respective problem set.

Still, we suggest you try solving '''every''' homework problem. In particular, some of these problems will be given as special 'homework tests' to be held in class. The tests are scheduled to Modules 2 and 3 late weeks.

A student may be required to 'defend' (i.e., to explain orally) his written solution to any problem. His grade for the problem may be decreased if he fails to do so properly.

== Exam 1 ==
A written examination is held past Module 1. Students may not consult any sources during the exam. The examination takes about 120 minutes. An integer weight is assigned to every problem.

== Colloquium ==
An oral colloquium is held at the beginning of Module 3. Each student is given two questions concerning statements and definitions as well as one question requiring a proof. After no less than 45 minutes of preparation (when using any literature is allowed), the student is required to answer ‘from scratch’, that is, with no recourse to any materials. The examiner may pose additional questions as he sees fit.

'''Please find the question list and rules [https://drive.google.com/file/d/1aoaj_Do8m2jm2nGGfSANRT9KKZvzgJGt/view?usp=drive_link here]'''.

== Exam 2 ==
A written examination is held past Module 3. Students may not consult any sources during the exam. The examination takes about 120 minutes. An integer weight is assigned to every problem.

== Bonus activities ==
Throughout the course, the students may be graded for a variety of ‘bonus activities’ (like quizzes, etc.) either offline or online.

== Course materials ==

[https://t.me/joinchat/T_YTN4IG1vAJNWT9 Course chat]. This is our primary outlet for course announcements, questions, and discussions. '''Please join it!'''

=== Lecture notes ===

[https://drive.google.com/file/d/1mmNLLQ0--EDihGNRKwSyXLOA1KL7A0lD/view?usp=sharing Original English version]

[https://drive.google.com/drive/folders/1cTCdJtVVtO9uDgIKE8HY0qhl285tzOo1?usp=drive_link A Russian translation by volunteering students] (you are welcome to [https://t.me/sigma_algebraa join] their ranks)

=== Classes recordings ===

=== Lecture video archive ===

=== Other resources ===
* [https://tinyurl.com/rwky5vmk The Course's Google Directory]

* [https://www.youtube.com/playlist?list=PL1Uob8iPTHGTidrmrqEHTJ96Pt3-PmML4 Past years' videos]

* We have a [https://meet.edashkov.net.ru dedicated server] to hold an online meeting if we need one.

== Problem sets ==

=== Class problems ===

* [https://drive.google.com/file/d/1EP-diSuOTn9f0ryg18Z2w0xjEp8j0bnl/view?usp=drive_link Problem Set 1]

* [https://drive.google.com/file/d/12ct99-ORd7A94Gh5g4Nf9riv7UqNMSRc/view?usp=drive_link Problem Set 2]

* [https://drive.google.com/file/d/1yKKqLsS99V4AhCYqbjafuav2CMCdQTOQ/view?usp=drive_link Problem Set 3]

* [https://drive.google.com/file/d/1YgH_AdCk4GcKC0KH7xBA4-sUnOYkUvUK/view?usp=drive_link Problem Set 4]

* [https://drive.google.com/file/d/1M556PSgTJOo5W-AxYEXjFu94VfledpF5/view?usp=drive_link Problem Set 5]

* [https://drive.google.com/file/d/1-ylVViaBgzxEM-M7Rvrz2iggtK6UiJTY/view?usp=drive_link Problem Set 6]

* [https://drive.google.com/file/d/15tcTNLW-uFqT2xPJn1imOnEzaGwlaZAq/view?usp=drive_link Problem Set 7]

* [https://drive.google.com/file/d/1N1EuCCe7NIiEa69nXHwncfQG2IOTyzLi/view?usp=drive_link Problem Set 8]

* [https://drive.google.com/file/d/1PmlR2bysnKSZrJle9Dwa4KiB23G5ORdZ/view?usp=drive_link Problem Set 9]



=== Assignment deadlines ===

{| class="wikitable"
|-
! Home problem set !! colspan="11" | Deadline
|-
| || 251 || 252 || 253 || 254 || 255 || 256 || 257
|-
| [https://drive.google.com/file/d/15vCxTrNMwagS4rqQnUzdLParTqOP8y5P/view?usp=drive_link HW1a ] || Sep 25 || Sep 25 || Sep 25 || Sep 23 || Sep 23 || Sep 23 || Sep 22
|-
| [https://drive.google.com/file/d/1PTJY1PEG-wUlTqUGXT8KWRsll8H0XLb0/view?usp=drive_link HW1b] || Oct 5 || Oct 9 || Oct 9 || Oct 11 || Oct 11 || Oct 11 ||Oct 7
|-
| [https://drive.google.com/file/d/1mSNPCXo1J3eMz7Wk9yagWkgaZn7AwN7B/view?usp=drive_link HW1c] || Oct 19 || Oct 23 || Oct 23 || Oct 22 || Oct 22 || Oct 22 || Oct 23
|-
| [https://drive.google.com/file/d/1LOPPwGjyVleR_mclxTKUJ_bxFrxt44sW/view?usp=drive_link HW2a] || Nov 13 || Nov 13 || Nov 13 || Nov 18 || Nov 18 || Nov 18 || Dec 1
|-
| [https://drive.google.com/file/d/1W7k1OTiIMlPOpo-2mwmGegrc4RDHz5_j/view?usp=drive_link HW2b] || Nov 30 || Nov 30 || Nov 30 || 03 Dec || 03 Dec || 03 Dec || Dec 8
|-
| [https://drive.google.com/file/d/1V99HEXHgcCXT6tjJp0oPV05Jw172Bid8/view?usp=drive_link HW2c] || Dec 14 || Dec 14 || Dec 14 || Dec 19 || Dec 19 || Dec 19 || Dec 19
|-
| [https://drive.google.com/file/d/1NVhQr0s6Z7SK6Y_oXzskXpY8c1CVeolJ/view?usp=drive_link HW3a] || Jan 25 || Jan 31 || Jan 31 || Feb 7 || Feb 7 || Feb 7 || Feb 4
|-
| [https://drive.google.com/file/d/19S1mi9DHX0WoqJpSOMSItFPN--Snhrp_/view?usp=drive_link HW3b] || Feb 17 || Feb 15 || Feb 15 || Feb 21 || Feb 21 || Feb 21 || Feb 18
|-
| [https://drive.google.com/file/d/1wPy3_0myen8aLP8f-WP3DMiPZjqT6CRy/view?usp=drive_link HW4a] || Mar 1 || Mar 5 || Mar 5 || Mar 11 || Mar 11 || Mar 11 || Mar 11
|-
| [https://drive.google.com/file/d/1vKfnIzo6b-WbZLYrDL6hd1S2v4s55SZ2/view?usp=drive_link HW4b] || Mar 15 || Mar 18 || Mar 18 || Mar 18 || Mar 18 || Mar 18 ||

|}

'''Each deadline is set by the respective group's instructor.'''

== Assessment and Grading ==

=== Homework ===

The homework is graded in three batches: one (HW_A) includes everything to be submitted in Module1, another (HW_B) includes all the problems submitted in other modules '''that we will choose to be graded''' (see Homework section for an explanation). The last batch (HW_Test_B) consists of two in-class tests; each test takes about 80 minutes and contains 6 -- 8 problems from the homework problem sets or very similar to those. For each problem, the student is given a score from 0 to 1 point (in fractional values) according to the progress he made.

The homework graded are computed the following way (before rounding):

HW_A = 10 * (the sum of points given for the problems) / #(problems);
''all the problems are to be graded''.

Grade HW_B is computed similarly but for its respective period of Modules 2 and 3:

HW_B = 10 * (the sum of points given for the problems) / #(problems subject to be graded);
''a few chosen problems are to be graded''.

HW_Test_B = 10 * (the sum of points given for the problems in both the tests) / #(problems in both the tests).

=== Exam1 and the Interim Assessment ===

Each problem solution is graded with a fractional score from 0 to 1 point, and the entire exam with the value (before rounding)

Exam1 = 10 * (p1 * w1 + ... + pn * wn) / (w1 + ... + wn),
where pi is the score and wi is the weight for the i-th problem.

The Interim grade 1 is computed past Module 1 and equals:

Interim1 = round(Interim1'), where

Interim1' = 0.5 * HW_A + 0.5 * Exam1.

(Here and everywhere, rounding is according to the usual arithmetic rules.)

=== Colloquium ===
For each of the 'definition' two questions, the student is given a score from 0 to 2 points, and from 0 to 4 points for the ‘proof’ question (all in fractional values).
The Colloq grade is computed the following way (before rounding):

Colloq = 10 * (the sum of points given) / 8.

=== Bonuses ===
Each student is given a score according to his progress in bonus activities, which results in the grade

Bonus = 10 * #(points given) / #(points possible).

The number of possible points varies but it is between 1 and 25 usually.

=== Exam2, the Second Interim, and the Final Assessment ===
Each problem solution is graded with a fractional score from 0 to 1 point, and the entire exam with the value (before rounding)

Exam2 = 10 * (p1 * w1 + ... + pn * wn) / (w1 + ... + wn),

where pi is the score and wi is the weight for the i-th problem.

The Interim grade 2 is computed past Module 3 and equals:

Interim2 = round(Interim2'), where

Interim2' = 0.085 * HW_B + 0.210 * HW_Test_B + 0.295 * Colloq + 0.06 * Bonus + 0.35 * Exam2.

The final grade for the course is

Final = round(0.3 * Interim1' + 0.7 * Interim 2')

Generally, '''nobody is exempt from the examinations'''.

== Plagiarism regulations ==
Plagiarism, that is, all forms of cheating with doing your academic assignments, including any '''unauthorized help of AI''' or another person, will not be tolerated. In this course, using AI is '''not''' generally authorized. Clearly, we may not have a definitive proof that somebody is cheating (notice, however, that AI-generated solutions to mathematical problems are quite conspicuous if they have not been edited heavily). Therefore, we will reserve the right to ask a suspect student to 'defend' his any written work, that is, to explain it orally and in person. So our regulations stipulate:
<blockquote>
If plagiarism is detected (including material generated with the help of generative AI without prior approval from the teacher), the assessment element will be assigned a score of "0".
If there is a suspicion that the task was not completed independently, the teacher has the right to initiate an additional verification or a defense of this particular assessment element. The final grade for the element will be based on the results of such verification or defense.
The teacher also has the right to randomly invite any student to defend any assessment element, regardless of plagiarism or suspicion. If the student refuses or fails to defend the work, the grade for this element will be annulled and recorded as "0".
</blockquote>
A final word of advice. Using AI regularly (and this is addictive!) instead of your natural intelligence will make you stupid and intellectually impotent in no time---at the price of a slight grade advantage (assuming your cheating goes unpunished). Do you really want it in this competitive world?

== Exam retaking ==
Examinations 1 and 2 are subject to be retaken if either the Interim1 or Final grade, respectively, is unsatisfactory (i.e., < 4). Retaking an exam is similar to the regular examination. The resulting grade is substituted for that of the latter (that is, retake grade is assigned to the variable Exami in the respective formula, whose value is then reevaluated). Those whose Interim or Final grade is still unsatisfactory after the first retake will have a (tough) choice to make.

Please take into account the following regulation according to the ''ПОПАТКУС'':
<blockquote>
On the first and second retakes, the cumulative course grade is taken into consideration. In case of receiving an unsatisfactory final grade after the first retake, the student may refuse to participate in the second retake and instead repeat the course according to the individual curriculum. The cumulative grade is formed again as a result of repeated courses. After completing the repeated course, the student is given a second retake only, which the student previously refused.
</blockquote>

The 'cumulative grade' here means all the variables in the grading formulas except Exami, which are the only ones to be retaken. The 'second retake' is similar to the first one and it is evaluated according to the same formula with the same values of 'cumulative' variables. This poses an obvious risk for anyone whose 'cumulatives' are low!

== Recommended reading ==
''Please notice that '''The Book''' for our Course does not exist. The latter is based on many sources.''

# Anderson J. A., Discrete Mathematics With Combinatorics. Prentice Hall, 2003.
# Biggs N. L., Discrete mathematics. 2nd ed., New York; Oxford: Oxford University Press, 2004.
# Gavrilov G. P., Sapozhenko A. A. Problems and Exercises in Discrete Mathematics. Kluwer Texts in the Mathematical Sciences 14. Springer, 1996.
# [http://courses.csail.mit.edu/6.042/spring17/mcs.pdf Lehman E., Thomson Leighton F., Meyer A. R. Mathematics for Computer Science, 2017.]
# [http://www.cs.elte.hu/~lovasz/dmbook.ps Lovasz L., Vesztergombi K. Discrete Mathematics. Lecture Notes; Yale University, 1999.]
# Melnikov O., Sarvanov V., Tyshkevich R., Yemelichev V., Zverovich I. Exercises in Graph Theory. Kluwer Texts in the Mathematical Sciences 19. Springer, 1998.
# Rosen K. H. Discrete Mathematics and Its Applications. McGraw-Hill, 1999.
# Stein C., Drysdale R. L., Bogart K. Discrete mathematics for computer scientists. Addison-Wesley, 2010.
# Vinogradov I. M. Elements of number theory. Dover, 1954.

=== In Russian ===
''If you understand Russian (by any chance), you will probably benefit from reading the following books.''

# Виноградов И. М. Основы теории чисел. 9-е изд., М.: Наука, 1981.
# [http://rubtsov.su/public/DM-HSE-Draft.pdf Вялый М., Подольский В., Рубцов А., Шварц Д., Шень А. Лекции по дискретной математике.]
# Гаврилов Г. П., Сапоженко А. А. Задачи и упражнения по дискретной математике. 3-е изд., М.: ФИЗМАТЛИТ, 2004.
# [https://drive.google.com/file/d/1RM6KX_reBFwUXesWGUEu0sFn2NCaBgvz/view?usp=sharing Дашков Е. В. Введение в математическую логику. Множества и отношения. М.: МФТИ, 2019.]
# Зубков А. М., Севастьянов Б. А., Чистяков В. П. Сборник задач по теории вероятностей. 2-е изд., М.: Наука, 1989.
# Мельников О. И. Теория графов в занимательных задачах. 5-е изд., М.: Книжный дом "ЛИБРОКОМ", 2013.
# [http://www.mccme.ru/free-books/shen/shen-induction.pdf Шень А., Математическая индукция. 5-е изд, М.: МЦНМО, 2016.]

Discrete Mathematics 1 DSBA 2025/2026

2026-02-26T11:20:50Z

Brdan: /* Assignment deadlines */

== Instructors ==

=== The lecturer ===
My name is Evgeny Dashkov. Feel free to contact me via email: edashkov@gmail.com, [https://t.me/edashkov Telegram], or [https://vk.com/evgeny.v.dashkov VK].

My Assistant (the person responsible for the tables etc.): [https://t.me/almanmaria Maria Krotova].

=== Seminar Instructors and Teaching Assistants ===
{| class="wikitable" style="text-align:center"
|-
! Group !! 251 !! 252 !! 253 !! 254 !! 255 !! 256 !! 257
|-
|| Teachers || [https://t.me/edashkov Evgeny Dashkov] ||colspan="2"| [https://t.me/brdann Boris Danilov]|| colspan="3"| [https://t.me/DiegBuitrago Diego Buitrago] || [https://t.me/carlosbuitrago Carlos Buitrago]
|-
|| Teaching Assistants || [https://t.me/dandelii Maria Samoilova] || [https://t.me/Nixlle Danila Riazanov] || [https://t.me/svnsrg Sergey Savin] || [https://t.me/KinWiz Alexey Popov] || [https://t.me/dm9dj Maxim Kharlan] || [https://t.me/ayratmur Ayrat Murtazin] || [https://t.me/crazyglue Sofya Shapovalova]
|}

=== Whom should I ask? ===

If you have a question or comment concerning the mathematical content of our course, it is best to post it to our [https://t.me/joinchat/T_YTN4IG1vAJNWT9 student chat]. Alternatively, you may address your question to your Teaching Assistant, Seminar Instructor or the Lecturer (say, if your question discloses an important idea for a HW problem). It is much better to ask and get to know than not to ask and remain ignorant. '''Please do not hesitate to ask your mathematical questions!'''

If you need a more detailed consultation concerning the course's mathematics, please be informed that our Teaching Assistants usually hold periodic consultations while the Seminar Instructors and Lecturer have some designated time for counseling students. Still, the best thing to do is to arrange a consultation in advance via a personal communication.

Homework-grading related questions should be directed to your teaching assistant first; then to your seminar instructor and to the lecturer just in case of any disagreement.

Organizational, administrative, legal or paperwork questions must be addressed to the Student Service Center, Study Office or other relevant offices first and foremost. If you have been redirected to us with such a question nevertheless, please contact the Lecturer's Assistant first.

== Current performance ==

[https://docs.google.com/spreadsheets/d/1vRdPzhUjqiDv2rGh9A3hYvtNmo3AkoEUtXMxBgzud9U/edit?usp=sharing The Table].

== Homework ==
The homework includes a few problem sets, one in a fortnight or so (the deadlines are announced on giving each set). Every problem set consists of about 10 – 15 problems. These sets may be subdivided further for students’ convenience.

We expect you to try solving '''every''' homework problem. Nevertheless, in Modules 2 and 3 we are going to grade the solutions of about one quarter of all problems. The problems chosen to be graded will be the same for all students and our choice will be revealed past the deadline for each respective problem set.

Still, we suggest you try solving '''every''' homework problem. In particular, some of these problems will be given as special 'homework tests' to be held in class. The tests are scheduled to Modules 2 and 3 late weeks.

A student may be required to 'defend' (i.e., to explain orally) his written solution to any problem. His grade for the problem may be decreased if he fails to do so properly.

== Exam 1 ==
A written examination is held past Module 1. Students may not consult any sources during the exam. The examination takes about 120 minutes. An integer weight is assigned to every problem.

== Colloquium ==
An oral colloquium is held at the beginning of Module 3. Each student is given two questions concerning statements and definitions as well as one question requiring a proof. After no less than 45 minutes of preparation (when using any literature is allowed), the student is required to answer ‘from scratch’, that is, with no recourse to any materials. The examiner may pose additional questions as he sees fit.

'''Please find the question list and rules [https://drive.google.com/file/d/1aoaj_Do8m2jm2nGGfSANRT9KKZvzgJGt/view?usp=drive_link here]'''.

== Exam 2 ==
A written examination is held past Module 3. Students may not consult any sources during the exam. The examination takes about 120 minutes. An integer weight is assigned to every problem.

== Bonus activities ==
Throughout the course, the students may be graded for a variety of ‘bonus activities’ (like quizzes, etc.) either offline or online.

== Course materials ==

[https://t.me/joinchat/T_YTN4IG1vAJNWT9 Course chat]. This is our primary outlet for course announcements, questions, and discussions. '''Please join it!'''

=== Lecture notes ===

[https://drive.google.com/file/d/1mmNLLQ0--EDihGNRKwSyXLOA1KL7A0lD/view?usp=sharing Original English version]

[https://drive.google.com/drive/folders/1cTCdJtVVtO9uDgIKE8HY0qhl285tzOo1?usp=drive_link A Russian translation by volunteering students] (you are welcome to [https://t.me/sigma_algebraa join] their ranks)

=== Classes recordings ===

=== Lecture video archive ===

=== Other resources ===
* [https://tinyurl.com/rwky5vmk The Course's Google Directory]

* [https://www.youtube.com/playlist?list=PL1Uob8iPTHGTidrmrqEHTJ96Pt3-PmML4 Past years' videos]

* We have a [https://meet.edashkov.net.ru dedicated server] to hold an online meeting if we need one.

== Problem sets ==

=== Class problems ===

* [https://drive.google.com/file/d/1EP-diSuOTn9f0ryg18Z2w0xjEp8j0bnl/view?usp=drive_link Problem Set 1]

* [https://drive.google.com/file/d/12ct99-ORd7A94Gh5g4Nf9riv7UqNMSRc/view?usp=drive_link Problem Set 2]

* [https://drive.google.com/file/d/1yKKqLsS99V4AhCYqbjafuav2CMCdQTOQ/view?usp=drive_link Problem Set 3]

* [https://drive.google.com/file/d/1YgH_AdCk4GcKC0KH7xBA4-sUnOYkUvUK/view?usp=drive_link Problem Set 4]

* [https://drive.google.com/file/d/1M556PSgTJOo5W-AxYEXjFu94VfledpF5/view?usp=drive_link Problem Set 5]

* [https://drive.google.com/file/d/1-ylVViaBgzxEM-M7Rvrz2iggtK6UiJTY/view?usp=drive_link Problem Set 6]

* [https://drive.google.com/file/d/15tcTNLW-uFqT2xPJn1imOnEzaGwlaZAq/view?usp=drive_link Problem Set 7]

* [https://drive.google.com/file/d/1N1EuCCe7NIiEa69nXHwncfQG2IOTyzLi/view?usp=drive_link Problem Set 8]



=== Assignment deadlines ===

{| class="wikitable"
|-
! Home problem set !! colspan="11" | Deadline
|-
| || 251 || 252 || 253 || 254 || 255 || 256 || 257
|-
| [https://drive.google.com/file/d/15vCxTrNMwagS4rqQnUzdLParTqOP8y5P/view?usp=drive_link HW1a ] || Sep 25 || Sep 25 || Sep 25 || Sep 23 || Sep 23 || Sep 23 || Sep 22
|-
| [https://drive.google.com/file/d/1PTJY1PEG-wUlTqUGXT8KWRsll8H0XLb0/view?usp=drive_link HW1b] || Oct 5 || Oct 9 || Oct 9 || Oct 11 || Oct 11 || Oct 11 ||Oct 7
|-
| [https://drive.google.com/file/d/1mSNPCXo1J3eMz7Wk9yagWkgaZn7AwN7B/view?usp=drive_link HW1c] || Oct 19 || Oct 23 || Oct 23 || Oct 22 || Oct 22 || Oct 22 || Oct 23
|-
| [https://drive.google.com/file/d/1LOPPwGjyVleR_mclxTKUJ_bxFrxt44sW/view?usp=drive_link HW2a] || Nov 13 || Nov 13 || Nov 13 || Nov 18 || Nov 18 || Nov 18 || Dec 1
|-
| [https://drive.google.com/file/d/1W7k1OTiIMlPOpo-2mwmGegrc4RDHz5_j/view?usp=drive_link HW2b] || Nov 30 || Nov 30 || Nov 30 || 03 Dec || 03 Dec || 03 Dec || Dec 8
|-
| [https://drive.google.com/file/d/1V99HEXHgcCXT6tjJp0oPV05Jw172Bid8/view?usp=drive_link HW2c] || Dec 14 || Dec 14 || Dec 14 || Dec 19 || Dec 19 || Dec 19 || Dec 19
|-
| [https://drive.google.com/file/d/1NVhQr0s6Z7SK6Y_oXzskXpY8c1CVeolJ/view?usp=drive_link HW3a] || Jan 25 || Jan 31 || Jan 31 || Feb 7 || Feb 7 || Feb 7 || Feb 4
|-
| [https://drive.google.com/file/d/19S1mi9DHX0WoqJpSOMSItFPN--Snhrp_/view?usp=drive_link HW3b] || Feb 17 || Feb 15 || Feb 15 || Feb 21 || Feb 21 || Feb 21 || Feb 18
|-
| [https://drive.google.com/file/d/1wPy3_0myen8aLP8f-WP3DMiPZjqT6CRy/view?usp=drive_link HW4a] || Mar 1 || Mar 5 || Mar 5 || || || ||

|}

'''Each deadline is set by the respective group's instructor.'''

== Assessment and Grading ==

=== Homework ===

The homework is graded in three batches: one (HW_A) includes everything to be submitted in Module1, another (HW_B) includes all the problems submitted in other modules '''that we will choose to be graded''' (see Homework section for an explanation). The last batch (HW_Test_B) consists of two in-class tests; each test takes about 80 minutes and contains 6 -- 8 problems from the homework problem sets or very similar to those. For each problem, the student is given a score from 0 to 1 point (in fractional values) according to the progress he made.

The homework graded are computed the following way (before rounding):

HW_A = 10 * (the sum of points given for the problems) / #(problems);
''all the problems are to be graded''.

Grade HW_B is computed similarly but for its respective period of Modules 2 and 3:

HW_B = 10 * (the sum of points given for the problems) / #(problems subject to be graded);
''a few chosen problems are to be graded''.

HW_Test_B = 10 * (the sum of points given for the problems in both the tests) / #(problems in both the tests).

=== Exam1 and the Interim Assessment ===

Each problem solution is graded with a fractional score from 0 to 1 point, and the entire exam with the value (before rounding)

Exam1 = 10 * (p1 * w1 + ... + pn * wn) / (w1 + ... + wn),
where pi is the score and wi is the weight for the i-th problem.

The Interim grade 1 is computed past Module 1 and equals:

Interim1 = round(Interim1'), where

Interim1' = 0.5 * HW_A + 0.5 * Exam1.

(Here and everywhere, rounding is according to the usual arithmetic rules.)

=== Colloquium ===
For each of the 'definition' two questions, the student is given a score from 0 to 2 points, and from 0 to 4 points for the ‘proof’ question (all in fractional values).
The Colloq grade is computed the following way (before rounding):

Colloq = 10 * (the sum of points given) / 8.

=== Bonuses ===
Each student is given a score according to his progress in bonus activities, which results in the grade

Bonus = 10 * #(points given) / #(points possible).

The number of possible points varies but it is between 1 and 25 usually.

=== Exam2, the Second Interim, and the Final Assessment ===
Each problem solution is graded with a fractional score from 0 to 1 point, and the entire exam with the value (before rounding)

Exam2 = 10 * (p1 * w1 + ... + pn * wn) / (w1 + ... + wn),

where pi is the score and wi is the weight for the i-th problem.

The Interim grade 2 is computed past Module 3 and equals:

Interim2 = round(Interim2'), where

Interim2' = 0.085 * HW_B + 0.210 * HW_Test_B + 0.295 * Colloq + 0.06 * Bonus + 0.35 * Exam2.

The final grade for the course is

Final = round(0.3 * Interim1' + 0.7 * Interim 2')

Generally, '''nobody is exempt from the examinations'''.

== Plagiarism regulations ==
Plagiarism, that is, all forms of cheating with doing your academic assignments, including any '''unauthorized help of AI''' or another person, will not be tolerated. In this course, using AI is '''not''' generally authorized. Clearly, we may not have a definitive proof that somebody is cheating (notice, however, that AI-generated solutions to mathematical problems are quite conspicuous if they have not been edited heavily). Therefore, we will reserve the right to ask a suspect student to 'defend' his any written work, that is, to explain it orally and in person. So our regulations stipulate:
<blockquote>
If plagiarism is detected (including material generated with the help of generative AI without prior approval from the teacher), the assessment element will be assigned a score of "0".
If there is a suspicion that the task was not completed independently, the teacher has the right to initiate an additional verification or a defense of this particular assessment element. The final grade for the element will be based on the results of such verification or defense.
The teacher also has the right to randomly invite any student to defend any assessment element, regardless of plagiarism or suspicion. If the student refuses or fails to defend the work, the grade for this element will be annulled and recorded as "0".
</blockquote>
A final word of advice. Using AI regularly (and this is addictive!) instead of your natural intelligence will make you stupid and intellectually impotent in no time---at the price of a slight grade advantage (assuming your cheating goes unpunished). Do you really want it in this competitive world?

== Exam retaking ==
Examinations 1 and 2 are subject to be retaken if either the Interim1 or Final grade, respectively, is unsatisfactory (i.e., < 4). Retaking an exam is similar to the regular examination. The resulting grade is substituted for that of the latter (that is, retake grade is assigned to the variable Exami in the respective formula, whose value is then reevaluated). Those whose Interim or Final grade is still unsatisfactory after the first retake will have a (tough) choice to make.

Please take into account the following regulation according to the ''ПОПАТКУС'':
<blockquote>
On the first and second retakes, the cumulative course grade is taken into consideration. In case of receiving an unsatisfactory final grade after the first retake, the student may refuse to participate in the second retake and instead repeat the course according to the individual curriculum. The cumulative grade is formed again as a result of repeated courses. After completing the repeated course, the student is given a second retake only, which the student previously refused.
</blockquote>

The 'cumulative grade' here means all the variables in the grading formulas except Exami, which are the only ones to be retaken. The 'second retake' is similar to the first one and it is evaluated according to the same formula with the same values of 'cumulative' variables. This poses an obvious risk for anyone whose 'cumulatives' are low!

== Recommended reading ==
''Please notice that '''The Book''' for our Course does not exist. The latter is based on many sources.''

# Anderson J. A., Discrete Mathematics With Combinatorics. Prentice Hall, 2003.
# Biggs N. L., Discrete mathematics. 2nd ed., New York; Oxford: Oxford University Press, 2004.
# Gavrilov G. P., Sapozhenko A. A. Problems and Exercises in Discrete Mathematics. Kluwer Texts in the Mathematical Sciences 14. Springer, 1996.
# [http://courses.csail.mit.edu/6.042/spring17/mcs.pdf Lehman E., Thomson Leighton F., Meyer A. R. Mathematics for Computer Science, 2017.]
# [http://www.cs.elte.hu/~lovasz/dmbook.ps Lovasz L., Vesztergombi K. Discrete Mathematics. Lecture Notes; Yale University, 1999.]
# Melnikov O., Sarvanov V., Tyshkevich R., Yemelichev V., Zverovich I. Exercises in Graph Theory. Kluwer Texts in the Mathematical Sciences 19. Springer, 1998.
# Rosen K. H. Discrete Mathematics and Its Applications. McGraw-Hill, 1999.
# Stein C., Drysdale R. L., Bogart K. Discrete mathematics for computer scientists. Addison-Wesley, 2010.
# Vinogradov I. M. Elements of number theory. Dover, 1954.

=== In Russian ===
''If you understand Russian (by any chance), you will probably benefit from reading the following books.''

# Виноградов И. М. Основы теории чисел. 9-е изд., М.: Наука, 1981.
# [http://rubtsov.su/public/DM-HSE-Draft.pdf Вялый М., Подольский В., Рубцов А., Шварц Д., Шень А. Лекции по дискретной математике.]
# Гаврилов Г. П., Сапоженко А. А. Задачи и упражнения по дискретной математике. 3-е изд., М.: ФИЗМАТЛИТ, 2004.
# [https://drive.google.com/file/d/1RM6KX_reBFwUXesWGUEu0sFn2NCaBgvz/view?usp=sharing Дашков Е. В. Введение в математическую логику. Множества и отношения. М.: МФТИ, 2019.]
# Зубков А. М., Севастьянов Б. А., Чистяков В. П. Сборник задач по теории вероятностей. 2-е изд., М.: Наука, 1989.
# Мельников О. И. Теория графов в занимательных задачах. 5-е изд., М.: Книжный дом "ЛИБРОКОМ", 2013.
# [http://www.mccme.ru/free-books/shen/shen-induction.pdf Шень А., Математическая индукция. 5-е изд, М.: МЦНМО, 2016.]

Discrete Mathematics 1 DSBA 2025/2026

2026-02-05T13:52:14Z

Brdan: /* Assignment deadlines */

== Instructors ==

=== The lecturer ===
My name is Evgeny Dashkov. Feel free to contact me via email: edashkov@gmail.com, [https://t.me/edashkov Telegram], or [https://vk.com/evgeny.v.dashkov VK].

My Assistant (the person responsible for the tables etc.): [https://t.me/almanmaria Maria Krotova].

=== Seminar Instructors and Teaching Assistants ===
{| class="wikitable" style="text-align:center"
|-
! Group !! 251 !! 252 !! 253 !! 254 !! 255 !! 256 !! 257
|-
|| Teachers || [https://t.me/edashkov Evgeny Dashkov] ||colspan="2"| [https://t.me/brdann Boris Danilov]|| colspan="3"| [https://t.me/DiegBuitrago Diego Buitrago] || [https://t.me/carlosbuitrago Carlos Buitrago]
|-
|| Teaching Assistants || [https://t.me/dandelii Maria Samoilova] || [https://t.me/Nixlle Danila Riazanov] || [https://t.me/svnsrg Sergey Savin] || [https://t.me/KinWiz Alexey Popov] || [https://t.me/dm9dj Maxim Kharlan] || [https://t.me/ayratmur Ayrat Murtazin] || [https://t.me/crazyglue Sofya Shapovalova]
|}

=== Whom should I ask? ===

If you have a question or comment concerning the mathematical content of our course, it is best to post it to our [https://t.me/joinchat/T_YTN4IG1vAJNWT9 student chat]. Alternatively, you may address your question to your Teaching Assistant, Seminar Instructor or the Lecturer (say, if your question discloses an important idea for a HW problem). It is much better to ask and get to know than not to ask and remain ignorant. '''Please do not hesitate to ask your mathematical questions!'''

If you need a more detailed consultation concerning the course's mathematics, please be informed that our Teaching Assistants usually hold periodic consultations while the Seminar Instructors and Lecturer have some designated time for counseling students. Still, the best thing to do is to arrange a consultation in advance via a personal communication.

Homework-grading related questions should be directed to your teaching assistant first; then to your seminar instructor and to the lecturer just in case of any disagreement.

Organizational, administrative, legal or paperwork questions must be addressed to the Student Service Center, Study Office or other relevant offices first and foremost. If you have been redirected to us with such a question nevertheless, please contact the Lecturer's Assistant first.

== Current performance ==

[https://docs.google.com/spreadsheets/d/1vRdPzhUjqiDv2rGh9A3hYvtNmo3AkoEUtXMxBgzud9U/edit?usp=sharing The Table].

== Homework ==
The homework includes a few problem sets, one in a fortnight or so (the deadlines are announced on giving each set). Every problem set consists of about 10 – 15 problems. These sets may be subdivided further for students’ convenience.

We expect you to try solving '''every''' homework problem. Nevertheless, in Modules 2 and 3 we are going to grade the solutions of about one quarter of all problems. The problems chosen to be graded will be the same for all students and our choice will be revealed past the deadline for each respective problem set.

Still, we suggest you try solving '''every''' homework problem. In particular, some of these problems will be given as special 'homework tests' to be held in class. The tests are scheduled to Modules 2 and 3 late weeks.

A student may be required to 'defend' (i.e., to explain orally) his written solution to any problem. His grade for the problem may be decreased if he fails to do so properly.

== Exam 1 ==
A written examination is held past Module 1. Students may not consult any sources during the exam. The examination takes about 120 minutes. An integer weight is assigned to every problem.

== Colloquium ==
An oral colloquium is held at the beginning of Module 3. Each student is given two questions concerning statements and definitions as well as one question requiring a proof. After no less than 45 minutes of preparation (when using any literature is allowed), the student is required to answer ‘from scratch’, that is, with no recourse to any materials. The examiner may pose additional questions as he sees fit.

'''Please find the question list and rules [https://drive.google.com/file/d/1aoaj_Do8m2jm2nGGfSANRT9KKZvzgJGt/view?usp=drive_link here]'''.

== Exam 2 ==
A written examination is held past Module 3. Students may not consult any sources during the exam. The examination takes about 120 minutes. An integer weight is assigned to every problem.

== Bonus activities ==
Throughout the course, the students may be graded for a variety of ‘bonus activities’ (like quizzes, etc.) either offline or online.

== Course materials ==

[https://t.me/joinchat/T_YTN4IG1vAJNWT9 Course chat]. This is our primary outlet for course announcements, questions, and discussions. '''Please join it!'''

=== Lecture notes ===

[https://drive.google.com/file/d/1mmNLLQ0--EDihGNRKwSyXLOA1KL7A0lD/view?usp=sharing Original English version]

[https://drive.google.com/drive/folders/1cTCdJtVVtO9uDgIKE8HY0qhl285tzOo1?usp=drive_link A Russian translation by volunteering students] (you are welcome to [https://t.me/sigma_algebraa join] their ranks)

=== Classes recordings ===

=== Lecture video archive ===

=== Other resources ===
* [https://tinyurl.com/rwky5vmk The Course's Google Directory]

* [https://www.youtube.com/playlist?list=PL1Uob8iPTHGTidrmrqEHTJ96Pt3-PmML4 Past years' videos]

* We have a [https://meet.edashkov.net.ru dedicated server] to hold an online meeting if we need one.

== Problem sets ==

=== Class problems ===

* [https://drive.google.com/file/d/1EP-diSuOTn9f0ryg18Z2w0xjEp8j0bnl/view?usp=drive_link Problem Set 1]

* [https://drive.google.com/file/d/12ct99-ORd7A94Gh5g4Nf9riv7UqNMSRc/view?usp=drive_link Problem Set 2]

* [https://drive.google.com/file/d/1yKKqLsS99V4AhCYqbjafuav2CMCdQTOQ/view?usp=drive_link Problem Set 3]

* [https://drive.google.com/file/d/1YgH_AdCk4GcKC0KH7xBA4-sUnOYkUvUK/view?usp=drive_link Problem Set 4]

* [https://drive.google.com/file/d/1M556PSgTJOo5W-AxYEXjFu94VfledpF5/view?usp=drive_link Problem Set 5]

* [https://drive.google.com/file/d/1-ylVViaBgzxEM-M7Rvrz2iggtK6UiJTY/view?usp=drive_link Problem Set 6]

* [https://drive.google.com/file/d/15tcTNLW-uFqT2xPJn1imOnEzaGwlaZAq/view?usp=drive_link Problem Set 7]



=== Assignment deadlines ===

{| class="wikitable"
|-
! Home problem set !! colspan="11" | Deadline
|-
| || 251 || 252 || 253 || 254 || 255 || 256 || 257
|-
| [https://drive.google.com/file/d/15vCxTrNMwagS4rqQnUzdLParTqOP8y5P/view?usp=drive_link HW1a ] || Sep 25 || Sep 25 || Sep 25 || Sep 23 || Sep 23 || Sep 23 || Sep 22
|-
| [https://drive.google.com/file/d/1PTJY1PEG-wUlTqUGXT8KWRsll8H0XLb0/view?usp=drive_link HW1b] || Oct 5 || Oct 9 || Oct 9 || Oct 11 || Oct 11 || Oct 11 ||Oct 7
|-
| [https://drive.google.com/file/d/1mSNPCXo1J3eMz7Wk9yagWkgaZn7AwN7B/view?usp=drive_link HW1c] || Oct 19 || Oct 23 || Oct 23 || Oct 22 || Oct 22 || Oct 22 || Oct 23
|-
| [https://drive.google.com/file/d/1LOPPwGjyVleR_mclxTKUJ_bxFrxt44sW/view?usp=drive_link HW2a] || Nov 13 || Nov 13 || Nov 13 || Nov 18 || Nov 18 || Nov 18 || Dec 1
|-
| [https://drive.google.com/file/d/1W7k1OTiIMlPOpo-2mwmGegrc4RDHz5_j/view?usp=drive_link HW2b] || Nov 30 || Nov 30 || Nov 30 || 03 Dec || 03 Dec || 03 Dec || Dec 8
|-
| [https://drive.google.com/file/d/1V99HEXHgcCXT6tjJp0oPV05Jw172Bid8/view?usp=drive_link HW2c] || Dec 14 || Dec 14 || Dec 14 || Dec 19 || Dec 19 || Dec 19 || Dec 19
|-
| [https://drive.google.com/file/d/1NVhQr0s6Z7SK6Y_oXzskXpY8c1CVeolJ/view?usp=drive_link HW3a] || Jan 25 || Jan 31 || Jan 31 || Feb 7 || Feb 7 || Feb 7 || Feb 4
|-
| [https://drive.google.com/file/d/19S1mi9DHX0WoqJpSOMSItFPN--Snhrp_/view?usp=drive_link HW3b] || || Feb 15 || Feb 15 || || || ||

|}

'''Each deadline is set by the respective group's instructor.'''

== Assessment and Grading ==

=== Homework ===

The homework is graded in three batches: one (HW_A) includes everything to be submitted in Module1, another (HW_B) includes all the problems submitted in other modules '''that we will choose to be graded''' (see Homework section for an explanation). The last batch (HW_Test_B) consists of two in-class tests; each test takes about 80 minutes and contains 6 -- 8 problems from the homework problem sets or very similar to those. For each problem, the student is given a score from 0 to 1 point (in fractional values) according to the progress he made.

The homework graded are computed the following way (before rounding):

HW_A = 10 * (the sum of points given for the problems) / #(problems);
''all the problems are to be graded''.

Grade HW_B is computed similarly but for its respective period of Modules 2 and 3:

HW_B = 10 * (the sum of points given for the problems) / #(problems subject to be graded);
''a few chosen problems are to be graded''.

HW_Test_B = 10 * (the sum of points given for the problems in both the tests) / #(problems in both the tests).

=== Exam1 and the Interim Assessment ===

Each problem solution is graded with a fractional score from 0 to 1 point, and the entire exam with the value (before rounding)

Exam1 = 10 * (p1 * w1 + ... + pn * wn) / (w1 + ... + wn),
where pi is the score and wi is the weight for the i-th problem.

The Interim grade 1 is computed past Module 1 and equals:

Interim1 = round(Interim1'), where

Interim1' = 0.5 * HW_A + 0.5 * Exam1.

(Here and everywhere, rounding is according to the usual arithmetic rules.)

=== Colloquium ===
For each of the 'definition' two questions, the student is given a score from 0 to 2 points, and from 0 to 4 points for the ‘proof’ question (all in fractional values).
The Colloq grade is computed the following way (before rounding):

Colloq = 10 * (the sum of points given) / 8.

=== Bonuses ===
Each student is given a score according to his progress in bonus activities, which results in the grade

Bonus = 10 * #(points given) / #(points possible).

The number of possible points varies but it is between 1 and 25 usually.

=== Exam2, the Second Interim, and the Final Assessment ===
Each problem solution is graded with a fractional score from 0 to 1 point, and the entire exam with the value (before rounding)

Exam2 = 10 * (p1 * w1 + ... + pn * wn) / (w1 + ... + wn),

where pi is the score and wi is the weight for the i-th problem.

The Interim grade 2 is computed past Module 3 and equals:

Interim2 = round(Interim2'), where

Interim2' = 0.085 * HW_B + 0.210 * HW_Test_B + 0.295 * Colloq + 0.06 * Bonus + 0.35 * Exam2.

The final grade for the course is

Final = round(0.3 * Interim1' + 0.7 * Interim 2')

Generally, '''nobody is exempt from the examinations'''.

== Plagiarism regulations ==
Plagiarism, that is, all forms of cheating with doing your academic assignments, including any '''unauthorized help of AI''' or another person, will not be tolerated. In this course, using AI is '''not''' generally authorized. Clearly, we may not have a definitive proof that somebody is cheating (notice, however, that AI-generated solutions to mathematical problems are quite conspicuous if they have not been edited heavily). Therefore, we will reserve the right to ask a suspect student to 'defend' his any written work, that is, to explain it orally and in person. So our regulations stipulate:
<blockquote>
If plagiarism is detected (including material generated with the help of generative AI without prior approval from the teacher), the assessment element will be assigned a score of "0".
If there is a suspicion that the task was not completed independently, the teacher has the right to initiate an additional verification or a defense of this particular assessment element. The final grade for the element will be based on the results of such verification or defense.
The teacher also has the right to randomly invite any student to defend any assessment element, regardless of plagiarism or suspicion. If the student refuses or fails to defend the work, the grade for this element will be annulled and recorded as "0".
</blockquote>
A final word of advice. Using AI regularly (and this is addictive!) instead of your natural intelligence will make you stupid and intellectually impotent in no time---at the price of a slight grade advantage (assuming your cheating goes unpunished). Do you really want it in this competitive world?

== Exam retaking ==
Examinations 1 and 2 are subject to be retaken if either the Interim1 or Final grade, respectively, is unsatisfactory (i.e., < 4). Retaking an exam is similar to the regular examination. The resulting grade is substituted for that of the latter (that is, retake grade is assigned to the variable Exami in the respective formula, whose value is then reevaluated). Those whose Interim or Final grade is still unsatisfactory after the first retake will have a (tough) choice to make.

Please take into account the following regulation according to the ''ПОПАТКУС'':
<blockquote>
On the first and second retakes, the cumulative course grade is taken into consideration. In case of receiving an unsatisfactory final grade after the first retake, the student may refuse to participate in the second retake and instead repeat the course according to the individual curriculum. The cumulative grade is formed again as a result of repeated courses. After completing the repeated course, the student is given a second retake only, which the student previously refused.
</blockquote>

The 'cumulative grade' here means all the variables in the grading formulas except Exami, which are the only ones to be retaken. The 'second retake' is similar to the first one and it is evaluated according to the same formula with the same values of 'cumulative' variables. This poses an obvious risk for anyone whose 'cumulatives' are low!

== Recommended reading ==
''Please notice that '''The Book''' for our Course does not exist. The latter is based on many sources.''

# Anderson J. A., Discrete Mathematics With Combinatorics. Prentice Hall, 2003.
# Biggs N. L., Discrete mathematics. 2nd ed., New York; Oxford: Oxford University Press, 2004.
# Gavrilov G. P., Sapozhenko A. A. Problems and Exercises in Discrete Mathematics. Kluwer Texts in the Mathematical Sciences 14. Springer, 1996.
# [http://courses.csail.mit.edu/6.042/spring17/mcs.pdf Lehman E., Thomson Leighton F., Meyer A. R. Mathematics for Computer Science, 2017.]
# [http://www.cs.elte.hu/~lovasz/dmbook.ps Lovasz L., Vesztergombi K. Discrete Mathematics. Lecture Notes; Yale University, 1999.]
# Melnikov O., Sarvanov V., Tyshkevich R., Yemelichev V., Zverovich I. Exercises in Graph Theory. Kluwer Texts in the Mathematical Sciences 19. Springer, 1998.
# Rosen K. H. Discrete Mathematics and Its Applications. McGraw-Hill, 1999.
# Stein C., Drysdale R. L., Bogart K. Discrete mathematics for computer scientists. Addison-Wesley, 2010.
# Vinogradov I. M. Elements of number theory. Dover, 1954.

=== In Russian ===
''If you understand Russian (by any chance), you will probably benefit from reading the following books.''

# Виноградов И. М. Основы теории чисел. 9-е изд., М.: Наука, 1981.
# [http://rubtsov.su/public/DM-HSE-Draft.pdf Вялый М., Подольский В., Рубцов А., Шварц Д., Шень А. Лекции по дискретной математике.]
# Гаврилов Г. П., Сапоженко А. А. Задачи и упражнения по дискретной математике. 3-е изд., М.: ФИЗМАТЛИТ, 2004.
# [https://drive.google.com/file/d/1RM6KX_reBFwUXesWGUEu0sFn2NCaBgvz/view?usp=sharing Дашков Е. В. Введение в математическую логику. Множества и отношения. М.: МФТИ, 2019.]
# Зубков А. М., Севастьянов Б. А., Чистяков В. П. Сборник задач по теории вероятностей. 2-е изд., М.: Наука, 1989.
# Мельников О. И. Теория графов в занимательных задачах. 5-е изд., М.: Книжный дом "ЛИБРОКОМ", 2013.
# [http://www.mccme.ru/free-books/shen/shen-induction.pdf Шень А., Математическая индукция. 5-е изд, М.: МЦНМО, 2016.]

Discrete Mathematics 1 DSBA 2025/2026

2026-01-23T10:54:56Z

Brdan: /* Assignment deadlines */

== Instructors ==

=== The lecturer ===
My name is Evgeny Dashkov. Feel free to contact me via email: edashkov@gmail.com, [https://t.me/edashkov Telegram], or [https://vk.com/evgeny.v.dashkov VK].

My Assistant (the person responsible for the tables etc.): [https://t.me/almanmaria Maria Krotova].

=== Seminar Instructors and Teaching Assistants ===
{| class="wikitable" style="text-align:center"
|-
! Group !! 251 !! 252 !! 253 !! 254 !! 255 !! 256 !! 257
|-
|| Teachers || [https://t.me/edashkov Evgeny Dashkov] ||colspan="2"| [https://t.me/brdann Boris Danilov]|| colspan="3"| [https://t.me/DiegBuitrago Diego Buitrago] || [https://t.me/carlosbuitrago Carlos Buitrago]
|-
|| Teaching Assistants || [https://t.me/dandelii Maria Samoilova] || [https://t.me/Nixlle Danila Riazanov] || [https://t.me/svnsrg Sergey Savin] || [https://t.me/KinWiz Alexey Popov] || [https://t.me/dm9dj Maxim Kharlan] || [https://t.me/ayratmur Ayrat Murtazin] || [https://t.me/crazyglue Sofya Shapovalova]
|}

=== Whom should I ask? ===

If you have a question or comment concerning the mathematical content of our course, it is best to post it to our [https://t.me/joinchat/T_YTN4IG1vAJNWT9 student chat]. Alternatively, you may address your question to your Teaching Assistant, Seminar Instructor or the Lecturer (say, if your question discloses an important idea for a HW problem). It is much better to ask and get to know than not to ask and remain ignorant. '''Please do not hesitate to ask your mathematical questions!'''

If you need a more detailed consultation concerning the course's mathematics, please be informed that our Teaching Assistants usually hold periodic consultations while the Seminar Instructors and Lecturer have some designated time for counseling students. Still, the best thing to do is to arrange a consultation in advance via a personal communication.

Homework-grading related questions should be directed to your teaching assistant first; then to your seminar instructor and to the lecturer just in case of any disagreement.

Organizational, administrative, legal or paperwork questions must be addressed to the Student Service Center, Study Office or other relevant offices first and foremost. If you have been redirected to us with such a question nevertheless, please contact the Lecturer's Assistant first.

== Current performance ==

[https://docs.google.com/spreadsheets/d/1vRdPzhUjqiDv2rGh9A3hYvtNmo3AkoEUtXMxBgzud9U/edit?usp=sharing The Table].

== Homework ==
The homework includes a few problem sets, one in a fortnight or so (the deadlines are announced on giving each set). Every problem set consists of about 10 – 15 problems. These sets may be subdivided further for students’ convenience.

We expect you to try solving '''every''' homework problem. Nevertheless, in Modules 2 and 3 we are going to grade the solutions of about one quarter of all problems. The problems chosen to be graded will be the same for all students and our choice will be revealed past the deadline for each respective problem set.

Still, we suggest you try solving '''every''' homework problem. In particular, some of these problems will be given as special 'homework tests' to be held in class. The tests are scheduled to Modules 2 and 3 late weeks.

A student may be required to 'defend' (i.e., to explain orally) his written solution to any problem. His grade for the problem may be decreased if he fails to do so properly.

== Exam 1 ==
A written examination is held past Module 1. Students may not consult any sources during the exam. The examination takes about 120 minutes. An integer weight is assigned to every problem.

== Colloquium ==
An oral colloquium is held at the beginning of Module 3. Each student is given two questions concerning statements and definitions as well as one question requiring a proof. After no less than 45 minutes of preparation (when using any literature is allowed), the student is required to answer ‘from scratch’, that is, with no recourse to any materials. The examiner may pose additional questions as he sees fit.

'''Please find the question list and rules [here]'''.

== Exam 2 ==
A written examination is held past Module 3. Students may not consult any sources during the exam. The examination takes about 120 minutes. An integer weight is assigned to every problem.

== Bonus activities ==
Throughout the course, the students may be graded for a variety of ‘bonus activities’ (like quizzes, etc.) either offline or online.

== Course materials ==

[https://t.me/joinchat/T_YTN4IG1vAJNWT9 Course chat]. This is our primary outlet for course announcements, questions, and discussions. '''Please join it!'''

=== Lecture notes ===

[https://drive.google.com/file/d/1mmNLLQ0--EDihGNRKwSyXLOA1KL7A0lD/view?usp=sharing Original English version]

[https://drive.google.com/drive/folders/1cTCdJtVVtO9uDgIKE8HY0qhl285tzOo1?usp=drive_link A Russian translation by volunteering students] (you are welcome to [https://t.me/sigma_algebraa join] their ranks)

=== Classes recordings ===

=== Lecture video archive ===

=== Other resources ===
* [https://tinyurl.com/rwky5vmk The Course's Google Directory]

* [https://www.youtube.com/playlist?list=PL1Uob8iPTHGTidrmrqEHTJ96Pt3-PmML4 Past years' videos]

* We have a [https://meet.edashkov.net.ru dedicated server] to hold an online meeting if we need one.

== Problem sets ==

=== Class problems ===

* [https://drive.google.com/file/d/1EP-diSuOTn9f0ryg18Z2w0xjEp8j0bnl/view?usp=drive_link Problem Set 1]

* [https://drive.google.com/file/d/12ct99-ORd7A94Gh5g4Nf9riv7UqNMSRc/view?usp=drive_link Problem Set 2]

* [https://drive.google.com/file/d/1yKKqLsS99V4AhCYqbjafuav2CMCdQTOQ/view?usp=drive_link Problem Set 3]

* [https://drive.google.com/file/d/1YgH_AdCk4GcKC0KH7xBA4-sUnOYkUvUK/view?usp=drive_link Problem Set 4]

* [https://drive.google.com/file/d/1M556PSgTJOo5W-AxYEXjFu94VfledpF5/view?usp=drive_link Problem Set 5]

* [https://drive.google.com/file/d/1-ylVViaBgzxEM-M7Rvrz2iggtK6UiJTY/view?usp=drive_link Problem Set 6]

* [https://drive.google.com/file/d/15tcTNLW-uFqT2xPJn1imOnEzaGwlaZAq/view?usp=drive_link Problem Set 7]



=== Assignment deadlines ===

{| class="wikitable"
|-
! Home problem set !! colspan="11" | Deadline
|-
| || 251 || 252 || 253 || 254 || 255 || 256 || 257
|-
| [https://drive.google.com/file/d/15vCxTrNMwagS4rqQnUzdLParTqOP8y5P/view?usp=drive_link HW1a ] || Sep 25 || Sep 25 || Sep 25 || Sep 23 || Sep 23 || Sep 23 || Sep 22
|-
| [https://drive.google.com/file/d/1PTJY1PEG-wUlTqUGXT8KWRsll8H0XLb0/view?usp=drive_link HW1b] || Oct 5 || Oct 9 || Oct 9 || Oct 11 || Oct 11 || Oct 11 ||Oct 7
|-
| [https://drive.google.com/file/d/1mSNPCXo1J3eMz7Wk9yagWkgaZn7AwN7B/view?usp=drive_link HW1c] || Oct 19 || Oct 23 || Oct 23 || Oct 22 || Oct 22 || Oct 22 || Oct 23
|-
| [https://drive.google.com/file/d/1LOPPwGjyVleR_mclxTKUJ_bxFrxt44sW/view?usp=drive_link HW2a] || Nov 13 || Nov 13 || Nov 13 || Nov 18 || Nov 18 || Nov 18 || Dec 1
|-
| [https://drive.google.com/file/d/1W7k1OTiIMlPOpo-2mwmGegrc4RDHz5_j/view?usp=drive_link HW2b] || Nov 30 || Nov 30 || Nov 30 || 03 Dec || 03 Dec || 03 Dec || Dec 8
|-
| [https://drive.google.com/file/d/1V99HEXHgcCXT6tjJp0oPV05Jw172Bid8/view?usp=drive_link HW2c] || Dec 14 || Dec 14 || Dec 14 || Dec 19 || Dec 19 || Dec 19 || Dec 19
|-
| [https://drive.google.com/file/d/1NVhQr0s6Z7SK6Y_oXzskXpY8c1CVeolJ/view?usp=drive_link HW3a] || Jan 25 || Jan 31 || Jan 31 || || || ||

|}

'''Each deadline is set by the respective group's instructor.'''

== Assessment and Grading ==

=== Homework ===

The homework is graded in three batches: one (HW_A) includes everything to be submitted in Module1, another (HW_B) includes all the problems submitted in other modules '''that we will choose to be graded''' (see Homework section for an explanation). The last batch (HW_Test_B) consists of two in-class tests; each test takes about 80 minutes and contains 6 -- 8 problems from the homework problem sets or very similar to those. For each problem, the student is given a score from 0 to 1 point (in fractional values) according to the progress he made.

The homework graded are computed the following way (before rounding):

HW_A = 10 * (the sum of points given for the problems) / #(problems);
''all the problems are to be graded''.

Grade HW_B is computed similarly but for its respective period of Modules 2 and 3:

HW_B = 10 * (the sum of points given for the problems) / #(problems subject to be graded);
''a few chosen problems are to be graded''.

HW_Test_B = 10 * (the sum of points given for the problems in both the tests) / #(problems in both the tests).

=== Exam1 and the Interim Assessment ===

Each problem solution is graded with a fractional score from 0 to 1 point, and the entire exam with the value (before rounding)

Exam1 = 10 * (p1 * w1 + ... + pn * wn) / (w1 + ... + wn),
where pi is the score and wi is the weight for the i-th problem.

The Interim grade 1 is computed past Module 1 and equals:

Interim1 = round(Interim1'), where

Interim1' = 0.5 * HW_A + 0.5 * Exam1.

(Here and everywhere, rounding is according to the usual arithmetic rules.)

=== Colloquium ===
For each of the 'definition' two questions, the student is given a score from 0 to 2 points, and from 0 to 4 points for the ‘proof’ question (all in fractional values).
The Colloq grade is computed the following way (before rounding):

Colloq = 10 * (the sum of points given) / 8.

=== Bonuses ===
Each student is given a score according to his progress in bonus activities, which results in the grade

Bonus = 10 * #(points given) / #(points possible).

The number of possible points varies but it is between 1 and 25 usually.

=== Exam2, the Second Interim, and the Final Assessment ===
Each problem solution is graded with a fractional score from 0 to 1 point, and the entire exam with the value (before rounding)

Exam2 = 10 * (p1 * w1 + ... + pn * wn) / (w1 + ... + wn),

where pi is the score and wi is the weight for the i-th problem.

The Interim grade 2 is computed past Module 3 and equals:

Interim2 = round(Interim2'), where

Interim2' = 0.085 * HW_B + 0.210 * HW_Test_B + 0.295 * Colloq + 0.06 * Bonus + 0.35 * Exam2.

The final grade for the course is

Final = round(0.3 * Interim1' + 0.7 * Interim 2')

Generally, '''nobody is exempt from the examinations'''.

== Plagiarism regulations ==
Plagiarism, that is, all forms of cheating with doing your academic assignments, including any '''unauthorized help of AI''' or another person, will not be tolerated. In this course, using AI is '''not''' generally authorized. Clearly, we may not have a definitive proof that somebody is cheating (notice, however, that AI-generated solutions to mathematical problems are quite conspicuous if they have not been edited heavily). Therefore, we will reserve the right to ask a suspect student to 'defend' his any written work, that is, to explain it orally and in person. So our regulations stipulate:
<blockquote>
If plagiarism is detected (including material generated with the help of generative AI without prior approval from the teacher), the assessment element will be assigned a score of "0".
If there is a suspicion that the task was not completed independently, the teacher has the right to initiate an additional verification or a defense of this particular assessment element. The final grade for the element will be based on the results of such verification or defense.
The teacher also has the right to randomly invite any student to defend any assessment element, regardless of plagiarism or suspicion. If the student refuses or fails to defend the work, the grade for this element will be annulled and recorded as "0".
</blockquote>
A final word of advice. Using AI regularly (and this is addictive!) instead of your natural intelligence will make you stupid and intellectually impotent in no time---at the price of a slight grade advantage (assuming your cheating goes unpunished). Do you really want it in this competitive world?

== Exam retaking ==
Examinations 1 and 2 are subject to be retaken if either the Interim1 or Final grade, respectively, is unsatisfactory (i.e., < 4). Retaking an exam is similar to the regular examination. The resulting grade is substituted for that of the latter (that is, retake grade is assigned to the variable Exami in the respective formula, whose value is then reevaluated). Those whose Interim or Final grade is still unsatisfactory after the first retake will have a (tough) choice to make.

Please take into account the following regulation according to the ''ПОПАТКУС'':
<blockquote>
On the first and second retakes, the cumulative course grade is taken into consideration. In case of receiving an unsatisfactory final grade after the first retake, the student may refuse to participate in the second retake and instead repeat the course according to the individual curriculum. The cumulative grade is formed again as a result of repeated courses. After completing the repeated course, the student is given a second retake only, which the student previously refused.
</blockquote>

The 'cumulative grade' here means all the variables in the grading formulas except Exami, which are the only ones to be retaken. The 'second retake' is similar to the first one and it is evaluated according to the same formula with the same values of 'cumulative' variables. This poses an obvious risk for anyone whose 'cumulatives' are low!

== Recommended reading ==
''Please notice that '''The Book''' for our Course does not exist. The latter is based on many sources.''

# Anderson J. A., Discrete Mathematics With Combinatorics. Prentice Hall, 2003.
# Biggs N. L., Discrete mathematics. 2nd ed., New York; Oxford: Oxford University Press, 2004.
# Gavrilov G. P., Sapozhenko A. A. Problems and Exercises in Discrete Mathematics. Kluwer Texts in the Mathematical Sciences 14. Springer, 1996.
# [http://courses.csail.mit.edu/6.042/spring17/mcs.pdf Lehman E., Thomson Leighton F., Meyer A. R. Mathematics for Computer Science, 2017.]
# [http://www.cs.elte.hu/~lovasz/dmbook.ps Lovasz L., Vesztergombi K. Discrete Mathematics. Lecture Notes; Yale University, 1999.]
# Melnikov O., Sarvanov V., Tyshkevich R., Yemelichev V., Zverovich I. Exercises in Graph Theory. Kluwer Texts in the Mathematical Sciences 19. Springer, 1998.
# Rosen K. H. Discrete Mathematics and Its Applications. McGraw-Hill, 1999.
# Stein C., Drysdale R. L., Bogart K. Discrete mathematics for computer scientists. Addison-Wesley, 2010.
# Vinogradov I. M. Elements of number theory. Dover, 1954.

=== In Russian ===
''If you understand Russian (by any chance), you will probably benefit from reading the following books.''

# Виноградов И. М. Основы теории чисел. 9-е изд., М.: Наука, 1981.
# [http://rubtsov.su/public/DM-HSE-Draft.pdf Вялый М., Подольский В., Рубцов А., Шварц Д., Шень А. Лекции по дискретной математике.]
# Гаврилов Г. П., Сапоженко А. А. Задачи и упражнения по дискретной математике. 3-е изд., М.: ФИЗМАТЛИТ, 2004.
# [https://drive.google.com/file/d/1RM6KX_reBFwUXesWGUEu0sFn2NCaBgvz/view?usp=sharing Дашков Е. В. Введение в математическую логику. Множества и отношения. М.: МФТИ, 2019.]
# Зубков А. М., Севастьянов Б. А., Чистяков В. П. Сборник задач по теории вероятностей. 2-е изд., М.: Наука, 1989.
# Мельников О. И. Теория графов в занимательных задачах. 5-е изд., М.: Книжный дом "ЛИБРОКОМ", 2013.
# [http://www.mccme.ru/free-books/shen/shen-induction.pdf Шень А., Математическая индукция. 5-е изд, М.: МЦНМО, 2016.]

Discrete Mathematics 1 DSBA 2025/2026

2026-01-23T10:54:29Z

Brdan: /* Assignment deadlines */

== Instructors ==

=== The lecturer ===
My name is Evgeny Dashkov. Feel free to contact me via email: edashkov@gmail.com, [https://t.me/edashkov Telegram], or [https://vk.com/evgeny.v.dashkov VK].

My Assistant (the person responsible for the tables etc.): [https://t.me/almanmaria Maria Krotova].

=== Seminar Instructors and Teaching Assistants ===
{| class="wikitable" style="text-align:center"
|-
! Group !! 251 !! 252 !! 253 !! 254 !! 255 !! 256 !! 257
|-
|| Teachers || [https://t.me/edashkov Evgeny Dashkov] ||colspan="2"| [https://t.me/brdann Boris Danilov]|| colspan="3"| [https://t.me/DiegBuitrago Diego Buitrago] || [https://t.me/carlosbuitrago Carlos Buitrago]
|-
|| Teaching Assistants || [https://t.me/dandelii Maria Samoilova] || [https://t.me/Nixlle Danila Riazanov] || [https://t.me/svnsrg Sergey Savin] || [https://t.me/KinWiz Alexey Popov] || [https://t.me/dm9dj Maxim Kharlan] || [https://t.me/ayratmur Ayrat Murtazin] || [https://t.me/crazyglue Sofya Shapovalova]
|}

=== Whom should I ask? ===

If you have a question or comment concerning the mathematical content of our course, it is best to post it to our [https://t.me/joinchat/T_YTN4IG1vAJNWT9 student chat]. Alternatively, you may address your question to your Teaching Assistant, Seminar Instructor or the Lecturer (say, if your question discloses an important idea for a HW problem). It is much better to ask and get to know than not to ask and remain ignorant. '''Please do not hesitate to ask your mathematical questions!'''

If you need a more detailed consultation concerning the course's mathematics, please be informed that our Teaching Assistants usually hold periodic consultations while the Seminar Instructors and Lecturer have some designated time for counseling students. Still, the best thing to do is to arrange a consultation in advance via a personal communication.

Homework-grading related questions should be directed to your teaching assistant first; then to your seminar instructor and to the lecturer just in case of any disagreement.

Organizational, administrative, legal or paperwork questions must be addressed to the Student Service Center, Study Office or other relevant offices first and foremost. If you have been redirected to us with such a question nevertheless, please contact the Lecturer's Assistant first.

== Current performance ==

[https://docs.google.com/spreadsheets/d/1vRdPzhUjqiDv2rGh9A3hYvtNmo3AkoEUtXMxBgzud9U/edit?usp=sharing The Table].

== Homework ==
The homework includes a few problem sets, one in a fortnight or so (the deadlines are announced on giving each set). Every problem set consists of about 10 – 15 problems. These sets may be subdivided further for students’ convenience.

We expect you to try solving '''every''' homework problem. Nevertheless, in Modules 2 and 3 we are going to grade the solutions of about one quarter of all problems. The problems chosen to be graded will be the same for all students and our choice will be revealed past the deadline for each respective problem set.

Still, we suggest you try solving '''every''' homework problem. In particular, some of these problems will be given as special 'homework tests' to be held in class. The tests are scheduled to Modules 2 and 3 late weeks.

A student may be required to 'defend' (i.e., to explain orally) his written solution to any problem. His grade for the problem may be decreased if he fails to do so properly.

== Exam 1 ==
A written examination is held past Module 1. Students may not consult any sources during the exam. The examination takes about 120 minutes. An integer weight is assigned to every problem.

== Colloquium ==
An oral colloquium is held at the beginning of Module 3. Each student is given two questions concerning statements and definitions as well as one question requiring a proof. After no less than 45 minutes of preparation (when using any literature is allowed), the student is required to answer ‘from scratch’, that is, with no recourse to any materials. The examiner may pose additional questions as he sees fit.

'''Please find the question list and rules [here]'''.

== Exam 2 ==
A written examination is held past Module 3. Students may not consult any sources during the exam. The examination takes about 120 minutes. An integer weight is assigned to every problem.

== Bonus activities ==
Throughout the course, the students may be graded for a variety of ‘bonus activities’ (like quizzes, etc.) either offline or online.

== Course materials ==

[https://t.me/joinchat/T_YTN4IG1vAJNWT9 Course chat]. This is our primary outlet for course announcements, questions, and discussions. '''Please join it!'''

=== Lecture notes ===

[https://drive.google.com/file/d/1mmNLLQ0--EDihGNRKwSyXLOA1KL7A0lD/view?usp=sharing Original English version]

[https://drive.google.com/drive/folders/1cTCdJtVVtO9uDgIKE8HY0qhl285tzOo1?usp=drive_link A Russian translation by volunteering students] (you are welcome to [https://t.me/sigma_algebraa join] their ranks)

=== Classes recordings ===

=== Lecture video archive ===

=== Other resources ===
* [https://tinyurl.com/rwky5vmk The Course's Google Directory]

* [https://www.youtube.com/playlist?list=PL1Uob8iPTHGTidrmrqEHTJ96Pt3-PmML4 Past years' videos]

* We have a [https://meet.edashkov.net.ru dedicated server] to hold an online meeting if we need one.

== Problem sets ==

=== Class problems ===

* [https://drive.google.com/file/d/1EP-diSuOTn9f0ryg18Z2w0xjEp8j0bnl/view?usp=drive_link Problem Set 1]

* [https://drive.google.com/file/d/12ct99-ORd7A94Gh5g4Nf9riv7UqNMSRc/view?usp=drive_link Problem Set 2]

* [https://drive.google.com/file/d/1yKKqLsS99V4AhCYqbjafuav2CMCdQTOQ/view?usp=drive_link Problem Set 3]

* [https://drive.google.com/file/d/1YgH_AdCk4GcKC0KH7xBA4-sUnOYkUvUK/view?usp=drive_link Problem Set 4]

* [https://drive.google.com/file/d/1M556PSgTJOo5W-AxYEXjFu94VfledpF5/view?usp=drive_link Problem Set 5]

* [https://drive.google.com/file/d/1-ylVViaBgzxEM-M7Rvrz2iggtK6UiJTY/view?usp=drive_link Problem Set 6]

* [https://drive.google.com/file/d/15tcTNLW-uFqT2xPJn1imOnEzaGwlaZAq/view?usp=drive_link Problem Set 7]



=== Assignment deadlines ===

{| class="wikitable"
|-
! Home problem set !! colspan="11" | Deadline
|-
| || 251 || 252 || 253 || 254 || 255 || 256 || 257
|-
| [https://drive.google.com/file/d/15vCxTrNMwagS4rqQnUzdLParTqOP8y5P/view?usp=drive_link HW1a ] || Sep 25 || Sep 25 || Sep 25 || Sep 23 || Sep 23 || Sep 23 || Sep 22
|-
| [https://drive.google.com/file/d/1PTJY1PEG-wUlTqUGXT8KWRsll8H0XLb0/view?usp=drive_link HW1b] || Oct 5 || Oct 9 || Oct 9 || Oct 11 || Oct 11 || Oct 11 ||Oct 7
|-
| [https://drive.google.com/file/d/1mSNPCXo1J3eMz7Wk9yagWkgaZn7AwN7B/view?usp=drive_link HW1c] || Oct 19 || Oct 23 || Oct 23 || Oct 22 || Oct 22 || Oct 22 || Oct 23
|-
| [https://drive.google.com/file/d/1LOPPwGjyVleR_mclxTKUJ_bxFrxt44sW/view?usp=drive_link HW2a] || Nov 13 || Nov 13 || Nov 13 || Nov 18 || Nov 18 || Nov 18 || Dec 1
|-
| [https://drive.google.com/file/d/1W7k1OTiIMlPOpo-2mwmGegrc4RDHz5_j/view?usp=drive_link HW2b] || Nov 30 || Nov 30 || Nov 30 || 03 Dec || 03 Dec || 03 Dec || Dec 8
|-
| [https://drive.google.com/file/d/1V99HEXHgcCXT6tjJp0oPV05Jw172Bid8/view?usp=drive_link HW2c] || Dec 14 || Dec 14 || Dec 14 || Dec 19 || Dec 19 || Dec 19 || Dec 19
|-
| [https://drive.google.com/file/d/1NVhQr0s6Z7SK6Y_oXzskXpY8c1CVeolJ/view?usp=drive_link HW3a] || Jan 25 |Jan 31| |Jan 31| || || || ||

|}

'''Each deadline is set by the respective group's instructor.'''

== Assessment and Grading ==

=== Homework ===

The homework is graded in three batches: one (HW_A) includes everything to be submitted in Module1, another (HW_B) includes all the problems submitted in other modules '''that we will choose to be graded''' (see Homework section for an explanation). The last batch (HW_Test_B) consists of two in-class tests; each test takes about 80 minutes and contains 6 -- 8 problems from the homework problem sets or very similar to those. For each problem, the student is given a score from 0 to 1 point (in fractional values) according to the progress he made.

The homework graded are computed the following way (before rounding):

HW_A = 10 * (the sum of points given for the problems) / #(problems);
''all the problems are to be graded''.

Grade HW_B is computed similarly but for its respective period of Modules 2 and 3:

HW_B = 10 * (the sum of points given for the problems) / #(problems subject to be graded);
''a few chosen problems are to be graded''.

HW_Test_B = 10 * (the sum of points given for the problems in both the tests) / #(problems in both the tests).

=== Exam1 and the Interim Assessment ===

Each problem solution is graded with a fractional score from 0 to 1 point, and the entire exam with the value (before rounding)

Exam1 = 10 * (p1 * w1 + ... + pn * wn) / (w1 + ... + wn),
where pi is the score and wi is the weight for the i-th problem.

The Interim grade 1 is computed past Module 1 and equals:

Interim1 = round(Interim1'), where

Interim1' = 0.5 * HW_A + 0.5 * Exam1.

(Here and everywhere, rounding is according to the usual arithmetic rules.)

=== Colloquium ===
For each of the 'definition' two questions, the student is given a score from 0 to 2 points, and from 0 to 4 points for the ‘proof’ question (all in fractional values).
The Colloq grade is computed the following way (before rounding):

Colloq = 10 * (the sum of points given) / 8.

=== Bonuses ===
Each student is given a score according to his progress in bonus activities, which results in the grade

Bonus = 10 * #(points given) / #(points possible).

The number of possible points varies but it is between 1 and 25 usually.

=== Exam2, the Second Interim, and the Final Assessment ===
Each problem solution is graded with a fractional score from 0 to 1 point, and the entire exam with the value (before rounding)

Exam2 = 10 * (p1 * w1 + ... + pn * wn) / (w1 + ... + wn),

where pi is the score and wi is the weight for the i-th problem.

The Interim grade 2 is computed past Module 3 and equals:

Interim2 = round(Interim2'), where

Interim2' = 0.085 * HW_B + 0.210 * HW_Test_B + 0.295 * Colloq + 0.06 * Bonus + 0.35 * Exam2.

The final grade for the course is

Final = round(0.3 * Interim1' + 0.7 * Interim 2')

Generally, '''nobody is exempt from the examinations'''.

== Plagiarism regulations ==
Plagiarism, that is, all forms of cheating with doing your academic assignments, including any '''unauthorized help of AI''' or another person, will not be tolerated. In this course, using AI is '''not''' generally authorized. Clearly, we may not have a definitive proof that somebody is cheating (notice, however, that AI-generated solutions to mathematical problems are quite conspicuous if they have not been edited heavily). Therefore, we will reserve the right to ask a suspect student to 'defend' his any written work, that is, to explain it orally and in person. So our regulations stipulate:
<blockquote>
If plagiarism is detected (including material generated with the help of generative AI without prior approval from the teacher), the assessment element will be assigned a score of "0".
If there is a suspicion that the task was not completed independently, the teacher has the right to initiate an additional verification or a defense of this particular assessment element. The final grade for the element will be based on the results of such verification or defense.
The teacher also has the right to randomly invite any student to defend any assessment element, regardless of plagiarism or suspicion. If the student refuses or fails to defend the work, the grade for this element will be annulled and recorded as "0".
</blockquote>
A final word of advice. Using AI regularly (and this is addictive!) instead of your natural intelligence will make you stupid and intellectually impotent in no time---at the price of a slight grade advantage (assuming your cheating goes unpunished). Do you really want it in this competitive world?

== Exam retaking ==
Examinations 1 and 2 are subject to be retaken if either the Interim1 or Final grade, respectively, is unsatisfactory (i.e., < 4). Retaking an exam is similar to the regular examination. The resulting grade is substituted for that of the latter (that is, retake grade is assigned to the variable Exami in the respective formula, whose value is then reevaluated). Those whose Interim or Final grade is still unsatisfactory after the first retake will have a (tough) choice to make.

Please take into account the following regulation according to the ''ПОПАТКУС'':
<blockquote>
On the first and second retakes, the cumulative course grade is taken into consideration. In case of receiving an unsatisfactory final grade after the first retake, the student may refuse to participate in the second retake and instead repeat the course according to the individual curriculum. The cumulative grade is formed again as a result of repeated courses. After completing the repeated course, the student is given a second retake only, which the student previously refused.
</blockquote>

The 'cumulative grade' here means all the variables in the grading formulas except Exami, which are the only ones to be retaken. The 'second retake' is similar to the first one and it is evaluated according to the same formula with the same values of 'cumulative' variables. This poses an obvious risk for anyone whose 'cumulatives' are low!

== Recommended reading ==
''Please notice that '''The Book''' for our Course does not exist. The latter is based on many sources.''

# Anderson J. A., Discrete Mathematics With Combinatorics. Prentice Hall, 2003.
# Biggs N. L., Discrete mathematics. 2nd ed., New York; Oxford: Oxford University Press, 2004.
# Gavrilov G. P., Sapozhenko A. A. Problems and Exercises in Discrete Mathematics. Kluwer Texts in the Mathematical Sciences 14. Springer, 1996.
# [http://courses.csail.mit.edu/6.042/spring17/mcs.pdf Lehman E., Thomson Leighton F., Meyer A. R. Mathematics for Computer Science, 2017.]
# [http://www.cs.elte.hu/~lovasz/dmbook.ps Lovasz L., Vesztergombi K. Discrete Mathematics. Lecture Notes; Yale University, 1999.]
# Melnikov O., Sarvanov V., Tyshkevich R., Yemelichev V., Zverovich I. Exercises in Graph Theory. Kluwer Texts in the Mathematical Sciences 19. Springer, 1998.
# Rosen K. H. Discrete Mathematics and Its Applications. McGraw-Hill, 1999.
# Stein C., Drysdale R. L., Bogart K. Discrete mathematics for computer scientists. Addison-Wesley, 2010.
# Vinogradov I. M. Elements of number theory. Dover, 1954.

=== In Russian ===
''If you understand Russian (by any chance), you will probably benefit from reading the following books.''

# Виноградов И. М. Основы теории чисел. 9-е изд., М.: Наука, 1981.
# [http://rubtsov.su/public/DM-HSE-Draft.pdf Вялый М., Подольский В., Рубцов А., Шварц Д., Шень А. Лекции по дискретной математике.]
# Гаврилов Г. П., Сапоженко А. А. Задачи и упражнения по дискретной математике. 3-е изд., М.: ФИЗМАТЛИТ, 2004.
# [https://drive.google.com/file/d/1RM6KX_reBFwUXesWGUEu0sFn2NCaBgvz/view?usp=sharing Дашков Е. В. Введение в математическую логику. Множества и отношения. М.: МФТИ, 2019.]
# Зубков А. М., Севастьянов Б. А., Чистяков В. П. Сборник задач по теории вероятностей. 2-е изд., М.: Наука, 1989.
# Мельников О. И. Теория графов в занимательных задачах. 5-е изд., М.: Книжный дом "ЛИБРОКОМ", 2013.
# [http://www.mccme.ru/free-books/shen/shen-induction.pdf Шень А., Математическая индукция. 5-е изд, М.: МЦНМО, 2016.]

Discrete Mathematics 1 DSBA 2025/2026

2025-12-08T18:04:49Z

Brdan: /* Assignment deadlines */

== Instructors ==

=== The lecturer ===
My name is Evgeny Dashkov. Feel free to contact me via email: edashkov@gmail.com, [https://t.me/edashkov Telegram], or [https://vk.com/evgeny.v.dashkov VK].

My Assistant (the person responsible for the tables etc.): [https://t.me/almanmaria Maria Krotova].

=== Seminar Instructors and Teaching Assistants ===
{| class="wikitable" style="text-align:center"
|-
! Group !! 251 !! 252 !! 253 !! 254 !! 255 !! 256 !! 257
|-
|| Teachers || [https://t.me/edashkov Evgeny Dashkov] ||colspan="2"| [https://t.me/brdann Boris Danilov]|| colspan="3"| [https://t.me/DiegBuitrago Diego Buitrago] || [https://t.me/carlosbuitrago Carlos Buitrago]
|-
|| Teaching Assistants || [https://t.me/dandelii Maria Samoilova] || [https://t.me/Nixlle Danila Riazanov] || [https://t.me/svnsrg Sergey Savin] || [https://t.me/KinWiz Alexey Popov] || [https://t.me/dm9dj Maxim Kharlan] || [https://t.me/ayratmur Ayrat Murtazin] || [https://t.me/crazyglue Sofya Shapovalova]
|}

=== Whom should I ask? ===

If you have a question or comment concerning the mathematical content of our course, it is best to post it to our [https://t.me/joinchat/T_YTN4IG1vAJNWT9 student chat]. Alternatively, you may address your question to your Teaching Assistant, Seminar Instructor or the Lecturer (say, if your question discloses an important idea for a HW problem). It is much better to ask and get to know than not to ask and remain ignorant. '''Please do not hesitate to ask your mathematical questions!'''

If you need a more detailed consultation concerning the course's mathematics, please be informed that our Teaching Assistants usually hold periodic consultations while the Seminar Instructors and Lecturer have some designated time for counseling students. Still, the best thing to do is to arrange a consultation in advance via a personal communication.

Homework-grading related questions should be directed to your teaching assistant first; then to your seminar instructor and to the lecturer just in case of any disagreement.

Organizational, administrative, legal or paperwork questions must be addressed to the Student Service Center, Study Office or other relevant offices first and foremost. If you have been redirected to us with such a question nevertheless, please contact the Lecturer's Assistant first.

== Current performance ==

[https://docs.google.com/spreadsheets/d/1vRdPzhUjqiDv2rGh9A3hYvtNmo3AkoEUtXMxBgzud9U/edit?usp=sharing The Table].

== Homework ==
The homework includes a few problem sets, one in a fortnight or so (the deadlines are announced on giving each set). Every problem set consists of about 10 – 15 problems. These sets may be subdivided further for students’ convenience.

We expect you to try solving '''every''' homework problem. Nevertheless, in Modules 2 and 3 we are going to grade the solutions of about one quarter of all problems. The problems chosen to be graded will be the same for all students and our choice will be revealed past the deadline for each respective problem set.

Still, we suggest you try solving '''every''' homework problem. In particular, some of these problems will be given as special 'homework tests' to be held in class. The tests are scheduled to Modules 2 and 3 late weeks.

A student may be required to 'defend' (i.e., to explain orally) his written solution to any problem. His grade for the problem may be decreased if he fails to do so properly.

== Exam 1 ==
A written examination is held past Module 1. Students may not consult any sources during the exam. The examination takes about 120 minutes. An integer weight is assigned to every problem.

== Colloquium ==
An oral colloquium is held at the beginning of Module 3. Each student is given two questions concerning statements and definitions as well as one question requiring a proof. After no less than 45 minutes of preparation (when using any literature is allowed), the student is required to answer ‘from scratch’, that is, with no recourse to any materials. The examiner may pose additional questions as he sees fit.

'''Please find the question list and rules [here]'''.

== Exam 2 ==
A written examination is held past Module 3. Students may not consult any sources during the exam. The examination takes about 120 minutes. An integer weight is assigned to every problem.

== Bonus activities ==
Throughout the course, the students may be graded for a variety of ‘bonus activities’ (like quizzes, etc.) either offline or online.

== Course materials ==

[https://t.me/joinchat/T_YTN4IG1vAJNWT9 Course chat]. This is our primary outlet for course announcements, questions, and discussions. '''Please join it!'''

=== Lecture notes ===

[https://drive.google.com/file/d/1mmNLLQ0--EDihGNRKwSyXLOA1KL7A0lD/view?usp=sharing Original English version]

[https://drive.google.com/drive/folders/1cTCdJtVVtO9uDgIKE8HY0qhl285tzOo1?usp=drive_link A Russian translation by volunteering students] (you are welcome to [https://t.me/sigma_algebraa join] their ranks)

=== Classes recordings ===

=== Lecture video archive ===

=== Other resources ===
* [https://tinyurl.com/rwky5vmk The Course's Google Directory]

* [https://www.youtube.com/playlist?list=PL1Uob8iPTHGTidrmrqEHTJ96Pt3-PmML4 Past years' videos]

* We have a [https://meet.edashkov.net.ru dedicated server] to hold an online meeting if we need one.

== Problem sets ==

=== Class problems ===

* [https://drive.google.com/file/d/1EP-diSuOTn9f0ryg18Z2w0xjEp8j0bnl/view?usp=drive_link Problem Set 1]

* [https://drive.google.com/file/d/12ct99-ORd7A94Gh5g4Nf9riv7UqNMSRc/view?usp=drive_link Problem Set 2]

* [https://drive.google.com/file/d/1yKKqLsS99V4AhCYqbjafuav2CMCdQTOQ/view?usp=drive_link Problem Set 3]

* [https://drive.google.com/file/d/1YgH_AdCk4GcKC0KH7xBA4-sUnOYkUvUK/view?usp=drive_link Problem Set 4]

* [https://drive.google.com/file/d/1M556PSgTJOo5W-AxYEXjFu94VfledpF5/view?usp=drive_link Problem Set 5]



=== Assignment deadlines ===

{| class="wikitable"
|-
! Home problem set !! colspan="11" | Deadline
|-
| || 251 || 252 || 253 || 254 || 255 || 256 || 257
|-
| [https://drive.google.com/file/d/15vCxTrNMwagS4rqQnUzdLParTqOP8y5P/view?usp=drive_link HW1a ] || Sep 25 || Sep 25 || Sep 25 || Sep 23 || Sep 23 || Sep 23 || Sep 22
|-
| [https://drive.google.com/file/d/1PTJY1PEG-wUlTqUGXT8KWRsll8H0XLb0/view?usp=drive_link HW1b] || Oct 5 || Oct 9 || Oct 9 || Oct 11 || Oct 11 || Oct 11 ||Oct 7
|-
| [https://drive.google.com/file/d/1mSNPCXo1J3eMz7Wk9yagWkgaZn7AwN7B/view?usp=drive_link HW1c] || Oct 19 || Oct 23 || Oct 23 || Oct 22 || Oct 22 || Oct 22 ||
|-
| [https://drive.google.com/file/d/1LOPPwGjyVleR_mclxTKUJ_bxFrxt44sW/view?usp=drive_link HW2a] || Nov 13 || Nov 13 || Nov 13 || Nov 18 || Nov 18 || Nov 18 ||
|-
| [https://drive.google.com/file/d/1W7k1OTiIMlPOpo-2mwmGegrc4RDHz5_j/view?usp=drive_link HW2b] || Nov 30 || Nov 30 || Nov 30 || 03 Dec || 03 Dec || 03 Dec ||
|-
| [https://drive.google.com/file/d/1V99HEXHgcCXT6tjJp0oPV05Jw172Bid8/view?usp=drive_link HW2c] || Dec 14 || Dec 14 || Dec 14 || || ||

|}

'''Each deadline is set by the respective group's instructor.'''

== Assessment and Grading ==

=== Homework ===

The homework is graded in three batches: one (HW_A) includes everything to be submitted in Module1, another (HW_B) includes all the problems submitted in other modules '''that we will choose to be graded''' (see Homework section for an explanation). The last batch (HW_Test_B) consists of two in-class tests; each test takes about 80 minutes and contains 6 -- 8 problems from the homework problem sets or very similar to those. For each problem, the student is given a score from 0 to 1 point (in fractional values) according to the progress he made.

The homework graded are computed the following way (before rounding):

HW_A = 10 * (the sum of points given for the problems) / #(problems);
''all the problems are to be graded''.

Grade HW_B is computed similarly but for its respective period of Modules 2 and 3:

HW_B = 10 * (the sum of points given for the problems) / #(problems subject to be graded);
''a few chosen problems are to be graded''.

HW_Test_B = 10 * (the sum of points given for the problems in both the tests) / #(problems in both the tests).

=== Exam1 and the Interim Assessment ===

Each problem solution is graded with a fractional score from 0 to 1 point, and the entire exam with the value (before rounding)

Exam1 = 10 * (p1 * w1 + ... + pn * wn) / (w1 + ... + wn),
where pi is the score and wi is the weight for the i-th problem.

The Interim grade 1 is computed past Module 1 and equals:

Interim1 = round(Interim1'), where

Interim1' = 0.5 * HW_A + 0.5 * Exam1.

(Here and everywhere, rounding is according to the usual arithmetic rules.)

=== Colloquium ===
For each of the 'definition' two questions, the student is given a score from 0 to 2 points, and from 0 to 4 points for the ‘proof’ question (all in fractional values).
The Colloq grade is computed the following way (before rounding):

Colloq = 10 * (the sum of points given) / 8.

=== Bonuses ===
Each student is given a score according to his progress in bonus activities, which results in the grade

Bonus = 10 * #(points given) / #(points possible).

The number of possible points varies but it is between 1 and 25 usually.

=== Exam2, the Second Interim, and the Final Assessment ===
Each problem solution is graded with a fractional score from 0 to 1 point, and the entire exam with the value (before rounding)

Exam2 = 10 * (p1 * w1 + ... + pn * wn) / (w1 + ... + wn),

where pi is the score and wi is the weight for the i-th problem.

The Interim grade 2 is computed past Module 3 and equals:

Interim2 = round(Interim2'), where

Interim2' = 0.085 * HW_B + 0.210 * HW_Test_B + 0.295 * Colloq + 0.06 * Bonus + 0.35 * Exam2.

The final grade for the course is

Final = round(0.3 * Interim1' + 0.7 * Interim 2')

Generally, '''nobody is exempt from the examinations'''.

== Plagiarism regulations ==
Plagiarism, that is, all forms of cheating with doing your academic assignments, including any '''unauthorized help of AI''' or another person, will not be tolerated. In this course, using AI is '''not''' generally authorized. Clearly, we may not have a definitive proof that somebody is cheating (notice, however, that AI-generated solutions to mathematical problems are quite conspicuous if they have not been edited heavily). Therefore, we will reserve the right to ask a suspect student to 'defend' his any written work, that is, to explain it orally and in person. So our regulations stipulate:
<blockquote>
If plagiarism is detected (including material generated with the help of generative AI without prior approval from the teacher), the assessment element will be assigned a score of "0".
If there is a suspicion that the task was not completed independently, the teacher has the right to initiate an additional verification or a defense of this particular assessment element. The final grade for the element will be based on the results of such verification or defense.
The teacher also has the right to randomly invite any student to defend any assessment element, regardless of plagiarism or suspicion. If the student refuses or fails to defend the work, the grade for this element will be annulled and recorded as "0".
</blockquote>
A final word of advice. Using AI regularly (and this is addictive!) instead of your natural intelligence will make you stupid and intellectually impotent in no time---at the price of a slight grade advantage (assuming your cheating goes unpunished). Do you really want it in this competitive world?

== Exam retaking ==
Examinations 1 and 2 are subject to be retaken if either the Interim1 or Final grade, respectively, is unsatisfactory (i.e., < 4). Retaking an exam is similar to the regular examination. The resulting grade is substituted for that of the latter (that is, retake grade is assigned to the variable Exami in the respective formula, whose value is then reevaluated). Those whose Interim or Final grade is still unsatisfactory after the first retake will have a (tough) choice to make.

Please take into account the following regulation according to the ''ПОПАТКУС'':
<blockquote>
On the first and second retakes, the cumulative course grade is taken into consideration. In case of receiving an unsatisfactory final grade after the first retake, the student may refuse to participate in the second retake and instead repeat the course according to the individual curriculum. The cumulative grade is formed again as a result of repeated courses. After completing the repeated course, the student is given a second retake only, which the student previously refused.
</blockquote>

The 'cumulative grade' here means all the variables in the grading formulas except Exami, which are the only ones to be retaken. The 'second retake' is similar to the first one and it is evaluated according to the same formula with the same values of 'cumulative' variables. This poses an obvious risk for anyone whose 'cumulatives' are low!

== Recommended reading ==
''Please notice that '''The Book''' for our Course does not exist. The latter is based on many sources.''

# Anderson J. A., Discrete Mathematics With Combinatorics. Prentice Hall, 2003.
# Biggs N. L., Discrete mathematics. 2nd ed., New York; Oxford: Oxford University Press, 2004.
# Gavrilov G. P., Sapozhenko A. A. Problems and Exercises in Discrete Mathematics. Kluwer Texts in the Mathematical Sciences 14. Springer, 1996.
# [http://courses.csail.mit.edu/6.042/spring17/mcs.pdf Lehman E., Thomson Leighton F., Meyer A. R. Mathematics for Computer Science, 2017.]
# [http://www.cs.elte.hu/~lovasz/dmbook.ps Lovasz L., Vesztergombi K. Discrete Mathematics. Lecture Notes; Yale University, 1999.]
# Melnikov O., Sarvanov V., Tyshkevich R., Yemelichev V., Zverovich I. Exercises in Graph Theory. Kluwer Texts in the Mathematical Sciences 19. Springer, 1998.
# Rosen K. H. Discrete Mathematics and Its Applications. McGraw-Hill, 1999.
# Stein C., Drysdale R. L., Bogart K. Discrete mathematics for computer scientists. Addison-Wesley, 2010.
# Vinogradov I. M. Elements of number theory. Dover, 1954.

=== In Russian ===
''If you understand Russian (by any chance), you will probably benefit from reading the following books.''

# Виноградов И. М. Основы теории чисел. 9-е изд., М.: Наука, 1981.
# [http://rubtsov.su/public/DM-HSE-Draft.pdf Вялый М., Подольский В., Рубцов А., Шварц Д., Шень А. Лекции по дискретной математике.]
# Гаврилов Г. П., Сапоженко А. А. Задачи и упражнения по дискретной математике. 3-е изд., М.: ФИЗМАТЛИТ, 2004.
# [https://drive.google.com/file/d/1RM6KX_reBFwUXesWGUEu0sFn2NCaBgvz/view?usp=sharing Дашков Е. В. Введение в математическую логику. Множества и отношения. М.: МФТИ, 2019.]
# Зубков А. М., Севастьянов Б. А., Чистяков В. П. Сборник задач по теории вероятностей. 2-е изд., М.: Наука, 1989.
# Мельников О. И. Теория графов в занимательных задачах. 5-е изд., М.: Книжный дом "ЛИБРОКОМ", 2013.
# [http://www.mccme.ru/free-books/shen/shen-induction.pdf Шень А., Математическая индукция. 5-е изд, М.: МЦНМО, 2016.]

Discrete Mathematics 1 DSBA 2025/2026

2025-11-22T12:42:35Z

Brdan: /* Assignment deadlines */

== Instructors ==

=== The lecturer ===
My name is Evgeny Dashkov. Feel free to contact me via email: edashkov@gmail.com, [https://t.me/edashkov Telegram], or [https://vk.com/evgeny.v.dashkov VK].

My Assistant (the person responsible for the tables etc.): [https://t.me/almanmaria Maria Krotova].

=== Seminar Instructors and Teaching Assistants ===
{| class="wikitable" style="text-align:center"
|-
! Group !! 251 !! 252 !! 253 !! 254 !! 255 !! 256 !! 257
|-
|| Teachers || [https://t.me/edashkov Evgeny Dashkov] ||colspan="2"| [https://t.me/brdann Boris Danilov]|| colspan="3"| [https://t.me/DiegBuitrago Diego Buitrago] || [https://t.me/carlosbuitrago Carlos Buitrago]
|-
|| Teaching Assistants || [https://t.me/dandelii Maria Samoilova] || [https://t.me/Nixlle Danila Riazanov] || [https://t.me/svnsrg Sergey Savin] || [https://t.me/KinWiz Alexey Popov] || [https://t.me/dm9dj Maxim Kharlan] || [https://t.me/ayratmur Ayrat Murtazin] || [https://t.me/crazyglue Sofya Shapovalova]
|}

=== Whom should I ask? ===

If you have a question or comment concerning the mathematical content of our course, it is best to post it to our [https://t.me/joinchat/T_YTN4IG1vAJNWT9 student chat]. Alternatively, you may address your question to your Teaching Assistant, Seminar Instructor or the Lecturer (say, if your question discloses an important idea for a HW problem). It is much better to ask and get to know than not to ask and remain ignorant. '''Please do not hesitate to ask your mathematical questions!'''

If you need a more detailed consultation concerning the course's mathematics, please be informed that our Teaching Assistants usually hold periodic consultations while the Seminar Instructors and Lecturer have some designated time for counseling students. Still, the best thing to do is to arrange a consultation in advance via a personal communication.

Homework-grading related questions should be directed to your teaching assistant first; then to your seminar instructor and to the lecturer just in case of any disagreement.

Organizational, administrative, legal or paperwork questions must be addressed to the Student Service Center, Study Office or other relevant offices first and foremost. If you have been redirected to us with such a question nevertheless, please contact the Lecturer's Assistant first.

== Current performance ==

[https://docs.google.com/spreadsheets/d/1vRdPzhUjqiDv2rGh9A3hYvtNmo3AkoEUtXMxBgzud9U/edit?usp=sharing The Table].

== Homework ==
The homework includes a few problem sets, one in a fortnight or so (the deadlines are announced on giving each set). Every problem set consists of about 10 – 15 problems. These sets may be subdivided further for students’ convenience.

We expect you to try solving '''every''' homework problem. Nevertheless, in Modules 2 and 3 we are going to grade the solutions of about one quarter of all problems. The problems chosen to be graded will be the same for all students and our choice will be revealed past the deadline for each respective problem set.

Still, we suggest you try solving '''every''' homework problem. In particular, some of these problems will be given as special 'homework tests' to be held in class. The tests are scheduled to Modules 2 and 3 late weeks.

A student may be required to 'defend' (i.e., to explain orally) his written solution to any problem. His grade for the problem may be decreased if he fails to do so properly.

== Exam 1 ==
A written examination is held past Module 1. Students may not consult any sources during the exam. The examination takes about 120 minutes. An integer weight is assigned to every problem.

== Colloquium ==
An oral colloquium is held at the beginning of Module 3. Each student is given two questions concerning statements and definitions as well as one question requiring a proof. After no less than 45 minutes of preparation (when using any literature is allowed), the student is required to answer ‘from scratch’, that is, with no recourse to any materials. The examiner may pose additional questions as he sees fit.

'''Please find the question list and rules [here]'''.

== Exam 2 ==
A written examination is held past Module 3. Students may not consult any sources during the exam. The examination takes about 120 minutes. An integer weight is assigned to every problem.

== Bonus activities ==
Throughout the course, the students may be graded for a variety of ‘bonus activities’ (like quizzes, etc.) either offline or online.

== Course materials ==

[https://t.me/joinchat/T_YTN4IG1vAJNWT9 Course chat]. This is our primary outlet for course announcements, questions, and discussions. '''Please join it!'''

=== Lecture notes ===

[https://drive.google.com/file/d/1mmNLLQ0--EDihGNRKwSyXLOA1KL7A0lD/view?usp=sharing Original English version]

[https://drive.google.com/drive/folders/1cTCdJtVVtO9uDgIKE8HY0qhl285tzOo1?usp=drive_link A Russian translation by volunteering students] (you are welcome to [https://t.me/sigma_algebraa join] their ranks)

=== Classes recordings ===

=== Lecture video archive ===

=== Other resources ===
* [https://tinyurl.com/rwky5vmk The Course's Google Directory]

* [https://www.youtube.com/playlist?list=PL1Uob8iPTHGTidrmrqEHTJ96Pt3-PmML4 Past years' videos]

* We have a [https://meet.edashkov.net.ru dedicated server] to hold an online meeting if we need one.

== Problem sets ==

=== Class problems ===

* [https://drive.google.com/file/d/1EP-diSuOTn9f0ryg18Z2w0xjEp8j0bnl/view?usp=drive_link Problem Set 1]

* [https://drive.google.com/file/d/12ct99-ORd7A94Gh5g4Nf9riv7UqNMSRc/view?usp=drive_link Problem Set 2]

* [https://drive.google.com/file/d/1yKKqLsS99V4AhCYqbjafuav2CMCdQTOQ/view?usp=drive_link Problem Set 3]

* [https://drive.google.com/file/d/1YgH_AdCk4GcKC0KH7xBA4-sUnOYkUvUK/view?usp=drive_link Problem Set 4]

* [https://drive.google.com/file/d/1M556PSgTJOo5W-AxYEXjFu94VfledpF5/view?usp=drive_link Problem Set 5]



=== Assignment deadlines ===

{| class="wikitable"
|-
! Home problem set !! colspan="11" | Deadline
|-
| || 251 || 252 || 253 || 254 || 255 || 256 || 257
|-
| [https://drive.google.com/file/d/15vCxTrNMwagS4rqQnUzdLParTqOP8y5P/view?usp=drive_link HW1a ] || Sep 25 || Sep 25 || Sep 25 || Sep 23 || Sep 23 || Sep 23 || Sep 22
|-
| [https://drive.google.com/file/d/1PTJY1PEG-wUlTqUGXT8KWRsll8H0XLb0/view?usp=drive_link HW1b] || Oct 5 || Oct 9 || Oct 9 || Oct 11 || Oct 11 || Oct 11 ||Oct 7
|-
| [https://drive.google.com/file/d/1mSNPCXo1J3eMz7Wk9yagWkgaZn7AwN7B/view?usp=drive_link HW1c] || Oct 19 || Oct 23 || Oct 23 || Oct 22 || Oct 22 || Oct 22 ||
|-
| [https://drive.google.com/file/d/1LOPPwGjyVleR_mclxTKUJ_bxFrxt44sW/view?usp=drive_link HW2a] || Nov 13 || Nov 13 || Nov 13 || Nov 18 || Nov 18 || Nov 18 ||
|-
| [https://drive.google.com/file/d/1W7k1OTiIMlPOpo-2mwmGegrc4RDHz5_j/view?usp=drive_link HW2b] || Nov 30 || Nov 30 || Nov 30 || || ||

|}

'''Each deadline is set by the respective group's instructor.'''

== Assessment and Grading ==

=== Homework ===

The homework is graded in three batches: one (HW_A) includes everything to be submitted in Module1, another (HW_B) includes all the problems submitted in other modules '''that we will choose to be graded''' (see Homework section for an explanation). The last batch (HW_Test_B) consists of two in-class tests; each test takes about 80 minutes and contains 6 -- 8 problems from the homework problem sets or very similar to those. For each problem, the student is given a score from 0 to 1 point (in fractional values) according to the progress he made.

The homework graded are computed the following way (before rounding):

HW_A = 10 * (the sum of points given for the problems) / #(problems);
''all the problems are to be graded''.

Grade HW_B is computed similarly but for its respective period of Modules 2 and 3:

HW_B = 10 * (the sum of points given for the problems) / #(problems subject to be graded);
''a few chosen problems are to be graded''.

HW_Test_B = 10 * (the sum of points given for the problems in both the tests) / #(problems in both the tests).

=== Exam1 and the Interim Assessment ===

Each problem solution is graded with a fractional score from 0 to 1 point, and the entire exam with the value (before rounding)

Exam1 = 10 * (p1 * w1 + ... + pn * wn) / (w1 + ... + wn),
where pi is the score and wi is the weight for the i-th problem.

The Interim grade 1 is computed past Module 1 and equals:

Interim1 = round(Interim1'), where

Interim1' = 0.5 * HW_A + 0.5 * Exam1.

(Here and everywhere, rounding is according to the usual arithmetic rules.)

=== Colloquium ===
For each of the 'definition' two questions, the student is given a score from 0 to 2 points, and from 0 to 4 points for the ‘proof’ question (all in fractional values).
The Colloq grade is computed the following way (before rounding):

Colloq = 10 * (the sum of points given) / 8.

=== Bonuses ===
Each student is given a score according to his progress in bonus activities, which results in the grade

Bonus = 10 * #(points given) / #(points possible).

The number of possible points varies but it is between 1 and 25 usually.

=== Exam2, the Second Interim, and the Final Assessment ===
Each problem solution is graded with a fractional score from 0 to 1 point, and the entire exam with the value (before rounding)

Exam2 = 10 * (p1 * w1 + ... + pn * wn) / (w1 + ... + wn),

where pi is the score and wi is the weight for the i-th problem.

The Interim grade 2 is computed past Module 3 and equals:

Interim2 = round(Interim2'), where

Interim2' = 0.085 * HW_B + 0.210 * HW_Test_B + 0.295 * Colloq + 0.06 * Bonus + 0.35 * Exam2.

The final grade for the course is

Final = round(0.3 * Interim1' + 0.7 * Interim 2')

Generally, '''nobody is exempt from the examinations'''.

== Plagiarism regulations ==
Plagiarism, that is, all forms of cheating with doing your academic assignments, including any '''unauthorized help of AI''' or another person, will not be tolerated. In this course, using AI is '''not''' generally authorized. Clearly, we may not have a definitive proof that somebody is cheating (notice, however, that AI-generated solutions to mathematical problems are quite conspicuous if they have not been edited heavily). Therefore, we will reserve the right to ask a suspect student to 'defend' his any written work, that is, to explain it orally and in person. So our regulations stipulate:
<blockquote>
If plagiarism is detected (including material generated with the help of generative AI without prior approval from the teacher), the assessment element will be assigned a score of "0".
If there is a suspicion that the task was not completed independently, the teacher has the right to initiate an additional verification or a defense of this particular assessment element. The final grade for the element will be based on the results of such verification or defense.
The teacher also has the right to randomly invite any student to defend any assessment element, regardless of plagiarism or suspicion. If the student refuses or fails to defend the work, the grade for this element will be annulled and recorded as "0".
</blockquote>
A final word of advice. Using AI regularly (and this is addictive!) instead of your natural intelligence will make you stupid and intellectually impotent in no time---at the price of a slight grade advantage (assuming your cheating goes unpunished). Do you really want it in this competitive world?

== Exam retaking ==
Examinations 1 and 2 are subject to be retaken if either the Interim1 or Final grade, respectively, is unsatisfactory (i.e., < 4). Retaking an exam is similar to the regular examination. The resulting grade is substituted for that of the latter (that is, retake grade is assigned to the variable Exami in the respective formula, whose value is then reevaluated). Those whose Interim or Final grade is still unsatisfactory after the first retake will have a (tough) choice to make.

Please take into account the following regulation according to the ''ПОПАТКУС'':
<blockquote>
On the first and second retakes, the cumulative course grade is taken into consideration. In case of receiving an unsatisfactory final grade after the first retake, the student may refuse to participate in the second retake and instead repeat the course according to the individual curriculum. The cumulative grade is formed again as a result of repeated courses. After completing the repeated course, the student is given a second retake only, which the student previously refused.
</blockquote>

The 'cumulative grade' here means all the variables in the grading formulas except Exami, which are the only ones to be retaken. The 'second retake' is similar to the first one and it is evaluated according to the same formula with the same values of 'cumulative' variables. This poses an obvious risk for anyone whose 'cumulatives' are low!

== Recommended reading ==
''Please notice that '''The Book''' for our Course does not exist. The latter is based on many sources.''

# Anderson J. A., Discrete Mathematics With Combinatorics. Prentice Hall, 2003.
# Biggs N. L., Discrete mathematics. 2nd ed., New York; Oxford: Oxford University Press, 2004.
# Gavrilov G. P., Sapozhenko A. A. Problems and Exercises in Discrete Mathematics. Kluwer Texts in the Mathematical Sciences 14. Springer, 1996.
# [http://courses.csail.mit.edu/6.042/spring17/mcs.pdf Lehman E., Thomson Leighton F., Meyer A. R. Mathematics for Computer Science, 2017.]
# [http://www.cs.elte.hu/~lovasz/dmbook.ps Lovasz L., Vesztergombi K. Discrete Mathematics. Lecture Notes; Yale University, 1999.]
# Melnikov O., Sarvanov V., Tyshkevich R., Yemelichev V., Zverovich I. Exercises in Graph Theory. Kluwer Texts in the Mathematical Sciences 19. Springer, 1998.
# Rosen K. H. Discrete Mathematics and Its Applications. McGraw-Hill, 1999.
# Stein C., Drysdale R. L., Bogart K. Discrete mathematics for computer scientists. Addison-Wesley, 2010.
# Vinogradov I. M. Elements of number theory. Dover, 1954.

=== In Russian ===
''If you understand Russian (by any chance), you will probably benefit from reading the following books.''

# Виноградов И. М. Основы теории чисел. 9-е изд., М.: Наука, 1981.
# [http://rubtsov.su/public/DM-HSE-Draft.pdf Вялый М., Подольский В., Рубцов А., Шварц Д., Шень А. Лекции по дискретной математике.]
# Гаврилов Г. П., Сапоженко А. А. Задачи и упражнения по дискретной математике. 3-е изд., М.: ФИЗМАТЛИТ, 2004.
# [https://drive.google.com/file/d/1RM6KX_reBFwUXesWGUEu0sFn2NCaBgvz/view?usp=sharing Дашков Е. В. Введение в математическую логику. Множества и отношения. М.: МФТИ, 2019.]
# Зубков А. М., Севастьянов Б. А., Чистяков В. П. Сборник задач по теории вероятностей. 2-е изд., М.: Наука, 1989.
# Мельников О. И. Теория графов в занимательных задачах. 5-е изд., М.: Книжный дом "ЛИБРОКОМ", 2013.
# [http://www.mccme.ru/free-books/shen/shen-induction.pdf Шень А., Математическая индукция. 5-е изд, М.: МЦНМО, 2016.]

Discrete Mathematics 1 DSBA 2025/2026

2025-11-07T11:35:18Z

Brdan: /* Assignment deadlines */

== Instructors ==

=== The lecturer ===
My name is Evgeny Dashkov. Feel free to contact me via email: edashkov@gmail.com, [https://t.me/edashkov Telegram], or [https://vk.com/evgeny.v.dashkov VK].

My Assistant (the person responsible for the tables etc.): [https://t.me/almanmaria Maria Krotova].

=== Seminar Instructors and Teaching Assistants ===
{| class="wikitable" style="text-align:center"
|-
! Group !! 251 !! 252 !! 253 !! 254 !! 255 !! 256 !! 257
|-
|| Teachers || [https://t.me/edashkov Evgeny Dashkov] ||colspan="2"| [https://t.me/brdann Boris Danilov]|| colspan="3"| [https://t.me/DiegBuitrago Diego Buitrago] || [https://t.me/carlosbuitrago Carlos Buitrago]
|-
|| Teaching Assistants || [https://t.me/dandelii Maria Samoilova] || [https://t.me/Nixlle Danila Riazanov] || [https://t.me/svnsrg Sergey Savin] || [https://t.me/KinWiz Alexey Popov] || [https://t.me/dm9dj Maxim Kharlan] || [https://t.me/ayratmur Ayrat Murtazin] || [https://t.me/crazyglue Sofya Shapovalova]
|}

=== Whom should I ask? ===

If you have a question or comment concerning the mathematical content of our course, it is best to post it to our [https://t.me/joinchat/T_YTN4IG1vAJNWT9 student chat]. Alternatively, you may address your question to your Teaching Assistant, Seminar Instructor or the Lecturer (say, if your question discloses an important idea for a HW problem). It is much better to ask and get to know than not to ask and remain ignorant. '''Please do not hesitate to ask your mathematical questions!'''

If you need a more detailed consultation concerning the course's mathematics, please be informed that our Teaching Assistants usually hold periodic consultations while the Seminar Instructors and Lecturer have some designated time for counseling students. Still, the best thing to do is to arrange a consultation in advance via a personal communication.

Homework-grading related questions should be directed to your teaching assistant first; then to your seminar instructor and to the lecturer just in case of any disagreement.

Organizational, administrative, legal or paperwork questions must be addressed to the Student Service Center, Study Office or other relevant offices first and foremost. If you have been redirected to us with such a question nevertheless, please contact the Lecturer's Assistant first.

== Current performance ==

[https://docs.google.com/spreadsheets/d/1vRdPzhUjqiDv2rGh9A3hYvtNmo3AkoEUtXMxBgzud9U/edit?usp=sharing The Table].

== Homework ==
The homework includes a few problem sets, one in a fortnight or so (the deadlines are announced on giving each set). Every problem set consists of about 10 – 15 problems. These sets may be subdivided further for students’ convenience.

We expect you to try solving '''every''' homework problem. Nevertheless, in Modules 2 and 3 we are going to grade the solutions of about one quarter of all problems. The problems chosen to be graded will be the same for all students and our choice will be revealed past the deadline for each respective problem set.

Still, we suggest you try solving '''every''' homework problem. In particular, some of these problems will be given as special 'homework tests' to be held in class. The tests are scheduled to Modules 2 and 3 late weeks.

A student may be required to 'defend' (i.e., to explain orally) his written solution to any problem. His grade for the problem may be decreased if he fails to do so properly.

== Exam 1 ==
A written examination is held past Module 1. Students may not consult any sources during the exam. The examination takes about 120 minutes. An integer weight is assigned to every problem.

== Colloquium ==
An oral colloquium is held at the beginning of Module 3. Each student is given two questions concerning statements and definitions as well as one question requiring a proof. After no less than 45 minutes of preparation (when using any literature is allowed), the student is required to answer ‘from scratch’, that is, with no recourse to any materials. The examiner may pose additional questions as he sees fit.

'''Please find the question list and rules [here]'''.

== Exam 2 ==
A written examination is held past Module 3. Students may not consult any sources during the exam. The examination takes about 120 minutes. An integer weight is assigned to every problem.

== Bonus activities ==
Throughout the course, the students may be graded for a variety of ‘bonus activities’ (like quizzes, etc.) either offline or online.

== Course materials ==

[https://t.me/joinchat/T_YTN4IG1vAJNWT9 Course chat]. This is our primary outlet for course announcements, questions, and discussions. '''Please join it!'''

=== Lecture notes ===

[https://drive.google.com/file/d/1mmNLLQ0--EDihGNRKwSyXLOA1KL7A0lD/view?usp=sharing Original English version]

[https://drive.google.com/drive/folders/1cTCdJtVVtO9uDgIKE8HY0qhl285tzOo1?usp=drive_link A Russian translation by volunteering students] (you are welcome to [https://t.me/sigma_algebraa join] their ranks)

=== Classes recordings ===

=== Lecture video archive ===

=== Other resources ===
* [https://tinyurl.com/rwky5vmk The Course's Google Directory]

* [https://www.youtube.com/playlist?list=PL1Uob8iPTHGTidrmrqEHTJ96Pt3-PmML4 Past years' videos]

* We have a [https://meet.edashkov.net.ru dedicated server] to hold an online meeting if we need one.

== Problem sets ==

=== Class problems ===

* [https://drive.google.com/file/d/1EP-diSuOTn9f0ryg18Z2w0xjEp8j0bnl/view?usp=drive_link Problem Set 1]

* [https://drive.google.com/file/d/12ct99-ORd7A94Gh5g4Nf9riv7UqNMSRc/view?usp=drive_link Problem Set 2]

* [https://drive.google.com/file/d/1yKKqLsS99V4AhCYqbjafuav2CMCdQTOQ/view?usp=drive_link Problem Set 3]

* [https://drive.google.com/file/d/1YgH_AdCk4GcKC0KH7xBA4-sUnOYkUvUK/view?usp=drive_link Problem Set 4]



=== Assignment deadlines ===

{| class="wikitable"
|-
! Home problem set !! colspan="11" | Deadline
|-
| || 251 || 252 || 253 || 254 || 255 || 256 || 257
|-
| [https://drive.google.com/file/d/15vCxTrNMwagS4rqQnUzdLParTqOP8y5P/view?usp=drive_link HW1a ] || Sep 25 || Sep 25 || Sep 25 || Sep 23 || Sep 23 || Sep 23 || Sep 22
|-
| [https://drive.google.com/file/d/1PTJY1PEG-wUlTqUGXT8KWRsll8H0XLb0/view?usp=drive_link HW1b] || Oct 5 || Oct 9 || Oct 9 || Oct 11 || Oct 11 || Oct 11 ||Oct 7
|-
| [https://drive.google.com/file/d/1mSNPCXo1J3eMz7Wk9yagWkgaZn7AwN7B/view?usp=drive_link HW1c] || Oct 19 || Oct 23 || Oct 23 || Oct 22 || Oct 22 || Oct 22 ||
|-
| [https://drive.google.com/file/d/1LOPPwGjyVleR_mclxTKUJ_bxFrxt44sW/view?usp=drive_link HW2a] || Nov 13 || Nov 13 || Nov 13 || || || ||

|}

'''Each deadline is set by the respective group's instructor.'''

== Assessment and Grading ==

=== Homework ===

The homework is graded in three batches: one (HW_A) includes everything to be submitted in Module1, another (HW_B) includes all the problems submitted in other modules '''that we will choose to be graded''' (see Homework section for an explanation). The last batch (HW_Test_B) consists of two in-class tests; each test takes about 80 minutes and contains 6 -- 8 problems from the homework problem sets or very similar to those. For each problem, the student is given a score from 0 to 1 point (in fractional values) according to the progress he made.

The homework graded are computed the following way (before rounding):

HW_A = 10 * (the sum of points given for the problems) / #(problems);
''all the problems are to be graded''.

Grade HW_B is computed similarly but for its respective period of Modules 2 and 3:

HW_B = 10 * (the sum of points given for the problems) / #(problems subject to be graded);
''a few chosen problems are to be graded''.

HW_Test_B = 10 * (the sum of points given for the problems in both the tests) / #(problems in both the tests).

=== Exam1 and the Interim Assessment ===

Each problem solution is graded with a fractional score from 0 to 1 point, and the entire exam with the value (before rounding)

Exam1 = 10 * (p1 * w1 + ... + pn * wn) / (w1 + ... + wn),
where pi is the score and wi is the weight for the i-th problem.

The Interim grade 1 is computed past Module 1 and equals:

Interim1 = round(Interim1'), where

Interim1' = 0.5 * HW_A + 0.5 * Exam1.

(Here and everywhere, rounding is according to the usual arithmetic rules.)

=== Colloquium ===
For each of the 'definition' two questions, the student is given a score from 0 to 2 points, and from 0 to 4 points for the ‘proof’ question (all in fractional values).
The Colloq grade is computed the following way (before rounding):

Colloq = 10 * (the sum of points given) / 8.

=== Bonuses ===
Each student is given a score according to his progress in bonus activities, which results in the grade

Bonus = 10 * #(points given) / #(points possible).

The number of possible points varies but it is between 1 and 25 usually.

=== Exam2, the Second Interim, and the Final Assessment ===
Each problem solution is graded with a fractional score from 0 to 1 point, and the entire exam with the value (before rounding)

Exam2 = 10 * (p1 * w1 + ... + pn * wn) / (w1 + ... + wn),

where pi is the score and wi is the weight for the i-th problem.

The Interim grade 2 is computed past Module 3 and equals:

Interim2 = round(Interim2'), where

Interim2' = 0.085 * HW_B + 0.210 * HW_Test_B + 0.295 * Colloq + 0.06 * Bonus + 0.35 * Exam2.

The final grade for the course is

Final = round(0.3 * Interim1' + 0.7 * Interim 2')

Generally, '''nobody is exempt from the examinations'''.

== Plagiarism regulations ==
Plagiarism, that is, all forms of cheating with doing your academic assignments, including any '''unauthorized help of AI''' or another person, will not be tolerated. In this course, using AI is '''not''' generally authorized. Clearly, we may not have a definitive proof that somebody is cheating (notice, however, that AI-generated solutions to mathematical problems are quite conspicuous if they have not been edited heavily). Therefore, we will reserve the right to ask a suspect student to 'defend' his any written work, that is, to explain it orally and in person. So our regulations stipulate:
<blockquote>
If plagiarism is detected (including material generated with the help of generative AI without prior approval from the teacher), the assessment element will be assigned a score of "0".
If there is a suspicion that the task was not completed independently, the teacher has the right to initiate an additional verification or a defense of this particular assessment element. The final grade for the element will be based on the results of such verification or defense.
The teacher also has the right to randomly invite any student to defend any assessment element, regardless of plagiarism or suspicion. If the student refuses or fails to defend the work, the grade for this element will be annulled and recorded as "0".
</blockquote>
A final word of advice. Using AI regularly (and this is addictive!) instead of your natural intelligence will make you stupid and intellectually impotent in no time---at the price of a slight grade advantage (assuming your cheating goes unpunished). Do you really want it in this competitive world?

== Exam retaking ==
Examinations 1 and 2 are subject to be retaken if either the Interim1 or Final grade, respectively, is unsatisfactory (i.e., < 4). Retaking an exam is similar to the regular examination. The resulting grade is substituted for that of the latter (that is, retake grade is assigned to the variable Exami in the respective formula, whose value is then reevaluated). Those whose Interim or Final grade is still unsatisfactory after the first retake will have a (tough) choice to make.

Please take into account the following regulation according to the ''ПОПАТКУС'':
<blockquote>
On the first and second retakes, the cumulative course grade is taken into consideration. In case of receiving an unsatisfactory final grade after the first retake, the student may refuse to participate in the second retake and instead repeat the course according to the individual curriculum. The cumulative grade is formed again as a result of repeated courses. After completing the repeated course, the student is given a second retake only, which the student previously refused.
</blockquote>

The 'cumulative grade' here means all the variables in the grading formulas except Exami, which are the only ones to be retaken. The 'second retake' is similar to the first one and it is evaluated according to the same formula with the same values of 'cumulative' variables. This poses an obvious risk for anyone whose 'cumulatives' are low!

== Recommended reading ==
''Please notice that '''The Book''' for our Course does not exist. The latter is based on many sources.''

# Anderson J. A., Discrete Mathematics With Combinatorics. Prentice Hall, 2003.
# Biggs N. L., Discrete mathematics. 2nd ed., New York; Oxford: Oxford University Press, 2004.
# Gavrilov G. P., Sapozhenko A. A. Problems and Exercises in Discrete Mathematics. Kluwer Texts in the Mathematical Sciences 14. Springer, 1996.
# [http://courses.csail.mit.edu/6.042/spring17/mcs.pdf Lehman E., Thomson Leighton F., Meyer A. R. Mathematics for Computer Science, 2017.]
# [http://www.cs.elte.hu/~lovasz/dmbook.ps Lovasz L., Vesztergombi K. Discrete Mathematics. Lecture Notes; Yale University, 1999.]
# Melnikov O., Sarvanov V., Tyshkevich R., Yemelichev V., Zverovich I. Exercises in Graph Theory. Kluwer Texts in the Mathematical Sciences 19. Springer, 1998.
# Rosen K. H. Discrete Mathematics and Its Applications. McGraw-Hill, 1999.
# Stein C., Drysdale R. L., Bogart K. Discrete mathematics for computer scientists. Addison-Wesley, 2010.
# Vinogradov I. M. Elements of number theory. Dover, 1954.

=== In Russian ===
''If you understand Russian (by any chance), you will probably benefit from reading the following books.''

# Виноградов И. М. Основы теории чисел. 9-е изд., М.: Наука, 1981.
# [http://rubtsov.su/public/DM-HSE-Draft.pdf Вялый М., Подольский В., Рубцов А., Шварц Д., Шень А. Лекции по дискретной математике.]
# Гаврилов Г. П., Сапоженко А. А. Задачи и упражнения по дискретной математике. 3-е изд., М.: ФИЗМАТЛИТ, 2004.
# [https://drive.google.com/file/d/1RM6KX_reBFwUXesWGUEu0sFn2NCaBgvz/view?usp=sharing Дашков Е. В. Введение в математическую логику. Множества и отношения. М.: МФТИ, 2019.]
# Зубков А. М., Севастьянов Б. А., Чистяков В. П. Сборник задач по теории вероятностей. 2-е изд., М.: Наука, 1989.
# Мельников О. И. Теория графов в занимательных задачах. 5-е изд., М.: Книжный дом "ЛИБРОКОМ", 2013.
# [http://www.mccme.ru/free-books/shen/shen-induction.pdf Шень А., Математическая индукция. 5-е изд, М.: МЦНМО, 2016.]

Discrete Mathematics 1 DSBA 2025/2026

2025-09-26T14:19:02Z

Brdan: /* Assignment deadlines */

== Instructors ==

=== The lecturer ===
My name is Evgeny Dashkov. Feel free to contact me via email: edashkov@gmail.com, [https://t.me/edashkov Telegram], or [https://vk.com/evgeny.v.dashkov VK].

My Assistant (the person responsible for the tables etc.): [https://t.me/almanmaria Maria Krotova].

=== Seminar Instructors and Teaching Assistants ===
{| class="wikitable" style="text-align:center"
|-
! Group !! 251 !! 252 !! 253 !! 254 !! 255 !! 256 !! 257
|-
|| Teachers || [https://t.me/edashkov Evgeny Dashkov] ||colspan="2"| [https://t.me/brdann Boris Danilov]|| colspan="3"| [https://t.me/DiegBuitrago Diego Buitrago] || [https://t.me/carlosbuitrago Carlos Buitrago]
|-
|| Teaching Assistants || [https://t.me/dandelii Maria Samoilova] || [https://t.me/Nixlle Danila Riazanov] || [https://t.me/svnsrg Sergey Savin] || [https://t.me/KinWiz Alexey Popov] || [https://t.me/dm9dj Maxim Kharlan] || [https://t.me/ayratmur Ayrat Murtazin] || [https://t.me/crazyglue Sofya Shapovalova]
|}

=== Whom should I ask? ===

If you have a question or comment concerning the mathematical content of our course, it is best to post it to our [https://t.me/joinchat/T_YTN4IG1vAJNWT9 student chat]. Alternatively, you may address your question to your Teaching Assistant, Seminar Instructor or the Lecturer (say, if your question discloses an important idea for a HW problem). It is much better to ask and get to know than not to ask and remain ignorant. '''Please do not hesitate to ask your mathematical questions!'''

If you need a more detailed consultation concerning the course's mathematics, please be informed that our Teaching Assistants usually hold periodic consultations while the Seminar Instructors and Lecturer have some designated time for counseling students. Still, the best thing to do is to arrange a consultation in advance via a personal communication.

Homework-grading related questions should be directed to your teaching assistant first; then to your seminar instructor and to the lecturer just in case of any disagreement.

Organizational, administrative, legal or paperwork questions must be addressed to the Student Service Center, Study Office or other relevant offices first and foremost. If you have been redirected to us with such a question nevertheless, please contact the Lecturer's Assistant first.

== Current performance ==

[https://docs.google.com/spreadsheets/d/1vRdPzhUjqiDv2rGh9A3hYvtNmo3AkoEUtXMxBgzud9U/edit?usp=sharing The Table].

== Homework ==
The homework includes a few problem sets, one in a fortnight or so (the deadlines are announced on giving each set). Every problem set consists of about 10 – 15 problems. These sets may be subdivided further for students’ convenience.

We expect you to try solving '''every''' homework problem. Nevertheless, in Modules 2 and 3 we are going to grade the solutions of about one quarter of all problems. The problems chosen to be graded will be the same for all students and our choice will be revealed past the deadline for each respective problem set.

Still, we suggest you try solving '''every''' homework problem. In particular, some of these problems will be given as special 'homework tests' to be held in class. The tests are scheduled to Modules 2 and 3 late weeks.

A student may be required to 'defend' (i.e., to explain orally) his written solution to any problem. His grade for the problem may be decreased if he fails to do so properly.

== Exam 1 ==
A written examination is held past Module 1. Students may not consult any sources during the exam. The examination takes about 120 minutes. An integer weight is assigned to every problem.

== Colloquium ==
An oral colloquium is held at the beginning of Module 3. Each student is given two questions concerning statements and definitions as well as one question requiring a proof. After no less than 45 minutes of preparation (when using any literature is allowed), the student is required to answer ‘from scratch’, that is, with no recourse to any materials. The examiner may pose additional questions as he sees fit.

'''Please find the question list and rules [here]'''.

== Exam 2 ==
A written examination is held past Module 3. Students may not consult any sources during the exam. The examination takes about 120 minutes. An integer weight is assigned to every problem.

== Bonus activities ==
Throughout the course, the students may be graded for a variety of ‘bonus activities’ (like quizzes, etc.) either offline or online.

== Course materials ==

[https://t.me/joinchat/T_YTN4IG1vAJNWT9 Course chat]. This is our primary outlet for course announcements, questions, and discussions. '''Please join it!'''

=== Lecture notes ===

[https://drive.google.com/file/d/1mmNLLQ0--EDihGNRKwSyXLOA1KL7A0lD/view?usp=sharing Original English version]

[https://drive.google.com/drive/folders/1cTCdJtVVtO9uDgIKE8HY0qhl285tzOo1?usp=drive_link A Russian translation by volunteering students] (you are welcome to [https://t.me/sigma_algebraa join] their ranks)

=== Classes recordings ===

=== Lecture video archive ===

=== Other resources ===
* [https://tinyurl.com/rwky5vmk The Course's Google Directory]

* [https://www.youtube.com/playlist?list=PL1Uob8iPTHGTidrmrqEHTJ96Pt3-PmML4 Past years' videos]

* We have a [https://meet.edashkov.net.ru dedicated server] to hold an online meeting if we need one.

== Problem sets ==

=== Class problems ===

* [https://drive.google.com/file/d/1EP-diSuOTn9f0ryg18Z2w0xjEp8j0bnl/view?usp=drive_link Problem Set 1]



=== Assignment deadlines ===

{| class="wikitable"
|-
! Home problem set !! colspan="11" | Deadline
|-
| || 251 || 252 || 253 || 254 || 255 || 256 || 257
|-
| [https://drive.google.com/file/d/15vCxTrNMwagS4rqQnUzdLParTqOP8y5P/view?usp=drive_link HW1a ] || Sep 25 || Sep 25 || Sep 25 || Sep 23 || Sep 23 || Sep 23 || Sep 22
|-
| [https://drive.google.com/file/d/1PTJY1PEG-wUlTqUGXT8KWRsll8H0XLb0/view?usp=drive_link HW1b] || Oct 5 || Oct 9 || Oct 9 || || ||

|}

'''Each deadline is set by the respective group's instructor.'''

== Assessment and Grading ==

=== Homework ===

The homework is graded in three batches: one (HW_A) includes everything to be submitted in Module1, another (HW_B) includes all the problems submitted in other modules '''that we will choose to be graded''' (see Homework section for an explanation). The last batch (HW_Test_B) consists of two in-class tests; each test takes about 80 minutes and contains 6 -- 8 problems from the homework problem sets or very similar to those. For each problem, the student is given a score from 0 to 1 point (in fractional values) according to the progress he made.

The homework graded are computed the following way (before rounding):

HW_A = 10 * (the sum of points given for the problems) / #(problems);
''all the problems are to be graded''.

Grade HW_B is computed similarly but for its respective period of Modules 2 and 3:

HW_B = 10 * (the sum of points given for the problems) / #(problems subject to be graded);
''a few chosen problems are to be graded''.

HW_Test_B = 10 * (the sum of points given for the problems in both the tests) / #(problems in both the tests).

=== Exam1 and the Interim Assessment ===

Each problem solution is graded with a fractional score from 0 to 1 point, and the entire exam with the value (before rounding)

Exam1 = 10 * (p1 * w1 + ... + pn * wn) / (w1 + ... + wn),
where pi is the score and wi is the weight for the i-th problem.

The Interim grade 1 is computed past Module 1 and equals:

Interim1 = round(Interim1'), where

Interim1' = 0.5 * HW_A + 0.5 * Exam1.

(Here and everywhere, rounding is according to the usual arithmetic rules.)

=== Colloquium ===
For each of the 'definition' two questions, the student is given a score from 0 to 2 points, and from 0 to 4 points for the ‘proof’ question (all in fractional values).
The Colloq grade is computed the following way (before rounding):

Colloq = 10 * (the sum of points given) / 8.

=== Bonuses ===
Each student is given a score according to his progress in bonus activities, which results in the grade

Bonus = 10 * #(points given) / #(points possible).

The number of possible points varies but it is between 1 and 25 usually.

=== Exam2, the Second Interim, and the Final Assessment ===
Each problem solution is graded with a fractional score from 0 to 1 point, and the entire exam with the value (before rounding)

Exam2 = 10 * (p1 * w1 + ... + pn * wn) / (w1 + ... + wn),

where pi is the score and wi is the weight for the i-th problem.

The Interim grade 2 is computed past Module 3 and equals:

Interim2 = round(Interim2'), where

Interim2' = 0.085 * HW_B + 0.210 * HW_Test_B + 0.295 * Colloq + 0.06 * Bonus + 0.35 * Exam2.

The final grade for the course is

Final = round(0.3 * Interim1' + 0.7 * Interim 2')

Generally, '''nobody is exempt from the examinations'''.

== Plagiarism regulations ==
Plagiarism, that is, all forms of cheating with doing your academic assignments, including any '''unauthorized help of AI''' or another person, will not be tolerated. In this course, using AI is '''not''' generally authorized. Clearly, we may not have a definitive proof that somebody is cheating (notice, however, that AI-generated solutions to mathematical problems are quite conspicuous if they have not been edited heavily). Therefore, we will reserve the right to ask a suspect student to 'defend' his any written work, that is, to explain it orally and in person. So our regulations stipulate:
<blockquote>
If plagiarism is detected (including material generated with the help of generative AI without prior approval from the teacher), the assessment element will be assigned a score of "0".
If there is a suspicion that the task was not completed independently, the teacher has the right to initiate an additional verification or a defense of this particular assessment element. The final grade for the element will be based on the results of such verification or defense.
The teacher also has the right to randomly invite any student to defend any assessment element, regardless of plagiarism or suspicion. If the student refuses or fails to defend the work, the grade for this element will be annulled and recorded as "0".
</blockquote>
A final word of advice. Using AI regularly (and this is addictive!) instead of your natural intelligence will make you stupid and intellectually impotent in no time---at the price of a slight grade advantage (assuming your cheating goes unpunished). Do you really want it in this competitive world?

== Exam retaking ==
Examinations 1 and 2 are subject to be retaken if either the Interim1 or Final grade, respectively, is unsatisfactory (i.e., < 4). Retaking an exam is similar to the regular examination. The resulting grade is substituted for that of the latter (that is, retake grade is assigned to the variable Exami in the respective formula, whose value is then reevaluated). Those whose Interim or Final grade is still unsatisfactory after the first retake will have a (tough) choice to make.

Please take into account the following regulation according to the ''ПОПАТКУС'':
<blockquote>
On the first and second retakes, the cumulative course grade is taken into consideration. In case of receiving an unsatisfactory final grade after the first retake, the student may refuse to participate in the second retake and instead repeat the course according to the individual curriculum. The cumulative grade is formed again as a result of repeated courses. After completing the repeated course, the student is given a second retake only, which the student previously refused.
</blockquote>

The 'cumulative grade' here means all the variables in the grading formulas except Exami, which are the only ones to be retaken. The 'second retake' is similar to the first one and it is evaluated according to the same formula with the same values of 'cumulative' variables. This poses an obvious risk for anyone whose 'cumulatives' are low!

== Recommended reading ==
''Please notice that '''The Book''' for our Course does not exist. The latter is based on many sources.''

# Anderson J. A., Discrete Mathematics With Combinatorics. Prentice Hall, 2003.
# Biggs N. L., Discrete mathematics. 2nd ed., New York; Oxford: Oxford University Press, 2004.
# Gavrilov G. P., Sapozhenko A. A. Problems and Exercises in Discrete Mathematics. Kluwer Texts in the Mathematical Sciences 14. Springer, 1996.
# [http://courses.csail.mit.edu/6.042/spring17/mcs.pdf Lehman E., Thomson Leighton F., Meyer A. R. Mathematics for Computer Science, 2017.]
# [http://www.cs.elte.hu/~lovasz/dmbook.ps Lovasz L., Vesztergombi K. Discrete Mathematics. Lecture Notes; Yale University, 1999.]
# Melnikov O., Sarvanov V., Tyshkevich R., Yemelichev V., Zverovich I. Exercises in Graph Theory. Kluwer Texts in the Mathematical Sciences 19. Springer, 1998.
# Rosen K. H. Discrete Mathematics and Its Applications. McGraw-Hill, 1999.
# Stein C., Drysdale R. L., Bogart K. Discrete mathematics for computer scientists. Addison-Wesley, 2010.
# Vinogradov I. M. Elements of number theory. Dover, 1954.

=== In Russian ===
''If you understand Russian (by any chance), you will probably benefit from reading the following books.''

# Виноградов И. М. Основы теории чисел. 9-е изд., М.: Наука, 1981.
# [http://rubtsov.su/public/DM-HSE-Draft.pdf Вялый М., Подольский В., Рубцов А., Шварц Д., Шень А. Лекции по дискретной математике.]
# Гаврилов Г. П., Сапоженко А. А. Задачи и упражнения по дискретной математике. 3-е изд., М.: ФИЗМАТЛИТ, 2004.
# [https://drive.google.com/file/d/1RM6KX_reBFwUXesWGUEu0sFn2NCaBgvz/view?usp=sharing Дашков Е. В. Введение в математическую логику. Множества и отношения. М.: МФТИ, 2019.]
# Зубков А. М., Севастьянов Б. А., Чистяков В. П. Сборник задач по теории вероятностей. 2-е изд., М.: Наука, 1989.
# Мельников О. И. Теория графов в занимательных задачах. 5-е изд., М.: Книжный дом "ЛИБРОКОМ", 2013.
# [http://www.mccme.ru/free-books/shen/shen-induction.pdf Шень А., Математическая индукция. 5-е изд, М.: МЦНМО, 2016.]

Discrete Mathematics 1 DSBA 2025/2026

2025-09-12T09:51:44Z

Brdan: /* Assignment deadlines */

== Instructors ==

=== The lecturer ===
My name is Evgeny Dashkov. Feel free to contact me via email: edashkov@gmail.com, [https://t.me/edashkov Telegram], or [https://vk.com/evgeny.v.dashkov VK].

My Assistant (the person responsible for the tables etc.): [https://t.me/almanmaria Maria Krotova].

=== Seminar Instructors and Teaching Assistants ===
{| class="wikitable" style="text-align:center"
|-
! Group !! 251 !! 252 !! 253 !! 254 !! 255 !! 256 !! 257
|-
|| Teachers || [https://t.me/edashkov Evgeny Dashkov] ||colspan="2"| [https://t.me/brdann Boris Danilov]|| colspan="3"| [https://t.me/DiegBuitrago Diego Buitrago] || [https://t.me/carlosbuitrago Carlos Buitrago]
|-
|| Teaching Assistants || [https://t.me/dandelii Maria Samoilova] || [https://t.me/Nixlle Danila Riazanov] || [https://t.me/svnsrg Sergey Savin] || [https://t.me/KinWiz Alexey Popov] || [https://t.me/dm9dj Maxim Kharlan] || [https://t.me/ayratmur Ayrat Murtazin] || [https://t.me/crazyglue Sofya Shapovalova]
|}

=== Whom should I ask? ===

If you have a question or comment concerning the mathematical content of our course, it is best to post it to our [https://t.me/joinchat/T_YTN4IG1vAJNWT9 student chat]. Alternatively, you may address your question to your Teaching Assistant, Seminar Instructor or the Lecturer (say, if your question discloses an important idea for a HW problem). It is much better to ask and get to know than not to ask and remain ignorant. '''Please do not hesitate to ask your mathematical questions!'''

If you need a more detailed consultation concerning the course's mathematics, please be informed that our Teaching Assistants usually hold periodic consultations while the Seminar Instructors and Lecturer have some designated time for counseling students. Still, the best thing to do is to arrange a consultation in advance via a personal communication.

Homework-grading related questions should be directed to your teaching assistant first; then to your seminar instructor and to the lecturer just in case of any disagreement.

Organizational, administrative, legal or paperwork questions must be addressed to the Student Service Center, Study Office or other relevant offices first and foremost. If you have been redirected to us with such a question nevertheless, please contact the Lecturer's Assistant first.

== Current performance ==

[https://docs.google.com/spreadsheets/d/1vRdPzhUjqiDv2rGh9A3hYvtNmo3AkoEUtXMxBgzud9U/edit?usp=sharing The Table].

== Homework ==
The homework includes a few problem sets, one in a fortnight or so (the deadlines are announced on giving each set). Every problem set consists of about 10 – 15 problems. These sets may be subdivided further for students’ convenience.

We expect you to try solving '''every''' homework problem. Nevertheless, in Modules 2 and 3 we are going to grade the solutions of about one quarter of all problems. The problems chosen to be graded will be the same for all students and our choice will be revealed past the deadline for each respective problem set.

Still, we suggest you try solving '''every''' homework problem. In particular, some of these problems will be given as special 'homework tests' to be held in class. The tests are scheduled to Modules 2 and 3 late weeks.

A student may be required to 'defend' (i.e., to explain orally) his written solution to any problem. His grade for the problem may be decreased if he fails to do so properly.

== Exam 1 ==
A written examination is held past Module 1. Students may not consult any sources during the exam. The examination takes about 120 minutes. An integer weight is assigned to every problem.

== Colloquium ==
An oral colloquium is held at the beginning of Module 3. Each student is given two questions concerning statements and definitions as well as one question requiring a proof. After no less than 45 minutes of preparation (when using any literature is allowed), the student is required to answer ‘from scratch’, that is, with no recourse to any materials. The examiner may pose additional questions as he sees fit.

'''Please find the question list and rules [here]'''.

== Exam 2 ==
A written examination is held past Module 3. Students may not consult any sources during the exam. The examination takes about 120 minutes. An integer weight is assigned to every problem.

== Bonus activities ==
Throughout the course, the students may be graded for a variety of ‘bonus activities’ (like quizzes, etc.) either offline or online.

== Course materials ==

[https://t.me/joinchat/T_YTN4IG1vAJNWT9 Course chat]. This is our primary outlet for course announcements, questions, and discussions. '''Please join it!'''

=== Lecture notes ===

[https://drive.google.com/file/d/1mmNLLQ0--EDihGNRKwSyXLOA1KL7A0lD/view?usp=sharing Original English version]

[https://drive.google.com/drive/folders/1cTCdJtVVtO9uDgIKE8HY0qhl285tzOo1?usp=drive_link A Russian translation by volunteering students] (you are welcome to [https://t.me/sigma_algebraa join] their ranks)

=== Classes recordings ===

=== Lecture video archive ===

=== Other resources ===
* [https://tinyurl.com/rwky5vmk The Course's Google Directory]

* [https://www.youtube.com/playlist?list=PL1Uob8iPTHGTidrmrqEHTJ96Pt3-PmML4 Past years' videos]

* We have a [https://meet.edashkov.net.ru dedicated server] to hold an online meeting if we need one.

== Problem sets ==

=== Class problems ===

* [https://drive.google.com/file/d/1EP-diSuOTn9f0ryg18Z2w0xjEp8j0bnl/view?usp=drive_link Problem Set 1]



=== Assignment deadlines ===

{| class="wikitable"
|-
! Home problem set !! colspan="11" | Deadline
|-
| || 251 || 252 || 253 || 254 || 255 || 256 || 257
|-
| [https://drive.google.com/file/d/15vCxTrNMwagS4rqQnUzdLParTqOP8y5P/view?usp=drive_link HW1a ] || Sep 19 || Sep 25 || Sep 25 || || || || Sep 22

|}

'''Each deadline is set by the respective group's instructor.'''

== Assessment and Grading ==

=== Homework ===

The homework is graded in three batches: one (HW_A) includes everything to be submitted in Module1, another (HW_B) includes all the problems submitted in other modules '''that we will choose to be graded''' (see Homework section for an explanation). The last batch (HW_Test_B) consists of two in-class tests; each test takes about 80 minutes and contains 6 -- 8 problems from the homework problem sets or very similar to those. For each problem, the student is given a score from 0 to 1 point (in fractional values) according to the progress he made.

The homework graded are computed the following way (before rounding):

HW_A = 10 * (the sum of points given for the problems) / #(problems);
''all the problems are to be graded''.

Grade HW_B is computed similarly but for its respective period of Modules 2 and 3:

HW_B = 10 * (the sum of points given for the problems) / #(problems subject to be graded);
''a few chosen problems are to be graded''.

HW_Test_B = 10 * (the sum of points given for the problems in both the tests) / #(problems in both the tests).

=== Exam1 and the Interim Assessment ===

Each problem solution is graded with a fractional score from 0 to 1 point, and the entire exam with the value (before rounding)

Exam1 = 10 * (p1 * w1 + ... + pn * wn) / (w1 + ... + wn),
where pi is the score and wi is the weight for the i-th problem.

The Interim grade 1 is computed past Module 1 and equals:

Interim1 = round(Interim1'), where

Interim1' = 0.5 * HW_A + 0.5 * Exam1.

(Here and everywhere, rounding is according to the usual arithmetic rules.)

=== Colloquium ===
For each of the 'definition' two questions, the student is given a score from 0 to 2 points, and from 0 to 4 points for the ‘proof’ question (all in fractional values).
The Colloq grade is computed the following way (before rounding):

Colloq = 10 * (the sum of points given) / 8.

=== Bonuses ===
Each student is given a score according to his progress in bonus activities, which results in the grade

Bonus = 10 * #(points given) / #(points possible).

The number of possible points varies but it is between 1 and 25 usually.

=== Exam2, the Second Interim, and the Final Assessment ===
Each problem solution is graded with a fractional score from 0 to 1 point, and the entire exam with the value (before rounding)

Exam2 = 10 * (p1 * w1 + ... + pn * wn) / (w1 + ... + wn),

where pi is the score and wi is the weight for the i-th problem.

The Interim grade 2 is computed past Module 3 and equals:

Interim2 = round(Interim2'), where

Interim2' = 0.085 * HW_B + 0.210 * HW_Test_B + 0.295 * Colloq + 0.06 * Bonus + 0.35 * Exam2.

The final grade for the course is

Final = round(0.3 * Interim1' + 0.7 * Interim 2')

Generally, '''nobody is exempt from the examinations'''.

== Plagiarism regulations ==
Plagiarism, that is, all forms of cheating with doing your academic assignments, including any '''unauthorized help of AI''' or another person, will not be tolerated. In this course, using AI is '''not''' generally authorized. Clearly, we may not have a definitive proof that somebody is cheating (notice, however, that AI-generated solutions to mathematical problems are quite conspicuous if they have not been edited heavily). Therefore, we will reserve the right to ask a suspect student to 'defend' his any written work, that is, to explain it orally and in person. So our regulations stipulate:
<blockquote>
If plagiarism is detected (including material generated with the help of generative AI without prior approval from the teacher), the assessment element will be assigned a score of "0".
If there is a suspicion that the task was not completed independently, the teacher has the right to initiate an additional verification or a defense of this particular assessment element. The final grade for the element will be based on the results of such verification or defense.
The teacher also has the right to randomly invite any student to defend any assessment element, regardless of plagiarism or suspicion. If the student refuses or fails to defend the work, the grade for this element will be annulled and recorded as "0".
</blockquote>
A final word of advice. Using AI regularly (and this is addictive!) instead of your natural intelligence will make you stupid and intellectually impotent in no time---at the price of a slight grade advantage (assuming your cheating goes unpunished). Do you really want it in this competitive world?

== Exam retaking ==
Examinations 1 and 2 are subject to be retaken if either the Interim1 or Final grade, respectively, is unsatisfactory (i.e., < 4). Retaking an exam is similar to the regular examination. The resulting grade is substituted for that of the latter (that is, retake grade is assigned to the variable Exami in the respective formula, whose value is then reevaluated). Those whose Interim or Final grade is still unsatisfactory after the first retake will have a (tough) choice to make.

Please take into account the following regulation according to the ''ПОПАТКУС'':
<blockquote>
On the first and second retakes, the cumulative course grade is taken into consideration. In case of receiving an unsatisfactory final grade after the first retake, the student may refuse to participate in the second retake and instead repeat the course according to the individual curriculum. The cumulative grade is formed again as a result of repeated courses. After completing the repeated course, the student is given a second retake only, which the student previously refused.
</blockquote>

The 'cumulative grade' here means all the variables in the grading formulas except Exami, which are the only ones to be retaken. The 'second retake' is similar to the first one and it is evaluated according to the same formula with the same values of 'cumulative' variables. This poses an obvious risk for anyone whose 'cumulatives' are low!

== Recommended reading ==
''Please notice that '''The Book''' for our Course does not exist. The latter is based on many sources.''

# Anderson J. A., Discrete Mathematics With Combinatorics. Prentice Hall, 2003.
# Biggs N. L., Discrete mathematics. 2nd ed., New York; Oxford: Oxford University Press, 2004.
# Gavrilov G. P., Sapozhenko A. A. Problems and Exercises in Discrete Mathematics. Kluwer Texts in the Mathematical Sciences 14. Springer, 1996.
# [http://courses.csail.mit.edu/6.042/spring17/mcs.pdf Lehman E., Thomson Leighton F., Meyer A. R. Mathematics for Computer Science, 2017.]
# [http://www.cs.elte.hu/~lovasz/dmbook.ps Lovasz L., Vesztergombi K. Discrete Mathematics. Lecture Notes; Yale University, 1999.]
# Melnikov O., Sarvanov V., Tyshkevich R., Yemelichev V., Zverovich I. Exercises in Graph Theory. Kluwer Texts in the Mathematical Sciences 19. Springer, 1998.
# Rosen K. H. Discrete Mathematics and Its Applications. McGraw-Hill, 1999.
# Stein C., Drysdale R. L., Bogart K. Discrete mathematics for computer scientists. Addison-Wesley, 2010.
# Vinogradov I. M. Elements of number theory. Dover, 1954.

=== In Russian ===
''If you understand Russian (by any chance), you will probably benefit from reading the following books.''

# Виноградов И. М. Основы теории чисел. 9-е изд., М.: Наука, 1981.
# [http://rubtsov.su/public/DM-HSE-Draft.pdf Вялый М., Подольский В., Рубцов А., Шварц Д., Шень А. Лекции по дискретной математике.]
# Гаврилов Г. П., Сапоженко А. А. Задачи и упражнения по дискретной математике. 3-е изд., М.: ФИЗМАТЛИТ, 2004.
# [https://drive.google.com/file/d/1RM6KX_reBFwUXesWGUEu0sFn2NCaBgvz/view?usp=sharing Дашков Е. В. Введение в математическую логику. Множества и отношения. М.: МФТИ, 2019.]
# Зубков А. М., Севастьянов Б. А., Чистяков В. П. Сборник задач по теории вероятностей. 2-е изд., М.: Наука, 1989.
# Мельников О. И. Теория графов в занимательных задачах. 5-е изд., М.: Книжный дом "ЛИБРОКОМ", 2013.
# [http://www.mccme.ru/free-books/shen/shen-induction.pdf Шень А., Математическая индукция. 5-е изд, М.: МЦНМО, 2016.]

Discrete Mathematics 1 DSBA 2025/2026

2025-09-12T09:51:30Z

Brdan: /* Assignment deadlines */

== Instructors ==

=== The lecturer ===
My name is Evgeny Dashkov. Feel free to contact me via email: edashkov@gmail.com, [https://t.me/edashkov Telegram], or [https://vk.com/evgeny.v.dashkov VK].

My Assistant (the person responsible for the tables etc.): [https://t.me/almanmaria Maria Krotova].

=== Seminar Instructors and Teaching Assistants ===
{| class="wikitable" style="text-align:center"
|-
! Group !! 251 !! 252 !! 253 !! 254 !! 255 !! 256 !! 257
|-
|| Teachers || [https://t.me/edashkov Evgeny Dashkov] ||colspan="2"| [https://t.me/brdann Boris Danilov]|| colspan="3"| [https://t.me/DiegBuitrago Diego Buitrago] || [https://t.me/carlosbuitrago Carlos Buitrago]
|-
|| Teaching Assistants || [https://t.me/dandelii Maria Samoilova] || [https://t.me/Nixlle Danila Riazanov] || [https://t.me/svnsrg Sergey Savin] || [https://t.me/KinWiz Alexey Popov] || [https://t.me/dm9dj Maxim Kharlan] || [https://t.me/ayratmur Ayrat Murtazin] || [https://t.me/crazyglue Sofya Shapovalova]
|}

=== Whom should I ask? ===

If you have a question or comment concerning the mathematical content of our course, it is best to post it to our [https://t.me/joinchat/T_YTN4IG1vAJNWT9 student chat]. Alternatively, you may address your question to your Teaching Assistant, Seminar Instructor or the Lecturer (say, if your question discloses an important idea for a HW problem). It is much better to ask and get to know than not to ask and remain ignorant. '''Please do not hesitate to ask your mathematical questions!'''

If you need a more detailed consultation concerning the course's mathematics, please be informed that our Teaching Assistants usually hold periodic consultations while the Seminar Instructors and Lecturer have some designated time for counseling students. Still, the best thing to do is to arrange a consultation in advance via a personal communication.

Homework-grading related questions should be directed to your teaching assistant first; then to your seminar instructor and to the lecturer just in case of any disagreement.

Organizational, administrative, legal or paperwork questions must be addressed to the Student Service Center, Study Office or other relevant offices first and foremost. If you have been redirected to us with such a question nevertheless, please contact the Lecturer's Assistant first.

== Current performance ==

[https://docs.google.com/spreadsheets/d/1vRdPzhUjqiDv2rGh9A3hYvtNmo3AkoEUtXMxBgzud9U/edit?usp=sharing The Table].

== Homework ==
The homework includes a few problem sets, one in a fortnight or so (the deadlines are announced on giving each set). Every problem set consists of about 10 – 15 problems. These sets may be subdivided further for students’ convenience.

We expect you to try solving '''every''' homework problem. Nevertheless, in Modules 2 and 3 we are going to grade the solutions of about one quarter of all problems. The problems chosen to be graded will be the same for all students and our choice will be revealed past the deadline for each respective problem set.

Still, we suggest you try solving '''every''' homework problem. In particular, some of these problems will be given as special 'homework tests' to be held in class. The tests are scheduled to Modules 2 and 3 late weeks.

A student may be required to 'defend' (i.e., to explain orally) his written solution to any problem. His grade for the problem may be decreased if he fails to do so properly.

== Exam 1 ==
A written examination is held past Module 1. Students may not consult any sources during the exam. The examination takes about 120 minutes. An integer weight is assigned to every problem.

== Colloquium ==
An oral colloquium is held at the beginning of Module 3. Each student is given two questions concerning statements and definitions as well as one question requiring a proof. After no less than 45 minutes of preparation (when using any literature is allowed), the student is required to answer ‘from scratch’, that is, with no recourse to any materials. The examiner may pose additional questions as he sees fit.

'''Please find the question list and rules [here]'''.

== Exam 2 ==
A written examination is held past Module 3. Students may not consult any sources during the exam. The examination takes about 120 minutes. An integer weight is assigned to every problem.

== Bonus activities ==
Throughout the course, the students may be graded for a variety of ‘bonus activities’ (like quizzes, etc.) either offline or online.

== Course materials ==

[https://t.me/joinchat/T_YTN4IG1vAJNWT9 Course chat]. This is our primary outlet for course announcements, questions, and discussions. '''Please join it!'''

=== Lecture notes ===

[https://drive.google.com/file/d/1mmNLLQ0--EDihGNRKwSyXLOA1KL7A0lD/view?usp=sharing Original English version]

[https://drive.google.com/drive/folders/1cTCdJtVVtO9uDgIKE8HY0qhl285tzOo1?usp=drive_link A Russian translation by volunteering students] (you are welcome to [https://t.me/sigma_algebraa join] their ranks)

=== Classes recordings ===

=== Lecture video archive ===

=== Other resources ===
* [https://tinyurl.com/rwky5vmk The Course's Google Directory]

* [https://www.youtube.com/playlist?list=PL1Uob8iPTHGTidrmrqEHTJ96Pt3-PmML4 Past years' videos]

* We have a [https://meet.edashkov.net.ru dedicated server] to hold an online meeting if we need one.

== Problem sets ==

=== Class problems ===

* [https://drive.google.com/file/d/1EP-diSuOTn9f0ryg18Z2w0xjEp8j0bnl/view?usp=drive_link Problem Set 1]



=== Assignment deadlines ===

{| class="wikitable"
|-
! Home problem set !! colspan="11" | Deadline
|-
| || 251 || 252 || 253 || 254 || 255 || 256 || 257
|-
| [https://drive.google.com/file/d/15vCxTrNMwagS4rqQnUzdLParTqOP8y5P/view?usp=drive_link HW1a ] || Sep 19 || Sep 25 || Sep 25 || || || Sep 22 ||

|}

'''Each deadline is set by the respective group's instructor.'''

== Assessment and Grading ==

=== Homework ===

The homework is graded in three batches: one (HW_A) includes everything to be submitted in Module1, another (HW_B) includes all the problems submitted in other modules '''that we will choose to be graded''' (see Homework section for an explanation). The last batch (HW_Test_B) consists of two in-class tests; each test takes about 80 minutes and contains 6 -- 8 problems from the homework problem sets or very similar to those. For each problem, the student is given a score from 0 to 1 point (in fractional values) according to the progress he made.

The homework graded are computed the following way (before rounding):

HW_A = 10 * (the sum of points given for the problems) / #(problems);
''all the problems are to be graded''.

Grade HW_B is computed similarly but for its respective period of Modules 2 and 3:

HW_B = 10 * (the sum of points given for the problems) / #(problems subject to be graded);
''a few chosen problems are to be graded''.

HW_Test_B = 10 * (the sum of points given for the problems in both the tests) / #(problems in both the tests).

=== Exam1 and the Interim Assessment ===

Each problem solution is graded with a fractional score from 0 to 1 point, and the entire exam with the value (before rounding)

Exam1 = 10 * (p1 * w1 + ... + pn * wn) / (w1 + ... + wn),
where pi is the score and wi is the weight for the i-th problem.

The Interim grade 1 is computed past Module 1 and equals:

Interim1 = round(Interim1'), where

Interim1' = 0.5 * HW_A + 0.5 * Exam1.

(Here and everywhere, rounding is according to the usual arithmetic rules.)

=== Colloquium ===
For each of the 'definition' two questions, the student is given a score from 0 to 2 points, and from 0 to 4 points for the ‘proof’ question (all in fractional values).
The Colloq grade is computed the following way (before rounding):

Colloq = 10 * (the sum of points given) / 8.

=== Bonuses ===
Each student is given a score according to his progress in bonus activities, which results in the grade

Bonus = 10 * #(points given) / #(points possible).

The number of possible points varies but it is between 1 and 25 usually.

=== Exam2, the Second Interim, and the Final Assessment ===
Each problem solution is graded with a fractional score from 0 to 1 point, and the entire exam with the value (before rounding)

Exam2 = 10 * (p1 * w1 + ... + pn * wn) / (w1 + ... + wn),

where pi is the score and wi is the weight for the i-th problem.

The Interim grade 2 is computed past Module 3 and equals:

Interim2 = round(Interim2'), where

Interim2' = 0.085 * HW_B + 0.210 * HW_Test_B + 0.295 * Colloq + 0.06 * Bonus + 0.35 * Exam2.

The final grade for the course is

Final = round(0.3 * Interim1' + 0.7 * Interim 2')

Generally, '''nobody is exempt from the examinations'''.

== Plagiarism regulations ==
Plagiarism, that is, all forms of cheating with doing your academic assignments, including any '''unauthorized help of AI''' or another person, will not be tolerated. In this course, using AI is '''not''' generally authorized. Clearly, we may not have a definitive proof that somebody is cheating (notice, however, that AI-generated solutions to mathematical problems are quite conspicuous if they have not been edited heavily). Therefore, we will reserve the right to ask a suspect student to 'defend' his any written work, that is, to explain it orally and in person. So our regulations stipulate:
<blockquote>
If plagiarism is detected (including material generated with the help of generative AI without prior approval from the teacher), the assessment element will be assigned a score of "0".
If there is a suspicion that the task was not completed independently, the teacher has the right to initiate an additional verification or a defense of this particular assessment element. The final grade for the element will be based on the results of such verification or defense.
The teacher also has the right to randomly invite any student to defend any assessment element, regardless of plagiarism or suspicion. If the student refuses or fails to defend the work, the grade for this element will be annulled and recorded as "0".
</blockquote>
A final word of advice. Using AI regularly (and this is addictive!) instead of your natural intelligence will make you stupid and intellectually impotent in no time---at the price of a slight grade advantage (assuming your cheating goes unpunished). Do you really want it in this competitive world?

== Exam retaking ==
Examinations 1 and 2 are subject to be retaken if either the Interim1 or Final grade, respectively, is unsatisfactory (i.e., < 4). Retaking an exam is similar to the regular examination. The resulting grade is substituted for that of the latter (that is, retake grade is assigned to the variable Exami in the respective formula, whose value is then reevaluated). Those whose Interim or Final grade is still unsatisfactory after the first retake will have a (tough) choice to make.

Please take into account the following regulation according to the ''ПОПАТКУС'':
<blockquote>
On the first and second retakes, the cumulative course grade is taken into consideration. In case of receiving an unsatisfactory final grade after the first retake, the student may refuse to participate in the second retake and instead repeat the course according to the individual curriculum. The cumulative grade is formed again as a result of repeated courses. After completing the repeated course, the student is given a second retake only, which the student previously refused.
</blockquote>

The 'cumulative grade' here means all the variables in the grading formulas except Exami, which are the only ones to be retaken. The 'second retake' is similar to the first one and it is evaluated according to the same formula with the same values of 'cumulative' variables. This poses an obvious risk for anyone whose 'cumulatives' are low!

== Recommended reading ==
''Please notice that '''The Book''' for our Course does not exist. The latter is based on many sources.''

# Anderson J. A., Discrete Mathematics With Combinatorics. Prentice Hall, 2003.
# Biggs N. L., Discrete mathematics. 2nd ed., New York; Oxford: Oxford University Press, 2004.
# Gavrilov G. P., Sapozhenko A. A. Problems and Exercises in Discrete Mathematics. Kluwer Texts in the Mathematical Sciences 14. Springer, 1996.
# [http://courses.csail.mit.edu/6.042/spring17/mcs.pdf Lehman E., Thomson Leighton F., Meyer A. R. Mathematics for Computer Science, 2017.]
# [http://www.cs.elte.hu/~lovasz/dmbook.ps Lovasz L., Vesztergombi K. Discrete Mathematics. Lecture Notes; Yale University, 1999.]
# Melnikov O., Sarvanov V., Tyshkevich R., Yemelichev V., Zverovich I. Exercises in Graph Theory. Kluwer Texts in the Mathematical Sciences 19. Springer, 1998.
# Rosen K. H. Discrete Mathematics and Its Applications. McGraw-Hill, 1999.
# Stein C., Drysdale R. L., Bogart K. Discrete mathematics for computer scientists. Addison-Wesley, 2010.
# Vinogradov I. M. Elements of number theory. Dover, 1954.

=== In Russian ===
''If you understand Russian (by any chance), you will probably benefit from reading the following books.''

# Виноградов И. М. Основы теории чисел. 9-е изд., М.: Наука, 1981.
# [http://rubtsov.su/public/DM-HSE-Draft.pdf Вялый М., Подольский В., Рубцов А., Шварц Д., Шень А. Лекции по дискретной математике.]
# Гаврилов Г. П., Сапоженко А. А. Задачи и упражнения по дискретной математике. 3-е изд., М.: ФИЗМАТЛИТ, 2004.
# [https://drive.google.com/file/d/1RM6KX_reBFwUXesWGUEu0sFn2NCaBgvz/view?usp=sharing Дашков Е. В. Введение в математическую логику. Множества и отношения. М.: МФТИ, 2019.]
# Зубков А. М., Севастьянов Б. А., Чистяков В. П. Сборник задач по теории вероятностей. 2-е изд., М.: Наука, 1989.
# Мельников О. И. Теория графов в занимательных задачах. 5-е изд., М.: Книжный дом "ЛИБРОКОМ", 2013.
# [http://www.mccme.ru/free-books/shen/shen-induction.pdf Шень А., Математическая индукция. 5-е изд, М.: МЦНМО, 2016.]

Discrete Mathematics 1 DSBA 2025/2026

2025-09-12T09:51:12Z

Brdan: /* Assignment deadlines */

== Instructors ==

=== The lecturer ===
My name is Evgeny Dashkov. Feel free to contact me via email: edashkov@gmail.com, [https://t.me/edashkov Telegram], or [https://vk.com/evgeny.v.dashkov VK].

My Assistant (the person responsible for the tables etc.): [https://t.me/almanmaria Maria Krotova].

=== Seminar Instructors and Teaching Assistants ===
{| class="wikitable" style="text-align:center"
|-
! Group !! 251 !! 252 !! 253 !! 254 !! 255 !! 256 !! 257
|-
|| Teachers || [https://t.me/edashkov Evgeny Dashkov] ||colspan="2"| [https://t.me/brdann Boris Danilov]|| colspan="3"| [https://t.me/DiegBuitrago Diego Buitrago] || [https://t.me/carlosbuitrago Carlos Buitrago]
|-
|| Teaching Assistants || [https://t.me/dandelii Maria Samoilova] || [https://t.me/Nixlle Danila Riazanov] || [https://t.me/svnsrg Sergey Savin] || [https://t.me/KinWiz Alexey Popov] || [https://t.me/dm9dj Maxim Kharlan] || [https://t.me/ayratmur Ayrat Murtazin] || [https://t.me/crazyglue Sofya Shapovalova]
|}

=== Whom should I ask? ===

If you have a question or comment concerning the mathematical content of our course, it is best to post it to our [https://t.me/joinchat/T_YTN4IG1vAJNWT9 student chat]. Alternatively, you may address your question to your Teaching Assistant, Seminar Instructor or the Lecturer (say, if your question discloses an important idea for a HW problem). It is much better to ask and get to know than not to ask and remain ignorant. '''Please do not hesitate to ask your mathematical questions!'''

If you need a more detailed consultation concerning the course's mathematics, please be informed that our Teaching Assistants usually hold periodic consultations while the Seminar Instructors and Lecturer have some designated time for counseling students. Still, the best thing to do is to arrange a consultation in advance via a personal communication.

Homework-grading related questions should be directed to your teaching assistant first; then to your seminar instructor and to the lecturer just in case of any disagreement.

Organizational, administrative, legal or paperwork questions must be addressed to the Student Service Center, Study Office or other relevant offices first and foremost. If you have been redirected to us with such a question nevertheless, please contact the Lecturer's Assistant first.

== Current performance ==

[https://docs.google.com/spreadsheets/d/1vRdPzhUjqiDv2rGh9A3hYvtNmo3AkoEUtXMxBgzud9U/edit?usp=sharing The Table].

== Homework ==
The homework includes a few problem sets, one in a fortnight or so (the deadlines are announced on giving each set). Every problem set consists of about 10 – 15 problems. These sets may be subdivided further for students’ convenience.

We expect you to try solving '''every''' homework problem. Nevertheless, in Modules 2 and 3 we are going to grade the solutions of about one quarter of all problems. The problems chosen to be graded will be the same for all students and our choice will be revealed past the deadline for each respective problem set.

Still, we suggest you try solving '''every''' homework problem. In particular, some of these problems will be given as special 'homework tests' to be held in class. The tests are scheduled to Modules 2 and 3 late weeks.

A student may be required to 'defend' (i.e., to explain orally) his written solution to any problem. His grade for the problem may be decreased if he fails to do so properly.

== Exam 1 ==
A written examination is held past Module 1. Students may not consult any sources during the exam. The examination takes about 120 minutes. An integer weight is assigned to every problem.

== Colloquium ==
An oral colloquium is held at the beginning of Module 3. Each student is given two questions concerning statements and definitions as well as one question requiring a proof. After no less than 45 minutes of preparation (when using any literature is allowed), the student is required to answer ‘from scratch’, that is, with no recourse to any materials. The examiner may pose additional questions as he sees fit.

'''Please find the question list and rules [here]'''.

== Exam 2 ==
A written examination is held past Module 3. Students may not consult any sources during the exam. The examination takes about 120 minutes. An integer weight is assigned to every problem.

== Bonus activities ==
Throughout the course, the students may be graded for a variety of ‘bonus activities’ (like quizzes, etc.) either offline or online.

== Course materials ==

[https://t.me/joinchat/T_YTN4IG1vAJNWT9 Course chat]. This is our primary outlet for course announcements, questions, and discussions. '''Please join it!'''

=== Lecture notes ===

[https://drive.google.com/file/d/1mmNLLQ0--EDihGNRKwSyXLOA1KL7A0lD/view?usp=sharing Original English version]

[https://drive.google.com/drive/folders/1cTCdJtVVtO9uDgIKE8HY0qhl285tzOo1?usp=drive_link A Russian translation by volunteering students] (you are welcome to [https://t.me/sigma_algebraa join] their ranks)

=== Classes recordings ===

=== Lecture video archive ===

=== Other resources ===
* [https://tinyurl.com/rwky5vmk The Course's Google Directory]

* [https://www.youtube.com/playlist?list=PL1Uob8iPTHGTidrmrqEHTJ96Pt3-PmML4 Past years' videos]

* We have a [https://meet.edashkov.net.ru dedicated server] to hold an online meeting if we need one.

== Problem sets ==

=== Class problems ===

* [https://drive.google.com/file/d/1EP-diSuOTn9f0ryg18Z2w0xjEp8j0bnl/view?usp=drive_link Problem Set 1]



=== Assignment deadlines ===

{| class="wikitable"
|-
! Home problem set !! colspan="11" | Deadline
|-
| || 251 || 252 || 253 || 254 || 255 || 256 || 257
|-
| [https://drive.google.com/file/d/15vCxTrNMwagS4rqQnUzdLParTqOP8y5P/view?usp=drive_link HW1a ] || Sep 19 || Sep 25 || Sep 25 || || || Sep 22

|}

'''Each deadline is set by the respective group's instructor.'''

== Assessment and Grading ==

=== Homework ===

The homework is graded in three batches: one (HW_A) includes everything to be submitted in Module1, another (HW_B) includes all the problems submitted in other modules '''that we will choose to be graded''' (see Homework section for an explanation). The last batch (HW_Test_B) consists of two in-class tests; each test takes about 80 minutes and contains 6 -- 8 problems from the homework problem sets or very similar to those. For each problem, the student is given a score from 0 to 1 point (in fractional values) according to the progress he made.

The homework graded are computed the following way (before rounding):

HW_A = 10 * (the sum of points given for the problems) / #(problems);
''all the problems are to be graded''.

Grade HW_B is computed similarly but for its respective period of Modules 2 and 3:

HW_B = 10 * (the sum of points given for the problems) / #(problems subject to be graded);
''a few chosen problems are to be graded''.

HW_Test_B = 10 * (the sum of points given for the problems in both the tests) / #(problems in both the tests).

=== Exam1 and the Interim Assessment ===

Each problem solution is graded with a fractional score from 0 to 1 point, and the entire exam with the value (before rounding)

Exam1 = 10 * (p1 * w1 + ... + pn * wn) / (w1 + ... + wn),
where pi is the score and wi is the weight for the i-th problem.

The Interim grade 1 is computed past Module 1 and equals:

Interim1 = round(Interim1'), where

Interim1' = 0.5 * HW_A + 0.5 * Exam1.

(Here and everywhere, rounding is according to the usual arithmetic rules.)

=== Colloquium ===
For each of the 'definition' two questions, the student is given a score from 0 to 2 points, and from 0 to 4 points for the ‘proof’ question (all in fractional values).
The Colloq grade is computed the following way (before rounding):

Colloq = 10 * (the sum of points given) / 8.

=== Bonuses ===
Each student is given a score according to his progress in bonus activities, which results in the grade

Bonus = 10 * #(points given) / #(points possible).

The number of possible points varies but it is between 1 and 25 usually.

=== Exam2, the Second Interim, and the Final Assessment ===
Each problem solution is graded with a fractional score from 0 to 1 point, and the entire exam with the value (before rounding)

Exam2 = 10 * (p1 * w1 + ... + pn * wn) / (w1 + ... + wn),

where pi is the score and wi is the weight for the i-th problem.

The Interim grade 2 is computed past Module 3 and equals:

Interim2 = round(Interim2'), where

Interim2' = 0.085 * HW_B + 0.210 * HW_Test_B + 0.295 * Colloq + 0.06 * Bonus + 0.35 * Exam2.

The final grade for the course is

Final = round(0.3 * Interim1' + 0.7 * Interim 2')

Generally, '''nobody is exempt from the examinations'''.

== Plagiarism regulations ==
Plagiarism, that is, all forms of cheating with doing your academic assignments, including any '''unauthorized help of AI''' or another person, will not be tolerated. In this course, using AI is '''not''' generally authorized. Clearly, we may not have a definitive proof that somebody is cheating (notice, however, that AI-generated solutions to mathematical problems are quite conspicuous if they have not been edited heavily). Therefore, we will reserve the right to ask a suspect student to 'defend' his any written work, that is, to explain it orally and in person. So our regulations stipulate:
<blockquote>
If plagiarism is detected (including material generated with the help of generative AI without prior approval from the teacher), the assessment element will be assigned a score of "0".
If there is a suspicion that the task was not completed independently, the teacher has the right to initiate an additional verification or a defense of this particular assessment element. The final grade for the element will be based on the results of such verification or defense.
The teacher also has the right to randomly invite any student to defend any assessment element, regardless of plagiarism or suspicion. If the student refuses or fails to defend the work, the grade for this element will be annulled and recorded as "0".
</blockquote>
A final word of advice. Using AI regularly (and this is addictive!) instead of your natural intelligence will make you stupid and intellectually impotent in no time---at the price of a slight grade advantage (assuming your cheating goes unpunished). Do you really want it in this competitive world?

== Exam retaking ==
Examinations 1 and 2 are subject to be retaken if either the Interim1 or Final grade, respectively, is unsatisfactory (i.e., < 4). Retaking an exam is similar to the regular examination. The resulting grade is substituted for that of the latter (that is, retake grade is assigned to the variable Exami in the respective formula, whose value is then reevaluated). Those whose Interim or Final grade is still unsatisfactory after the first retake will have a (tough) choice to make.

Please take into account the following regulation according to the ''ПОПАТКУС'':
<blockquote>
On the first and second retakes, the cumulative course grade is taken into consideration. In case of receiving an unsatisfactory final grade after the first retake, the student may refuse to participate in the second retake and instead repeat the course according to the individual curriculum. The cumulative grade is formed again as a result of repeated courses. After completing the repeated course, the student is given a second retake only, which the student previously refused.
</blockquote>

The 'cumulative grade' here means all the variables in the grading formulas except Exami, which are the only ones to be retaken. The 'second retake' is similar to the first one and it is evaluated according to the same formula with the same values of 'cumulative' variables. This poses an obvious risk for anyone whose 'cumulatives' are low!

== Recommended reading ==
''Please notice that '''The Book''' for our Course does not exist. The latter is based on many sources.''

# Anderson J. A., Discrete Mathematics With Combinatorics. Prentice Hall, 2003.
# Biggs N. L., Discrete mathematics. 2nd ed., New York; Oxford: Oxford University Press, 2004.
# Gavrilov G. P., Sapozhenko A. A. Problems and Exercises in Discrete Mathematics. Kluwer Texts in the Mathematical Sciences 14. Springer, 1996.
# [http://courses.csail.mit.edu/6.042/spring17/mcs.pdf Lehman E., Thomson Leighton F., Meyer A. R. Mathematics for Computer Science, 2017.]
# [http://www.cs.elte.hu/~lovasz/dmbook.ps Lovasz L., Vesztergombi K. Discrete Mathematics. Lecture Notes; Yale University, 1999.]
# Melnikov O., Sarvanov V., Tyshkevich R., Yemelichev V., Zverovich I. Exercises in Graph Theory. Kluwer Texts in the Mathematical Sciences 19. Springer, 1998.
# Rosen K. H. Discrete Mathematics and Its Applications. McGraw-Hill, 1999.
# Stein C., Drysdale R. L., Bogart K. Discrete mathematics for computer scientists. Addison-Wesley, 2010.
# Vinogradov I. M. Elements of number theory. Dover, 1954.

=== In Russian ===
''If you understand Russian (by any chance), you will probably benefit from reading the following books.''

# Виноградов И. М. Основы теории чисел. 9-е изд., М.: Наука, 1981.
# [http://rubtsov.su/public/DM-HSE-Draft.pdf Вялый М., Подольский В., Рубцов А., Шварц Д., Шень А. Лекции по дискретной математике.]
# Гаврилов Г. П., Сапоженко А. А. Задачи и упражнения по дискретной математике. 3-е изд., М.: ФИЗМАТЛИТ, 2004.
# [https://drive.google.com/file/d/1RM6KX_reBFwUXesWGUEu0sFn2NCaBgvz/view?usp=sharing Дашков Е. В. Введение в математическую логику. Множества и отношения. М.: МФТИ, 2019.]
# Зубков А. М., Севастьянов Б. А., Чистяков В. П. Сборник задач по теории вероятностей. 2-е изд., М.: Наука, 1989.
# Мельников О. И. Теория графов в занимательных задачах. 5-е изд., М.: Книжный дом "ЛИБРОКОМ", 2013.
# [http://www.mccme.ru/free-books/shen/shen-induction.pdf Шень А., Математическая индукция. 5-е изд, М.: МЦНМО, 2016.]

Discrete Mathematics 2 DSBA 2025/2026

2025-09-11T22:21:56Z

Brdan: /* Seminar instructors */

= About =

This page contains basic information for the [https://www.hse.ru/edu/courses/1071074277 course Discrete Mathematics 2] in 2025/2026 academic year at HSE Bachelor’s Programme in Data Science and Business Analytics (DSBA).

= Smart LMS =

All materials will be published in [https://edu.hse.ru/course/view.php?id=252961 Smart LMS]

= Professors and assistants =

The lecturer of the course in 2025 fall term is Boris Radislavovich Danilov (brdanilov@gmail.com).

== Seminar instructors ==

{| class="wikitable" style="text-align:center"
|-
! Group !! 241 !! 242 !! 243 !! 244 !! 245 !! 246
|-
|| Teachers || [https://t.me/brdann Boris Danilov] || colspan="2" | [https://t.me/Alyona_Chislova Alyona Chislova] || Igor Savitskii || colspan="2" | [https://t.me/carlosbuitrago Carlos Buitrago]
|-
|| Odd homework assistants || [https://t.me/d_poIy Polina Doronicheva] || colspan="2" | Anastasia Podolyakina || [https://t.me/d_poIy Polina Doronicheva] || colspan="2" | Irina Milova
|-
|| Even homework assistants || Lewis Lesigha || colspan="2" | Anna Votinova || Lewis Lesigha || colspan="2" | Mark Belov
|}

== Office hours ==

'''Each teacher must be notified in advance''' that you want to come during consultation hours!!!

{| class="wikitable" style="text-align:center"
|-
|| Teachers || [https://t.me/brdann Boris Danilov] || [https://t.me/Alyona_Chislova Alyona Chislova] || Igor Savitskii ||[https://t.me/carlosbuitrago Carlos Buitrago]
|-
|| Time || Tuesday 17.50-18.20 || || ||
|}

= Interim assessment activities =

== Homework assignments ==

Homework assignments include 14 problem sets, one in a week. The last homework assignment is not assessed by tutors (it is left for self-assessment). The assessment of homework assignments is partial, that is only a minor subset of exercises from the whole homework assignment are being evaluated. Exercises to be evaluated are announced after homework deadline has passed.

Problem sets contain exercises which are labeled by an asterisk as ‘bonus’ while all the remaining exercises are considered ‘ordinary’. Deadline for submissions of ordinary exercises is the date when the task was assigned plus 7 days. Bonus exercises are assessed independently and their deadline is the date when the task was assigned plus 14 days. Late submissions score is penalized (both for compulsory and bonus parts separately) with multiplier (0.9)^H, where H is the number of hours passed after deadline, but only when H is less than 48. Submissions late for more than 48 hours are not assessed and scored zero.

Homework ordinary and bonus parts can be passed separately, but each part is passed as a whole. Re-submission of individual exercises means the re-submission of the whole part of the homework assignment with the update of the timestamp for all previously submitted exercises in that part. Only the last submission is getting assessed and scored.

Student may be required to explain orally his written solution to any problem on the colloquium, in class, or if there are suspicions of preparing the task without student's own effort on a personal appointment initiated by the teacher for the purpose of verification or defense of this particular assessment element. Student’s grade for the assessment element may be adjusted based on the additional verification or the defense. If plagiarism is detected, the assessment element will be assigned a score of "0".

Grade <HW> for homework assignments is a rational number between 0 and 15: 
''<HW> = min(15, 10 * (the sum of score points obtained by the student for all evaluated tasks in all homework assignments) / (the sum of nominal score points for ordinary evaluated tasks in all homework assignments))''.

== Quizzes ==

Quizzes are small tests that contain 1-3 exercises for 10-15 minutes that are held on seminars or lectures. The form of a quiz is a small written test. Students aren't allowed to use any materials during the quiz. Some questions of the quiz are sometimes labeled as ‘bonus’ whilst the others are ‘ordinary’ questions.

Grade <QZ> for quizzes is the rational number between 0 and 15: 
''<QZ> = min(15, 10 * (the sum of score points obtained by the student for all tasks in all quizzes) / (the sum of nominal score points for ordinary tasks in all quizzes))''.

== Knowledge test ==

Knowledge test is a written control work that is held at the end of the 1st module. Students may not consult any sources during the knowledge test that takes about 60 minutes and contains 5-7 problems. Some problems of the knowledge test are labeled as ‘bonus’ whilst the others are ‘ordinary’. Each problem is graded on the scale from 0 to 6 integer points.

Grade <KT> for the knowledge test is the rational number between 0 and 15: 
''<KT> = min(15, 10 * (the sum of score points obtained by the student for all tasks) / (the sum of nominal score points for ordinary tasks))''

== Colloquium ==

Colloquium is an oral activity where student receives one practical question (a problem similar to those that are assigned in homework) and two theoretical questions aligned with definitions and proofs from lectures. Student has 60 minutes to prepare his answer before defending it to a tutor (or several tutors).

Grade <CO> for the colloquium is the rational number between 0 and 10 that is based on answers of the student, where the answer for the practical question is graded out of 2 parts and answers for theoretical question are graded out of 3 parts each. Furthermore, 2 remaining parts of the grade are gained by answering additional questions on definitions and statements of theorems from the course.

== Examination control work ==

Written examination control work is held at the end of the course. Students may not consult any sources during the examination control work that takes about 120 minutes and contains 8-10 problems. Some problems of the examination control work are labeled as ‘bonus’ whilst the others are ‘ordinary’. Each problem is graded on the scale from 0 to 6 integer points.

Grade <EX> for the examination control work is the rational number between 0 and 15: 
''<EX> = min(15, 10 * (the sum of score points obtained by the student for all tasks) / (the sum of nominal score points for ordinary tasks))''

'''Retake principles''':

On the first and second retakes, the cumulative course grade is taken into consideration. In case of receiving an unsatisfactory final grade after the first retake, the student may refuse to participate in the second retake and instead repeat the course according to the individual curriculum. The cumulative grade is formed again as a result of repeated courses. After completing the repeated course, the student is given a second retake only, which the student previously refused.

= Grading =

== Final Grade ==

Grade <Final grade> for the course is determined by the formula:

'''<Final grade> = min(10, round(0.11 * <HW> + 0.14 * <QZ> + 0.17 * <KT> + 0.23 * <CO> + 0.35 * <EX>))''',

where <HW>, <QZ>, <KT>, <CO>, <EX> are grades for interim assessment activities:

* <HW> - Homework assignments
* <QZ> - Quizzes
* <KT> - Knowledge test
* <CO> - Colloquium
* <EX> - Examination control work

'''Rounding rules''':

Arithmetic rounding works for students with attendance between '''30%''' and '''70%'''. For students with attendance less than '''30%''' a number X with fractional part below or equal to '''0.7''' is rounded "below" (to the highest integer non exceeding X). For students with attendance greater than '''70%''' a number Y with fractional part above or equal to '''0.3''' is rounded "above" (to the smallest integer greater than Y). Rounding in the formula means rounding to the nearest integer, tie-values are rounded up.

== Automatic pass ==

Students who have good performance and attendance are eligible for automatic pass.

If student's attendance is greater than '''60%''' and <AU> by the formula below is greater or equal to '''7.0''' without rounding then by automatic pass <Final grade> = round(<AU>) (special rounding rules are NOT applied)

'''<AU> = min(10, 0.17 * <HW> + 0.22 * <QZ> + 0.26 * <KT> + 0.35 * <CO>)'''

Please note that expression for <AU> does NOT include rounding. 
Decision to apply for automatic pass must be made prior to taking the exam. Attendance at the exam automatically cancels automatic pass.

= Plagiarism rules =

If plagiarism is detected (including text generated with the help of generative AI without prior approval from the teacher), the assessment element will be assigned a score of "0". 
If there is a suspicion that the task was not completed independently, the teacher has the right to initiate an additional verification or a defense of this particular assessment element. The final grade for the element will be based on the results of such verification or defense. 
The teacher also reserves the right to randomly invite any student to defend any assessment element, regardless of plagiarism or suspicion. If the student refuses or fails to defend the work, the grade for this element will be annulled and recorded as "0".

Discrete Mathematics 2 DSBA 2025/2026

2025-09-11T18:15:15Z

Brdan: /* Professors and assistants */

= About =

This page contains basic information for the [https://www.hse.ru/edu/courses/1071074277 course Discrete Mathematics 2] in 2025/2026 academic year at HSE Bachelor’s Programme in Data Science and Business Analytics (DSBA).

= Smart LMS =

All materials will be published in [https://edu.hse.ru/course/view.php?id=252961 Smart LMS]

= Professors and assistants =

The lecturer of the course in 2025 fall term is Boris Radislavovich Danilov (brdanilov@gmail.com).

== Seminar instructors ==

{| class="wikitable" style="text-align:center"
|-
! Group !! 241 !! 242 !! 243 !! 244 !! 245 !! 246
|-
|| Teachers || [https://t.me/brdann Boris Danilov] || colspan="2" | [https://t.me/Alyona_Chislova Alyona Chislova] || Igor Savitskii || colspan="2" | [https://t.me/carlosbuitrago Carlos Buitrago]
|-
|| Odd homework assistants || Polina Doronicheva || colspan="2" | Anastasia Podolyakina || Polina Doronicheva || colspan="2" | Irina Milova
|-
|| Even homework assistants || Lewis Lesigha || colspan="2" | Anna Votinova || Lewis Lesigha || colspan="2" | Mark Belov
|}

== Office hours ==

'''Each teacher must be notified in advance''' that you want to come during consultation hours!!!

{| class="wikitable" style="text-align:center"
|-
|| Teachers || [https://t.me/brdann Boris Danilov] || [https://t.me/Alyona_Chislova Alyona Chislova] || Igor Savitskii ||[https://t.me/carlosbuitrago Carlos Buitrago]
|-
|| Time || Tuesday 17.50-18.20 || || ||
|}

= Interim assessment activities =

== Homework assignments ==

Homework assignments include 14 problem sets, one in a week. The last homework assignment is not assessed by tutors (it is left for self-assessment). The assessment of homework assignments is partial, that is only a minor subset of exercises from the whole homework assignment are being evaluated. Exercises to be evaluated are announced after homework deadline has passed.

Problem sets contain exercises which are labeled by an asterisk as ‘bonus’ while all the remaining exercises are considered ‘ordinary’. Deadline for submissions of ordinary exercises is the date when the task was assigned plus 7 days. Bonus exercises are assessed independently and their deadline is the date when the task was assigned plus 14 days. Late submissions score is penalized (both for compulsory and bonus parts separately) with multiplier (0.9)^H, where H is the number of hours passed after deadline, but only when H is less than 48. Submissions late for more than 48 hours are not assessed and scored zero.

Homework ordinary and bonus parts can be passed separately, but each part is passed as a whole. Re-submission of individual exercises means the re-submission of the whole part of the homework assignment with the update of the timestamp for all previously submitted exercises in that part. Only the last submission is getting assessed and scored.

Student may be required to explain orally his written solution to any problem on the colloquium, in class, or if there are suspicions of preparing the task without student's own effort on a personal appointment initiated by the teacher for the purpose of verification or defense of this particular assessment element. Student’s grade for the assessment element may be adjusted based on the additional verification or the defense. If plagiarism is detected, the assessment element will be assigned a score of "0".

Grade <HW> for homework assignments is a rational number between 0 and 15: 
''<HW> = min(15, 10 * (the sum of score points obtained by the student for all evaluated tasks in all homework assignments) / (the sum of nominal score points for ordinary evaluated tasks in all homework assignments))''.

== Quizzes ==

Quizzes are small tests that contain 1-3 exercises for 10-15 minutes that are held on seminars or lectures. The form of a quiz is a small written test. Students aren't allowed to use any materials during the quiz. Some questions of the quiz are sometimes labeled as ‘bonus’ whilst the others are ‘ordinary’ questions.

Grade <QZ> for quizzes is the rational number between 0 and 15: 
''<QZ> = min(15, 10 * (the sum of score points obtained by the student for all tasks in all quizzes) / (the sum of nominal score points for ordinary tasks in all quizzes))''.

== Knowledge test ==

Knowledge test is a written control work that is held at the end of the 1st module. Students may not consult any sources during the knowledge test that takes about 60 minutes and contains 5-7 problems. Some problems of the knowledge test are labeled as ‘bonus’ whilst the others are ‘ordinary’. Each problem is graded on the scale from 0 to 6 integer points.

Grade <KT> for the knowledge test is the rational number between 0 and 15: 
''<KT> = min(15, 10 * (the sum of score points obtained by the student for all tasks) / (the sum of nominal score points for ordinary tasks))''

== Colloquium ==

Colloquium is an oral activity where student receives one practical question (a problem similar to those that are assigned in homework) and two theoretical questions aligned with definitions and proofs from lectures. Student has 60 minutes to prepare his answer before defending it to a tutor (or several tutors).

Grade <CO> for the colloquium is the rational number between 0 and 10 that is based on answers of the student, where the answer for the practical question is graded out of 2 parts and answers for theoretical question are graded out of 3 parts each. Furthermore, 2 remaining parts of the grade are gained by answering additional questions on definitions and statements of theorems from the course.

== Examination control work ==

Written examination control work is held at the end of the course. Students may not consult any sources during the examination control work that takes about 120 minutes and contains 8-10 problems. Some problems of the examination control work are labeled as ‘bonus’ whilst the others are ‘ordinary’. Each problem is graded on the scale from 0 to 6 integer points.

Grade <EX> for the examination control work is the rational number between 0 and 15: 
''<EX> = min(15, 10 * (the sum of score points obtained by the student for all tasks) / (the sum of nominal score points for ordinary tasks))''

'''Retake principles''':

On the first and second retakes, the cumulative course grade is taken into consideration. In case of receiving an unsatisfactory final grade after the first retake, the student may refuse to participate in the second retake and instead repeat the course according to the individual curriculum. The cumulative grade is formed again as a result of repeated courses. After completing the repeated course, the student is given a second retake only, which the student previously refused.

= Grading =

== Final Grade ==

Grade <Final grade> for the course is determined by the formula:

'''<Final grade> = min(10, round(0.11 * <HW> + 0.14 * <QZ> + 0.17 * <KT> + 0.23 * <CO> + 0.35 * <EX>))''',

where <HW>, <QZ>, <KT>, <CO>, <EX> are grades for interim assessment activities:

* <HW> - Homework assignments
* <QZ> - Quizzes
* <KT> - Knowledge test
* <CO> - Colloquium
* <EX> - Examination control work

'''Rounding rules''':

Arithmetic rounding works for students with attendance between '''30%''' and '''70%'''. For students with attendance less than '''30%''' a number X with fractional part below or equal to '''0.7''' is rounded "below" (to the highest integer non exceeding X). For students with attendance greater than '''70%''' a number Y with fractional part above or equal to '''0.3''' is rounded "above" (to the smallest integer greater than Y). Rounding in the formula means rounding to the nearest integer, tie-values are rounded up.

== Automatic pass ==

Students who have good performance and attendance are eligible for automatic pass.

If student's attendance is greater than '''60%''' and <AU> by the formula below is greater or equal to '''7.0''' without rounding then by automatic pass <Final grade> = round(<AU>) (special rounding rules are NOT applied)

'''<AU> = min(10, 0.17 * <HW> + 0.22 * <QZ> + 0.26 * <KT> + 0.35 * <CO>)'''

Please note that expression for <AU> does NOT include rounding. 
Decision to apply for automatic pass must be made prior to taking the exam. Attendance at the exam automatically cancels automatic pass.

= Plagiarism rules =

If plagiarism is detected (including text generated with the help of generative AI without prior approval from the teacher), the assessment element will be assigned a score of "0". 
If there is a suspicion that the task was not completed independently, the teacher has the right to initiate an additional verification or a defense of this particular assessment element. The final grade for the element will be based on the results of such verification or defense. 
The teacher also reserves the right to randomly invite any student to defend any assessment element, regardless of plagiarism or suspicion. If the student refuses or fails to defend the work, the grade for this element will be annulled and recorded as "0".

Discrete Mathematics 2 DSBA 2025/2026

2025-09-11T18:14:46Z

Brdan: /* Seminar instructors */

= About =

This page contains basic information for the [https://www.hse.ru/edu/courses/1071074277 course Discrete Mathematics 2] in 2025/2026 academic year at HSE Bachelor’s Programme in Data Science and Business Analytics (DSBA).

= Smart LMS =

All materials will be published in [https://edu.hse.ru/course/view.php?id=252961 Smart LMS]

= Professors and assistants =

The lecturer of the course in 2025 fall term is Boris Radislavovich Danilov (brdanilov@gmail.com).

== Seminar instructors ==

{| class="wikitable" style="text-align:center"
|-
! Group !! 241 !! 242 !! 243 !! 244 !! 245 !! 246
|-
|| Teachers || [https://t.me/brdann Boris Danilov] || colspan="2" | [https://t.me/Alyona_Chislova Alyona Chislova] || Igor Savitskii || colspan="2" | [https://t.me/carlosbuitrago Carlos Buitrago]
|-
|| Odd hwk assistants || Polina Doronicheva || colspan="2" | Anastasia Podolyakina || Polina Doronicheva || colspan="2" | Irina Milova
|-
|| Even hwk assistants || Lewis Lesigha || colspan="2" | Anna Votinova || Lewis Lesigha || colspan="2" | Mark Belov
|}

== Office hours ==

'''Each teacher must be notified in advance''' that you want to come during consultation hours!!!

{| class="wikitable" style="text-align:center"
|-
|| Teachers || [https://t.me/brdann Boris Danilov] || [https://t.me/Alyona_Chislova Alyona Chislova] || Igor Savitskii ||[https://t.me/carlosbuitrago Carlos Buitrago]
|-
|| Time || Tuesday 17.50-18.20 || || ||
|}

= Interim assessment activities =

== Homework assignments ==

Homework assignments include 14 problem sets, one in a week. The last homework assignment is not assessed by tutors (it is left for self-assessment). The assessment of homework assignments is partial, that is only a minor subset of exercises from the whole homework assignment are being evaluated. Exercises to be evaluated are announced after homework deadline has passed.

Problem sets contain exercises which are labeled by an asterisk as ‘bonus’ while all the remaining exercises are considered ‘ordinary’. Deadline for submissions of ordinary exercises is the date when the task was assigned plus 7 days. Bonus exercises are assessed independently and their deadline is the date when the task was assigned plus 14 days. Late submissions score is penalized (both for compulsory and bonus parts separately) with multiplier (0.9)^H, where H is the number of hours passed after deadline, but only when H is less than 48. Submissions late for more than 48 hours are not assessed and scored zero.

Homework ordinary and bonus parts can be passed separately, but each part is passed as a whole. Re-submission of individual exercises means the re-submission of the whole part of the homework assignment with the update of the timestamp for all previously submitted exercises in that part. Only the last submission is getting assessed and scored.

Student may be required to explain orally his written solution to any problem on the colloquium, in class, or if there are suspicions of preparing the task without student's own effort on a personal appointment initiated by the teacher for the purpose of verification or defense of this particular assessment element. Student’s grade for the assessment element may be adjusted based on the additional verification or the defense. If plagiarism is detected, the assessment element will be assigned a score of "0".

Grade <HW> for homework assignments is a rational number between 0 and 15: 
''<HW> = min(15, 10 * (the sum of score points obtained by the student for all evaluated tasks in all homework assignments) / (the sum of nominal score points for ordinary evaluated tasks in all homework assignments))''.

== Quizzes ==

Quizzes are small tests that contain 1-3 exercises for 10-15 minutes that are held on seminars or lectures. The form of a quiz is a small written test. Students aren't allowed to use any materials during the quiz. Some questions of the quiz are sometimes labeled as ‘bonus’ whilst the others are ‘ordinary’ questions.

Grade <QZ> for quizzes is the rational number between 0 and 15: 
''<QZ> = min(15, 10 * (the sum of score points obtained by the student for all tasks in all quizzes) / (the sum of nominal score points for ordinary tasks in all quizzes))''.

== Knowledge test ==

Knowledge test is a written control work that is held at the end of the 1st module. Students may not consult any sources during the knowledge test that takes about 60 minutes and contains 5-7 problems. Some problems of the knowledge test are labeled as ‘bonus’ whilst the others are ‘ordinary’. Each problem is graded on the scale from 0 to 6 integer points.

Grade <KT> for the knowledge test is the rational number between 0 and 15: 
''<KT> = min(15, 10 * (the sum of score points obtained by the student for all tasks) / (the sum of nominal score points for ordinary tasks))''

== Colloquium ==

Colloquium is an oral activity where student receives one practical question (a problem similar to those that are assigned in homework) and two theoretical questions aligned with definitions and proofs from lectures. Student has 60 minutes to prepare his answer before defending it to a tutor (or several tutors).

Grade <CO> for the colloquium is the rational number between 0 and 10 that is based on answers of the student, where the answer for the practical question is graded out of 2 parts and answers for theoretical question are graded out of 3 parts each. Furthermore, 2 remaining parts of the grade are gained by answering additional questions on definitions and statements of theorems from the course.

== Examination control work ==

Written examination control work is held at the end of the course. Students may not consult any sources during the examination control work that takes about 120 minutes and contains 8-10 problems. Some problems of the examination control work are labeled as ‘bonus’ whilst the others are ‘ordinary’. Each problem is graded on the scale from 0 to 6 integer points.

Grade <EX> for the examination control work is the rational number between 0 and 15: 
''<EX> = min(15, 10 * (the sum of score points obtained by the student for all tasks) / (the sum of nominal score points for ordinary tasks))''

'''Retake principles''':

On the first and second retakes, the cumulative course grade is taken into consideration. In case of receiving an unsatisfactory final grade after the first retake, the student may refuse to participate in the second retake and instead repeat the course according to the individual curriculum. The cumulative grade is formed again as a result of repeated courses. After completing the repeated course, the student is given a second retake only, which the student previously refused.

= Grading =

== Final Grade ==

Grade <Final grade> for the course is determined by the formula:

'''<Final grade> = min(10, round(0.11 * <HW> + 0.14 * <QZ> + 0.17 * <KT> + 0.23 * <CO> + 0.35 * <EX>))''',

where <HW>, <QZ>, <KT>, <CO>, <EX> are grades for interim assessment activities:

* <HW> - Homework assignments
* <QZ> - Quizzes
* <KT> - Knowledge test
* <CO> - Colloquium
* <EX> - Examination control work

'''Rounding rules''':

Arithmetic rounding works for students with attendance between '''30%''' and '''70%'''. For students with attendance less than '''30%''' a number X with fractional part below or equal to '''0.7''' is rounded "below" (to the highest integer non exceeding X). For students with attendance greater than '''70%''' a number Y with fractional part above or equal to '''0.3''' is rounded "above" (to the smallest integer greater than Y). Rounding in the formula means rounding to the nearest integer, tie-values are rounded up.

== Automatic pass ==

Students who have good performance and attendance are eligible for automatic pass.

If student's attendance is greater than '''60%''' and <AU> by the formula below is greater or equal to '''7.0''' without rounding then by automatic pass <Final grade> = round(<AU>) (special rounding rules are NOT applied)

'''<AU> = min(10, 0.17 * <HW> + 0.22 * <QZ> + 0.26 * <KT> + 0.35 * <CO>)'''

Please note that expression for <AU> does NOT include rounding. 
Decision to apply for automatic pass must be made prior to taking the exam. Attendance at the exam automatically cancels automatic pass.

= Plagiarism rules =

If plagiarism is detected (including text generated with the help of generative AI without prior approval from the teacher), the assessment element will be assigned a score of "0". 
If there is a suspicion that the task was not completed independently, the teacher has the right to initiate an additional verification or a defense of this particular assessment element. The final grade for the element will be based on the results of such verification or defense. 
The teacher also reserves the right to randomly invite any student to defend any assessment element, regardless of plagiarism or suspicion. If the student refuses or fails to defend the work, the grade for this element will be annulled and recorded as "0".

Discrete Mathematics 2 DSBA 2025/2026

2025-09-11T18:14:01Z

Brdan: /* Seminar instructors */

= About =

This page contains basic information for the [https://www.hse.ru/edu/courses/1071074277 course Discrete Mathematics 2] in 2025/2026 academic year at HSE Bachelor’s Programme in Data Science and Business Analytics (DSBA).

= Smart LMS =

All materials will be published in [https://edu.hse.ru/course/view.php?id=252961 Smart LMS]

= Professors and assistants =

The lecturer of the course in 2025 fall term is Boris Radislavovich Danilov (brdanilov@gmail.com).

== Seminar instructors ==

{| class="wikitable" style="text-align:center"
|-
! Group !! 241 !! 242 !! 243 !! 244 !! 245 !! 246
|-
|| Teachers || [https://t.me/brdann Boris Danilov] || colspan="2" | [https://t.me/Alyona_Chislova Alyona Chislova] || Igor Savitskii || colspan="2" | [https://t.me/carlosbuitrago Carlos Buitrago]
|-
|| Even week assistants || Polina Doronicheva || colspan="2" | Anastasia Podolyakina || Polina Doronicheva || colspan="2" | Irina Milova
|-
|| Odd week assistants || Lewis Lesigha || colspan="2" | Anna Votinova || Lewis Lesigha || colspan="2" | Mark Belov
|}

== Office hours ==

'''Each teacher must be notified in advance''' that you want to come during consultation hours!!!

{| class="wikitable" style="text-align:center"
|-
|| Teachers || [https://t.me/brdann Boris Danilov] || [https://t.me/Alyona_Chislova Alyona Chislova] || Igor Savitskii ||[https://t.me/carlosbuitrago Carlos Buitrago]
|-
|| Time || Tuesday 17.50-18.20 || || ||
|}

= Interim assessment activities =

== Homework assignments ==

Homework assignments include 14 problem sets, one in a week. The last homework assignment is not assessed by tutors (it is left for self-assessment). The assessment of homework assignments is partial, that is only a minor subset of exercises from the whole homework assignment are being evaluated. Exercises to be evaluated are announced after homework deadline has passed.

Problem sets contain exercises which are labeled by an asterisk as ‘bonus’ while all the remaining exercises are considered ‘ordinary’. Deadline for submissions of ordinary exercises is the date when the task was assigned plus 7 days. Bonus exercises are assessed independently and their deadline is the date when the task was assigned plus 14 days. Late submissions score is penalized (both for compulsory and bonus parts separately) with multiplier (0.9)^H, where H is the number of hours passed after deadline, but only when H is less than 48. Submissions late for more than 48 hours are not assessed and scored zero.

Homework ordinary and bonus parts can be passed separately, but each part is passed as a whole. Re-submission of individual exercises means the re-submission of the whole part of the homework assignment with the update of the timestamp for all previously submitted exercises in that part. Only the last submission is getting assessed and scored.

Student may be required to explain orally his written solution to any problem on the colloquium, in class, or if there are suspicions of preparing the task without student's own effort on a personal appointment initiated by the teacher for the purpose of verification or defense of this particular assessment element. Student’s grade for the assessment element may be adjusted based on the additional verification or the defense. If plagiarism is detected, the assessment element will be assigned a score of "0".

Grade <HW> for homework assignments is a rational number between 0 and 15: 
''<HW> = min(15, 10 * (the sum of score points obtained by the student for all evaluated tasks in all homework assignments) / (the sum of nominal score points for ordinary evaluated tasks in all homework assignments))''.

== Quizzes ==

Quizzes are small tests that contain 1-3 exercises for 10-15 minutes that are held on seminars or lectures. The form of a quiz is a small written test. Students aren't allowed to use any materials during the quiz. Some questions of the quiz are sometimes labeled as ‘bonus’ whilst the others are ‘ordinary’ questions.

Grade <QZ> for quizzes is the rational number between 0 and 15: 
''<QZ> = min(15, 10 * (the sum of score points obtained by the student for all tasks in all quizzes) / (the sum of nominal score points for ordinary tasks in all quizzes))''.

== Knowledge test ==

Knowledge test is a written control work that is held at the end of the 1st module. Students may not consult any sources during the knowledge test that takes about 60 minutes and contains 5-7 problems. Some problems of the knowledge test are labeled as ‘bonus’ whilst the others are ‘ordinary’. Each problem is graded on the scale from 0 to 6 integer points.

Grade <KT> for the knowledge test is the rational number between 0 and 15: 
''<KT> = min(15, 10 * (the sum of score points obtained by the student for all tasks) / (the sum of nominal score points for ordinary tasks))''

== Colloquium ==

Colloquium is an oral activity where student receives one practical question (a problem similar to those that are assigned in homework) and two theoretical questions aligned with definitions and proofs from lectures. Student has 60 minutes to prepare his answer before defending it to a tutor (or several tutors).

Grade <CO> for the colloquium is the rational number between 0 and 10 that is based on answers of the student, where the answer for the practical question is graded out of 2 parts and answers for theoretical question are graded out of 3 parts each. Furthermore, 2 remaining parts of the grade are gained by answering additional questions on definitions and statements of theorems from the course.

== Examination control work ==

Written examination control work is held at the end of the course. Students may not consult any sources during the examination control work that takes about 120 minutes and contains 8-10 problems. Some problems of the examination control work are labeled as ‘bonus’ whilst the others are ‘ordinary’. Each problem is graded on the scale from 0 to 6 integer points.

Grade <EX> for the examination control work is the rational number between 0 and 15: 
''<EX> = min(15, 10 * (the sum of score points obtained by the student for all tasks) / (the sum of nominal score points for ordinary tasks))''

'''Retake principles''':

On the first and second retakes, the cumulative course grade is taken into consideration. In case of receiving an unsatisfactory final grade after the first retake, the student may refuse to participate in the second retake and instead repeat the course according to the individual curriculum. The cumulative grade is formed again as a result of repeated courses. After completing the repeated course, the student is given a second retake only, which the student previously refused.

= Grading =

== Final Grade ==

Grade <Final grade> for the course is determined by the formula:

'''<Final grade> = min(10, round(0.11 * <HW> + 0.14 * <QZ> + 0.17 * <KT> + 0.23 * <CO> + 0.35 * <EX>))''',

where <HW>, <QZ>, <KT>, <CO>, <EX> are grades for interim assessment activities:

* <HW> - Homework assignments
* <QZ> - Quizzes
* <KT> - Knowledge test
* <CO> - Colloquium
* <EX> - Examination control work

'''Rounding rules''':

Arithmetic rounding works for students with attendance between '''30%''' and '''70%'''. For students with attendance less than '''30%''' a number X with fractional part below or equal to '''0.7''' is rounded "below" (to the highest integer non exceeding X). For students with attendance greater than '''70%''' a number Y with fractional part above or equal to '''0.3''' is rounded "above" (to the smallest integer greater than Y). Rounding in the formula means rounding to the nearest integer, tie-values are rounded up.

== Automatic pass ==

Students who have good performance and attendance are eligible for automatic pass.

If student's attendance is greater than '''60%''' and <AU> by the formula below is greater or equal to '''7.0''' without rounding then by automatic pass <Final grade> = round(<AU>) (special rounding rules are NOT applied)

'''<AU> = min(10, 0.17 * <HW> + 0.22 * <QZ> + 0.26 * <KT> + 0.35 * <CO>)'''

Please note that expression for <AU> does NOT include rounding. 
Decision to apply for automatic pass must be made prior to taking the exam. Attendance at the exam automatically cancels automatic pass.

= Plagiarism rules =

If plagiarism is detected (including text generated with the help of generative AI without prior approval from the teacher), the assessment element will be assigned a score of "0". 
If there is a suspicion that the task was not completed independently, the teacher has the right to initiate an additional verification or a defense of this particular assessment element. The final grade for the element will be based on the results of such verification or defense. 
The teacher also reserves the right to randomly invite any student to defend any assessment element, regardless of plagiarism or suspicion. If the student refuses or fails to defend the work, the grade for this element will be annulled and recorded as "0".

Discrete Mathematics 2 DSBA 2025/2026

2025-09-11T18:13:22Z

Brdan: /* Seminar instructors */

= About =

This page contains basic information for the [https://www.hse.ru/edu/courses/1071074277 course Discrete Mathematics 2] in 2025/2026 academic year at HSE Bachelor’s Programme in Data Science and Business Analytics (DSBA).

= Smart LMS =

All materials will be published in [https://edu.hse.ru/course/view.php?id=252961 Smart LMS]

= Professors and assistants =

The lecturer of the course in 2025 fall term is Boris Radislavovich Danilov (brdanilov@gmail.com).

== Seminar instructors ==

{| class="wikitable" style="text-align:center"
|-
! Group !! 241 !! 242 !! 243 !! 244 !! 245 !! 246
|-
|| Teachers || [https://t.me/brdann Boris Danilov] || colspan="2" | [https://t.me/Alyona_Chislova Alyona Chislova] || Igor Savitskii || colspan="2" | [https://t.me/carlosbuitrago Carlos Buitrago]
|-
|| Odd week assistants || Polina Doronicheva || colspan="2" | Anastasia Podolyakina || Polina Doronicheva || colspan="2" | Irina Milova
|-
|| Even week assistants || Lewis Lesigha || colspan="2" | Anna Votinova || Lewis Lesigha || colspan="2" | Mark Belov
|}

== Office hours ==

'''Each teacher must be notified in advance''' that you want to come during consultation hours!!!

{| class="wikitable" style="text-align:center"
|-
|| Teachers || [https://t.me/brdann Boris Danilov] || [https://t.me/Alyona_Chislova Alyona Chislova] || Igor Savitskii ||[https://t.me/carlosbuitrago Carlos Buitrago]
|-
|| Time || Tuesday 17.50-18.20 || || ||
|}

= Interim assessment activities =

== Homework assignments ==

Homework assignments include 14 problem sets, one in a week. The last homework assignment is not assessed by tutors (it is left for self-assessment). The assessment of homework assignments is partial, that is only a minor subset of exercises from the whole homework assignment are being evaluated. Exercises to be evaluated are announced after homework deadline has passed.

Problem sets contain exercises which are labeled by an asterisk as ‘bonus’ while all the remaining exercises are considered ‘ordinary’. Deadline for submissions of ordinary exercises is the date when the task was assigned plus 7 days. Bonus exercises are assessed independently and their deadline is the date when the task was assigned plus 14 days. Late submissions score is penalized (both for compulsory and bonus parts separately) with multiplier (0.9)^H, where H is the number of hours passed after deadline, but only when H is less than 48. Submissions late for more than 48 hours are not assessed and scored zero.

Homework ordinary and bonus parts can be passed separately, but each part is passed as a whole. Re-submission of individual exercises means the re-submission of the whole part of the homework assignment with the update of the timestamp for all previously submitted exercises in that part. Only the last submission is getting assessed and scored.

Student may be required to explain orally his written solution to any problem on the colloquium, in class, or if there are suspicions of preparing the task without student's own effort on a personal appointment initiated by the teacher for the purpose of verification or defense of this particular assessment element. Student’s grade for the assessment element may be adjusted based on the additional verification or the defense. If plagiarism is detected, the assessment element will be assigned a score of "0".

Grade <HW> for homework assignments is a rational number between 0 and 15: 
''<HW> = min(15, 10 * (the sum of score points obtained by the student for all evaluated tasks in all homework assignments) / (the sum of nominal score points for ordinary evaluated tasks in all homework assignments))''.

== Quizzes ==

Quizzes are small tests that contain 1-3 exercises for 10-15 minutes that are held on seminars or lectures. The form of a quiz is a small written test. Students aren't allowed to use any materials during the quiz. Some questions of the quiz are sometimes labeled as ‘bonus’ whilst the others are ‘ordinary’ questions.

Grade <QZ> for quizzes is the rational number between 0 and 15: 
''<QZ> = min(15, 10 * (the sum of score points obtained by the student for all tasks in all quizzes) / (the sum of nominal score points for ordinary tasks in all quizzes))''.

== Knowledge test ==

Knowledge test is a written control work that is held at the end of the 1st module. Students may not consult any sources during the knowledge test that takes about 60 minutes and contains 5-7 problems. Some problems of the knowledge test are labeled as ‘bonus’ whilst the others are ‘ordinary’. Each problem is graded on the scale from 0 to 6 integer points.

Grade <KT> for the knowledge test is the rational number between 0 and 15: 
''<KT> = min(15, 10 * (the sum of score points obtained by the student for all tasks) / (the sum of nominal score points for ordinary tasks))''

== Colloquium ==

Colloquium is an oral activity where student receives one practical question (a problem similar to those that are assigned in homework) and two theoretical questions aligned with definitions and proofs from lectures. Student has 60 minutes to prepare his answer before defending it to a tutor (or several tutors).

Grade <CO> for the colloquium is the rational number between 0 and 10 that is based on answers of the student, where the answer for the practical question is graded out of 2 parts and answers for theoretical question are graded out of 3 parts each. Furthermore, 2 remaining parts of the grade are gained by answering additional questions on definitions and statements of theorems from the course.

== Examination control work ==

Written examination control work is held at the end of the course. Students may not consult any sources during the examination control work that takes about 120 minutes and contains 8-10 problems. Some problems of the examination control work are labeled as ‘bonus’ whilst the others are ‘ordinary’. Each problem is graded on the scale from 0 to 6 integer points.

Grade <EX> for the examination control work is the rational number between 0 and 15: 
''<EX> = min(15, 10 * (the sum of score points obtained by the student for all tasks) / (the sum of nominal score points for ordinary tasks))''

'''Retake principles''':

On the first and second retakes, the cumulative course grade is taken into consideration. In case of receiving an unsatisfactory final grade after the first retake, the student may refuse to participate in the second retake and instead repeat the course according to the individual curriculum. The cumulative grade is formed again as a result of repeated courses. After completing the repeated course, the student is given a second retake only, which the student previously refused.

= Grading =

== Final Grade ==

Grade <Final grade> for the course is determined by the formula:

'''<Final grade> = min(10, round(0.11 * <HW> + 0.14 * <QZ> + 0.17 * <KT> + 0.23 * <CO> + 0.35 * <EX>))''',

where <HW>, <QZ>, <KT>, <CO>, <EX> are grades for interim assessment activities:

* <HW> - Homework assignments
* <QZ> - Quizzes
* <KT> - Knowledge test
* <CO> - Colloquium
* <EX> - Examination control work

'''Rounding rules''':

Arithmetic rounding works for students with attendance between '''30%''' and '''70%'''. For students with attendance less than '''30%''' a number X with fractional part below or equal to '''0.7''' is rounded "below" (to the highest integer non exceeding X). For students with attendance greater than '''70%''' a number Y with fractional part above or equal to '''0.3''' is rounded "above" (to the smallest integer greater than Y). Rounding in the formula means rounding to the nearest integer, tie-values are rounded up.

== Automatic pass ==

Students who have good performance and attendance are eligible for automatic pass.

If student's attendance is greater than '''60%''' and <AU> by the formula below is greater or equal to '''7.0''' without rounding then by automatic pass <Final grade> = round(<AU>) (special rounding rules are NOT applied)

'''<AU> = min(10, 0.17 * <HW> + 0.22 * <QZ> + 0.26 * <KT> + 0.35 * <CO>)'''

Please note that expression for <AU> does NOT include rounding. 
Decision to apply for automatic pass must be made prior to taking the exam. Attendance at the exam automatically cancels automatic pass.

= Plagiarism rules =

If plagiarism is detected (including text generated with the help of generative AI without prior approval from the teacher), the assessment element will be assigned a score of "0". 
If there is a suspicion that the task was not completed independently, the teacher has the right to initiate an additional verification or a defense of this particular assessment element. The final grade for the element will be based on the results of such verification or defense. 
The teacher also reserves the right to randomly invite any student to defend any assessment element, regardless of plagiarism or suspicion. If the student refuses or fails to defend the work, the grade for this element will be annulled and recorded as "0".

Discrete Mathematics 2 DSBA 2025/2026

2025-09-11T18:10:39Z

Brdan: /* Seminar instructors */

= About =

This page contains basic information for the [https://www.hse.ru/edu/courses/1071074277 course Discrete Mathematics 2] in 2025/2026 academic year at HSE Bachelor’s Programme in Data Science and Business Analytics (DSBA).

= Smart LMS =

All materials will be published in [https://edu.hse.ru/course/view.php?id=252961 Smart LMS]

= Professors and assistants =

The lecturer of the course in 2025 fall term is Boris Radislavovich Danilov (brdanilov@gmail.com).

== Seminar instructors ==

{| class="wikitable" style="text-align:center"
|-
! Group !! 241 !! 242 !! 243 !! 244 !! 245 !! 246
|-
|| Teachers || [https://t.me/brdann Boris Danilov] || colspan="2" | [https://t.me/Alyona_Chislova Alyona Chislova] || Igor Savitskii || colspan="2" | [https://t.me/carlosbuitrago Carlos Buitrago]
|-
|| Odd week assistants || Polina Doronicheva || colspan="2" | Anastasia Podolyakina || Polina Doronicheva || colspan="2" | Irina Milova
|-
|| Odd week assistants || Lewis Lesigha || colspan="2" | Anna Votinova || Lewis Lesigha || colspan="2" | Mark Belov
|}

== Office hours ==

'''Each teacher must be notified in advance''' that you want to come during consultation hours!!!

{| class="wikitable" style="text-align:center"
|-
|| Teachers || [https://t.me/brdann Boris Danilov] || [https://t.me/Alyona_Chislova Alyona Chislova] || Igor Savitskii ||[https://t.me/carlosbuitrago Carlos Buitrago]
|-
|| Time || Tuesday 17.50-18.20 || || ||
|}

= Interim assessment activities =

== Homework assignments ==

Homework assignments include 14 problem sets, one in a week. The last homework assignment is not assessed by tutors (it is left for self-assessment). The assessment of homework assignments is partial, that is only a minor subset of exercises from the whole homework assignment are being evaluated. Exercises to be evaluated are announced after homework deadline has passed.

Problem sets contain exercises which are labeled by an asterisk as ‘bonus’ while all the remaining exercises are considered ‘ordinary’. Deadline for submissions of ordinary exercises is the date when the task was assigned plus 7 days. Bonus exercises are assessed independently and their deadline is the date when the task was assigned plus 14 days. Late submissions score is penalized (both for compulsory and bonus parts separately) with multiplier (0.9)^H, where H is the number of hours passed after deadline, but only when H is less than 48. Submissions late for more than 48 hours are not assessed and scored zero.

Homework ordinary and bonus parts can be passed separately, but each part is passed as a whole. Re-submission of individual exercises means the re-submission of the whole part of the homework assignment with the update of the timestamp for all previously submitted exercises in that part. Only the last submission is getting assessed and scored.

Student may be required to explain orally his written solution to any problem on the colloquium, in class, or if there are suspicions of preparing the task without student's own effort on a personal appointment initiated by the teacher for the purpose of verification or defense of this particular assessment element. Student’s grade for the assessment element may be adjusted based on the additional verification or the defense. If plagiarism is detected, the assessment element will be assigned a score of "0".

Grade <HW> for homework assignments is a rational number between 0 and 15: 
''<HW> = min(15, 10 * (the sum of score points obtained by the student for all evaluated tasks in all homework assignments) / (the sum of nominal score points for ordinary evaluated tasks in all homework assignments))''.

== Quizzes ==

Quizzes are small tests that contain 1-3 exercises for 10-15 minutes that are held on seminars or lectures. The form of a quiz is a small written test. Students aren't allowed to use any materials during the quiz. Some questions of the quiz are sometimes labeled as ‘bonus’ whilst the others are ‘ordinary’ questions.

Grade <QZ> for quizzes is the rational number between 0 and 15: 
''<QZ> = min(15, 10 * (the sum of score points obtained by the student for all tasks in all quizzes) / (the sum of nominal score points for ordinary tasks in all quizzes))''.

== Knowledge test ==

Knowledge test is a written control work that is held at the end of the 1st module. Students may not consult any sources during the knowledge test that takes about 60 minutes and contains 5-7 problems. Some problems of the knowledge test are labeled as ‘bonus’ whilst the others are ‘ordinary’. Each problem is graded on the scale from 0 to 6 integer points.

Grade <KT> for the knowledge test is the rational number between 0 and 15: 
''<KT> = min(15, 10 * (the sum of score points obtained by the student for all tasks) / (the sum of nominal score points for ordinary tasks))''

== Colloquium ==

Colloquium is an oral activity where student receives one practical question (a problem similar to those that are assigned in homework) and two theoretical questions aligned with definitions and proofs from lectures. Student has 60 minutes to prepare his answer before defending it to a tutor (or several tutors).

Grade <CO> for the colloquium is the rational number between 0 and 10 that is based on answers of the student, where the answer for the practical question is graded out of 2 parts and answers for theoretical question are graded out of 3 parts each. Furthermore, 2 remaining parts of the grade are gained by answering additional questions on definitions and statements of theorems from the course.

== Examination control work ==

Written examination control work is held at the end of the course. Students may not consult any sources during the examination control work that takes about 120 minutes and contains 8-10 problems. Some problems of the examination control work are labeled as ‘bonus’ whilst the others are ‘ordinary’. Each problem is graded on the scale from 0 to 6 integer points.

Grade <EX> for the examination control work is the rational number between 0 and 15: 
''<EX> = min(15, 10 * (the sum of score points obtained by the student for all tasks) / (the sum of nominal score points for ordinary tasks))''

'''Retake principles''':

On the first and second retakes, the cumulative course grade is taken into consideration. In case of receiving an unsatisfactory final grade after the first retake, the student may refuse to participate in the second retake and instead repeat the course according to the individual curriculum. The cumulative grade is formed again as a result of repeated courses. After completing the repeated course, the student is given a second retake only, which the student previously refused.

= Grading =

== Final Grade ==

Grade <Final grade> for the course is determined by the formula:

'''<Final grade> = min(10, round(0.11 * <HW> + 0.14 * <QZ> + 0.17 * <KT> + 0.23 * <CO> + 0.35 * <EX>))''',

where <HW>, <QZ>, <KT>, <CO>, <EX> are grades for interim assessment activities:

* <HW> - Homework assignments
* <QZ> - Quizzes
* <KT> - Knowledge test
* <CO> - Colloquium
* <EX> - Examination control work

'''Rounding rules''':

Arithmetic rounding works for students with attendance between '''30%''' and '''70%'''. For students with attendance less than '''30%''' a number X with fractional part below or equal to '''0.7''' is rounded "below" (to the highest integer non exceeding X). For students with attendance greater than '''70%''' a number Y with fractional part above or equal to '''0.3''' is rounded "above" (to the smallest integer greater than Y). Rounding in the formula means rounding to the nearest integer, tie-values are rounded up.

== Automatic pass ==

Students who have good performance and attendance are eligible for automatic pass.

If student's attendance is greater than '''60%''' and <AU> by the formula below is greater or equal to '''7.0''' without rounding then by automatic pass <Final grade> = round(<AU>) (special rounding rules are NOT applied)

'''<AU> = min(10, 0.17 * <HW> + 0.22 * <QZ> + 0.26 * <KT> + 0.35 * <CO>)'''

Please note that expression for <AU> does NOT include rounding. 
Decision to apply for automatic pass must be made prior to taking the exam. Attendance at the exam automatically cancels automatic pass.

= Plagiarism rules =

If plagiarism is detected (including text generated with the help of generative AI without prior approval from the teacher), the assessment element will be assigned a score of "0". 
If there is a suspicion that the task was not completed independently, the teacher has the right to initiate an additional verification or a defense of this particular assessment element. The final grade for the element will be based on the results of such verification or defense. 
The teacher also reserves the right to randomly invite any student to defend any assessment element, regardless of plagiarism or suspicion. If the student refuses or fails to defend the work, the grade for this element will be annulled and recorded as "0".

Discrete Mathematics 2 DSBA 2025/2026

2025-09-10T09:49:50Z

Brdan: Fix formatting

= About =

This page contains basic information for the [https://www.hse.ru/edu/courses/1071074277 course Discrete Mathematics 2] in 2025/2026 academic year at HSE Bachelor’s Programme in Data Science and Business Analytics (DSBA).

= Smart LMS =

All materials will be published in [https://edu.hse.ru/course/view.php?id=252961 Smart LMS]

= Professors and assistants =

The lecturer of the course in 2025 fall term is Boris Radislavovich Danilov (brdanilov@gmail.com).

== Seminar instructors ==

{| class="wikitable" style="text-align:center"
|-
! Group !! 241 !! 242 !! 243 !! 244 !! 245 !! 246
|-
|| Teachers || [https://t.me/brdann Boris Danilov] || colspan="2" | [https://t.me/Alyona_Chislova Alyona Chislova] || Igor Savitskii || colspan="2" | [https://t.me/carlosbuitrago Carlos Buitrago]
|-
|| Assistants || colspan="2" | || colspan="2" | || colspan="2" |
|}

== Office hours ==

'''Each teacher must be notified in advance''' that you want to come during consultation hours!!!

{| class="wikitable" style="text-align:center"
|-
|| Teachers || [https://t.me/brdann Boris Danilov] || [https://t.me/Alyona_Chislova Alyona Chislova] || Igor Savitskii ||[https://t.me/carlosbuitrago Carlos Buitrago]
|-
|| Time || Tuesday 17.50-18.20 || || ||
|}

= Interim assessment activities =

== Homework assignments ==

Homework assignments include 14 problem sets, one in a week. The last homework assignment is not assessed by tutors (it is left for self-assessment). The assessment of homework assignments is partial, that is only a minor subset of exercises from the whole homework assignment are being evaluated. Exercises to be evaluated are announced after homework deadline has passed.

Problem sets contain exercises which are labeled by an asterisk as ‘bonus’ while all the remaining exercises are considered ‘ordinary’. Deadline for submissions of ordinary exercises is the date when the task was assigned plus 7 days. Bonus exercises are assessed independently and their deadline is the date when the task was assigned plus 14 days. Late submissions score is penalized (both for compulsory and bonus parts separately) with multiplier (0.9)^H, where H is the number of hours passed after deadline, but only when H is less than 48. Submissions late for more than 48 hours are not assessed and scored zero.

Homework ordinary and bonus parts can be passed separately, but each part is passed as a whole. Re-submission of individual exercises means the re-submission of the whole part of the homework assignment with the update of the timestamp for all previously submitted exercises in that part. Only the last submission is getting assessed and scored.

Student may be required to explain orally his written solution to any problem on the colloquium, in class, or if there are suspicions of preparing the task without student's own effort on a personal appointment initiated by the teacher for the purpose of verification or defense of this particular assessment element. Student’s grade for the assessment element may be adjusted based on the additional verification or the defense. If plagiarism is detected, the assessment element will be assigned a score of "0".

Grade <HW> for homework assignments is a rational number between 0 and 15: 
''<HW> = min(15, 10 * (the sum of score points obtained by the student for all evaluated tasks in all homework assignments) / (the sum of nominal score points for ordinary evaluated tasks in all homework assignments))''.

== Quizzes ==

Quizzes are small tests that contain 1-3 exercises for 10-15 minutes that are held on seminars or lectures. The form of a quiz is a small written test. Students aren't allowed to use any materials during the quiz. Some questions of the quiz are sometimes labeled as ‘bonus’ whilst the others are ‘ordinary’ questions.

Grade <QZ> for quizzes is the rational number between 0 and 15: 
''<QZ> = min(15, 10 * (the sum of score points obtained by the student for all tasks in all quizzes) / (the sum of nominal score points for ordinary tasks in all quizzes))''.

== Knowledge test ==

Knowledge test is a written control work that is held at the end of the 1st module. Students may not consult any sources during the knowledge test that takes about 60 minutes and contains 5-7 problems. Some problems of the knowledge test are labeled as ‘bonus’ whilst the others are ‘ordinary’. Each problem is graded on the scale from 0 to 6 integer points.

Grade <KT> for the knowledge test is the rational number between 0 and 15: 
''<KT> = min(15, 10 * (the sum of score points obtained by the student for all tasks) / (the sum of nominal score points for ordinary tasks))''

== Colloquium ==

Colloquium is an oral activity where student receives one practical question (a problem similar to those that are assigned in homework) and two theoretical questions aligned with definitions and proofs from lectures. Student has 60 minutes to prepare his answer before defending it to a tutor (or several tutors).

Grade <CO> for the colloquium is the rational number between 0 and 10 that is based on answers of the student, where the answer for the practical question is graded out of 2 parts and answers for theoretical question are graded out of 3 parts each. Furthermore, 2 remaining parts of the grade are gained by answering additional questions on definitions and statements of theorems from the course.

== Examination control work ==

Written examination control work is held at the end of the course. Students may not consult any sources during the examination control work that takes about 120 minutes and contains 8-10 problems. Some problems of the examination control work are labeled as ‘bonus’ whilst the others are ‘ordinary’. Each problem is graded on the scale from 0 to 6 integer points.

Grade <EX> for the examination control work is the rational number between 0 and 15: 
''<EX> = min(15, 10 * (the sum of score points obtained by the student for all tasks) / (the sum of nominal score points for ordinary tasks))''

'''Retake principles''':

On the first and second retakes, the cumulative course grade is taken into consideration. In case of receiving an unsatisfactory final grade after the first retake, the student may refuse to participate in the second retake and instead repeat the course according to the individual curriculum. The cumulative grade is formed again as a result of repeated courses. After completing the repeated course, the student is given a second retake only, which the student previously refused.

= Grading =

== Final Grade ==

Grade <Final grade> for the course is determined by the formula:

'''<Final grade> = min(10, round(0.11 * <HW> + 0.14 * <QZ> + 0.17 * <KT> + 0.23 * <CO> + 0.35 * <EX>))''',

where <HW>, <QZ>, <KT>, <CO>, <EX> are grades for interim assessment activities:

* <HW> - Homework assignments
* <QZ> - Quizzes
* <KT> - Knowledge test
* <CO> - Colloquium
* <EX> - Examination control work

'''Rounding rules''':

Arithmetic rounding works for students with attendance between '''30%''' and '''70%'''. For students with attendance less than '''30%''' a number X with fractional part below or equal to '''0.7''' is rounded "below" (to the highest integer non exceeding X). For students with attendance greater than '''70%''' a number Y with fractional part above or equal to '''0.3''' is rounded "above" (to the smallest integer greater than Y). Rounding in the formula means rounding to the nearest integer, tie-values are rounded up.

== Automatic pass ==

Students who have good performance and attendance are eligible for automatic pass.

If student's attendance is greater than '''60%''' and <AU> by the formula below is greater or equal to '''7.0''' without rounding then by automatic pass <Final grade> = round(<AU>) (special rounding rules are NOT applied)

'''<AU> = min(10, 0.17 * <HW> + 0.22 * <QZ> + 0.26 * <KT> + 0.35 * <CO>)'''

Please note that expression for <AU> does NOT include rounding. 
Decision to apply for automatic pass must be made prior to taking the exam. Attendance at the exam automatically cancels automatic pass.

= Plagiarism rules =

If plagiarism is detected (including text generated with the help of generative AI without prior approval from the teacher), the assessment element will be assigned a score of "0". 
If there is a suspicion that the task was not completed independently, the teacher has the right to initiate an additional verification or a defense of this particular assessment element. The final grade for the element will be based on the results of such verification or defense. 
The teacher also reserves the right to randomly invite any student to defend any assessment element, regardless of plagiarism or suspicion. If the student refuses or fails to defend the work, the grade for this element will be annulled and recorded as "0".

Discrete Mathematics 2 DSBA 2025/2026

2025-09-10T09:49:25Z

Brdan: Add office hours

= About =

This page contains basic information for the [https://www.hse.ru/edu/courses/1071074277 course Discrete Mathematics 2] in 2025/2026 academic year at HSE Bachelor’s Programme in Data Science and Business Analytics (DSBA).

= Smart LMS =

All materials will be published in [https://edu.hse.ru/course/view.php?id=252961 Smart LMS]

= Professors and assistants =

The lecturer of the course in 2025 fall term is Boris Radislavovich Danilov (brdanilov@gmail.com).

== Seminar instructors ==

{| class="wikitable" style="text-align:center"
|-
! Group !! 241 !! 242 !! 243 !! 244 !! 245 !! 246
|-
|| Teachers || [https://t.me/brdann Boris Danilov] || colspan="2" | [https://t.me/Alyona_Chislova Alyona Chislova] || Igor Savitskii || colspan="2" | [https://t.me/carlosbuitrago Carlos Buitrago]
|-
|| Assistants || colspan="2" | || colspan="2" | || colspan="2" |
|}

== Office hours ==

'''Each teacher must be notified in advance''' that you want to come during consultation hours!!!

{| class="wikitable" style="text-align:center"
|-
|| Teachers || [https://t.me/brdann Boris Danilov] || [https://t.me/Alyona_Chislova Alyona Chislova] || Igor Savitskii ||[https://t.me/carlosbuitrago Carlos Buitrago]
|-
|| Time |Tuesday 17.50-18.20| || || ||
|}

= Interim assessment activities =

== Homework assignments ==

Homework assignments include 14 problem sets, one in a week. The last homework assignment is not assessed by tutors (it is left for self-assessment). The assessment of homework assignments is partial, that is only a minor subset of exercises from the whole homework assignment are being evaluated. Exercises to be evaluated are announced after homework deadline has passed.

Problem sets contain exercises which are labeled by an asterisk as ‘bonus’ while all the remaining exercises are considered ‘ordinary’. Deadline for submissions of ordinary exercises is the date when the task was assigned plus 7 days. Bonus exercises are assessed independently and their deadline is the date when the task was assigned plus 14 days. Late submissions score is penalized (both for compulsory and bonus parts separately) with multiplier (0.9)^H, where H is the number of hours passed after deadline, but only when H is less than 48. Submissions late for more than 48 hours are not assessed and scored zero.

Homework ordinary and bonus parts can be passed separately, but each part is passed as a whole. Re-submission of individual exercises means the re-submission of the whole part of the homework assignment with the update of the timestamp for all previously submitted exercises in that part. Only the last submission is getting assessed and scored.

Student may be required to explain orally his written solution to any problem on the colloquium, in class, or if there are suspicions of preparing the task without student's own effort on a personal appointment initiated by the teacher for the purpose of verification or defense of this particular assessment element. Student’s grade for the assessment element may be adjusted based on the additional verification or the defense. If plagiarism is detected, the assessment element will be assigned a score of "0".

Grade <HW> for homework assignments is a rational number between 0 and 15: 
''<HW> = min(15, 10 * (the sum of score points obtained by the student for all evaluated tasks in all homework assignments) / (the sum of nominal score points for ordinary evaluated tasks in all homework assignments))''.

== Quizzes ==

Quizzes are small tests that contain 1-3 exercises for 10-15 minutes that are held on seminars or lectures. The form of a quiz is a small written test. Students aren't allowed to use any materials during the quiz. Some questions of the quiz are sometimes labeled as ‘bonus’ whilst the others are ‘ordinary’ questions.

Grade <QZ> for quizzes is the rational number between 0 and 15: 
''<QZ> = min(15, 10 * (the sum of score points obtained by the student for all tasks in all quizzes) / (the sum of nominal score points for ordinary tasks in all quizzes))''.

== Knowledge test ==

Knowledge test is a written control work that is held at the end of the 1st module. Students may not consult any sources during the knowledge test that takes about 60 minutes and contains 5-7 problems. Some problems of the knowledge test are labeled as ‘bonus’ whilst the others are ‘ordinary’. Each problem is graded on the scale from 0 to 6 integer points.

Grade <KT> for the knowledge test is the rational number between 0 and 15: 
''<KT> = min(15, 10 * (the sum of score points obtained by the student for all tasks) / (the sum of nominal score points for ordinary tasks))''

== Colloquium ==

Colloquium is an oral activity where student receives one practical question (a problem similar to those that are assigned in homework) and two theoretical questions aligned with definitions and proofs from lectures. Student has 60 minutes to prepare his answer before defending it to a tutor (or several tutors).

Grade <CO> for the colloquium is the rational number between 0 and 10 that is based on answers of the student, where the answer for the practical question is graded out of 2 parts and answers for theoretical question are graded out of 3 parts each. Furthermore, 2 remaining parts of the grade are gained by answering additional questions on definitions and statements of theorems from the course.

== Examination control work ==

Written examination control work is held at the end of the course. Students may not consult any sources during the examination control work that takes about 120 minutes and contains 8-10 problems. Some problems of the examination control work are labeled as ‘bonus’ whilst the others are ‘ordinary’. Each problem is graded on the scale from 0 to 6 integer points.

Grade <EX> for the examination control work is the rational number between 0 and 15: 
''<EX> = min(15, 10 * (the sum of score points obtained by the student for all tasks) / (the sum of nominal score points for ordinary tasks))''

'''Retake principles''':

On the first and second retakes, the cumulative course grade is taken into consideration. In case of receiving an unsatisfactory final grade after the first retake, the student may refuse to participate in the second retake and instead repeat the course according to the individual curriculum. The cumulative grade is formed again as a result of repeated courses. After completing the repeated course, the student is given a second retake only, which the student previously refused.

= Grading =

== Final Grade ==

Grade <Final grade> for the course is determined by the formula:

'''<Final grade> = min(10, round(0.11 * <HW> + 0.14 * <QZ> + 0.17 * <KT> + 0.23 * <CO> + 0.35 * <EX>))''',

where <HW>, <QZ>, <KT>, <CO>, <EX> are grades for interim assessment activities:

* <HW> - Homework assignments
* <QZ> - Quizzes
* <KT> - Knowledge test
* <CO> - Colloquium
* <EX> - Examination control work

'''Rounding rules''':

Arithmetic rounding works for students with attendance between '''30%''' and '''70%'''. For students with attendance less than '''30%''' a number X with fractional part below or equal to '''0.7''' is rounded "below" (to the highest integer non exceeding X). For students with attendance greater than '''70%''' a number Y with fractional part above or equal to '''0.3''' is rounded "above" (to the smallest integer greater than Y). Rounding in the formula means rounding to the nearest integer, tie-values are rounded up.

== Automatic pass ==

Students who have good performance and attendance are eligible for automatic pass.

If student's attendance is greater than '''60%''' and <AU> by the formula below is greater or equal to '''7.0''' without rounding then by automatic pass <Final grade> = round(<AU>) (special rounding rules are NOT applied)

'''<AU> = min(10, 0.17 * <HW> + 0.22 * <QZ> + 0.26 * <KT> + 0.35 * <CO>)'''

Please note that expression for <AU> does NOT include rounding. 
Decision to apply for automatic pass must be made prior to taking the exam. Attendance at the exam automatically cancels automatic pass.

= Plagiarism rules =

If plagiarism is detected (including text generated with the help of generative AI without prior approval from the teacher), the assessment element will be assigned a score of "0". 
If there is a suspicion that the task was not completed independently, the teacher has the right to initiate an additional verification or a defense of this particular assessment element. The final grade for the element will be based on the results of such verification or defense. 
The teacher also reserves the right to randomly invite any student to defend any assessment element, regardless of plagiarism or suspicion. If the student refuses or fails to defend the work, the grade for this element will be annulled and recorded as "0".

Discrete Mathematics 2 DSBA 2025/2026

2025-09-10T09:46:54Z

Brdan: Add link to Smart LMS

= About =

This page contains basic information for the [https://www.hse.ru/edu/courses/1071074277 course Discrete Mathematics 2] in 2025/2026 academic year at HSE Bachelor’s Programme in Data Science and Business Analytics (DSBA).

= Smart LMS =

All materials will be published in [https://edu.hse.ru/course/view.php?id=252961 Smart LMS]

= Professors and assistants =

The lecturer of the course in 2025 fall term is Boris Radislavovich Danilov (brdanilov@gmail.com).

== Seminar instructors ==

{| class="wikitable" style="text-align:center"
|-
! Group !! 241 !! 242 !! 243 !! 244 !! 245 !! 246
|-
|| Teachers || [https://t.me/brdann Boris Danilov] || colspan="2" | [https://t.me/Alyona_Chislova Alyona Chislova] || Igor Savitskii || colspan="2" | [https://t.me/carlosbuitrago Carlos Buitrago]
|-
|| Assistants || colspan="2" | || colspan="2" | || colspan="2" |
|}

== Office hours ==

'''Each teacher must be notified in advance''' that you want to come during consultation hours!!!

{| class="wikitable" style="text-align:center"
|-
|| Teachers || [https://t.me/brdann Boris Danilov] || [https://t.me/Alyona_Chislova Alyona Chislova] || Igor Savitskii ||[https://t.me/carlosbuitrago Carlos Buitrago]
|-
|| Time || || || ||
|}

= Interim assessment activities =

== Homework assignments ==

Homework assignments include 14 problem sets, one in a week. The last homework assignment is not assessed by tutors (it is left for self-assessment). The assessment of homework assignments is partial, that is only a minor subset of exercises from the whole homework assignment are being evaluated. Exercises to be evaluated are announced after homework deadline has passed.

Problem sets contain exercises which are labeled by an asterisk as ‘bonus’ while all the remaining exercises are considered ‘ordinary’. Deadline for submissions of ordinary exercises is the date when the task was assigned plus 7 days. Bonus exercises are assessed independently and their deadline is the date when the task was assigned plus 14 days. Late submissions score is penalized (both for compulsory and bonus parts separately) with multiplier (0.9)^H, where H is the number of hours passed after deadline, but only when H is less than 48. Submissions late for more than 48 hours are not assessed and scored zero.

Homework ordinary and bonus parts can be passed separately, but each part is passed as a whole. Re-submission of individual exercises means the re-submission of the whole part of the homework assignment with the update of the timestamp for all previously submitted exercises in that part. Only the last submission is getting assessed and scored.

Student may be required to explain orally his written solution to any problem on the colloquium, in class, or if there are suspicions of preparing the task without student's own effort on a personal appointment initiated by the teacher for the purpose of verification or defense of this particular assessment element. Student’s grade for the assessment element may be adjusted based on the additional verification or the defense. If plagiarism is detected, the assessment element will be assigned a score of "0".

Grade <HW> for homework assignments is a rational number between 0 and 15: 
''<HW> = min(15, 10 * (the sum of score points obtained by the student for all evaluated tasks in all homework assignments) / (the sum of nominal score points for ordinary evaluated tasks in all homework assignments))''.

== Quizzes ==

Quizzes are small tests that contain 1-3 exercises for 10-15 minutes that are held on seminars or lectures. The form of a quiz is a small written test. Students aren't allowed to use any materials during the quiz. Some questions of the quiz are sometimes labeled as ‘bonus’ whilst the others are ‘ordinary’ questions.

Grade <QZ> for quizzes is the rational number between 0 and 15: 
''<QZ> = min(15, 10 * (the sum of score points obtained by the student for all tasks in all quizzes) / (the sum of nominal score points for ordinary tasks in all quizzes))''.

== Knowledge test ==

Knowledge test is a written control work that is held at the end of the 1st module. Students may not consult any sources during the knowledge test that takes about 60 minutes and contains 5-7 problems. Some problems of the knowledge test are labeled as ‘bonus’ whilst the others are ‘ordinary’. Each problem is graded on the scale from 0 to 6 integer points.

Grade <KT> for the knowledge test is the rational number between 0 and 15: 
''<KT> = min(15, 10 * (the sum of score points obtained by the student for all tasks) / (the sum of nominal score points for ordinary tasks))''

== Colloquium ==

Colloquium is an oral activity where student receives one practical question (a problem similar to those that are assigned in homework) and two theoretical questions aligned with definitions and proofs from lectures. Student has 60 minutes to prepare his answer before defending it to a tutor (or several tutors).

Grade <CO> for the colloquium is the rational number between 0 and 10 that is based on answers of the student, where the answer for the practical question is graded out of 2 parts and answers for theoretical question are graded out of 3 parts each. Furthermore, 2 remaining parts of the grade are gained by answering additional questions on definitions and statements of theorems from the course.

== Examination control work ==

Written examination control work is held at the end of the course. Students may not consult any sources during the examination control work that takes about 120 minutes and contains 8-10 problems. Some problems of the examination control work are labeled as ‘bonus’ whilst the others are ‘ordinary’. Each problem is graded on the scale from 0 to 6 integer points.

Grade <EX> for the examination control work is the rational number between 0 and 15: 
''<EX> = min(15, 10 * (the sum of score points obtained by the student for all tasks) / (the sum of nominal score points for ordinary tasks))''

'''Retake principles''':

On the first and second retakes, the cumulative course grade is taken into consideration. In case of receiving an unsatisfactory final grade after the first retake, the student may refuse to participate in the second retake and instead repeat the course according to the individual curriculum. The cumulative grade is formed again as a result of repeated courses. After completing the repeated course, the student is given a second retake only, which the student previously refused.

= Grading =

== Final Grade ==

Grade <Final grade> for the course is determined by the formula:

'''<Final grade> = min(10, round(0.11 * <HW> + 0.14 * <QZ> + 0.17 * <KT> + 0.23 * <CO> + 0.35 * <EX>))''',

where <HW>, <QZ>, <KT>, <CO>, <EX> are grades for interim assessment activities:

* <HW> - Homework assignments
* <QZ> - Quizzes
* <KT> - Knowledge test
* <CO> - Colloquium
* <EX> - Examination control work

'''Rounding rules''':

Arithmetic rounding works for students with attendance between '''30%''' and '''70%'''. For students with attendance less than '''30%''' a number X with fractional part below or equal to '''0.7''' is rounded "below" (to the highest integer non exceeding X). For students with attendance greater than '''70%''' a number Y with fractional part above or equal to '''0.3''' is rounded "above" (to the smallest integer greater than Y). Rounding in the formula means rounding to the nearest integer, tie-values are rounded up.

== Automatic pass ==

Students who have good performance and attendance are eligible for automatic pass.

If student's attendance is greater than '''60%''' and <AU> by the formula below is greater or equal to '''7.0''' without rounding then by automatic pass <Final grade> = round(<AU>) (special rounding rules are NOT applied)

'''<AU> = min(10, 0.17 * <HW> + 0.22 * <QZ> + 0.26 * <KT> + 0.35 * <CO>)'''

Please note that expression for <AU> does NOT include rounding. 
Decision to apply for automatic pass must be made prior to taking the exam. Attendance at the exam automatically cancels automatic pass.

= Plagiarism rules =

If plagiarism is detected (including text generated with the help of generative AI without prior approval from the teacher), the assessment element will be assigned a score of "0". 
If there is a suspicion that the task was not completed independently, the teacher has the right to initiate an additional verification or a defense of this particular assessment element. The final grade for the element will be based on the results of such verification or defense. 
The teacher also reserves the right to randomly invite any student to defend any assessment element, regardless of plagiarism or suspicion. If the student refuses or fails to defend the work, the grade for this element will be annulled and recorded as "0".

Discrete Mathematics DSBA 2024/2025

2025-03-13T17:50:33Z

Brdan: /* Assignment deadlines */

== Instructors ==

=== The lecturer ===
My name is Evgeny Dashkov. Feel free to contact me via email: edashkov@gmail.com, [https://t.me/edashkov Telegram], or [https://vk.com/evgeny.v.dashkov VK].

My Assistant (the person responsible for the tables etc.): [https://t.me/elizaaaa_5 Elizaveta Levshina].

=== Seminar Instructors and Teaching Assistants ===
{| class="wikitable" style="text-align:center"
|-
! Group !! 241 !! 242 !! 243 !! 244 !! 245 !! 246
|-
|| Teachers || [https://t.me/edashkov Evgeny Dashkov] ||colspan="2"| [https://t.me/brdann Boris Danilov]|| colspan="3"| [https://t.me/DiegBuitrago Diego Buitrago]
|-
|| Teaching Assistants || [https://t.me/svbudygin Sergei Budygin] || [https://t.me/Avgustine_iw Zakhar Zinkin] || [https://t.me/svnsrg Sergey Savin] || [https://t.me/NaviMash Ivan Mashkarin] || [https://t.me/underpl Maxim Titov] || [https://t.me/almanmaria Maria Krotova]
|}

=== Whom should I ask? ===

If you have a question or comment concerning the mathematical content of our course, it is best to post it to our [https://t.me/joinchat/T_YTN4IG1vAJNWT9 student chat]. Alternatively, you may address your question to your Teaching Assistant, Seminar Instructor or the Lecturer (say, if your question discloses an important idea for a HW problem). It is much better to ask and get to know than not to ask and remain ignorant. '''Please do not hesitate to ask your mathematical questions!'''

If you need a more detailed consultation concerning the course's mathematics, please be informed that our Teaching Assistants usually hold periodic consultations while the Seminar Instructors and Lecturer have some designated time for counseling students. Still, the best thing to do is to arrange a consultation in advance via a personal communication.

Homework-grading related questions should be directed to your teaching assistant first; then to your seminar instructor and to the lecturer just in case of any disagreement.

Organizational, administrative, legal or paperwork questions must be addressed to the Student Service Center, Study Office or other relevant offices first and foremost. If you have been redirected to us with such a question nevertheless, please contact the Lecturer's Assistant first.

== Current performance ==

[https://docs.google.com/spreadsheets/d/1632c9OT4ICCe5X3A1Obc1rH69dNpIEy_FEghK1vyM8o/edit?usp=drive_link The Table].

== Homework ==
The homework includes a few problem sets, one in a fortnight or so (the deadlines are announced on giving each set). Every problem set consists of about 10 – 15 problems, some of which are labeled as ‘bonus’ while all the remaining are considered ‘ordinary’. These sets may be subdivided further for students’ convenience.

A student may be required to 'defend' (i.e., to explain orally) his written solution to any problem. His grade for the problem may be decreased if he fails to do so properly.

== Exam 1 ==
A written examination is held past Module 1. Students may not consult any sources during the exam. The examination takes about 120 minutes. Some problems of the exam are labeled as ‘bonus’; the others are ‘ordinary’.

== Colloquium ==
An oral colloquium is held at the beginning of Module 3. Each student is given two questions concerning statements and definitions as well as one question requiring a proof. After no less than 45 minutes of preparation (when using any literature is allowed), the student is required to answer ‘from scratch’, that is, with no recourse to any materials. The examiner may pose additional questions as he sees fit.

'''Please find the question list and rules [https://drive.google.com/file/d/1ZdxmBUHDBnDnI156J4QR2X3Y0rJZoPiW/view?usp=drive_link here]'''.

== Exam 2 ==
A written examination is held past Module 3. Students may not consult any sources during the exam. The examination takes about 120 minutes. Some problems of the exam are labeled as ‘bonus’; the others are ‘ordinary’.

== Bonus activities ==
Throughout the course, the students may be graded for a variety of ‘bonus activities’ (like quizzes, etc.) either offline or online.

== Course materials ==

[https://t.me/joinchat/T_YTN4IG1vAJNWT9 Course chat]. This is our primary outlet for course announcements, questions, and discussions. '''Please join it!'''

=== Lecture notes ===

[https://drive.google.com/file/d/1mmNLLQ0--EDihGNRKwSyXLOA1KL7A0lD/view?usp=sharing Original English version]

[https://drive.google.com/drive/folders/1cTCdJtVVtO9uDgIKE8HY0qhl285tzOo1?usp=drive_link A Russian translation by volunteering students] (you are welcome to [https://t.me/sigma_algebraa join] their ranks)

=== Classes recordings ===

=== Lecture video archive ===

=== Other resources ===
* [https://tinyurl.com/rwky5vmk The Course's Google Directory]

* [https://www.youtube.com/playlist?list=PL1Uob8iPTHGTidrmrqEHTJ96Pt3-PmML4 Past years' videos]

* We have a [https://meet.edashkov.net.ru dedicated server] to hold an online meeting if we need one.

== Problem sets ==

=== Class problems ===

* [https://drive.google.com/file/d/1EP-diSuOTn9f0ryg18Z2w0xjEp8j0bnl/view?usp=drive_link Problem Set 1]

* [https://drive.google.com/file/d/12ct99-ORd7A94Gh5g4Nf9riv7UqNMSRc/view?usp=drive_link Problem Set 2]

* [https://drive.google.com/file/d/1yKKqLsS99V4AhCYqbjafuav2CMCdQTOQ/view?usp=drive_link Problem Set 3]

* [https://drive.google.com/file/d/1YgH_AdCk4GcKC0KH7xBA4-sUnOYkUvUK/view?usp=drive_link Problem Set 4]

* [https://drive.google.com/file/d/1M556PSgTJOo5W-AxYEXjFu94VfledpF5/view?usp=drive_link Problem Set 5]

* [https://drive.google.com/file/d/1-ylVViaBgzxEM-M7Rvrz2iggtK6UiJTY/view?usp=drive_link Problem Set 6]

* [https://drive.google.com/file/d/15tcTNLW-uFqT2xPJn1imOnEzaGwlaZAq/view?usp=drive_link Problem Set 7]

* [https://drive.google.com/file/d/1N1EuCCe7NIiEa69nXHwncfQG2IOTyzLi/view?usp=drive_link Problem Set 8]

* [https://drive.google.com/file/d/1PmlR2bysnKSZrJle9Dwa4KiB23G5ORdZ/view?usp=drive_link Problem Set 9]

=== Assignment deadlines ===

{| class="wikitable"
|-
! Home problem set !! colspan="11" | Deadline
|-
| || 241 || 242 || 243 || 244 || 245 || 246
|-
| [https://drive.google.com/file/d/15vCxTrNMwagS4rqQnUzdLParTqOP8y5P/view?usp=drive_link HW1a ] || Sep 19 || Sep 19 || Sep 19 || Sep 24 || Sep 24 || Sep 24
|-
| [https://drive.google.com/file/d/1PTJY1PEG-wUlTqUGXT8KWRsll8H0XLb0/view?usp=drive_link HW1b] || Oct 12 || Oct 10 || Oct 10 || Oct 17 || Oct 17 || Oct 17
|-
| [https://drive.google.com/file/d/1mSNPCXo1J3eMz7Wk9yagWkgaZn7AwN7B/view?usp=drive_link HW1c] || Oct 24 || Oct 24 || Oct 24 || Oct 24 || Oct 24 || Oct 24
|-
| [https://drive.google.com/file/d/1LOPPwGjyVleR_mclxTKUJ_bxFrxt44sW/view?usp=drive_link HW2a] || Nov 29 || Nov 29 || Nov 29 || Nov 29 || Nov 29 || Nov 29
|-
| [https://drive.google.com/file/d/1W7k1OTiIMlPOpo-2mwmGegrc4RDHz5_j/view?usp=drive_link HW2b] || Dec 8 || Dec 8 || Dec 8 || Dec 14 || Dec 14 || Dec 14
|-
| [https://drive.google.com/file/d/1V99HEXHgcCXT6tjJp0oPV05Jw172Bid8/view?usp=drive_link HW2c] || Jan 9 || Jan 23 || Jan 23 || Jan 25 || Jan 25 || Jan 25
|-
| [https://drive.google.com/file/d/1NVhQr0s6Z7SK6Y_oXzskXpY8c1CVeolJ/view?usp=drive_link HW3a] || Feb 6 || Feb 3 || Feb 6 || Feb 15 || Feb 15 || Feb 15
|-
| [https://drive.google.com/file/d/19S1mi9DHX0WoqJpSOMSItFPN--Snhrp_/view?usp=drive_link HW3b] || Feb 27 || Feb 27 || Feb 27 || March 9 || March 1 || March 1
|-
| [https://drive.google.com/file/d/1wPy3_0myen8aLP8f-WP3DMiPZjqT6CRy/view?usp=drive_link HW4a] || Mar 10 || Mar 20 || Mar 20 || March 15 || March 15 || March 15
|-
| [https://drive.google.com/file/d/1vKfnIzo6b-WbZLYrDL6hd1S2v4s55SZ2/view?usp=drive_link HW4b] || || Mar 22 || Mar 22 || || ||
|}

'''Each deadline is set by the respective group's instructor.'''

== Assessment and Grading ==

=== Homework ===

The homework is graded in two batches: one (HW_A) includes everything to be submitted in Module1 and the other (HW_B) includes all the rest. For each problem, either ordinary or bonus, the student is given a score from 0 to 1 point (in fractional values) according to the progress he made.

Grade HW_A is computed the following way (before rounding):

HW_A = 8 * ord + 2 * adv, where

ord = (the sum of points given for ordinary problems) / #(ordinary problems);

adv = (the sum of points given for bonus problems) / #(bonus problems).

Grade HW_B is computed similarly but for its respective period of Modules 2 and 3.

=== Exam1 and the Interim Assessment ===

Each problem solution in the exam is graded with a fractional score from 0 to 1 point, and the entire exam with the value (before rounding)

Exam1 = 8 * ord + 2 * adv, where

ord = (the sum of points given for ordinary problems) / #(ordinary problems);

adv = (the sum of points given for bonus problems) / #(bonus problems).

The Interim grade 1 is computed past Module 1 and equals:

Interim1 = round(0.5 * HW_A + 0.5 * Exam1).

(Here and everywhere, rounding is according to arithmetic rules.)

=== Colloquium ===
For each of the 'definition' two questions, the student is given a score from 0 to 2 points, and from 0 to 4 points for the ‘proof’ question (all in fractional values).
The Colloq grade is computed the following way (before rounding):

Colloq = 10 * (the sum of points given) / 8.

=== Bonuses ===
Each student is given a score according to his progress in bonus activities, which results in the grade

Bonus = 10 * #(points given) / #(points possible).

The number of possible points varies but it is between 1 and 25 usually.

=== Exam2, the Second Interim, and the Final Assessment ===
Each problem solution in exam is graded with a fractional score from 0 to 1 point, and the entire exam with the value (before rounding)

Exam2 = 8 * ord + 2 * adv, where

ord = (the sum of points given for ordinary problems) / #(ordinary problems);

adv = (the sum of points given for bonus problems) / #(bonus problems).

The Interim grade 2 is computed past Module 3 and equals:

Interim2 = round(0.295 * HW_B + 0.295 * Colloq + 0.06 * Bonus + 0.35 * Exam2).

The final grade for the course is

Final = round(0.3 * Interim1 + 0.7 * Interim 2)

Generally, '''nobody is exempt from the examinations'''.

== Exam retaking ==
Examinations 1 and 2 are subject to be retaken if either the Interim1 or Final grade, respectively, is unsatisfactory (i.e., < 4). Retaking an exam is similar to the regular examination. The resulting grade is substituted for that of the latter (that is, retake grade is assigned to the variable Exami in the respective formula, whose value is then reevaluated). Those whose Interim or Final grade is still unsatisfactory after the first retake will have a (tough) choice to make.

Please take into account the following regulation according to the ''ПОПАТКУС'':
<blockquote>
On the first and second retake the cumulative course grade is taken into consideration. In case of receiving an unsatisfactory final grade after the first retake, the student may refuse to participate in the second retake and repeat the course according to the individual curricula. Cumulative grade is formed again as a result of repeated course. After the completion of the repeated course, the student is given a second retake only, from which the student has previously refused.
</blockquote>

The 'cumulative grade' here means all the variables in the grading formulas except Exami, which are the only ones to be retaken. The 'second retake' is similar to the first one and it is evaluated according to the same formula with the same values of 'cumulative' variables. This poses an obvious risk for anyone whose 'cumulatives' are low!

== Recommended reading ==
''Please notice that '''The Book''' for our Course does not exist. The latter is based on many sources.''

# Anderson J. A., Discrete Mathematics With Combinatorics. Prentice Hall, 2003.
# Biggs N. L., Discrete mathematics. 2nd ed., New York; Oxford: Oxford University Press, 2004.
# Gavrilov G. P., Sapozhenko A. A. Problems and Exercises in Discrete Mathematics. Kluwer Texts in the Mathematical Sciences 14. Springer, 1996.
# [http://courses.csail.mit.edu/6.042/spring17/mcs.pdf Lehman E., Thomson Leighton F., Meyer A. R. Mathematics for Computer Science, 2017.]
# [http://www.cs.elte.hu/~lovasz/dmbook.ps Lovasz L., Vesztergombi K. Discrete Mathematics. Lecture Notes; Yale University, 1999.]
# Melnikov O., Sarvanov V., Tyshkevich R., Yemelichev V., Zverovich I. Exercises in Graph Theory. Kluwer Texts in the Mathematical Sciences 19. Springer, 1998.
# Rosen K. H. Discrete Mathematics and Its Applications. McGraw-Hill, 1999.
# Stein C., Drysdale R. L., Bogart K. Discrete mathematics for computer scientists. Addison-Wesley, 2010.
# Vinogradov I. M. Elements of number theory. Dover, 1954.

=== In Russian ===
''If you understand Russian (by any chance), you will probably benefit from reading the following books.''

# Виноградов И. М. Основы теории чисел. 9-е изд., М.: Наука, 1981.
# [http://rubtsov.su/public/DM-HSE-Draft.pdf Вялый М., Подольский В., Рубцов А., Шварц Д., Шень А. Лекции по дискретной математике.]
# Гаврилов Г. П., Сапоженко А. А. Задачи и упражнения по дискретной математике. 3-е изд., М.: ФИЗМАТЛИТ, 2004.
# [https://drive.google.com/file/d/1RM6KX_reBFwUXesWGUEu0sFn2NCaBgvz/view?usp=sharing Дашков Е. В. Введение в математическую логику. Множества и отношения. М.: МФТИ, 2019.]
# Зубков А. М., Севастьянов Б. А., Чистяков В. П. Сборник задач по теории вероятностей. 2-е изд., М.: Наука, 1989.
# Мельников О. И. Теория графов в занимательных задачах. 5-е изд., М.: Книжный дом "ЛИБРОКОМ", 2013.
# [http://www.mccme.ru/free-books/shen/shen-induction.pdf Шень А., Математическая индукция. 5-е изд, М.: МЦНМО, 2016.]

Discrete Mathematics DSBA 2024/2025

2025-03-13T17:47:49Z

Brdan: /* Assignment deadlines */

== Instructors ==

=== The lecturer ===
My name is Evgeny Dashkov. Feel free to contact me via email: edashkov@gmail.com, [https://t.me/edashkov Telegram], or [https://vk.com/evgeny.v.dashkov VK].

My Assistant (the person responsible for the tables etc.): [https://t.me/elizaaaa_5 Elizaveta Levshina].

=== Seminar Instructors and Teaching Assistants ===
{| class="wikitable" style="text-align:center"
|-
! Group !! 241 !! 242 !! 243 !! 244 !! 245 !! 246
|-
|| Teachers || [https://t.me/edashkov Evgeny Dashkov] ||colspan="2"| [https://t.me/brdann Boris Danilov]|| colspan="3"| [https://t.me/DiegBuitrago Diego Buitrago]
|-
|| Teaching Assistants || [https://t.me/svbudygin Sergei Budygin] || [https://t.me/Avgustine_iw Zakhar Zinkin] || [https://t.me/svnsrg Sergey Savin] || [https://t.me/NaviMash Ivan Mashkarin] || [https://t.me/underpl Maxim Titov] || [https://t.me/almanmaria Maria Krotova]
|}

=== Whom should I ask? ===

If you have a question or comment concerning the mathematical content of our course, it is best to post it to our [https://t.me/joinchat/T_YTN4IG1vAJNWT9 student chat]. Alternatively, you may address your question to your Teaching Assistant, Seminar Instructor or the Lecturer (say, if your question discloses an important idea for a HW problem). It is much better to ask and get to know than not to ask and remain ignorant. '''Please do not hesitate to ask your mathematical questions!'''

If you need a more detailed consultation concerning the course's mathematics, please be informed that our Teaching Assistants usually hold periodic consultations while the Seminar Instructors and Lecturer have some designated time for counseling students. Still, the best thing to do is to arrange a consultation in advance via a personal communication.

Homework-grading related questions should be directed to your teaching assistant first; then to your seminar instructor and to the lecturer just in case of any disagreement.

Organizational, administrative, legal or paperwork questions must be addressed to the Student Service Center, Study Office or other relevant offices first and foremost. If you have been redirected to us with such a question nevertheless, please contact the Lecturer's Assistant first.

== Current performance ==

[https://docs.google.com/spreadsheets/d/1632c9OT4ICCe5X3A1Obc1rH69dNpIEy_FEghK1vyM8o/edit?usp=drive_link The Table].

== Homework ==
The homework includes a few problem sets, one in a fortnight or so (the deadlines are announced on giving each set). Every problem set consists of about 10 – 15 problems, some of which are labeled as ‘bonus’ while all the remaining are considered ‘ordinary’. These sets may be subdivided further for students’ convenience.

A student may be required to 'defend' (i.e., to explain orally) his written solution to any problem. His grade for the problem may be decreased if he fails to do so properly.

== Exam 1 ==
A written examination is held past Module 1. Students may not consult any sources during the exam. The examination takes about 120 minutes. Some problems of the exam are labeled as ‘bonus’; the others are ‘ordinary’.

== Colloquium ==
An oral colloquium is held at the beginning of Module 3. Each student is given two questions concerning statements and definitions as well as one question requiring a proof. After no less than 45 minutes of preparation (when using any literature is allowed), the student is required to answer ‘from scratch’, that is, with no recourse to any materials. The examiner may pose additional questions as he sees fit.

'''Please find the question list and rules [https://drive.google.com/file/d/1ZdxmBUHDBnDnI156J4QR2X3Y0rJZoPiW/view?usp=drive_link here]'''.

== Exam 2 ==
A written examination is held past Module 3. Students may not consult any sources during the exam. The examination takes about 120 minutes. Some problems of the exam are labeled as ‘bonus’; the others are ‘ordinary’.

== Bonus activities ==
Throughout the course, the students may be graded for a variety of ‘bonus activities’ (like quizzes, etc.) either offline or online.

== Course materials ==

[https://t.me/joinchat/T_YTN4IG1vAJNWT9 Course chat]. This is our primary outlet for course announcements, questions, and discussions. '''Please join it!'''

=== Lecture notes ===

[https://drive.google.com/file/d/1mmNLLQ0--EDihGNRKwSyXLOA1KL7A0lD/view?usp=sharing Original English version]

[https://drive.google.com/drive/folders/1cTCdJtVVtO9uDgIKE8HY0qhl285tzOo1?usp=drive_link A Russian translation by volunteering students] (you are welcome to [https://t.me/sigma_algebraa join] their ranks)

=== Classes recordings ===

=== Lecture video archive ===

=== Other resources ===
* [https://tinyurl.com/rwky5vmk The Course's Google Directory]

* [https://www.youtube.com/playlist?list=PL1Uob8iPTHGTidrmrqEHTJ96Pt3-PmML4 Past years' videos]

* We have a [https://meet.edashkov.net.ru dedicated server] to hold an online meeting if we need one.

== Problem sets ==

=== Class problems ===

* [https://drive.google.com/file/d/1EP-diSuOTn9f0ryg18Z2w0xjEp8j0bnl/view?usp=drive_link Problem Set 1]

* [https://drive.google.com/file/d/12ct99-ORd7A94Gh5g4Nf9riv7UqNMSRc/view?usp=drive_link Problem Set 2]

* [https://drive.google.com/file/d/1yKKqLsS99V4AhCYqbjafuav2CMCdQTOQ/view?usp=drive_link Problem Set 3]

* [https://drive.google.com/file/d/1YgH_AdCk4GcKC0KH7xBA4-sUnOYkUvUK/view?usp=drive_link Problem Set 4]

* [https://drive.google.com/file/d/1M556PSgTJOo5W-AxYEXjFu94VfledpF5/view?usp=drive_link Problem Set 5]

* [https://drive.google.com/file/d/1-ylVViaBgzxEM-M7Rvrz2iggtK6UiJTY/view?usp=drive_link Problem Set 6]

* [https://drive.google.com/file/d/15tcTNLW-uFqT2xPJn1imOnEzaGwlaZAq/view?usp=drive_link Problem Set 7]

* [https://drive.google.com/file/d/1N1EuCCe7NIiEa69nXHwncfQG2IOTyzLi/view?usp=drive_link Problem Set 8]

* [https://drive.google.com/file/d/1PmlR2bysnKSZrJle9Dwa4KiB23G5ORdZ/view?usp=drive_link Problem Set 9]

=== Assignment deadlines ===

{| class="wikitable"
|-
! Home problem set !! colspan="11" | Deadline
|-
| || 241 || 242 || 243 || 244 || 245 || 246
|-
| [https://drive.google.com/file/d/15vCxTrNMwagS4rqQnUzdLParTqOP8y5P/view?usp=drive_link HW1a ] || Sep 19 || Sep 19 || Sep 19 || Sep 24 || Sep 24 || Sep 24
|-
| [https://drive.google.com/file/d/1PTJY1PEG-wUlTqUGXT8KWRsll8H0XLb0/view?usp=drive_link HW1b] || Oct 12 || Oct 10 || Oct 10 || Oct 17 || Oct 17 || Oct 17
|-
| [https://drive.google.com/file/d/1mSNPCXo1J3eMz7Wk9yagWkgaZn7AwN7B/view?usp=drive_link HW1c] || Oct 24 || Oct 24 || Oct 24 || Oct 24 || Oct 24 || Oct 24
|-
| [https://drive.google.com/file/d/1LOPPwGjyVleR_mclxTKUJ_bxFrxt44sW/view?usp=drive_link HW2a] || Nov 29 || Nov 29 || Nov 29 || Nov 29 || Nov 29 || Nov 29
|-
| [https://drive.google.com/file/d/1W7k1OTiIMlPOpo-2mwmGegrc4RDHz5_j/view?usp=drive_link HW2b] || Dec 8 || Dec 8 || Dec 8 || Dec 14 || Dec 14 || Dec 14
|-
| [https://drive.google.com/file/d/1V99HEXHgcCXT6tjJp0oPV05Jw172Bid8/view?usp=drive_link HW2c] || Jan 9 || Jan 23 || Jan 23 || Jan 25 || Jan 25 || Jan 25
|-
| [https://drive.google.com/file/d/1NVhQr0s6Z7SK6Y_oXzskXpY8c1CVeolJ/view?usp=drive_link HW3a] || Feb 6 || Feb 3 || Feb 6 || Feb 15 || Feb 15 || Feb 15
|-
| [https://drive.google.com/file/d/19S1mi9DHX0WoqJpSOMSItFPN--Snhrp_/view?usp=drive_link HW3b] || Feb 27 || Feb 27 || Feb 27 || March 9 || March 1 || March 1
|-
| [https://drive.google.com/file/d/1wPy3_0myen8aLP8f-WP3DMiPZjqT6CRy/view?usp=drive_link HW4a] || Mar 10 || Mar 20 || Mar 20 || March 15 || March 15 || March 15
|-
| [https://drive.google.com/file/d/1vKfnIzo6b-WbZLYrDL6hd1S2v4s55SZ2/view?usp=drive_link HW4b] || || Mar 20 || Mar 22 || || ||
|}

'''Each deadline is set by the respective group's instructor.'''

== Assessment and Grading ==

=== Homework ===

The homework is graded in two batches: one (HW_A) includes everything to be submitted in Module1 and the other (HW_B) includes all the rest. For each problem, either ordinary or bonus, the student is given a score from 0 to 1 point (in fractional values) according to the progress he made.

Grade HW_A is computed the following way (before rounding):

HW_A = 8 * ord + 2 * adv, where

ord = (the sum of points given for ordinary problems) / #(ordinary problems);

adv = (the sum of points given for bonus problems) / #(bonus problems).

Grade HW_B is computed similarly but for its respective period of Modules 2 and 3.

=== Exam1 and the Interim Assessment ===

Each problem solution in the exam is graded with a fractional score from 0 to 1 point, and the entire exam with the value (before rounding)

Exam1 = 8 * ord + 2 * adv, where

ord = (the sum of points given for ordinary problems) / #(ordinary problems);

adv = (the sum of points given for bonus problems) / #(bonus problems).

The Interim grade 1 is computed past Module 1 and equals:

Interim1 = round(0.5 * HW_A + 0.5 * Exam1).

(Here and everywhere, rounding is according to arithmetic rules.)

=== Colloquium ===
For each of the 'definition' two questions, the student is given a score from 0 to 2 points, and from 0 to 4 points for the ‘proof’ question (all in fractional values).
The Colloq grade is computed the following way (before rounding):

Colloq = 10 * (the sum of points given) / 8.

=== Bonuses ===
Each student is given a score according to his progress in bonus activities, which results in the grade

Bonus = 10 * #(points given) / #(points possible).

The number of possible points varies but it is between 1 and 25 usually.

=== Exam2, the Second Interim, and the Final Assessment ===
Each problem solution in exam is graded with a fractional score from 0 to 1 point, and the entire exam with the value (before rounding)

Exam2 = 8 * ord + 2 * adv, where

ord = (the sum of points given for ordinary problems) / #(ordinary problems);

adv = (the sum of points given for bonus problems) / #(bonus problems).

The Interim grade 2 is computed past Module 3 and equals:

Interim2 = round(0.295 * HW_B + 0.295 * Colloq + 0.06 * Bonus + 0.35 * Exam2).

The final grade for the course is

Final = round(0.3 * Interim1 + 0.7 * Interim 2)

Generally, '''nobody is exempt from the examinations'''.

== Exam retaking ==
Examinations 1 and 2 are subject to be retaken if either the Interim1 or Final grade, respectively, is unsatisfactory (i.e., < 4). Retaking an exam is similar to the regular examination. The resulting grade is substituted for that of the latter (that is, retake grade is assigned to the variable Exami in the respective formula, whose value is then reevaluated). Those whose Interim or Final grade is still unsatisfactory after the first retake will have a (tough) choice to make.

Please take into account the following regulation according to the ''ПОПАТКУС'':
<blockquote>
On the first and second retake the cumulative course grade is taken into consideration. In case of receiving an unsatisfactory final grade after the first retake, the student may refuse to participate in the second retake and repeat the course according to the individual curricula. Cumulative grade is formed again as a result of repeated course. After the completion of the repeated course, the student is given a second retake only, from which the student has previously refused.
</blockquote>

The 'cumulative grade' here means all the variables in the grading formulas except Exami, which are the only ones to be retaken. The 'second retake' is similar to the first one and it is evaluated according to the same formula with the same values of 'cumulative' variables. This poses an obvious risk for anyone whose 'cumulatives' are low!

== Recommended reading ==
''Please notice that '''The Book''' for our Course does not exist. The latter is based on many sources.''

# Anderson J. A., Discrete Mathematics With Combinatorics. Prentice Hall, 2003.
# Biggs N. L., Discrete mathematics. 2nd ed., New York; Oxford: Oxford University Press, 2004.
# Gavrilov G. P., Sapozhenko A. A. Problems and Exercises in Discrete Mathematics. Kluwer Texts in the Mathematical Sciences 14. Springer, 1996.
# [http://courses.csail.mit.edu/6.042/spring17/mcs.pdf Lehman E., Thomson Leighton F., Meyer A. R. Mathematics for Computer Science, 2017.]
# [http://www.cs.elte.hu/~lovasz/dmbook.ps Lovasz L., Vesztergombi K. Discrete Mathematics. Lecture Notes; Yale University, 1999.]
# Melnikov O., Sarvanov V., Tyshkevich R., Yemelichev V., Zverovich I. Exercises in Graph Theory. Kluwer Texts in the Mathematical Sciences 19. Springer, 1998.
# Rosen K. H. Discrete Mathematics and Its Applications. McGraw-Hill, 1999.
# Stein C., Drysdale R. L., Bogart K. Discrete mathematics for computer scientists. Addison-Wesley, 2010.
# Vinogradov I. M. Elements of number theory. Dover, 1954.

=== In Russian ===
''If you understand Russian (by any chance), you will probably benefit from reading the following books.''

# Виноградов И. М. Основы теории чисел. 9-е изд., М.: Наука, 1981.
# [http://rubtsov.su/public/DM-HSE-Draft.pdf Вялый М., Подольский В., Рубцов А., Шварц Д., Шень А. Лекции по дискретной математике.]
# Гаврилов Г. П., Сапоженко А. А. Задачи и упражнения по дискретной математике. 3-е изд., М.: ФИЗМАТЛИТ, 2004.
# [https://drive.google.com/file/d/1RM6KX_reBFwUXesWGUEu0sFn2NCaBgvz/view?usp=sharing Дашков Е. В. Введение в математическую логику. Множества и отношения. М.: МФТИ, 2019.]
# Зубков А. М., Севастьянов Б. А., Чистяков В. П. Сборник задач по теории вероятностей. 2-е изд., М.: Наука, 1989.
# Мельников О. И. Теория графов в занимательных задачах. 5-е изд., М.: Книжный дом "ЛИБРОКОМ", 2013.
# [http://www.mccme.ru/free-books/shen/shen-induction.pdf Шень А., Математическая индукция. 5-е изд, М.: МЦНМО, 2016.]

Discrete Mathematics DSBA 2024/2025

2025-02-21T11:18:04Z

Brdan: /* Assignment deadlines */

== Instructors ==

=== The lecturer ===
My name is Evgeny Dashkov. Feel free to contact me via email: edashkov@gmail.com, [https://t.me/edashkov Telegram], or [https://vk.com/evgeny.v.dashkov VK].

My Assistant (the person responsible for the tables etc.): [https://t.me/elizaaaa_5 Elizaveta Levshina].

=== Seminar Instructors and Teaching Assistants ===
{| class="wikitable" style="text-align:center"
|-
! Group !! 241 !! 242 !! 243 !! 244 !! 245 !! 246
|-
|| Teachers || [https://t.me/edashkov Evgeny Dashkov] ||colspan="2"| [https://t.me/brdann Boris Danilov]|| colspan="3"| [https://t.me/DiegBuitrago Diego Buitrago]
|-
|| Teaching Assistants || [https://t.me/svbudygin Sergei Budygin] || [https://t.me/Avgustine_iw Zakhar Zinkin] || [https://t.me/svnsrg Sergey Savin] || [https://t.me/NaviMash Ivan Mashkarin] || [https://t.me/underpl Maxim Titov] || [https://t.me/almanmaria Maria Krotova]
|}

=== Whom should I ask? ===

If you have a question or comment concerning the mathematical content of our course, it is best to post it to our [https://t.me/joinchat/T_YTN4IG1vAJNWT9 student chat]. Alternatively, you may address your question to your Teaching Assistant, Seminar Instructor or the Lecturer (say, if your question discloses an important idea for a HW problem). It is much better to ask and get to know than not to ask and remain ignorant. '''Please do not hesitate to ask your mathematical questions!'''

If you need a more detailed consultation concerning the course's mathematics, please be informed that our Teaching Assistants usually hold periodic consultations while the Seminar Instructors and Lecturer have some designated time for counseling students. Still, the best thing to do is to arrange a consultation in advance via a personal communication.

Homework-grading related questions should be directed to your teaching assistant first; then to your seminar instructor and to the lecturer just in case of any disagreement.

Organizational, administrative, legal or paperwork questions must be addressed to the Student Service Center, Study Office or other relevant offices first and foremost. If you have been redirected to us with such a question nevertheless, please contact the Lecturer's Assistant first.

== Current performance ==

[https://docs.google.com/spreadsheets/d/1632c9OT4ICCe5X3A1Obc1rH69dNpIEy_FEghK1vyM8o/edit?usp=drive_link The Table].

== Homework ==
The homework includes a few problem sets, one in a fortnight or so (the deadlines are announced on giving each set). Every problem set consists of about 10 – 15 problems, some of which are labeled as ‘bonus’ while all the remaining are considered ‘ordinary’. These sets may be subdivided further for students’ convenience.

A student may be required to 'defend' (i.e., to explain orally) his written solution to any problem. His grade for the problem may be decreased if he fails to do so properly.

== Exam 1 ==
A written examination is held past Module 1. Students may not consult any sources during the exam. The examination takes about 120 minutes. Some problems of the exam are labeled as ‘bonus’; the others are ‘ordinary’.

== Colloquium ==
An oral colloquium is held at the beginning of Module 3. Each student is given two questions concerning statements and definitions as well as one question requiring a proof. After no less than 45 minutes of preparation (when using any literature is allowed), the student is required to answer ‘from scratch’, that is, with no recourse to any materials. The examiner may pose additional questions as he sees fit.

'''Please find the question list and rules [https://drive.google.com/file/d/1ZdxmBUHDBnDnI156J4QR2X3Y0rJZoPiW/view?usp=drive_link here]'''.

== Exam 2 ==
A written examination is held past Module 3. Students may not consult any sources during the exam. The examination takes about 120 minutes. Some problems of the exam are labeled as ‘bonus’; the others are ‘ordinary’.

== Bonus activities ==
Throughout the course, the students may be graded for a variety of ‘bonus activities’ (like quizzes, etc.) either offline or online.

== Course materials ==

[https://t.me/joinchat/T_YTN4IG1vAJNWT9 Course chat]. This is our primary outlet for course announcements, questions, and discussions. '''Please join it!'''

=== Lecture notes ===

[https://drive.google.com/file/d/1mmNLLQ0--EDihGNRKwSyXLOA1KL7A0lD/view?usp=sharing Original English version]

[https://drive.google.com/drive/folders/1cTCdJtVVtO9uDgIKE8HY0qhl285tzOo1?usp=drive_link A Russian translation by volunteering students] (you are welcome to [https://t.me/sigma_algebraa join] their ranks)

=== Classes recordings ===

=== Lecture video archive ===

=== Other resources ===
* [https://tinyurl.com/rwky5vmk The Course's Google Directory]

* [https://www.youtube.com/playlist?list=PL1Uob8iPTHGTidrmrqEHTJ96Pt3-PmML4 Past years' videos]

* We have a [https://meet.edashkov.net.ru dedicated server] to hold an online meeting if we need one.

== Problem sets ==

=== Class problems ===

* [https://drive.google.com/file/d/1EP-diSuOTn9f0ryg18Z2w0xjEp8j0bnl/view?usp=drive_link Problem Set 1]

* [https://drive.google.com/file/d/12ct99-ORd7A94Gh5g4Nf9riv7UqNMSRc/view?usp=drive_link Problem Set 2]

* [https://drive.google.com/file/d/1yKKqLsS99V4AhCYqbjafuav2CMCdQTOQ/view?usp=drive_link Problem Set 3]

* [https://drive.google.com/file/d/1YgH_AdCk4GcKC0KH7xBA4-sUnOYkUvUK/view?usp=drive_link Problem Set 4]

* [https://drive.google.com/file/d/1M556PSgTJOo5W-AxYEXjFu94VfledpF5/view?usp=drive_link Problem Set 5]

* [https://drive.google.com/file/d/1-ylVViaBgzxEM-M7Rvrz2iggtK6UiJTY/view?usp=drive_link Problem Set 6]

* [https://drive.google.com/file/d/15tcTNLW-uFqT2xPJn1imOnEzaGwlaZAq/view?usp=drive_link Problem Set 7]

* [https://drive.google.com/file/d/1N1EuCCe7NIiEa69nXHwncfQG2IOTyzLi/view?usp=drive_link Problem Set 8]


=== Assignment deadlines ===

{| class="wikitable"
|-
! Home problem set !! colspan="11" | Deadline
|-
| || 241 || 242 || 243 || 244 || 245 || 246
|-
| [https://drive.google.com/file/d/15vCxTrNMwagS4rqQnUzdLParTqOP8y5P/view?usp=drive_link HW1a ] || Sep 19 || Sep 19 || Sep 19 || Sep 24 || Sep 24 || Sep 24
|-
| [https://drive.google.com/file/d/1PTJY1PEG-wUlTqUGXT8KWRsll8H0XLb0/view?usp=drive_link HW1b] || Oct 12 || Oct 10 || Oct 10 || Oct 17 || Oct 17 || Oct 17
|-
| [https://drive.google.com/file/d/1mSNPCXo1J3eMz7Wk9yagWkgaZn7AwN7B/view?usp=drive_link HW1c] || Oct 24 || Oct 24 || Oct 24 || Oct 24 || Oct 24 || Oct 24
|-
| [https://drive.google.com/file/d/1LOPPwGjyVleR_mclxTKUJ_bxFrxt44sW/view?usp=drive_link HW2a] || Nov 29 || Nov 29 || Nov 29 || Nov 29 || Nov 29 || Nov 29
|-
| [https://drive.google.com/file/d/1W7k1OTiIMlPOpo-2mwmGegrc4RDHz5_j/view?usp=drive_link HW2b] || Dec 8 || Dec 8 || Dec 8 || Dec 14 || Dec 14 || Dec 14
|-
| [https://drive.google.com/file/d/1V99HEXHgcCXT6tjJp0oPV05Jw172Bid8/view?usp=drive_link HW2c] || Jan 9 || Jan 23 || Jan 23 || Jan 25 || Jan 25 || Jan 25
|-
| [https://drive.google.com/file/d/1NVhQr0s6Z7SK6Y_oXzskXpY8c1CVeolJ/view?usp=drive_link HW3a] || Feb 6 || Feb 3 || Feb 6 || Feb 15 || Feb 15 || Feb 15
|-
| [https://drive.google.com/file/d/19S1mi9DHX0WoqJpSOMSItFPN--Snhrp_/view?usp=drive_link HW3b] || Feb 27 || Feb 27 || Feb 27 || March 9 || March 1 || March 1
|}


'''Each deadline is set by the respective group's instructor.'''

== Assessment and Grading ==

=== Homework ===

The homework is graded in two batches: one (HW_A) includes everything to be submitted in Module1 and the other (HW_B) includes all the rest. For each problem, either ordinary or bonus, the student is given a score from 0 to 1 point (in fractional values) according to the progress he made.

Grade HW_A is computed the following way (before rounding):

HW_A = 8 * ord + 2 * adv, where

ord = (the sum of points given for ordinary problems) / #(ordinary problems);

adv = (the sum of points given for bonus problems) / #(bonus problems).

Grade HW_B is computed similarly but for its respective period of Modules 2 and 3.

=== Exam1 and the Interim Assessment ===

Each problem solution in the exam is graded with a fractional score from 0 to 1 point, and the entire exam with the value (before rounding)

Exam1 = 8 * ord + 2 * adv, where

ord = (the sum of points given for ordinary problems) / #(ordinary problems);

adv = (the sum of points given for bonus problems) / #(bonus problems).

The Interim grade 1 is computed past Module 1 and equals:

Interim1 = round(0.5 * HW_A + 0.5 * Exam1).

(Here and everywhere, rounding is according to arithmetic rules.)

=== Colloquium ===
For each of the 'definition' two questions, the student is given a score from 0 to 2 points, and from 0 to 4 points for the ‘proof’ question (all in fractional values).
The Colloq grade is computed the following way (before rounding):

Colloq = 10 * (the sum of points given) / 8.

=== Bonuses ===
Each student is given a score according to his progress in bonus activities, which results in the grade

Bonus = 10 * #(points given) / #(points possible).

The number of possible points varies but it is between 1 and 25 usually.

=== Exam2, the Second Interim, and the Final Assessment ===
Each problem solution in exam is graded with a fractional score from 0 to 1 point, and the entire exam with the value (before rounding)

Exam2 = 8 * ord + 2 * adv, where

ord = (the sum of points given for ordinary problems) / #(ordinary problems);

adv = (the sum of points given for bonus problems) / #(bonus problems).

The Interim grade 2 is computed past Module 3 and equals:

Interim2 = round(0.295 * HW_B + 0.295 * Colloq + 0.06 * Bonus + 0.35 * Exam2).

The final grade for the course is

Final = round(0.3 * Interim1 + 0.7 * Interim 2)

Generally, '''nobody is exempt from the examinations'''.

== Exam retaking ==
Examinations 1 and 2 are subject to be retaken if either the Interim1 or Final grade, respectively, is unsatisfactory (i.e., < 4). Retaking an exam is similar to the regular examination. The resulting grade is substituted for that of the latter (that is, retake grade is assigned to the variable Exami in the respective formula, whose value is then reevaluated). Those whose Interim or Final grade is still unsatisfactory after the first retake will have a (tough) choice to make.

Please take into account the following regulation according to the ''ПОПАТКУС'':
<blockquote>
On the first and second retake the cumulative course grade is taken into consideration. In case of receiving an unsatisfactory final grade after the first retake, the student may refuse to participate in the second retake and repeat the course according to the individual curricula. Cumulative grade is formed again as a result of repeated course. After the completion of the repeated course, the student is given a second retake only, from which the student has previously refused.
</blockquote>

The 'cumulative grade' here means all the variables in the grading formulas except Exami, which are the only ones to be retaken. The 'second retake' is similar to the first one and it is evaluated according to the same formula with the same values of 'cumulative' variables. This poses an obvious risk for anyone whose 'cumulatives' are low!

== Recommended reading ==
''Please notice that '''The Book''' for our Course does not exist. The latter is based on many sources.''

# Anderson J. A., Discrete Mathematics With Combinatorics. Prentice Hall, 2003.
# Biggs N. L., Discrete mathematics. 2nd ed., New York; Oxford: Oxford University Press, 2004.
# Gavrilov G. P., Sapozhenko A. A. Problems and Exercises in Discrete Mathematics. Kluwer Texts in the Mathematical Sciences 14. Springer, 1996.
# [http://courses.csail.mit.edu/6.042/spring17/mcs.pdf Lehman E., Thomson Leighton F., Meyer A. R. Mathematics for Computer Science, 2017.]
# [http://www.cs.elte.hu/~lovasz/dmbook.ps Lovasz L., Vesztergombi K. Discrete Mathematics. Lecture Notes; Yale University, 1999.]
# Melnikov O., Sarvanov V., Tyshkevich R., Yemelichev V., Zverovich I. Exercises in Graph Theory. Kluwer Texts in the Mathematical Sciences 19. Springer, 1998.
# Rosen K. H. Discrete Mathematics and Its Applications. McGraw-Hill, 1999.
# Stein C., Drysdale R. L., Bogart K. Discrete mathematics for computer scientists. Addison-Wesley, 2010.
# Vinogradov I. M. Elements of number theory. Dover, 1954.

=== In Russian ===
''If you understand Russian (by any chance), you will probably benefit from reading the following books.''

# Виноградов И. М. Основы теории чисел. 9-е изд., М.: Наука, 1981.
# [http://rubtsov.su/public/DM-HSE-Draft.pdf Вялый М., Подольский В., Рубцов А., Шварц Д., Шень А. Лекции по дискретной математике.]
# Гаврилов Г. П., Сапоженко А. А. Задачи и упражнения по дискретной математике. 3-е изд., М.: ФИЗМАТЛИТ, 2004.
# [https://drive.google.com/file/d/1RM6KX_reBFwUXesWGUEu0sFn2NCaBgvz/view?usp=sharing Дашков Е. В. Введение в математическую логику. Множества и отношения. М.: МФТИ, 2019.]
# Зубков А. М., Севастьянов Б. А., Чистяков В. П. Сборник задач по теории вероятностей. 2-е изд., М.: Наука, 1989.
# Мельников О. И. Теория графов в занимательных задачах. 5-е изд., М.: Книжный дом "ЛИБРОКОМ", 2013.
# [http://www.mccme.ru/free-books/shen/shen-induction.pdf Шень А., Математическая индукция. 5-е изд, М.: МЦНМО, 2016.]

Discrete Mathematics DSBA 2023/2024

2025-02-13T14:39:03Z

Brdan: /* Assignment deadlines */

Discrete Mathematics DSBA 2023/2024

2025-02-13T14:38:22Z

Brdan: /* Assignment deadlines */

Discrete Mathematics DSBA 2024/2025

2025-01-27T19:37:21Z

Brdan: /* Assignment deadlines */

== Instructors ==

=== The lecturer ===
My name is Evgeny Dashkov. Feel free to contact me via email: edashkov@gmail.com, [https://t.me/edashkov Telegram], or [https://vk.com/evgeny.v.dashkov VK].

My Assistant (the person responsible for the tables etc.): [https://t.me/elizaaaa_5 Elizaveta Levshina].

=== Seminar Instructors and Teaching Assistants ===
{| class="wikitable" style="text-align:center"
|-
! Group !! 241 !! 242 !! 243 !! 244 !! 245 !! 246
|-
|| Teachers || [https://t.me/edashkov Evgeny Dashkov] ||colspan="2"| [https://t.me/brdann Boris Danilov]|| colspan="3"| [https://t.me/DiegBuitrago Diego Buitrago]
|-
|| Teaching Assistants || [https://t.me/svbudygin Sergei Budygin] || [https://t.me/Avgustine_iw Zakhar Zinkin] || [https://t.me/svnsrg Sergey Savin] || [https://t.me/NaviMash Ivan Mashkarin] || [https://t.me/underpl Maxim Titov] || [https://t.me/almanmaria Maria Krotova]
|}

=== Whom should I ask? ===

If you have a question or comment concerning the mathematical content of our course, it is best to post it to our [https://t.me/joinchat/T_YTN4IG1vAJNWT9 student chat]. Alternatively, you may address your question to your Teaching Assistant, Seminar Instructor or the Lecturer (say, if your question discloses an important idea for a HW problem). It is much better to ask and get to know than not to ask and remain ignorant. '''Please do not hesitate to ask your mathematical questions!'''

If you need a more detailed consultation concerning the course's mathematics, please be informed that our Teaching Assistants usually hold periodic consultations while the Seminar Instructors and Lecturer have some designated time for counseling students. Still, the best thing to do is to arrange a consultation in advance via a personal communication.

Homework-grading related questions should be directed to your teaching assistant first; then to your seminar instructor and to the lecturer just in case of any disagreement.

Organizational, administrative, legal or paperwork questions must be addressed to the Student Service Center, Study Office or other relevant offices first and foremost. If you have been redirected to us with such a question nevertheless, please contact the Lecturer's Assistant first.

== Current performance ==

[https://docs.google.com/spreadsheets/d/1632c9OT4ICCe5X3A1Obc1rH69dNpIEy_FEghK1vyM8o/edit?usp=drive_link The Table].

== Homework ==
The homework includes a few problem sets, one in a fortnight or so (the deadlines are announced on giving each set). Every problem set consists of about 10 – 15 problems, some of which are labeled as ‘bonus’ while all the remaining are considered ‘ordinary’. These sets may be subdivided further for students’ convenience.

A student may be required to 'defend' (i.e., to explain orally) his written solution to any problem. His grade for the problem may be decreased if he fails to do so properly.

== Exam 1 ==
A written examination is held past Module 1. Students may not consult any sources during the exam. The examination takes about 120 minutes. Some problems of the exam are labeled as ‘bonus’; the others are ‘ordinary’.

== Colloquium ==
An oral colloquium is held at the beginning of Module 3. Each student is given two questions concerning statements and definitions as well as one question requiring a proof. After no less than 45 minutes of preparation (when using any literature is allowed), the student is required to answer ‘from scratch’, that is, with no recourse to any materials. The examiner may pose additional questions as he sees fit.

'''Please find the question list and rules [https://drive.google.com/file/d/1ZdxmBUHDBnDnI156J4QR2X3Y0rJZoPiW/view?usp=drive_link here]'''.

== Exam 2 ==
A written examination is held past Module 3. Students may not consult any sources during the exam. The examination takes about 120 minutes. Some problems of the exam are labeled as ‘bonus’; the others are ‘ordinary’.

== Bonus activities ==
Throughout the course, the students may be graded for a variety of ‘bonus activities’ (like quizzes, etc.) either offline or online.

== Course materials ==

[https://t.me/joinchat/T_YTN4IG1vAJNWT9 Course chat]. This is our primary outlet for course announcements, questions, and discussions. '''Please join it!'''

=== Lecture notes ===

[https://drive.google.com/file/d/1mmNLLQ0--EDihGNRKwSyXLOA1KL7A0lD/view?usp=sharing Original English version]

[https://drive.google.com/drive/folders/1cTCdJtVVtO9uDgIKE8HY0qhl285tzOo1?usp=drive_link A Russian translation by volunteering students] (you are welcome to [https://t.me/sigma_algebraa join] their ranks)

=== Classes recordings ===

=== Lecture video archive ===

=== Other resources ===
* [https://tinyurl.com/rwky5vmk The Course's Google Directory]

* [https://www.youtube.com/playlist?list=PL1Uob8iPTHGTidrmrqEHTJ96Pt3-PmML4 Past years' videos]

* We have a [https://meet.edashkov.net.ru dedicated server] to hold an online meeting if we need one.

== Problem sets ==

=== Class problems ===

* [https://drive.google.com/file/d/1EP-diSuOTn9f0ryg18Z2w0xjEp8j0bnl/view?usp=drive_link Problem Set 1]

* [https://drive.google.com/file/d/12ct99-ORd7A94Gh5g4Nf9riv7UqNMSRc/view?usp=drive_link Problem Set 2]

* [https://drive.google.com/file/d/1yKKqLsS99V4AhCYqbjafuav2CMCdQTOQ/view?usp=drive_link Problem Set 3]

* [https://drive.google.com/file/d/1YgH_AdCk4GcKC0KH7xBA4-sUnOYkUvUK/view?usp=drive_link Problem Set 4]

* [https://drive.google.com/file/d/1M556PSgTJOo5W-AxYEXjFu94VfledpF5/view?usp=drive_link Problem Set 5]

* [https://drive.google.com/file/d/1-ylVViaBgzxEM-M7Rvrz2iggtK6UiJTY/view?usp=drive_link Problem Set 6]



=== Assignment deadlines ===

{| class="wikitable"
|-
! Home problem set !! colspan="11" | Deadline
|-
| || 241 || 242 || 243 || 244 || 245 || 246
|-
| [https://drive.google.com/file/d/15vCxTrNMwagS4rqQnUzdLParTqOP8y5P/view?usp=drive_link HW1a ] || Sep 19 || Sep 19 || Sep 19 || Sep 24 || Sep 24 || Sep 24
|-
| [https://drive.google.com/file/d/1PTJY1PEG-wUlTqUGXT8KWRsll8H0XLb0/view?usp=drive_link HW1b] || Oct 12 || Oct 10 || Oct 10 || Oct 17 || Oct 17 || Oct 17
|-
| [https://drive.google.com/file/d/1mSNPCXo1J3eMz7Wk9yagWkgaZn7AwN7B/view?usp=drive_link HW1c] || Oct 24 || Oct 24 || Oct 24 || Oct 24 || Oct 24 || Oct 24
|-
| [https://drive.google.com/file/d/1LOPPwGjyVleR_mclxTKUJ_bxFrxt44sW/view?usp=drive_link HW2a] || Nov 29 || Nov 29 || Nov 29 || Nov 29 || Nov 29 || Nov 29
|-
| [https://drive.google.com/file/d/1W7k1OTiIMlPOpo-2mwmGegrc4RDHz5_j/view?usp=drive_link HW2b] || Dec 8 || Dec 8 || Dec 8 || Dec 14 || Dec 14 || Dec 14
|-
| [https://drive.google.com/file/d/1V99HEXHgcCXT6tjJp0oPV05Jw172Bid8/view?usp=drive_link HW2c] || Jan 9 || Jan 23 || Jan 23 || Jan 25 || Jan 25 || Jan 25
|-
| [https://drive.google.com/file/d/1NVhQr0s6Z7SK6Y_oXzskXpY8c1CVeolJ/view?usp=drive_link HW3a] || Feb 6 || Feb 3 || Feb 6 || ||
|}


'''Each deadline is set by the respective group's instructor.'''

== Assessment and Grading ==

=== Homework ===

The homework is graded in two batches: one (HW_A) includes everything to be submitted in Module1 and the other (HW_B) includes all the rest. For each problem, either ordinary or bonus, the student is given a score from 0 to 1 point (in fractional values) according to the progress he made.

Grade HW_A is computed the following way (before rounding):

HW_A = 8 * ord + 2 * adv, where

ord = (the sum of points given for ordinary problems) / #(ordinary problems);

adv = (the sum of points given for bonus problems) / #(bonus problems).

Grade HW_B is computed similarly but for its respective period of Modules 2 and 3.

=== Exam1 and the Interim Assessment ===

Each problem solution in the exam is graded with a fractional score from 0 to 1 point, and the entire exam with the value (before rounding)

Exam1 = 8 * ord + 2 * adv, where

ord = (the sum of points given for ordinary problems) / #(ordinary problems);

adv = (the sum of points given for bonus problems) / #(bonus problems).

The Interim grade 1 is computed past Module 1 and equals:

Interim1 = round(0.5 * HW_A + 0.5 * Exam1).

(Here and everywhere, rounding is according to arithmetic rules.)

=== Colloquium ===
For each of the 'definition' two questions, the student is given a score from 0 to 2 points, and from 0 to 4 points for the ‘proof’ question (all in fractional values).
The Colloq grade is computed the following way (before rounding):

Colloq = 10 * (the sum of points given) / 8.

=== Bonuses ===
Each student is given a score according to his progress in bonus activities, which results in the grade

Bonus = 10 * #(points given) / #(points possible).

The number of possible points varies but it is between 1 and 25 usually.

=== Exam2, the Second Interim, and the Final Assessment ===
Each problem solution in exam is graded with a fractional score from 0 to 1 point, and the entire exam with the value (before rounding)

Exam2 = 8 * ord + 2 * adv, where

ord = (the sum of points given for ordinary problems) / #(ordinary problems);

adv = (the sum of points given for bonus problems) / #(bonus problems).

The Interim grade 2 is computed past Module 3 and equals:

Interim2 = round(0.295 * HW_B + 0.295 * Colloq + 0.06 * Bonus + 0.35 * Exam2).

The final grade for the course is

Final = round(0.3 * Interim1 + 0.7 * Interim 2)

Generally, '''nobody is exempt from the examinations'''.

== Exam retaking ==
Examinations 1 and 2 are subject to be retaken if either the Interim1 or Final grade, respectively, is unsatisfactory (i.e., < 4). Retaking an exam is similar to the regular examination. The resulting grade is substituted for that of the latter (that is, retake grade is assigned to the variable Exami in the respective formula, whose value is then reevaluated). Those whose Interim or Final grade is still unsatisfactory after the first retake will have a (tough) choice to make.

Please take into account the following regulation according to the ''ПОПАТКУС'':
<blockquote>
On the first and second retake the cumulative course grade is taken into consideration. In case of receiving an unsatisfactory final grade after the first retake, the student may refuse to participate in the second retake and repeat the course according to the individual curricula. Cumulative grade is formed again as a result of repeated course. After the completion of the repeated course, the student is given a second retake only, from which the student has previously refused.
</blockquote>

The 'cumulative grade' here means all the variables in the grading formulas except Exami, which are the only ones to be retaken. The 'second retake' is similar to the first one and it is evaluated according to the same formula with the same values of 'cumulative' variables. This poses an obvious risk for anyone whose 'cumulatives' are low!

== Recommended reading ==
''Please notice that '''The Book''' for our Course does not exist. The latter is based on many sources.''

# Anderson J. A., Discrete Mathematics With Combinatorics. Prentice Hall, 2003.
# Biggs N. L., Discrete mathematics. 2nd ed., New York; Oxford: Oxford University Press, 2004.
# Gavrilov G. P., Sapozhenko A. A. Problems and Exercises in Discrete Mathematics. Kluwer Texts in the Mathematical Sciences 14. Springer, 1996.
# [http://courses.csail.mit.edu/6.042/spring17/mcs.pdf Lehman E., Thomson Leighton F., Meyer A. R. Mathematics for Computer Science, 2017.]
# [http://www.cs.elte.hu/~lovasz/dmbook.ps Lovasz L., Vesztergombi K. Discrete Mathematics. Lecture Notes; Yale University, 1999.]
# Melnikov O., Sarvanov V., Tyshkevich R., Yemelichev V., Zverovich I. Exercises in Graph Theory. Kluwer Texts in the Mathematical Sciences 19. Springer, 1998.
# Rosen K. H. Discrete Mathematics and Its Applications. McGraw-Hill, 1999.
# Stein C., Drysdale R. L., Bogart K. Discrete mathematics for computer scientists. Addison-Wesley, 2010.
# Vinogradov I. M. Elements of number theory. Dover, 1954.

=== In Russian ===
''If you understand Russian (by any chance), you will probably benefit from reading the following books.''

# Виноградов И. М. Основы теории чисел. 9-е изд., М.: Наука, 1981.
# [http://rubtsov.su/public/DM-HSE-Draft.pdf Вялый М., Подольский В., Рубцов А., Шварц Д., Шень А. Лекции по дискретной математике.]
# Гаврилов Г. П., Сапоженко А. А. Задачи и упражнения по дискретной математике. 3-е изд., М.: ФИЗМАТЛИТ, 2004.
# [https://drive.google.com/file/d/1RM6KX_reBFwUXesWGUEu0sFn2NCaBgvz/view?usp=sharing Дашков Е. В. Введение в математическую логику. Множества и отношения. М.: МФТИ, 2019.]
# Зубков А. М., Севастьянов Б. А., Чистяков В. П. Сборник задач по теории вероятностей. 2-е изд., М.: Наука, 1989.
# Мельников О. И. Теория графов в занимательных задачах. 5-е изд., М.: Книжный дом "ЛИБРОКОМ", 2013.
# [http://www.mccme.ru/free-books/shen/shen-induction.pdf Шень А., Математическая индукция. 5-е изд, М.: МЦНМО, 2016.]

Discrete Mathematics DSBA 2024/2025

2025-01-16T16:17:57Z

Brdan: /* Assignment deadlines */

== Instructors ==

=== The lecturer ===
My name is Evgeny Dashkov. Feel free to contact me via email: edashkov@gmail.com, [https://t.me/edashkov Telegram], or [https://vk.com/evgeny.v.dashkov VK].

My Assistant (the person responsible for the tables etc.): [https://t.me/elizaaaa_5 Elizaveta Levshina].

=== Seminar Instructors and Teaching Assistants ===
{| class="wikitable" style="text-align:center"
|-
! Group !! 241 !! 242 !! 243 !! 244 !! 245 !! 246
|-
|| Teachers || [https://t.me/edashkov Evgeny Dashkov] ||colspan="2"| [https://t.me/brdann Boris Danilov]|| colspan="3"| [https://t.me/DiegBuitrago Diego Buitrago]
|-
|| Teaching Assistants || [https://t.me/svbudygin Sergei Budygin] || [https://t.me/Avgustine_iw Zakhar Zinkin] || [https://t.me/svnsrg Sergey Savin] || [https://t.me/NaviMash Ivan Mashkarin] || [https://t.me/underpl Maxim Titov] || [https://t.me/almanmaria Maria Krotova]
|}

=== Whom should I ask? ===

If you have a question or comment concerning the mathematical content of our course, it is best to post it to our [https://t.me/joinchat/T_YTN4IG1vAJNWT9 student chat]. Alternatively, you may address your question to your Teaching Assistant, Seminar Instructor or the Lecturer (say, if your question discloses an important idea for a HW problem). It is much better to ask and get to know than not to ask and remain ignorant. '''Please do not hesitate to ask your mathematical questions!'''

If you need a more detailed consultation concerning the course's mathematics, please be informed that our Teaching Assistants usually hold periodic consultations while the Seminar Instructors and Lecturer have some designated time for counseling students. Still, the best thing to do is to arrange a consultation in advance via a personal communication.

Homework-grading related questions should be directed to your teaching assistant first; then to your seminar instructor and to the lecturer just in case of any disagreement.

Organizational, administrative, legal or paperwork questions must be addressed to the Student Service Center, Study Office or other relevant offices first and foremost. If you have been redirected to us with such a question nevertheless, please contact the Lecturer's Assistant first.

== Current performance ==

[https://docs.google.com/spreadsheets/d/1632c9OT4ICCe5X3A1Obc1rH69dNpIEy_FEghK1vyM8o/edit?usp=drive_link The Table].

== Homework ==
The homework includes a few problem sets, one in a fortnight or so (the deadlines are announced on giving each set). Every problem set consists of about 10 – 15 problems, some of which are labeled as ‘bonus’ while all the remaining are considered ‘ordinary’. These sets may be subdivided further for students’ convenience.

A student may be required to 'defend' (i.e., to explain orally) his written solution to any problem. His grade for the problem may be decreased if he fails to do so properly.

== Exam 1 ==
A written examination is held past Module 1. Students may not consult any sources during the exam. The examination takes about 120 minutes. Some problems of the exam are labeled as ‘bonus’; the others are ‘ordinary’.

== Colloquium ==
An oral colloquium is held at the beginning of Module 3. Each student is given two questions concerning statements and definitions as well as one question requiring a proof. After no less than 45 minutes of preparation (when using any literature is allowed), the student is required to answer ‘from scratch’, that is, with no recourse to any materials. The examiner may pose additional questions as he sees fit.


== Exam 2 ==
A written examination is held past Module 3. Students may not consult any sources during the exam. The examination takes about 120 minutes. Some problems of the exam are labeled as ‘bonus’; the others are ‘ordinary’.

== Bonus activities ==
Throughout the course, the students may be graded for a variety of ‘bonus activities’ (like quizzes, etc.) either offline or online.

== Course materials ==

[https://t.me/joinchat/T_YTN4IG1vAJNWT9 Course chat]. This is our primary outlet for course announcements, questions, and discussions. '''Please join it!'''

=== Lecture notes ===

[https://drive.google.com/file/d/1mmNLLQ0--EDihGNRKwSyXLOA1KL7A0lD/view?usp=sharing Original English version]

[https://drive.google.com/drive/folders/1cTCdJtVVtO9uDgIKE8HY0qhl285tzOo1?usp=drive_link A Russian translation by volunteering students] (you are welcome to [https://t.me/sigma_algebraa join] their ranks)

=== Classes recordings ===

=== Lecture video archive ===

=== Other resources ===
* [https://tinyurl.com/rwky5vmk The Course's Google Directory]

* [https://www.youtube.com/playlist?list=PL1Uob8iPTHGTidrmrqEHTJ96Pt3-PmML4 Past years' videos]

* We have a [https://meet.edashkov.net.ru dedicated server] to hold an online meeting if we need one.

== Problem sets ==

=== Class problems ===

* [https://drive.google.com/file/d/1EP-diSuOTn9f0ryg18Z2w0xjEp8j0bnl/view?usp=drive_link Problem Set 1]

* [https://drive.google.com/file/d/12ct99-ORd7A94Gh5g4Nf9riv7UqNMSRc/view?usp=drive_link Problem Set 2]

* [https://drive.google.com/file/d/1yKKqLsS99V4AhCYqbjafuav2CMCdQTOQ/view?usp=drive_link Problem Set 3]

* [https://drive.google.com/file/d/1YgH_AdCk4GcKC0KH7xBA4-sUnOYkUvUK/view?usp=drive_link Problem Set 4]

* [https://drive.google.com/file/d/1M556PSgTJOo5W-AxYEXjFu94VfledpF5/view?usp=drive_link Problem Set 5]

* [https://drive.google.com/file/d/1-ylVViaBgzxEM-M7Rvrz2iggtK6UiJTY/view?usp=drive_link Problem Set 6]



=== Assignment deadlines ===

{| class="wikitable"
|-
! Home problem set !! colspan="11" | Deadline
|-
| || 241 || 242 || 243 || 244 || 245 || 246
|-
| [https://drive.google.com/file/d/15vCxTrNMwagS4rqQnUzdLParTqOP8y5P/view?usp=drive_link HW1a ] || Sep 19 || Sep 19 || Sep 19 || Sep 24 || Sep 24 || Sep 24
|-
| [https://drive.google.com/file/d/1PTJY1PEG-wUlTqUGXT8KWRsll8H0XLb0/view?usp=drive_link HW1b] || Oct 12 || Oct 10 || Oct 10 || Oct 17 || Oct 17 || Oct 17
|-
| [https://drive.google.com/file/d/1mSNPCXo1J3eMz7Wk9yagWkgaZn7AwN7B/view?usp=drive_link HW1c] || Oct 24 || Oct 24 || Oct 24 || Oct 24 || Oct 24 || Oct 24
|-
| [https://drive.google.com/file/d/1LOPPwGjyVleR_mclxTKUJ_bxFrxt44sW/view?usp=drive_link HW2a] || Nov 29 || Nov 29 || Nov 29 || Nov 29 || Nov 29 || Nov 29
|-
| [https://drive.google.com/file/d/1W7k1OTiIMlPOpo-2mwmGegrc4RDHz5_j/view?usp=drive_link HW2b] || Dec 8 || Dec 8 || Dec 8 || Dec 14 || Dec 14 || Dec 14
|-
| [https://drive.google.com/file/d/1V99HEXHgcCXT6tjJp0oPV05Jw172Bid8/view?usp=drive_link HW2c] || Jan 9 || Jan 23 || Jan 23 || || ||
|}


'''Each deadline is set by the respective group's instructor.'''

== Assessment and Grading ==

=== Homework ===

The homework is graded in two batches: one (HW_A) includes everything to be submitted in Module1 and the other (HW_B) includes all the rest. For each problem, either ordinary or bonus, the student is given a score from 0 to 1 point (in fractional values) according to the progress he made.

Grade HW_A is computed the following way (before rounding):

HW_A = 8 * ord + 2 * adv, where

ord = (the sum of points given for ordinary problems) / #(ordinary problems);

adv = (the sum of points given for bonus problems) / #(bonus problems).

Grade HW_B is computed similarly but for its respective period of Modules 2 and 3.

=== Exam1 and the Interim Assessment ===

Each problem solution in the exam is graded with a fractional score from 0 to 1 point, and the entire exam with the value (before rounding)

Exam1 = 8 * ord + 2 * adv, where

ord = (the sum of points given for ordinary problems) / #(ordinary problems);

adv = (the sum of points given for bonus problems) / #(bonus problems).

The Interim grade 1 is computed past Module 1 and equals:

Interim1 = round(0.5 * HW_A + 0.5 * Exam1).

(Here and everywhere, rounding is according to arithmetic rules.)

=== Colloquium ===
For each of the 'definition' two questions, the student is given a score from 0 to 2 points, and from 0 to 4 points for the ‘proof’ question (all in fractional values).
The Colloq grade is computed the following way (before rounding):

Colloq = 10 * (the sum of points given) / 8.

=== Bonuses ===
Each student is given a score according to his progress in bonus activities, which results in the grade

Bonus = 10 * #(points given) / #(points possible).

The number of possible points varies but it is between 1 and 25 usually.

=== Exam2, the Second Interim, and the Final Assessment ===
Each problem solution in exam is graded with a fractional score from 0 to 1 point, and the entire exam with the value (before rounding)

Exam2 = 8 * ord + 2 * adv, where

ord = (the sum of points given for ordinary problems) / #(ordinary problems);

adv = (the sum of points given for bonus problems) / #(bonus problems).

The Interim grade 2 is computed past Module 3 and equals:

Interim2 = round(0.295 * HW_B + 0.295 * Colloq + 0.06 * Bonus + 0.35 * Exam2).

The final grade for the course is

Final = round(0.3 * Interim1 + 0.7 * Interim 2)

Generally, '''nobody is exempt from the examinations'''.

== Exam retaking ==
Examinations 1 and 2 are subject to be retaken if either the Interim1 or Final grade, respectively, is unsatisfactory (i.e., < 4). Retaking an exam is similar to the regular examination. The resulting grade is substituted for that of the latter (that is, retake grade is assigned to the variable Exami in the respective formula, whose value is then reevaluated). Those whose Interim or Final grade is still unsatisfactory after the first retake will have a (tough) choice to make.

Please take into account the following regulation according to the ''ПОПАТКУС'':
<blockquote>
On the first and second retake the cumulative course grade is taken into consideration. In case of receiving an unsatisfactory final grade after the first retake, the student may refuse to participate in the second retake and repeat the course according to the individual curricula. Cumulative grade is formed again as a result of repeated course. After the completion of the repeated course, the student is given a second retake only, from which the student has previously refused.
</blockquote>

The 'cumulative grade' here means all the variables in the grading formulas except Exami, which are the only ones to be retaken. The 'second retake' is similar to the first one and it is evaluated according to the same formula with the same values of 'cumulative' variables. This poses an obvious risk for anyone whose 'cumulatives' are low!

== Recommended reading ==
''Please notice that '''The Book''' for our Course does not exist. The latter is based on many sources.''

# Anderson J. A., Discrete Mathematics With Combinatorics. Prentice Hall, 2003.
# Biggs N. L., Discrete mathematics. 2nd ed., New York; Oxford: Oxford University Press, 2004.
# Gavrilov G. P., Sapozhenko A. A. Problems and Exercises in Discrete Mathematics. Kluwer Texts in the Mathematical Sciences 14. Springer, 1996.
# [http://courses.csail.mit.edu/6.042/spring17/mcs.pdf Lehman E., Thomson Leighton F., Meyer A. R. Mathematics for Computer Science, 2017.]
# [http://www.cs.elte.hu/~lovasz/dmbook.ps Lovasz L., Vesztergombi K. Discrete Mathematics. Lecture Notes; Yale University, 1999.]
# Melnikov O., Sarvanov V., Tyshkevich R., Yemelichev V., Zverovich I. Exercises in Graph Theory. Kluwer Texts in the Mathematical Sciences 19. Springer, 1998.
# Rosen K. H. Discrete Mathematics and Its Applications. McGraw-Hill, 1999.
# Stein C., Drysdale R. L., Bogart K. Discrete mathematics for computer scientists. Addison-Wesley, 2010.
# Vinogradov I. M. Elements of number theory. Dover, 1954.

=== In Russian ===
''If you understand Russian (by any chance), you will probably benefit from reading the following books.''

# Виноградов И. М. Основы теории чисел. 9-е изд., М.: Наука, 1981.
# [http://rubtsov.su/public/DM-HSE-Draft.pdf Вялый М., Подольский В., Рубцов А., Шварц Д., Шень А. Лекции по дискретной математике.]
# Гаврилов Г. П., Сапоженко А. А. Задачи и упражнения по дискретной математике. 3-е изд., М.: ФИЗМАТЛИТ, 2004.
# [https://drive.google.com/file/d/1RM6KX_reBFwUXesWGUEu0sFn2NCaBgvz/view?usp=sharing Дашков Е. В. Введение в математическую логику. Множества и отношения. М.: МФТИ, 2019.]
# Зубков А. М., Севастьянов Б. А., Чистяков В. П. Сборник задач по теории вероятностей. 2-е изд., М.: Наука, 1989.
# Мельников О. И. Теория графов в занимательных задачах. 5-е изд., М.: Книжный дом "ЛИБРОКОМ", 2013.
# [http://www.mccme.ru/free-books/shen/shen-induction.pdf Шень А., Математическая индукция. 5-е изд, М.: МЦНМО, 2016.]

Discrete Mathematics DSBA 2024/2025

2024-11-29T00:04:57Z

Brdan: /* Assignment deadlines */

== Instructors ==

=== The lecturer ===
My name is Evgeny Dashkov. Feel free to contact me via email: edashkov@gmail.com, [https://t.me/edashkov Telegram], or [https://vk.com/evgeny.v.dashkov VK].

My Assistant (the person responsible for the tables etc.): [https://t.me/elizaaaa_5 Elizaveta Levshina].

=== Seminar Instructors and Teaching Assistants ===
{| class="wikitable" style="text-align:center"
|-
! Group !! 241 !! 242 !! 243 !! 244 !! 245 !! 246
|-
|| Teachers || [https://t.me/edashkov Evgeny Dashkov] ||colspan="2"| [https://t.me/brdann Boris Danilov]|| colspan="3"| [https://t.me/DiegBuitrago Diego Buitrago]
|-
|| Teaching Assistants || [https://t.me/svbudygin Sergei Budygin] || [https://t.me/Avgustine_iw Zakhar Zinkin] || [https://t.me/svnsrg Sergey Savin] || [https://t.me/NaviMash Ivan Mashkarin] || [https://t.me/underpl Maxim Titov] || [https://t.me/almanmaria Maria Krotova]
|}

=== Whom should I ask? ===

If you have a question or comment concerning the mathematical content of our course, it is best to post it to our [https://t.me/joinchat/T_YTN4IG1vAJNWT9 student chat]. Alternatively, you may address your question to your Teaching Assistant, Seminar Instructor or the Lecturer (say, if your question discloses an important idea for a HW problem). It is much better to ask and get to know than not to ask and remain ignorant. '''Please do not hesitate to ask your mathematical questions!'''

If you need a more detailed consultation concerning the course's mathematics, please be informed that our Teaching Assistants usually hold periodic consultations while the Seminar Instructors and Lecturer have some designated time for counseling students. Still, the best thing to do is to arrange a consultation in advance via a personal communication.

Homework-grading related questions should be directed to your teaching assistant first; then to your seminar instructor and to the lecturer just in case of any disagreement.

Organizational, administrative, legal or paperwork questions must be addressed to the Student Service Center, Study Office or other relevant offices first and foremost. If you have been redirected to us with such a question nevertheless, please contact the Lecturer's Assistant first.

== Current performance ==

[https://docs.google.com/spreadsheets/d/1632c9OT4ICCe5X3A1Obc1rH69dNpIEy_FEghK1vyM8o/edit?usp=drive_link The Table].

== Homework ==
The homework includes a few problem sets, one in a fortnight or so (the deadlines are announced on giving each set). Every problem set consists of about 10 – 15 problems, some of which are labeled as ‘bonus’ while all the remaining are considered ‘ordinary’. These sets may be subdivided further for students’ convenience.

A student may be required to 'defend' (i.e., to explain orally) his written solution to any problem. His grade for the problem may be decreased if he fails to do so properly.

== Exam 1 ==
A written examination is held past Module 1. Students may not consult any sources during the exam. The examination takes about 120 minutes. Some problems of the exam are labeled as ‘bonus’; the others are ‘ordinary’.

== Colloquium ==
An oral colloquium is held at the beginning of Module 3. Each student is given two questions concerning statements and definitions as well as one question requiring a proof. After no less than 45 minutes of preparation (when using any literature is allowed), the student is required to answer ‘from scratch’, that is, with no recourse to any materials. The examiner may pose additional questions as he sees fit.


== Exam 2 ==
A written examination is held past Module 3. Students may not consult any sources during the exam. The examination takes about 120 minutes. Some problems of the exam are labeled as ‘bonus’; the others are ‘ordinary’.

== Bonus activities ==
Throughout the course, the students may be graded for a variety of ‘bonus activities’ (like quizzes, etc.) either offline or online.

== Course materials ==

[https://t.me/joinchat/T_YTN4IG1vAJNWT9 Course chat]. This is our primary outlet for course announcements, questions, and discussions. '''Please join it!'''

=== Lecture notes ===

[https://drive.google.com/file/d/1mmNLLQ0--EDihGNRKwSyXLOA1KL7A0lD/view?usp=sharing Original English version]

[https://drive.google.com/drive/folders/1cTCdJtVVtO9uDgIKE8HY0qhl285tzOo1?usp=drive_link A Russian translation by volunteering students] (you are welcome to [https://t.me/sigma_algebraa join] their ranks)

=== Classes recordings ===

=== Lecture video archive ===

=== Other resources ===
* [https://tinyurl.com/rwky5vmk The Course's Google Directory]

* [https://www.youtube.com/playlist?list=PL1Uob8iPTHGTidrmrqEHTJ96Pt3-PmML4 Past years' videos]

* We have a [https://meet.edashkov.net.ru dedicated server] to hold an online meeting if we need one.

== Problem sets ==

=== Class problems ===

* [https://drive.google.com/file/d/1EP-diSuOTn9f0ryg18Z2w0xjEp8j0bnl/view?usp=drive_link Problem Set 1]

* [https://drive.google.com/file/d/12ct99-ORd7A94Gh5g4Nf9riv7UqNMSRc/view?usp=drive_link Problem Set 2]

* [https://drive.google.com/file/d/1yKKqLsS99V4AhCYqbjafuav2CMCdQTOQ/view?usp=drive_link Problem Set 3]

* [https://drive.google.com/file/d/1YgH_AdCk4GcKC0KH7xBA4-sUnOYkUvUK/view?usp=drive_link Problem Set 4]



=== Assignment deadlines ===

{| class="wikitable"
|-
! Home problem set !! colspan="11" | Deadline
|-
| || 241 || 242 || 243 || 244 || 245 || 246
|-
| [https://drive.google.com/file/d/15vCxTrNMwagS4rqQnUzdLParTqOP8y5P/view?usp=drive_link HW1a ] || Sep 19 || Sep 19 || Sep 19 || Sep 24 || Sep 24 || Sep 24
|-
| [https://drive.google.com/file/d/1PTJY1PEG-wUlTqUGXT8KWRsll8H0XLb0/view?usp=drive_link HW1b] || Oct 12 || Oct 10 || Oct 10 || Oct 17 || Oct 17 || Oct 17
|-
| [https://drive.google.com/file/d/1mSNPCXo1J3eMz7Wk9yagWkgaZn7AwN7B/view?usp=drive_link HW1c] || Oct 24 || Oct 24 || Oct 24 || Oct 24 || Oct 24 || Oct 24
|-
| [https://drive.google.com/file/d/1LOPPwGjyVleR_mclxTKUJ_bxFrxt44sW/view?usp=drive_link HW2a] || Nov 29 || Nov 29 || Nov 29 || Nov 29 || Nov 29 || Nov 29
|-
| [https://drive.google.com/file/d/1W7k1OTiIMlPOpo-2mwmGegrc4RDHz5_j/view?usp=drive_link HW2b] || Dec 8 || Dec 8 || Dec 8 || || ||
|}


'''Each deadline is set by the respective group's instructor.'''

== Assessment and Grading ==

=== Homework ===

The homework is graded in two batches: one (HW_A) includes everything to be submitted in Module1 and the other (HW_B) includes all the rest. For each problem, either ordinary or bonus, the student is given a score from 0 to 1 point (in fractional values) according to the progress he made.

Grade HW_A is computed the following way (before rounding):

HW_A = 8 * ord + 2 * adv, where

ord = (the sum of points given for ordinary problems) / #(ordinary problems);

adv = (the sum of points given for bonus problems) / #(bonus problems).

Grade HW_B is computed similarly but for its respective period of Modules 2 and 3.

=== Exam1 and the Interim Assessment ===

Each problem solution in the exam is graded with a fractional score from 0 to 1 point, and the entire exam with the value (before rounding)

Exam1 = 8 * ord + 2 * adv, where

ord = (the sum of points given for ordinary problems) / #(ordinary problems);

adv = (the sum of points given for bonus problems) / #(bonus problems).

The Interim grade 1 is computed past Module 1 and equals:

Interim1 = round(0.5 * HW_A + 0.5 * Exam1).

(Here and everywhere, rounding is according to arithmetic rules.)

=== Colloquium ===
For each of the 'definition' two questions, the student is given a score from 0 to 2 points, and from 0 to 4 points for the ‘proof’ question (all in fractional values).
The Colloq grade is computed the following way (before rounding):

Colloq = 10 * (the sum of points given) / 8.

=== Bonuses ===
Each student is given a score according to his progress in bonus activities, which results in the grade

Bonus = 10 * #(points given) / #(points possible).

The number of possible points varies but it is between 1 and 25 usually.

=== Exam2, the Second Interim, and the Final Assessment ===
Each problem solution in exam is graded with a fractional score from 0 to 1 point, and the entire exam with the value (before rounding)

Exam2 = 8 * ord + 2 * adv, where

ord = (the sum of points given for ordinary problems) / #(ordinary problems);

adv = (the sum of points given for bonus problems) / #(bonus problems).

The Interim grade 2 is computed past Module 3 and equals:

Interim2 = round(0.295 * HW_B + 0.295 * Colloq + 0.06 * Bonus + 0.35 * Exam2).

The final grade for the course is

Final = round(0.3 * Interim1 + 0.7 * Interim 2)

Generally, '''nobody is exempt from the examinations'''.

== Exam retaking ==
Examinations 1 and 2 are subject to be retaken if either the Interim1 or Final grade, respectively, is unsatisfactory (i.e., < 4). Retaking an exam is similar to the regular examination. The resulting grade is substituted for that of the latter (that is, retake grade is assigned to the variable Exami in the respective formula, whose value is then reevaluated). Those whose Interim or Final grade is still unsatisfactory after the first retake will have a (tough) choice to make.

Please take into account the following regulation according to the ''ПОПАТКУС'':
<blockquote>
On the first and second retake the cumulative course grade is taken into consideration. In case of receiving an unsatisfactory final grade after the first retake, the student may refuse to participate in the second retake and repeat the course according to the individual curricula. Cumulative grade is formed again as a result of repeated course. After the completion of the repeated course, the student is given a second retake only, from which the student has previously refused.
</blockquote>

The 'cumulative grade' here means all the variables in the grading formulas except Exami, which are the only ones to be retaken. The 'second retake' is similar to the first one and it is evaluated according to the same formula with the same values of 'cumulative' variables. This poses an obvious risk for anyone whose 'cumulatives' are low!

== Recommended reading ==
''Please notice that '''The Book''' for our Course does not exist. The latter is based on many sources.''

# Anderson J. A., Discrete Mathematics With Combinatorics. Prentice Hall, 2003.
# Biggs N. L., Discrete mathematics. 2nd ed., New York; Oxford: Oxford University Press, 2004.
# Gavrilov G. P., Sapozhenko A. A. Problems and Exercises in Discrete Mathematics. Kluwer Texts in the Mathematical Sciences 14. Springer, 1996.
# [http://courses.csail.mit.edu/6.042/spring17/mcs.pdf Lehman E., Thomson Leighton F., Meyer A. R. Mathematics for Computer Science, 2017.]
# [http://www.cs.elte.hu/~lovasz/dmbook.ps Lovasz L., Vesztergombi K. Discrete Mathematics. Lecture Notes; Yale University, 1999.]
# Melnikov O., Sarvanov V., Tyshkevich R., Yemelichev V., Zverovich I. Exercises in Graph Theory. Kluwer Texts in the Mathematical Sciences 19. Springer, 1998.
# Rosen K. H. Discrete Mathematics and Its Applications. McGraw-Hill, 1999.
# Stein C., Drysdale R. L., Bogart K. Discrete mathematics for computer scientists. Addison-Wesley, 2010.
# Vinogradov I. M. Elements of number theory. Dover, 1954.

=== In Russian ===
''If you understand Russian (by any chance), you will probably benefit from reading the following books.''

# Виноградов И. М. Основы теории чисел. 9-е изд., М.: Наука, 1981.
# [http://rubtsov.su/public/DM-HSE-Draft.pdf Вялый М., Подольский В., Рубцов А., Шварц Д., Шень А. Лекции по дискретной математике.]
# Гаврилов Г. П., Сапоженко А. А. Задачи и упражнения по дискретной математике. 3-е изд., М.: ФИЗМАТЛИТ, 2004.
# [https://drive.google.com/file/d/1RM6KX_reBFwUXesWGUEu0sFn2NCaBgvz/view?usp=sharing Дашков Е. В. Введение в математическую логику. Множества и отношения. М.: МФТИ, 2019.]
# Зубков А. М., Севастьянов Б. А., Чистяков В. П. Сборник задач по теории вероятностей. 2-е изд., М.: Наука, 1989.
# Мельников О. И. Теория графов в занимательных задачах. 5-е изд., М.: Книжный дом "ЛИБРОКОМ", 2013.
# [http://www.mccme.ru/free-books/shen/shen-induction.pdf Шень А., Математическая индукция. 5-е изд, М.: МЦНМО, 2016.]

Discrete Mathematics DSBA 2024/2025

2024-11-22T07:49:12Z

Brdan: /* Assignment deadlines */

== Instructors ==

=== The lecturer ===
My name is Evgeny Dashkov. Feel free to contact me via email: edashkov@gmail.com, [https://t.me/edashkov Telegram], or [https://vk.com/evgeny.v.dashkov VK].

My Assistant (the person responsible for the tables etc.): [https://t.me/elizaaaa_5 Elizaveta Levshina].

=== Seminar Instructors and Teaching Assistants ===
{| class="wikitable" style="text-align:center"
|-
! Group !! 241 !! 242 !! 243 !! 244 !! 245 !! 246
|-
|| Teachers || [https://t.me/edashkov Evgeny Dashkov] ||colspan="2"| [https://t.me/brdann Boris Danilov]|| colspan="3"| [https://t.me/DiegBuitrago Diego Buitrago]
|-
|| Teaching Assistants || [https://t.me/svbudygin Sergei Budygin] || [https://t.me/Avgustine_iw Zakhar Zinkin] || [https://t.me/svnsrg Sergey Savin] || [https://t.me/NaviMash Ivan Mashkarin] || [https://t.me/underpl Maxim Titov] || [https://t.me/almanmaria Maria Krotova]
|}

=== Whom should I ask? ===

If you have a question or comment concerning the mathematical content of our course, it is best to post it to our [https://t.me/joinchat/T_YTN4IG1vAJNWT9 student chat]. Alternatively, you may address your question to your Teaching Assistant, Seminar Instructor or the Lecturer (say, if your question discloses an important idea for a HW problem). It is much better to ask and get to know than not to ask and remain ignorant. '''Please do not hesitate to ask your mathematical questions!'''

If you need a more detailed consultation concerning the course's mathematics, please be informed that our Teaching Assistants usually hold periodic consultations while the Seminar Instructors and Lecturer have some designated time for counseling students. Still, the best thing to do is to arrange a consultation in advance via a personal communication.

Homework-grading related questions should be directed to your teaching assistant first; then to your seminar instructor and to the lecturer just in case of any disagreement.

Organizational, administrative, legal or paperwork questions must be addressed to the Student Service Center, Study Office or other relevant offices first and foremost. If you have been redirected to us with such a question nevertheless, please contact the Lecturer's Assistant first.

== Current performance ==

[https://docs.google.com/spreadsheets/d/1632c9OT4ICCe5X3A1Obc1rH69dNpIEy_FEghK1vyM8o/edit?usp=drive_link The Table].

== Homework ==
The homework includes a few problem sets, one in a fortnight or so (the deadlines are announced on giving each set). Every problem set consists of about 10 – 15 problems, some of which are labeled as ‘bonus’ while all the remaining are considered ‘ordinary’. These sets may be subdivided further for students’ convenience.

A student may be required to 'defend' (i.e., to explain orally) his written solution to any problem. His grade for the problem may be decreased if he fails to do so properly.

== Exam 1 ==
A written examination is held past Module 1. Students may not consult any sources during the exam. The examination takes about 120 minutes. Some problems of the exam are labeled as ‘bonus’; the others are ‘ordinary’.

== Colloquium ==
An oral colloquium is held at the beginning of Module 3. Each student is given two questions concerning statements and definitions as well as one question requiring a proof. After no less than 45 minutes of preparation (when using any literature is allowed), the student is required to answer ‘from scratch’, that is, with no recourse to any materials. The examiner may pose additional questions as he sees fit.


== Exam 2 ==
A written examination is held past Module 3. Students may not consult any sources during the exam. The examination takes about 120 minutes. Some problems of the exam are labeled as ‘bonus’; the others are ‘ordinary’.

== Bonus activities ==
Throughout the course, the students may be graded for a variety of ‘bonus activities’ (like quizzes, etc.) either offline or online.

== Course materials ==

[https://t.me/joinchat/T_YTN4IG1vAJNWT9 Course chat]. This is our primary outlet for course announcements, questions, and discussions. '''Please join it!'''

=== Lecture notes ===

[https://drive.google.com/file/d/1mmNLLQ0--EDihGNRKwSyXLOA1KL7A0lD/view?usp=sharing Original English version]

[https://drive.google.com/drive/folders/1cTCdJtVVtO9uDgIKE8HY0qhl285tzOo1?usp=drive_link A Russian translation by volunteering students] (you are welcome to [https://t.me/sigma_algebraa join] their ranks)

=== Classes recordings ===

=== Lecture video archive ===

=== Other resources ===
* [https://tinyurl.com/rwky5vmk The Course's Google Directory]

* [https://www.youtube.com/playlist?list=PL1Uob8iPTHGTidrmrqEHTJ96Pt3-PmML4 Past years' videos]

* We have a [https://meet.edashkov.net.ru dedicated server] to hold an online meeting if we need one.

== Problem sets ==

=== Class problems ===

* [https://drive.google.com/file/d/1EP-diSuOTn9f0ryg18Z2w0xjEp8j0bnl/view?usp=drive_link Problem Set 1]

* [https://drive.google.com/file/d/12ct99-ORd7A94Gh5g4Nf9riv7UqNMSRc/view?usp=drive_link Problem Set 2]

* [https://drive.google.com/file/d/1yKKqLsS99V4AhCYqbjafuav2CMCdQTOQ/view?usp=drive_link Problem Set 3]

* [https://drive.google.com/file/d/1YgH_AdCk4GcKC0KH7xBA4-sUnOYkUvUK/view?usp=drive_link Problem Set 4]



=== Assignment deadlines ===

{| class="wikitable"
|-
! Home problem set !! colspan="11" | Deadline
|-
| || 241 || 242 || 243 || 244 || 245 || 246
|-
| [https://drive.google.com/file/d/15vCxTrNMwagS4rqQnUzdLParTqOP8y5P/view?usp=drive_link HW1a ] || Sep 19 || Sep 19 || Sep 19 || Sep 24 || Sep 24 || Sep 24
|-
| [https://drive.google.com/file/d/1PTJY1PEG-wUlTqUGXT8KWRsll8H0XLb0/view?usp=drive_link HW1b] || Oct 12 || Oct 10 || Oct 10 || Oct 17 || Oct 17 || Oct 17
|-
| [https://drive.google.com/file/d/1mSNPCXo1J3eMz7Wk9yagWkgaZn7AwN7B/view?usp=drive_link HW1c] || Oct 24 || Oct 24 || Oct 24 || Oct 24 || Oct 24 || Oct 24
|-
| [https://drive.google.com/file/d/1LOPPwGjyVleR_mclxTKUJ_bxFrxt44sW/view?usp=drive_link HW2a] || Nov 25 || Nov 28 || Nov 28 || Nov 29 || Nov 29 || Nov 29
|}


'''Each deadline is set by the respective group's instructor.'''

== Assessment and Grading ==

=== Homework ===

The homework is graded in two batches: one (HW_A) includes everything to be submitted in Module1 and the other (HW_B) includes all the rest. For each problem, either ordinary or bonus, the student is given a score from 0 to 1 point (in fractional values) according to the progress he made.

Grade HW_A is computed the following way (before rounding):

HW_A = 8 * ord + 2 * adv, where

ord = (the sum of points given for ordinary problems) / #(ordinary problems);

adv = (the sum of points given for bonus problems) / #(bonus problems).

Grade HW_B is computed similarly but for its respective period of Modules 2 and 3.

=== Exam1 and the Interim Assessment ===

Each problem solution in the exam is graded with a fractional score from 0 to 1 point, and the entire exam with the value (before rounding)

Exam1 = 8 * ord + 2 * adv, where

ord = (the sum of points given for ordinary problems) / #(ordinary problems);

adv = (the sum of points given for bonus problems) / #(bonus problems).

The Interim grade 1 is computed past Module 1 and equals:

Interim1 = round(0.5 * HW_A + 0.5 * Exam1).

(Here and everywhere, rounding is according to arithmetic rules.)

=== Colloquium ===
For each of the 'definition' two questions, the student is given a score from 0 to 2 points, and from 0 to 4 points for the ‘proof’ question (all in fractional values).
The Colloq grade is computed the following way (before rounding):

Colloq = 10 * (the sum of points given) / 8.

=== Bonuses ===
Each student is given a score according to his progress in bonus activities, which results in the grade

Bonus = 10 * #(points given) / #(points possible).

The number of possible points varies but it is between 1 and 25 usually.

=== Exam2, the Second Interim, and the Final Assessment ===
Each problem solution in exam is graded with a fractional score from 0 to 1 point, and the entire exam with the value (before rounding)

Exam2 = 8 * ord + 2 * adv, where

ord = (the sum of points given for ordinary problems) / #(ordinary problems);

adv = (the sum of points given for bonus problems) / #(bonus problems).

The Interim grade 2 is computed past Module 3 and equals:

Interim2 = round(0.295 * HW_B + 0.295 * Colloq + 0.06 * Bonus + 0.35 * Exam2).

The final grade for the course is

Final = round(0.3 * Interim1 + 0.7 * Interim 2)

Generally, '''nobody is exempt from the examinations'''.

== Exam retaking ==
Examinations 1 and 2 are subject to be retaken if either the Interim1 or Final grade, respectively, is unsatisfactory (i.e., < 4). Retaking an exam is similar to the regular examination. The resulting grade is substituted for that of the latter (that is, retake grade is assigned to the variable Exami in the respective formula, whose value is then reevaluated). Those whose Interim or Final grade is still unsatisfactory after the first retake will have a (tough) choice to make.

Please take into account the following regulation according to the ''ПОПАТКУС'':
<blockquote>
On the first and second retake the cumulative course grade is taken into consideration. In case of receiving an unsatisfactory final grade after the first retake, the student may refuse to participate in the second retake and repeat the course according to the individual curricula. Cumulative grade is formed again as a result of repeated course. After the completion of the repeated course, the student is given a second retake only, from which the student has previously refused.
</blockquote>

The 'cumulative grade' here means all the variables in the grading formulas except Exami, which are the only ones to be retaken. The 'second retake' is similar to the first one and it is evaluated according to the same formula with the same values of 'cumulative' variables. This poses an obvious risk for anyone whose 'cumulatives' are low!

== Recommended reading ==
''Please notice that '''The Book''' for our Course does not exist. The latter is based on many sources.''

# Anderson J. A., Discrete Mathematics With Combinatorics. Prentice Hall, 2003.
# Biggs N. L., Discrete mathematics. 2nd ed., New York; Oxford: Oxford University Press, 2004.
# Gavrilov G. P., Sapozhenko A. A. Problems and Exercises in Discrete Mathematics. Kluwer Texts in the Mathematical Sciences 14. Springer, 1996.
# [http://courses.csail.mit.edu/6.042/spring17/mcs.pdf Lehman E., Thomson Leighton F., Meyer A. R. Mathematics for Computer Science, 2017.]
# [http://www.cs.elte.hu/~lovasz/dmbook.ps Lovasz L., Vesztergombi K. Discrete Mathematics. Lecture Notes; Yale University, 1999.]
# Melnikov O., Sarvanov V., Tyshkevich R., Yemelichev V., Zverovich I. Exercises in Graph Theory. Kluwer Texts in the Mathematical Sciences 19. Springer, 1998.
# Rosen K. H. Discrete Mathematics and Its Applications. McGraw-Hill, 1999.
# Stein C., Drysdale R. L., Bogart K. Discrete mathematics for computer scientists. Addison-Wesley, 2010.
# Vinogradov I. M. Elements of number theory. Dover, 1954.

=== In Russian ===
''If you understand Russian (by any chance), you will probably benefit from reading the following books.''

# Виноградов И. М. Основы теории чисел. 9-е изд., М.: Наука, 1981.
# [http://rubtsov.su/public/DM-HSE-Draft.pdf Вялый М., Подольский В., Рубцов А., Шварц Д., Шень А. Лекции по дискретной математике.]
# Гаврилов Г. П., Сапоженко А. А. Задачи и упражнения по дискретной математике. 3-е изд., М.: ФИЗМАТЛИТ, 2004.
# [https://drive.google.com/file/d/1RM6KX_reBFwUXesWGUEu0sFn2NCaBgvz/view?usp=sharing Дашков Е. В. Введение в математическую логику. Множества и отношения. М.: МФТИ, 2019.]
# Зубков А. М., Севастьянов Б. А., Чистяков В. П. Сборник задач по теории вероятностей. 2-е изд., М.: Наука, 1989.
# Мельников О. И. Теория графов в занимательных задачах. 5-е изд., М.: Книжный дом "ЛИБРОКОМ", 2013.
# [http://www.mccme.ru/free-books/shen/shen-induction.pdf Шень А., Математическая индукция. 5-е изд, М.: МЦНМО, 2016.]

Discrete Mathematics DSBA 2024/2025

2024-09-30T15:59:44Z

Brdan: /* Assignment deadlines */

== Instructors ==

=== The lecturer ===
My name is Evgeny Dashkov. Feel free to contact me via email: edashkov@gmail.com, [https://t.me/edashkov Telegram], or [https://vk.com/evgeny.v.dashkov VK].

My Assistant (the person responsible for the tables etc.): [https://t.me/elizaaaa_5 Elizaveta Levshina].

=== Seminar Instructors and Teaching Assistants ===
{| class="wikitable" style="text-align:center"
|-
! Group !! 241 !! 242 !! 243 !! 244 !! 245 !! 246
|-
|| Teachers || [https://t.me/edashkov Evgeny Dashkov] ||colspan="2"| [https://t.me/brdann Boris Danilov]|| colspan="3"| [https://t.me/DiegBuitrago Diego Buitrago] ||
|-
|| Teaching Assistants || [https://t.me/svbudygin Sergei Budygin] || [https://t.me/Avgustine_iw Zakhar Zinkin] || [https://t.me/svnsrg Sergey Savin] || [https://t.me/NaviMash Ivan Mashkarin] || [https://t.me/underpl Maxim Titov] || [https://t.me/almanmaria Maria Krotova]
|}

=== Whom should I ask? ===

If you have a question or comment concerning the mathematical content of our course, it is best to post it to our [https://t.me/joinchat/T_YTN4IG1vAJNWT9 student chat]. Alternatively, you may address your question to your Teaching Assistant, Seminar Instructor or the Lecturer (say, if your question discloses an important idea for a HW problem). It is much better to ask and get to know than not to ask and remain ignorant. '''Please do not hesitate to ask your mathematical questions!'''

If you need a more detailed consultation concerning the course's mathematics, please be informed that our Teaching Assistants usually hold periodic consultations while the Seminar Instructors and Lecturer have some designated time for counseling students. Still, the best thing to do is to arrange a consultation in advance via a personal communication.

Homework-grading related questions should be directed to your teaching assistant first; then to your seminar instructor and to the lecturer just in case of any disagreement.

Organizational, administrative, legal or paperwork questions must be addressed to the Student Service Center, Study Office or other relevant offices first and foremost. If you have been redirected to us with such a question nevertheless, please contact the Lecturer's Assistant first.

== Current performance ==

[https://docs.google.com/spreadsheets/d/1632c9OT4ICCe5X3A1Obc1rH69dNpIEy_FEghK1vyM8o/edit?usp=drive_link The Table].

== Homework ==
The homework includes a few problem sets, one in a fortnight or so (the deadlines are announced on giving each set). Every problem set consists of about 10 – 15 problems, some of which are labeled as ‘bonus’ while all the remaining are considered ‘ordinary’. These sets may be subdivided further for students’ convenience.

A student may be required to 'defend' (i.e., to explain orally) his written solution to any problem. His grade for the problem may be decreased if he fails to do so properly.

== Exam 1 ==
A written examination is held past Module 1. Students may not consult any sources during the exam. The examination takes about 120 minutes. Some problems of the exam are labeled as ‘bonus’; the others are ‘ordinary’.

== Colloquium ==
An oral colloquium is held at the beginning of Module 3. Each student is given two questions concerning statements and definitions as well as one question requiring a proof. After no less than 45 minutes of preparation (when using any literature is allowed), the student is required to answer ‘from scratch’, that is, with no recourse to any materials. The examiner may pose additional questions as he sees fit.


== Exam 2 ==
A written examination is held past Module 3. Students may not consult any sources during the exam. The examination takes about 120 minutes. Some problems of the exam are labeled as ‘bonus’; the others are ‘ordinary’.

== Bonus activities ==
Throughout the course, the students may be graded for a variety of ‘bonus activities’ (like quizzes, etc.) either offline or online.

== Course materials ==

[https://t.me/joinchat/T_YTN4IG1vAJNWT9 Course chat]. This is our primary outlet for course announcements, questions, and discussions. '''Please join it!'''

=== Lecture notes ===

[https://drive.google.com/file/d/1mmNLLQ0--EDihGNRKwSyXLOA1KL7A0lD/view?usp=sharing Original English version]

[https://drive.google.com/drive/folders/1cTCdJtVVtO9uDgIKE8HY0qhl285tzOo1?usp=drive_link A Russian translation by volunteering students] (you are welcome to [https://t.me/sigma_algebraa join] their ranks)

=== Classes recordings ===

=== Lecture video archive ===

=== Other resources ===
* [https://tinyurl.com/rwky5vmk The Course's Google Directory]

* [https://www.youtube.com/playlist?list=PL1Uob8iPTHGTidrmrqEHTJ96Pt3-PmML4 Past years' videos]

* We have a [https://meet.edashkov.net.ru dedicated server] to hold an online meeting if we need one.

== Problem sets ==

=== Class problems ===

* [https://drive.google.com/file/d/1EP-diSuOTn9f0ryg18Z2w0xjEp8j0bnl/view?usp=drive_link Problem Set 1]



=== Assignment deadlines ===

{| class="wikitable"
|-
! Home problem set !! colspan="11" | Deadline
|-
| || 241 || 242 || 243 || 244 || 245 || 246
|-
| [https://drive.google.com/file/d/15vCxTrNMwagS4rqQnUzdLParTqOP8y5P/view?usp=drive_link HW1a ] || Sep 19 || Sep 19 || Sep 19 || Sep 24 || Sep 24 || Sep 24
|-
| [https://drive.google.com/file/d/1PTJY1PEG-wUlTqUGXT8KWRsll8H0XLb0/view?usp=drive_link HW1b] || Oct 3 || Oct 10 || Oct 10 || Oct 12 || Oct 12 || Oct 12
|}


'''Each deadline is set by the respective group's instructor.'''

== Assessment and Grading ==

=== Homework ===

The homework is graded in two batches: one (HW_A) includes everything to be submitted in Module1 and the other (HW_B) includes all the rest. For each problem, either ordinary or bonus, the student is given a score from 0 to 1 point (in fractional values) according to the progress he made.

Grade HW_A is computed the following way (before rounding):

HW_A = 8 * ord + 2 * adv, where

ord = (the sum of points given for ordinary problems) / #(ordinary problems);

adv = (the sum of points given for bonus problems) / #(bonus problems).

Grade HW_B is computed similarly but for its respective period of Modules 2 and 3.

=== Exam1 and the Interim Assessment ===

Each problem solution in the exam is graded with a fractional score from 0 to 1 point, and the entire exam with the value (before rounding)

Exam1 = 8 * ord + 2 * adv, where

ord = (the sum of points given for ordinary problems) / #(ordinary problems);

adv = (the sum of points given for bonus problems) / #(bonus problems).

The Interim grade 1 is computed past Module 1 and equals:

Interim1 = round(0.5 * HW_A + 0.5 * Exam1).

(Here and everywhere, rounding is according to arithmetic rules.)

=== Colloquium ===
For each of the 'definition' two questions, the student is given a score from 0 to 2 points, and from 0 to 4 points for the ‘proof’ question (all in fractional values).
The Colloq grade is computed the following way (before rounding):

Colloq = 10 * (the sum of points given) / 8.

=== Bonuses ===
Each student is given a score according to his progress in bonus activities, which results in the grade

Bonus = 10 * #(points given) / #(points possible).

The number of possible points varies but it is between 1 and 25 usually.

=== Exam2, the Second Interim, and the Final Assessment ===
Each problem solution in exam is graded with a fractional score from 0 to 1 point, and the entire exam with the value (before rounding)

Exam2 = 8 * ord + 2 * adv, where

ord = (the sum of points given for ordinary problems) / #(ordinary problems);

adv = (the sum of points given for bonus problems) / #(bonus problems).

The Interim grade 2 is computed past Module 3 and equals:

Interim2 = round(0.295 * HW_B + 0.295 * Colloq + 0.06 * Bonus + 0.35 * Exam2).

The final grade for the course is

Final = round(0.3 * Interim1 + 0.7 * Interim 2)

Generally, '''nobody is exempt from the examinations'''.

== Exam retaking ==
Examinations 1 and 2 are subject to be retaken if either the Interim1 or Final grade, respectively, is unsatisfactory (i.e., < 4). Retaking an exam is similar to the regular examination. The resulting grade is substituted for that of the latter (that is, retake grade is assigned to the variable Exami in the respective formula, whose value is then reevaluated). Those whose Interim or Final grade is still unsatisfactory after the first retake will have a (tough) choice to make.

Please take into account the following regulation according to the ''ПОПАТКУС'':
<blockquote>
On the first and second retake the cumulative course grade is taken into consideration. In case of receiving an unsatisfactory final grade after the first retake, the student may refuse to participate in the second retake and repeat the course according to the individual curricula. Cumulative grade is formed again as a result of repeated course. After the completion of the repeated course, the student is given a second retake only, from which the student has previously refused.
</blockquote>

The 'cumulative grade' here means all the variables in the grading formulas except Exami, which are the only ones to be retaken. The 'second retake' is similar to the first one and it is evaluated according to the same formula with the same values of 'cumulative' variables. This poses an obvious risk for anyone whose 'cumulatives' are low!

== Recommended reading ==
''Please notice that '''The Book''' for our Course does not exist. The latter is based on many sources.''

# Anderson J. A., Discrete Mathematics With Combinatorics. Prentice Hall, 2003.
# Biggs N. L., Discrete mathematics. 2nd ed., New York; Oxford: Oxford University Press, 2004.
# Gavrilov G. P., Sapozhenko A. A. Problems and Exercises in Discrete Mathematics. Kluwer Texts in the Mathematical Sciences 14. Springer, 1996.
# [http://courses.csail.mit.edu/6.042/spring17/mcs.pdf Lehman E., Thomson Leighton F., Meyer A. R. Mathematics for Computer Science, 2017.]
# [http://www.cs.elte.hu/~lovasz/dmbook.ps Lovasz L., Vesztergombi K. Discrete Mathematics. Lecture Notes; Yale University, 1999.]
# Melnikov O., Sarvanov V., Tyshkevich R., Yemelichev V., Zverovich I. Exercises in Graph Theory. Kluwer Texts in the Mathematical Sciences 19. Springer, 1998.
# Rosen K. H. Discrete Mathematics and Its Applications. McGraw-Hill, 1999.
# Stein C., Drysdale R. L., Bogart K. Discrete mathematics for computer scientists. Addison-Wesley, 2010.
# Vinogradov I. M. Elements of number theory. Dover, 1954.

=== In Russian ===
''If you understand Russian (by any chance), you will probably benefit from reading the following books.''

# Виноградов И. М. Основы теории чисел. 9-е изд., М.: Наука, 1981.
# [http://rubtsov.su/public/DM-HSE-Draft.pdf Вялый М., Подольский В., Рубцов А., Шварц Д., Шень А. Лекции по дискретной математике.]
# Гаврилов Г. П., Сапоженко А. А. Задачи и упражнения по дискретной математике. 3-е изд., М.: ФИЗМАТЛИТ, 2004.
# [https://drive.google.com/file/d/1RM6KX_reBFwUXesWGUEu0sFn2NCaBgvz/view?usp=sharing Дашков Е. В. Введение в математическую логику. Множества и отношения. М.: МФТИ, 2019.]
# Зубков А. М., Севастьянов Б. А., Чистяков В. П. Сборник задач по теории вероятностей. 2-е изд., М.: Наука, 1989.
# Мельников О. И. Теория графов в занимательных задачах. 5-е изд., М.: Книжный дом "ЛИБРОКОМ", 2013.
# [http://www.mccme.ru/free-books/shen/shen-induction.pdf Шень А., Математическая индукция. 5-е изд, М.: МЦНМО, 2016.]

Discrete Mathematics 2 DSBA 2024/25

2024-09-24T07:29:52Z

Brdan: /* About */

= About =
This page contains basic information for the course Discrete Mathematics 2 in 2023/2024 academic year at Bachelor’s Programme 'HSE and University of London Double Degree Programme in Data Science and Business Analytics' (DSBA).

= [https://edu.hse.ru/course/view.php?id=216822 Smart LMS] =

= Professors and assistants =

The lecturer of the course in 2024 fall term is Boris Radislavovich Danilov (brdanilov@gmail.com).

== Seminar instructors ==
{| class="wikitable" style="text-align:center"
|-
! Group !! 221 !! 222 !! 223 !! 224
|-
|| Teachers || colspan="2" | [https://t.me/brdann Boris Danilov] || colspan="2" | [https://t.me/carlosbuitrago Carlos Buitrago]
|-
|| Assistants || [https://t.me/svklevtsova417 Клевцова Снежана] || [https://t.me/rinpmchs Шередеко Арина] || [https://t.me/@mashha_soboleva Соболева Мария] || [https://t.me/Alyona_Chislova Алёна Числова]
|-
|| Lecturer’s assistant || colspan="4"| [https://t.me/Alyona_Chislova Алёна Числова]
|}

= Midterm Test =

Midterm test is held past the end of the first module.

= Exam =

Exam is held at the end of the course.

= Grading =
Grade <Final grade> for the course is determined by the formula:

<Final grade> = min(10, round( 0.23 * <HA> + 0.15 * <QZ> + 0.23 * <MT> + 0.39 * <FT>),

where <HA>, <QZ>, <MT>, <FT> are grades for interim assessment activities:

* <HA> - Homework assignments
* <QZ> - Quizzes (small control works on lectures and seminars)
* <MT> - Midterm test
* <FT> - Final test (exam)

All grades <HA>, <QZ>, <MT>, <FT> are rational numbers between 0 and 20; grade above 10 is considered "bonus score" for "starred" exercises.

Rounding in the formula means rounding to the nearest integer, tie-values are rounded up.

== Automatic pass ==

If <AU> by the formula below is >=7 then by automatic pass <Final grade> = round(<AU>) 
<AU> = min(10, 0.36 * <HA> + 0.28 * <QZ> + 0.36 * <MT>) 
Please note that expression for <AU> does NOT include rounding.

Discrete Mathematics 2 DSBA 2024/25

2024-09-23T23:57:15Z

Brdan:

= About =
This page contains basic information for the course Discrete Mathematics 2 in 2023/2024 academic year at Bachelor’s Programme 'HSE and University of London Double Degree Programme in Data Science and Business Analytics' (DSBA).

More information about the course including lecture presentations, seminar sheets in [https://edu.hse.ru/course/view.php?id=216822 Smart LMS].

= Professors and assistants =

The lecturer of the course in 2024 fall term is Boris Radislavovich Danilov (brdanilov@gmail.com).

== Seminar instructors ==
{| class="wikitable" style="text-align:center"
|-
! Group !! 221 !! 222 !! 223 !! 224
|-
|| Teachers || colspan="2" | [https://t.me/brdann Boris Danilov] || colspan="2" | [https://t.me/carlosbuitrago Carlos Buitrago]
|-
|| Assistants || [https://t.me/svklevtsova417 Клевцова Снежана] || [https://t.me/rinpmchs Шередеко Арина] || [https://t.me/@mashha_soboleva Соболева Мария] || [https://t.me/Alyona_Chislova Алёна Числова]
|-
|| Lecturer’s assistant || colspan="4"| [https://t.me/Alyona_Chislova Алёна Числова]
|}

= Midterm Test =

Midterm test is held past the end of the first module.

= Exam =

Exam is held at the end of the course.

= Grading =
Grade <Final grade> for the course is determined by the formula:

<Final grade> = min(10, round( 0.23 * <HA> + 0.15 * <QZ> + 0.23 * <MT> + 0.39 * <FT>),

where <HA>, <QZ>, <MT>, <FT> are grades for interim assessment activities:

* <HA> - Homework assignments
* <QZ> - Quizzes (small control works on lectures and seminars)
* <MT> - Midterm test
* <FT> - Final test (exam)

All grades <HA>, <QZ>, <MT>, <FT> are rational numbers between 0 and 20; grade above 10 is considered "bonus score" for "starred" exercises.

Rounding in the formula means rounding to the nearest integer, tie-values are rounded up.

== Automatic pass ==

If <AU> by the formula below is >=7 then by automatic pass <Final grade> = round(<AU>) 
<AU> = min(10, 0.36 * <HA> + 0.28 * <QZ> + 0.36 * <MT>) 
Please note that expression for <AU> does NOT include rounding.

Discrete Mathematics 2 DSBA 2024/25

2024-09-23T23:55:23Z

Brdan: /* About */

= About =
This page contains basic information for the course Discrete Mathematics 2 in 2023/2024 academic year at Bachelor’s Programme 'HSE and University of London Double Degree Programme in Data Science and Business Analytics' (DSBA).

More information about the course including lecture presentations, seminar sheets in [https://edu.hse.ru/course/view.php?id=216822 Smart LMS].

= Professors and assistants =

The lecturer of the course in 2024 fall term is Boris Radislavovich Danilov (brdanilov@gmail.com).

== Seminar instructors ==
{| class="wikitable" style="text-align:center"
|-
! Group !! 221 !! 222 !! 223 !! 224
|-
|| Teachers || colspan="2" | [https://t.me/brdann Boris Danilov] || colspan="2" | [https://t.me/carlosbuitrago Carlos Buitrago]
|-
|| Assistants || [https://t.me/svklevtsova417 Клевцова Снежана] || [https://t.me/rinpmchs Шередеко Арина] || [https://t.me/@mashha_soboleva Соболева Мария] || [https://t.me/Alyona_Chislova Алёна Числова]
|-
|| Lecturer’s assistant || colspan="4"| [https://t.me/Alyona_Chislova Алёна Числова]
|}

= Lectures =
* [https://disk.yandex.ru/i/CwQMNwEFkFtW8A Introduction]
* [https://disk.yandex.ru/i/WHN23DA2gsnJBg Lecture 1]
* [https://disk.yandex.ru/i/SA5_NjXj1RRzZw Lecture 2]
* [https://disk.yandex.ru/i/IHuJi9BGNmG3-g Lecture 3]

= Seminar sheets =
* [https://disk.yandex.ru/i/ta7w7La6GMwMKw Seminar 1]
* [https://disk.yandex.ru/i/ja4iIFBH3cxmnQ Seminar 2]
* [https://disk.yandex.ru/i/fJ2AwfXJGvZy9A Seminar 3]

= Midterm Test =

Midterm test is held past the end of the first module.

= Exam =

Exam is held at the end of the course.

= Grading =
Grade <Final grade> for the course is determined by the formula:

<Final grade> = min(10, round( 0.23 * <HA> + 0.15 * <QZ> + 0.23 * <MT> + 0.39 * <FT>),

where <HA>, <QZ>, <MT>, <FT> are grades for interim assessment activities:

* <HA> - Homework assignments
* <QZ> - Quizzes (small control works on seminars)
* <MT> - Midterm test
* <FT> - Final test (exam)

All grades <HA>, <QZ>, <MT>, <FT> are rational numbers between 0 and 20; grade above 10 is considered "bonus score" for "starred" exercises.

Rounding in the formula means rounding to the nearest integer, tie-values are rounded up.

== Automatic pass ==

If <AU> by the formula below is >=7 then by automatic pass <Final grade> = round(<AU>) 
<AU> = min(10, 0.36 * <HA> + 0.28 * <QZ> + 0.36 * <MT>) 
Please note that expression for <AU> does NOT include rounding.

Discrete Mathematics DSBA 2024/2025

2024-09-23T13:57:22Z

Brdan: /* Assignment deadlines */

== Instructors ==

=== The lecturer ===
My name is Evgeny Dashkov. Feel free to contact me via email: edashkov@gmail.com, [https://t.me/edashkov Telegram], or [https://vk.com/evgeny.v.dashkov VK].

My Assistant (the person responsible for the tables etc.): [https://t.me/elizaaaa_5 Elizaveta Levshina].

=== Seminar Instructors and Teaching Assistants ===
{| class="wikitable" style="text-align:center"
|-
! Group !! 241 !! 242 !! 243 !! 244 !! 245 !! 246
|-
|| Teachers || [https://t.me/edashkov Evgeny Dashkov] ||colspan="2"| [https://t.me/brdann Boris Danilov]|| colspan="3"| [https://t.me/DiegBuitrago Diego Buitrago] ||
|-
|| Teaching Assistants || [https://t.me/svbudygin Sergei Budygin] || [https://t.me/Avgustine_iw Zakhar Zinkin] || [https://t.me/svnsrg Sergey Savin] || [https://t.me/NaviMash Ivan Mashkarin] || [https://t.me/underpl Maxim Titov] || [https://t.me/almanmaria Maria Krotova]
|}

=== Whom should I ask? ===

If you have a question or comment concerning the mathematical content of our course, it is best to post it to our [https://t.me/joinchat/T_YTN4IG1vAJNWT9 student chat]. Alternatively, you may address your question to your Teaching Assistant, Seminar Instructor or the Lecturer (say, if your question discloses an important idea for a HW problem). It is much better to ask and get to know than not to ask and remain ignorant. '''Please do not hesitate to ask your mathematical questions!'''

If you need a more detailed consultation concerning the course's mathematics, please be informed that our Teaching Assistants usually hold periodic consultations while the Seminar Instructors and Lecturer have some designated time for counseling students. Still, the best thing to do is to arrange a consultation in advance via a personal communication.

Homework-grading related questions should be directed to your teaching assistant first; then to your seminar instructor and to the lecturer just in case of any disagreement.

Organizational, administrative, legal or paperwork questions must be addressed to the Student Service Center, Study Office or other relevant offices first and foremost. If you have been redirected to us with such a question nevertheless, please contact the Lecturer's Assistant first.

== Current performance ==

[https://docs.google.com/spreadsheets/d/1632c9OT4ICCe5X3A1Obc1rH69dNpIEy_FEghK1vyM8o/edit?usp=drive_link The Table].

== Homework ==
The homework includes a few problem sets, one in a fortnight or so (the deadlines are announced on giving each set). Every problem set consists of about 10 – 15 problems, some of which are labeled as ‘bonus’ while all the remaining are considered ‘ordinary’. These sets may be subdivided further for students’ convenience.

A student may be required to 'defend' (i.e., to explain orally) his written solution to any problem. His grade for the problem may be decreased if he fails to do so properly.

== Exam 1 ==
A written examination is held past Module 1. Students may not consult any sources during the exam. The examination takes about 120 minutes. Some problems of the exam are labeled as ‘bonus’; the others are ‘ordinary’.

== Colloquium ==
An oral colloquium is held at the beginning of Module 3. Each student is given two questions concerning statements and definitions as well as one question requiring a proof. After no less than 45 minutes of preparation (when using any literature is allowed), the student is required to answer ‘from scratch’, that is, with no recourse to any materials. The examiner may pose additional questions as he sees fit.


== Exam 2 ==
A written examination is held past Module 3. Students may not consult any sources during the exam. The examination takes about 120 minutes. Some problems of the exam are labeled as ‘bonus’; the others are ‘ordinary’.

== Bonus activities ==
Throughout the course, the students may be graded for a variety of ‘bonus activities’ (like quizzes, etc.) either offline or online.

== Course materials ==

[https://t.me/joinchat/T_YTN4IG1vAJNWT9 Course chat]. This is our primary outlet for course announcements, questions, and discussions. '''Please join it!'''

=== Lecture notes ===

[https://drive.google.com/file/d/1mmNLLQ0--EDihGNRKwSyXLOA1KL7A0lD/view?usp=sharing Original English version]

[https://drive.google.com/drive/folders/1cTCdJtVVtO9uDgIKE8HY0qhl285tzOo1?usp=drive_link A Russian translation by volunteering students] (you are welcome to [https://t.me/sigma_algebraa join] their ranks)

=== Classes recordings ===

=== Lecture video archive ===

=== Other resources ===
* [https://tinyurl.com/rwky5vmk The Course's Google Directory]

* [https://www.youtube.com/playlist?list=PL1Uob8iPTHGTidrmrqEHTJ96Pt3-PmML4 Past years' videos]

* We have a [https://meet.edashkov.net.ru dedicated server] to hold an online meeting if we need one.

== Problem sets ==

=== Class problems ===

* [https://drive.google.com/file/d/1EP-diSuOTn9f0ryg18Z2w0xjEp8j0bnl/view?usp=drive_link Problem Set 1]



=== Assignment deadlines ===

{| class="wikitable"
|-
! Home problem set !! colspan="11" | Deadline
|-
| || 241 || 242 || 243 || 244 || 245 || 246
|-
| [https://drive.google.com/file/d/15vCxTrNMwagS4rqQnUzdLParTqOP8y5P/view?usp=drive_link HW1a ] || Sep 19 || Sep 19 || Sep 19 || Sep 24 || Sep 24 || Sep 24
|-
| [https://drive.google.com/file/d/1PTJY1PEG-wUlTqUGXT8KWRsll8H0XLb0/view?usp=drive_link HW1b] || Oct 3 || Oct 3 || Oct 3 || || ||
|}


'''Each deadline is set by the respective group's instructor.'''

== Assessment and Grading ==

=== Homework ===

The homework is graded in two batches: one (HW_A) includes everything to be submitted in Module1 and the other (HW_B) includes all the rest. For each problem, either ordinary or bonus, the student is given a score from 0 to 1 point (in fractional values) according to the progress he made.

Grade HW_A is computed the following way (before rounding):

HW_A = 8 * ord + 2 * adv, where

ord = (the sum of points given for ordinary problems) / #(ordinary problems);

adv = (the sum of points given for bonus problems) / #(bonus problems).

Grade HW_B is computed similarly but for its respective period of Modules 2 and 3.

=== Exam1 and the Interim Assessment ===

Each problem solution in the exam is graded with a fractional score from 0 to 1 point, and the entire exam with the value (before rounding)

Exam1 = 8 * ord + 2 * adv, where

ord = (the sum of points given for ordinary problems) / #(ordinary problems);

adv = (the sum of points given for bonus problems) / #(bonus problems).

The Interim grade 1 is computed past Module 1 and equals:

Interim1 = round(0.5 * HW_A + 0.5 * Exam1).

(Here and everywhere, rounding is according to arithmetic rules.)

=== Colloquium ===
For each of the 'definition' two questions, the student is given a score from 0 to 2 points, and from 0 to 4 points for the ‘proof’ question (all in fractional values).
The Colloq grade is computed the following way (before rounding):

Colloq = 10 * (the sum of points given) / 8.

=== Bonuses ===
Each student is given a score according to his progress in bonus activities, which results in the grade

Bonus = 10 * #(points given) / #(points possible).

The number of possible points varies but it is between 1 and 25 usually.

=== Exam2, the Second Interim, and the Final Assessment ===
Each problem solution in exam is graded with a fractional score from 0 to 1 point, and the entire exam with the value (before rounding)

Exam2 = 8 * ord + 2 * adv, where

ord = (the sum of points given for ordinary problems) / #(ordinary problems);

adv = (the sum of points given for bonus problems) / #(bonus problems).

The Interim grade 2 is computed past Module 3 and equals:

Interim2 = round(0.295 * HW_B + 0.295 * Colloq + 0.06 * Bonus + 0.35 * Exam2).

The final grade for the course is

Final = round(0.3 * Interim1 + 0.7 * Interim 2)

Generally, '''nobody is exempt from the examinations'''.

== Exam retaking ==
Examinations 1 and 2 are subject to be retaken if either the Interim1 or Final grade, respectively, is unsatisfactory (i.e., < 4). Retaking an exam is similar to the regular examination. The resulting grade is substituted for that of the latter (that is, retake grade is assigned to the variable Exami in the respective formula, whose value is then reevaluated). Those whose Interim or Final grade is still unsatisfactory after the first retake will have a (tough) choice to make.

Please take into account the following regulation according to the ''ПОПАТКУС'':
<blockquote>
On the first and second retake the cumulative course grade is taken into consideration. In case of receiving an unsatisfactory final grade after the first retake, the student may refuse to participate in the second retake and repeat the course according to the individual curricula. Cumulative grade is formed again as a result of repeated course. After the completion of the repeated course, the student is given a second retake only, from which the student has previously refused.
</blockquote>

The 'cumulative grade' here means all the variables in the grading formulas except Exami, which are the only ones to be retaken. The 'second retake' is similar to the first one and it is evaluated according to the same formula with the same values of 'cumulative' variables. This poses an obvious risk for anyone whose 'cumulatives' are low!

== Recommended reading ==
''Please notice that '''The Book''' for our Course does not exist. The latter is based on many sources.''

# Anderson J. A., Discrete Mathematics With Combinatorics. Prentice Hall, 2003.
# Biggs N. L., Discrete mathematics. 2nd ed., New York; Oxford: Oxford University Press, 2004.
# Gavrilov G. P., Sapozhenko A. A. Problems and Exercises in Discrete Mathematics. Kluwer Texts in the Mathematical Sciences 14. Springer, 1996.
# [http://courses.csail.mit.edu/6.042/spring17/mcs.pdf Lehman E., Thomson Leighton F., Meyer A. R. Mathematics for Computer Science, 2017.]
# [http://www.cs.elte.hu/~lovasz/dmbook.ps Lovasz L., Vesztergombi K. Discrete Mathematics. Lecture Notes; Yale University, 1999.]
# Melnikov O., Sarvanov V., Tyshkevich R., Yemelichev V., Zverovich I. Exercises in Graph Theory. Kluwer Texts in the Mathematical Sciences 19. Springer, 1998.
# Rosen K. H. Discrete Mathematics and Its Applications. McGraw-Hill, 1999.
# Stein C., Drysdale R. L., Bogart K. Discrete mathematics for computer scientists. Addison-Wesley, 2010.
# Vinogradov I. M. Elements of number theory. Dover, 1954.

=== In Russian ===
''If you understand Russian (by any chance), you will probably benefit from reading the following books.''

# Виноградов И. М. Основы теории чисел. 9-е изд., М.: Наука, 1981.
# [http://rubtsov.su/public/DM-HSE-Draft.pdf Вялый М., Подольский В., Рубцов А., Шварц Д., Шень А. Лекции по дискретной математике.]
# Гаврилов Г. П., Сапоженко А. А. Задачи и упражнения по дискретной математике. 3-е изд., М.: ФИЗМАТЛИТ, 2004.
# [https://drive.google.com/file/d/1RM6KX_reBFwUXesWGUEu0sFn2NCaBgvz/view?usp=sharing Дашков Е. В. Введение в математическую логику. Множества и отношения. М.: МФТИ, 2019.]
# Зубков А. М., Севастьянов Б. А., Чистяков В. П. Сборник задач по теории вероятностей. 2-е изд., М.: Наука, 1989.
# Мельников О. И. Теория графов в занимательных задачах. 5-е изд., М.: Книжный дом "ЛИБРОКОМ", 2013.
# [http://www.mccme.ru/free-books/shen/shen-induction.pdf Шень А., Математическая индукция. 5-е изд, М.: МЦНМО, 2016.]

Discrete Mathematics DSBA 2024/2025

2024-09-23T13:56:58Z

Brdan: /* Assignment deadlines */

== Instructors ==

=== The lecturer ===
My name is Evgeny Dashkov. Feel free to contact me via email: edashkov@gmail.com, [https://t.me/edashkov Telegram], or [https://vk.com/evgeny.v.dashkov VK].

My Assistant (the person responsible for the tables etc.): [https://t.me/elizaaaa_5 Elizaveta Levshina].

=== Seminar Instructors and Teaching Assistants ===
{| class="wikitable" style="text-align:center"
|-
! Group !! 241 !! 242 !! 243 !! 244 !! 245 !! 246
|-
|| Teachers || [https://t.me/edashkov Evgeny Dashkov] ||colspan="2"| [https://t.me/brdann Boris Danilov]|| colspan="3"| [https://t.me/DiegBuitrago Diego Buitrago] ||
|-
|| Teaching Assistants || [https://t.me/svbudygin Sergei Budygin] || [https://t.me/Avgustine_iw Zakhar Zinkin] || [https://t.me/svnsrg Sergey Savin] || [https://t.me/NaviMash Ivan Mashkarin] || [https://t.me/underpl Maxim Titov] || [https://t.me/almanmaria Maria Krotova]
|}

=== Whom should I ask? ===

If you have a question or comment concerning the mathematical content of our course, it is best to post it to our [https://t.me/joinchat/T_YTN4IG1vAJNWT9 student chat]. Alternatively, you may address your question to your Teaching Assistant, Seminar Instructor or the Lecturer (say, if your question discloses an important idea for a HW problem). It is much better to ask and get to know than not to ask and remain ignorant. '''Please do not hesitate to ask your mathematical questions!'''

If you need a more detailed consultation concerning the course's mathematics, please be informed that our Teaching Assistants usually hold periodic consultations while the Seminar Instructors and Lecturer have some designated time for counseling students. Still, the best thing to do is to arrange a consultation in advance via a personal communication.

Homework-grading related questions should be directed to your teaching assistant first; then to your seminar instructor and to the lecturer just in case of any disagreement.

Organizational, administrative, legal or paperwork questions must be addressed to the Student Service Center, Study Office or other relevant offices first and foremost. If you have been redirected to us with such a question nevertheless, please contact the Lecturer's Assistant first.

== Current performance ==

[https://docs.google.com/spreadsheets/d/1632c9OT4ICCe5X3A1Obc1rH69dNpIEy_FEghK1vyM8o/edit?usp=drive_link The Table].

== Homework ==
The homework includes a few problem sets, one in a fortnight or so (the deadlines are announced on giving each set). Every problem set consists of about 10 – 15 problems, some of which are labeled as ‘bonus’ while all the remaining are considered ‘ordinary’. These sets may be subdivided further for students’ convenience.

A student may be required to 'defend' (i.e., to explain orally) his written solution to any problem. His grade for the problem may be decreased if he fails to do so properly.

== Exam 1 ==
A written examination is held past Module 1. Students may not consult any sources during the exam. The examination takes about 120 minutes. Some problems of the exam are labeled as ‘bonus’; the others are ‘ordinary’.

== Colloquium ==
An oral colloquium is held at the beginning of Module 3. Each student is given two questions concerning statements and definitions as well as one question requiring a proof. After no less than 45 minutes of preparation (when using any literature is allowed), the student is required to answer ‘from scratch’, that is, with no recourse to any materials. The examiner may pose additional questions as he sees fit.


== Exam 2 ==
A written examination is held past Module 3. Students may not consult any sources during the exam. The examination takes about 120 minutes. Some problems of the exam are labeled as ‘bonus’; the others are ‘ordinary’.

== Bonus activities ==
Throughout the course, the students may be graded for a variety of ‘bonus activities’ (like quizzes, etc.) either offline or online.

== Course materials ==

[https://t.me/joinchat/T_YTN4IG1vAJNWT9 Course chat]. This is our primary outlet for course announcements, questions, and discussions. '''Please join it!'''

=== Lecture notes ===

[https://drive.google.com/file/d/1mmNLLQ0--EDihGNRKwSyXLOA1KL7A0lD/view?usp=sharing Original English version]

[https://drive.google.com/drive/folders/1cTCdJtVVtO9uDgIKE8HY0qhl285tzOo1?usp=drive_link A Russian translation by volunteering students] (you are welcome to [https://t.me/sigma_algebraa join] their ranks)

=== Classes recordings ===

=== Lecture video archive ===

=== Other resources ===
* [https://tinyurl.com/rwky5vmk The Course's Google Directory]

* [https://www.youtube.com/playlist?list=PL1Uob8iPTHGTidrmrqEHTJ96Pt3-PmML4 Past years' videos]

* We have a [https://meet.edashkov.net.ru dedicated server] to hold an online meeting if we need one.

== Problem sets ==

=== Class problems ===

* [https://drive.google.com/file/d/1EP-diSuOTn9f0ryg18Z2w0xjEp8j0bnl/view?usp=drive_link Problem Set 1]



=== Assignment deadlines ===

{| class="wikitable"
|-
! Home problem set !! colspan="11" | Deadline
|-
| || 241 || 242 || 243 || 244 || 245 || 246
|-
| [https://drive.google.com/file/d/15vCxTrNMwagS4rqQnUzdLParTqOP8y5P/view?usp=drive_link HW1a ] || Sep 19 || Sep 19 || Sep 19 || Sep 24 || Sep 24 || Sep 24
|-
| [https://drive.google.com/file/d/1PTJY1PEG-wUlTqUGXT8KWRsll8H0XLb0/view?usp=drive_link HW1b] || Oct 3 || Oct 3 || || || ||
|}


'''Each deadline is set by the respective group's instructor.'''

== Assessment and Grading ==

=== Homework ===

The homework is graded in two batches: one (HW_A) includes everything to be submitted in Module1 and the other (HW_B) includes all the rest. For each problem, either ordinary or bonus, the student is given a score from 0 to 1 point (in fractional values) according to the progress he made.

Grade HW_A is computed the following way (before rounding):

HW_A = 8 * ord + 2 * adv, where

ord = (the sum of points given for ordinary problems) / #(ordinary problems);

adv = (the sum of points given for bonus problems) / #(bonus problems).

Grade HW_B is computed similarly but for its respective period of Modules 2 and 3.

=== Exam1 and the Interim Assessment ===

Each problem solution in the exam is graded with a fractional score from 0 to 1 point, and the entire exam with the value (before rounding)

Exam1 = 8 * ord + 2 * adv, where

ord = (the sum of points given for ordinary problems) / #(ordinary problems);

adv = (the sum of points given for bonus problems) / #(bonus problems).

The Interim grade 1 is computed past Module 1 and equals:

Interim1 = round(0.5 * HW_A + 0.5 * Exam1).

(Here and everywhere, rounding is according to arithmetic rules.)

=== Colloquium ===
For each of the 'definition' two questions, the student is given a score from 0 to 2 points, and from 0 to 4 points for the ‘proof’ question (all in fractional values).
The Colloq grade is computed the following way (before rounding):

Colloq = 10 * (the sum of points given) / 8.

=== Bonuses ===
Each student is given a score according to his progress in bonus activities, which results in the grade

Bonus = 10 * #(points given) / #(points possible).

The number of possible points varies but it is between 1 and 25 usually.

=== Exam2, the Second Interim, and the Final Assessment ===
Each problem solution in exam is graded with a fractional score from 0 to 1 point, and the entire exam with the value (before rounding)

Exam2 = 8 * ord + 2 * adv, where

ord = (the sum of points given for ordinary problems) / #(ordinary problems);

adv = (the sum of points given for bonus problems) / #(bonus problems).

The Interim grade 2 is computed past Module 3 and equals:

Interim2 = round(0.295 * HW_B + 0.295 * Colloq + 0.06 * Bonus + 0.35 * Exam2).

The final grade for the course is

Final = round(0.3 * Interim1 + 0.7 * Interim 2)

Generally, '''nobody is exempt from the examinations'''.

== Exam retaking ==
Examinations 1 and 2 are subject to be retaken if either the Interim1 or Final grade, respectively, is unsatisfactory (i.e., < 4). Retaking an exam is similar to the regular examination. The resulting grade is substituted for that of the latter (that is, retake grade is assigned to the variable Exami in the respective formula, whose value is then reevaluated). Those whose Interim or Final grade is still unsatisfactory after the first retake will have a (tough) choice to make.

Please take into account the following regulation according to the ''ПОПАТКУС'':
<blockquote>
On the first and second retake the cumulative course grade is taken into consideration. In case of receiving an unsatisfactory final grade after the first retake, the student may refuse to participate in the second retake and repeat the course according to the individual curricula. Cumulative grade is formed again as a result of repeated course. After the completion of the repeated course, the student is given a second retake only, from which the student has previously refused.
</blockquote>

The 'cumulative grade' here means all the variables in the grading formulas except Exami, which are the only ones to be retaken. The 'second retake' is similar to the first one and it is evaluated according to the same formula with the same values of 'cumulative' variables. This poses an obvious risk for anyone whose 'cumulatives' are low!

== Recommended reading ==
''Please notice that '''The Book''' for our Course does not exist. The latter is based on many sources.''

# Anderson J. A., Discrete Mathematics With Combinatorics. Prentice Hall, 2003.
# Biggs N. L., Discrete mathematics. 2nd ed., New York; Oxford: Oxford University Press, 2004.
# Gavrilov G. P., Sapozhenko A. A. Problems and Exercises in Discrete Mathematics. Kluwer Texts in the Mathematical Sciences 14. Springer, 1996.
# [http://courses.csail.mit.edu/6.042/spring17/mcs.pdf Lehman E., Thomson Leighton F., Meyer A. R. Mathematics for Computer Science, 2017.]
# [http://www.cs.elte.hu/~lovasz/dmbook.ps Lovasz L., Vesztergombi K. Discrete Mathematics. Lecture Notes; Yale University, 1999.]
# Melnikov O., Sarvanov V., Tyshkevich R., Yemelichev V., Zverovich I. Exercises in Graph Theory. Kluwer Texts in the Mathematical Sciences 19. Springer, 1998.
# Rosen K. H. Discrete Mathematics and Its Applications. McGraw-Hill, 1999.
# Stein C., Drysdale R. L., Bogart K. Discrete mathematics for computer scientists. Addison-Wesley, 2010.
# Vinogradov I. M. Elements of number theory. Dover, 1954.

=== In Russian ===
''If you understand Russian (by any chance), you will probably benefit from reading the following books.''

# Виноградов И. М. Основы теории чисел. 9-е изд., М.: Наука, 1981.
# [http://rubtsov.su/public/DM-HSE-Draft.pdf Вялый М., Подольский В., Рубцов А., Шварц Д., Шень А. Лекции по дискретной математике.]
# Гаврилов Г. П., Сапоженко А. А. Задачи и упражнения по дискретной математике. 3-е изд., М.: ФИЗМАТЛИТ, 2004.
# [https://drive.google.com/file/d/1RM6KX_reBFwUXesWGUEu0sFn2NCaBgvz/view?usp=sharing Дашков Е. В. Введение в математическую логику. Множества и отношения. М.: МФТИ, 2019.]
# Зубков А. М., Севастьянов Б. А., Чистяков В. П. Сборник задач по теории вероятностей. 2-е изд., М.: Наука, 1989.
# Мельников О. И. Теория графов в занимательных задачах. 5-е изд., М.: Книжный дом "ЛИБРОКОМ", 2013.
# [http://www.mccme.ru/free-books/shen/shen-induction.pdf Шень А., Математическая индукция. 5-е изд, М.: МЦНМО, 2016.]

Discrete Mathematics 2 DSBA 2024/25

2024-09-16T20:40:49Z

Brdan: /* Lectures */

= About =
This page contains basic information for the course Discrete Mathematics 2 in 2023/2024 academic year at Bachelor’s Programme 'HSE and University of London Double Degree Programme in Data Science and Business Analytics' (DSBA).

Find more information about the course including lecture presentations, seminar sheets in Smart LMS soon.

[https://t.me/+fVFTFIuG7ho3OGZi DM2 Public Chat]

= Professors and assistants =

The lecturer of the course in 2024 fall term is Boris Radislavovich Danilov (brdanilov@gmail.com).

== Seminar instructors ==
{| class="wikitable" style="text-align:center"
|-
! Group !! 221 !! 222 !! 223 !! 224
|-
|| Teachers || colspan="2" | [https://t.me/brdann Boris Danilov] || colspan="2" | [https://t.me/carlosbuitrago Carlos Buitrago]
|-
|| Assistants || [https://t.me/svklevtsova417 Клевцова Снежана] || [https://t.me/rinpmchs Шередеко Арина] || [https://t.me/@mashha_soboleva Соболева Мария] || [https://t.me/kkkkkkkkirilllll Будяк Кирилл]
|-
|| Lecturer’s assistant || colspan="4"| [https://t.me/Alyona_Chislova Алёна Числова]
|}

= Lectures =
* [https://disk.yandex.ru/i/CwQMNwEFkFtW8A Introduction]
* [https://disk.yandex.ru/i/WHN23DA2gsnJBg Lecture 1]
* [https://disk.yandex.ru/i/SA5_NjXj1RRzZw Lecture 2]
* [https://disk.yandex.ru/i/IHuJi9BGNmG3-g Lecture 3]

= Seminar sheets =
* [https://disk.yandex.ru/i/ta7w7La6GMwMKw Seminar 1]
* [https://disk.yandex.ru/i/ja4iIFBH3cxmnQ Seminar 2]
* [https://disk.yandex.ru/i/fJ2AwfXJGvZy9A Seminar 3]

= Midterm Test =

Midterm test is held past the end of the first module.

= Exam =

Exam is held at the end of the course.

= Grading =
Grade <Final grade> for the course is determined by the formula:

<Final grade> = min(10, round( 0.23 * <HA> + 0.15 * <QZ> + 0.23 * <MT> + 0.39 * <FT>),

where <HA>, <QZ>, <MT>, <FT> are grades for interim assessment activities:

* <HA> - Homework assignments
* <QZ> - Quizzes (small control works on seminars)
* <MT> - Midterm test
* <FT> - Final test (exam)

All grades <HA>, <QZ>, <MT>, <FT> are rational numbers between 0 and 20; grade above 10 is considered "bonus score" for "starred" exercises.

Rounding in the formula means rounding to the nearest integer, tie-values are rounded up.

== Automatic pass ==

If <AU> by the formula below is >=7 then by automatic pass <Final grade> = round(<AU>) 
<AU> = min(10, 0.36 * <HA> + 0.28 * <QZ> + 0.36 * <MT>) 
Please note that expression for <AU> does NOT include rounding.

Discrete Mathematics 2 DSBA 2024/25

2024-09-16T20:40:16Z

Brdan: /* Seminar sheets */

= About =
This page contains basic information for the course Discrete Mathematics 2 in 2023/2024 academic year at Bachelor’s Programme 'HSE and University of London Double Degree Programme in Data Science and Business Analytics' (DSBA).

Find more information about the course including lecture presentations, seminar sheets in Smart LMS soon.

[https://t.me/+fVFTFIuG7ho3OGZi DM2 Public Chat]

= Professors and assistants =

The lecturer of the course in 2024 fall term is Boris Radislavovich Danilov (brdanilov@gmail.com).

== Seminar instructors ==
{| class="wikitable" style="text-align:center"
|-
! Group !! 221 !! 222 !! 223 !! 224
|-
|| Teachers || colspan="2" | [https://t.me/brdann Boris Danilov] || colspan="2" | [https://t.me/carlosbuitrago Carlos Buitrago]
|-
|| Assistants || [https://t.me/svklevtsova417 Клевцова Снежана] || [https://t.me/rinpmchs Шередеко Арина] || [https://t.me/@mashha_soboleva Соболева Мария] || [https://t.me/kkkkkkkkirilllll Будяк Кирилл]
|-
|| Lecturer’s assistant || colspan="4"| [https://t.me/Alyona_Chislova Алёна Числова]
|}

= Lectures =
* [https://disk.yandex.ru/i/CwQMNwEFkFtW8A Introduction]
* [https://disk.yandex.ru/i/WHN23DA2gsnJBg Lecture 1]
* [https://disk.yandex.ru/i/SA5_NjXj1RRzZw Lecture 2]

= Seminar sheets =
* [https://disk.yandex.ru/i/ta7w7La6GMwMKw Seminar 1]
* [https://disk.yandex.ru/i/ja4iIFBH3cxmnQ Seminar 2]
* [https://disk.yandex.ru/i/fJ2AwfXJGvZy9A Seminar 3]

= Midterm Test =

Midterm test is held past the end of the first module.

= Exam =

Exam is held at the end of the course.

= Grading =
Grade <Final grade> for the course is determined by the formula:

<Final grade> = min(10, round( 0.23 * <HA> + 0.15 * <QZ> + 0.23 * <MT> + 0.39 * <FT>),

where <HA>, <QZ>, <MT>, <FT> are grades for interim assessment activities:

* <HA> - Homework assignments
* <QZ> - Quizzes (small control works on seminars)
* <MT> - Midterm test
* <FT> - Final test (exam)

All grades <HA>, <QZ>, <MT>, <FT> are rational numbers between 0 and 20; grade above 10 is considered "bonus score" for "starred" exercises.

Rounding in the formula means rounding to the nearest integer, tie-values are rounded up.

== Automatic pass ==

If <AU> by the formula below is >=7 then by automatic pass <Final grade> = round(<AU>) 
<AU> = min(10, 0.36 * <HA> + 0.28 * <QZ> + 0.36 * <MT>) 
Please note that expression for <AU> does NOT include rounding.

Discrete Mathematics 2 DSBA 2024/25

2024-09-12T18:38:09Z

Brdan: /* Seminar instructors */

= About =
This page contains basic information for the course Discrete Mathematics 2 in 2023/2024 academic year at Bachelor’s Programme 'HSE and University of London Double Degree Programme in Data Science and Business Analytics' (DSBA).

Find more information about the course including lecture presentations, seminar sheets in Smart LMS soon.

[https://t.me/+fVFTFIuG7ho3OGZi DM2 Public Chat]

= Professors and assistants =

The lecturer of the course in 2024 fall term is Boris Radislavovich Danilov (brdanilov@gmail.com).

== Seminar instructors ==
{| class="wikitable" style="text-align:center"
|-
! Group !! 221 !! 222 !! 223 !! 224
|-
|| Teachers || colspan="2" | [https://t.me/brdann Boris Danilov] || colspan="2" | [https://t.me/carlosbuitrago Carlos Buitrago]
|-
|| Assistants || [https://t.me/svklevtsova417 Клевцова Снежана] || [https://t.me/rinpmchs Шередеко Арина] || [https://t.me/@mashha_soboleva Соболева Мария] || [https://t.me/kkkkkkkkirilllll Будяк Кирилл]
|-
|| Lecturer’s assistant || colspan="4"| [https://t.me/Alyona_Chislova Алёна Числова]
|}

= Lectures =
* [https://disk.yandex.ru/i/CwQMNwEFkFtW8A Introduction]
* [https://disk.yandex.ru/i/WHN23DA2gsnJBg Lecture 1]
* [https://disk.yandex.ru/i/SA5_NjXj1RRzZw Lecture 2]

= Seminar sheets =
* [https://disk.yandex.ru/i/ta7w7La6GMwMKw Seminar 1]
* [https://disk.yandex.ru/i/ja4iIFBH3cxmnQ Seminar 2]

= Midterm Test =

Midterm test is held past the end of the first module.

= Exam =

Exam is held at the end of the course.

= Grading =
Grade <Final grade> for the course is determined by the formula:

<Final grade> = min(10, round( 0.23 * <HA> + 0.15 * <QZ> + 0.23 * <MT> + 0.39 * <FT>),

where <HA>, <QZ>, <MT>, <FT> are grades for interim assessment activities:

* <HA> - Homework assignments
* <QZ> - Quizzes (small control works on seminars)
* <MT> - Midterm test
* <FT> - Final test (exam)

All grades <HA>, <QZ>, <MT>, <FT> are rational numbers between 0 and 20; grade above 10 is considered "bonus score" for "starred" exercises.

Rounding in the formula means rounding to the nearest integer, tie-values are rounded up.

== Automatic pass ==

If <AU> by the formula below is >=7 then by automatic pass <Final grade> = round(<AU>) 
<AU> = min(10, 0.36 * <HA> + 0.28 * <QZ> + 0.36 * <MT>) 
Please note that expression for <AU> does NOT include rounding.

Discrete Mathematics 2 DSBA 2024/25

2024-09-11T18:08:23Z

Brdan: /* Seminar sheets */

= About =
This page contains basic information for the course Discrete Mathematics 2 in 2023/2024 academic year at Bachelor’s Programme 'HSE and University of London Double Degree Programme in Data Science and Business Analytics' (DSBA).

Find more information about the course including lecture presentations, seminar sheets in Smart LMS soon.

[https://t.me/+fVFTFIuG7ho3OGZi DM2 Public Chat]

= Professors and assistants =

The lecturer of the course in 2024 fall term is Boris Radislavovich Danilov (brdanilov@gmail.com).

== Seminar instructors ==
{| class="wikitable" style="text-align:center"
|-
! Group !! 221 !! 222 !! 223 !! 224
|-
|| Teachers || colspan="2" | [https://t.me/brdann Boris Danilov] || colspan="2" | [https://t.me/carlosbuitrago Carlos Buitrago]
|-
|| Assistants || [https://t.me/svklevtsova417 Клевцова Снежана] || [https://t.me/rinpmchs Шередеко Арина] || [https://t.me/masha_soboleva___ Соболева Мария] || [https://t.me/kkkkkkkkirilllll Будяк Кирилл]
|-
|| Lecturer’s assistant || colspan="4"| [https://t.me/Alyona_Chislova Алёна Числова]
|}

= Lectures =
* [https://disk.yandex.ru/i/CwQMNwEFkFtW8A Introduction]
* [https://disk.yandex.ru/i/WHN23DA2gsnJBg Lecture 1]
* [https://disk.yandex.ru/i/SA5_NjXj1RRzZw Lecture 2]

= Seminar sheets =
* [https://disk.yandex.ru/i/ta7w7La6GMwMKw Seminar 1]
* [https://disk.yandex.ru/i/ja4iIFBH3cxmnQ Seminar 2]

= Midterm Test =

Midterm test is held past the end of the first module.

= Exam =

Exam is held at the end of the course.

= Grading =
Grade <Final grade> for the course is determined by the formula:

<Final grade> = min(10, round( 0.23 * <HA> + 0.15 * <QZ> + 0.23 * <MT> + 0.39 * <FT>),

where <HA>, <QZ>, <MT>, <FT> are grades for interim assessment activities:

* <HA> - Homework assignments
* <QZ> - Quizzes (small control works on seminars)
* <MT> - Midterm test
* <FT> - Final test (exam)

All grades <HA>, <QZ>, <MT>, <FT> are rational numbers between 0 and 20; grade above 10 is considered "bonus score" for "starred" exercises.

Rounding in the formula means rounding to the nearest integer, tie-values are rounded up.

== Automatic pass ==

If <AU> by the formula below is >=7 then by automatic pass <Final grade> = round(<AU>) 
<AU> = min(10, 0.36 * <HA> + 0.28 * <QZ> + 0.36 * <MT>) 
Please note that expression for <AU> does NOT include rounding.

Discrete Mathematics 2 DSBA 2024/25

2024-09-11T18:08:13Z

Brdan: /* Lectures */

= About =
This page contains basic information for the course Discrete Mathematics 2 in 2023/2024 academic year at Bachelor’s Programme 'HSE and University of London Double Degree Programme in Data Science and Business Analytics' (DSBA).

Find more information about the course including lecture presentations, seminar sheets in Smart LMS soon.

[https://t.me/+fVFTFIuG7ho3OGZi DM2 Public Chat]

= Professors and assistants =

The lecturer of the course in 2024 fall term is Boris Radislavovich Danilov (brdanilov@gmail.com).

== Seminar instructors ==
{| class="wikitable" style="text-align:center"
|-
! Group !! 221 !! 222 !! 223 !! 224
|-
|| Teachers || colspan="2" | [https://t.me/brdann Boris Danilov] || colspan="2" | [https://t.me/carlosbuitrago Carlos Buitrago]
|-
|| Assistants || [https://t.me/svklevtsova417 Клевцова Снежана] || [https://t.me/rinpmchs Шередеко Арина] || [https://t.me/masha_soboleva___ Соболева Мария] || [https://t.me/kkkkkkkkirilllll Будяк Кирилл]
|-
|| Lecturer’s assistant || colspan="4"| [https://t.me/Alyona_Chislova Алёна Числова]
|}

= Lectures =
* [https://disk.yandex.ru/i/CwQMNwEFkFtW8A Introduction]
* [https://disk.yandex.ru/i/WHN23DA2gsnJBg Lecture 1]
* [https://disk.yandex.ru/i/SA5_NjXj1RRzZw Lecture 2]

= Seminar sheets =
* [https://disk.yandex.ru/i/ta7w7La6GMwMKw Seminar 1]
* [https://disk.yandex.ru/i/ja4iIFBH3cxmnQ Seminar 2 (draft)]

= Midterm Test =

Midterm test is held past the end of the first module.

= Exam =

Exam is held at the end of the course.

= Grading =
Grade <Final grade> for the course is determined by the formula:

<Final grade> = min(10, round( 0.23 * <HA> + 0.15 * <QZ> + 0.23 * <MT> + 0.39 * <FT>),

where <HA>, <QZ>, <MT>, <FT> are grades for interim assessment activities:

* <HA> - Homework assignments
* <QZ> - Quizzes (small control works on seminars)
* <MT> - Midterm test
* <FT> - Final test (exam)

All grades <HA>, <QZ>, <MT>, <FT> are rational numbers between 0 and 20; grade above 10 is considered "bonus score" for "starred" exercises.

Rounding in the formula means rounding to the nearest integer, tie-values are rounded up.

== Automatic pass ==

If <AU> by the formula below is >=7 then by automatic pass <Final grade> = round(<AU>) 
<AU> = min(10, 0.36 * <HA> + 0.28 * <QZ> + 0.36 * <MT>) 
Please note that expression for <AU> does NOT include rounding.

Discrete Mathematics 2 DSBA 2024/25

2024-09-08T21:45:09Z

Brdan: /* Seminar sheets */

= About =
This page contains basic information for the course Discrete Mathematics 2 in 2023/2024 academic year at Bachelor’s Programme 'HSE and University of London Double Degree Programme in Data Science and Business Analytics' (DSBA).

Find more information about the course including lecture presentations, seminar sheets in Smart LMS soon.

[https://t.me/+fVFTFIuG7ho3OGZi DM2 Public Chat]

= Professors and assistants =

The lecturer of the course in 2024 fall term is Boris Radislavovich Danilov (brdanilov@gmail.com).

== Seminar instructors ==
{| class="wikitable" style="text-align:center"
|-
! Group !! 221 !! 222 !! 223 !! 224
|-
|| Teachers || colspan="2" | [https://t.me/brdann Boris Danilov] || colspan="2" | [https://t.me/carlosbuitrago Carlos Buitrago]
|-
|| Assistants || [https://t.me/svklevtsova417 Клевцова Снежана] || [https://t.me/rinpmchs Шередеко Арина] || [https://t.me/masha_soboleva___ Соболева Мария] || [https://t.me/kkkkkkkkirilllll Будяк Кирилл]
|-
|| Lecturer’s assistant || colspan="4"| [https://t.me/Alyona_Chislova Алёна Числова]
|}

= Lectures =
* [https://disk.yandex.ru/i/CwQMNwEFkFtW8A Introduction]
* [https://disk.yandex.ru/i/WHN23DA2gsnJBg Lecture 1]
* [https://disk.yandex.ru/i/SA5_NjXj1RRzZw Lecture 2 (draft)]

= Seminar sheets =
* [https://disk.yandex.ru/i/ta7w7La6GMwMKw Seminar 1]
* [https://disk.yandex.ru/i/ja4iIFBH3cxmnQ Seminar 2 (draft)]

= Midterm Test =

Midterm test is held past the end of the first module.

= Exam =

Exam is held at the end of the course.

= Grading =
Grade <Final grade> for the course is determined by the formula:

<Final grade> = min(10, round( 0.23 * <HA> + 0.15 * <QZ> + 0.23 * <MT> + 0.39 * <FT>),

where <HA>, <QZ>, <MT>, <FT> are grades for interim assessment activities:

* <HA> - Homework assignments
* <QZ> - Quizzes (small control works on seminars)
* <MT> - Midterm test
* <FT> - Final test (exam)

All grades <HA>, <QZ>, <MT>, <FT> are rational numbers between 0 and 20; grade above 10 is considered "bonus score" for "starred" exercises.

Rounding in the formula means rounding to the nearest integer, tie-values are rounded up.

== Automatic pass ==

If <AU> by the formula below is >=7 then by automatic pass <Final grade> = round(<AU>) 
<AU> = min(10, 0.36 * <HA> + 0.28 * <QZ> + 0.36 * <MT>) 
Please note that expression for <AU> does NOT include rounding.

Discrete Mathematics 2 DSBA 2024/25

2024-09-08T21:42:42Z

Brdan: /* Lectures */

= About =
This page contains basic information for the course Discrete Mathematics 2 in 2023/2024 academic year at Bachelor’s Programme 'HSE and University of London Double Degree Programme in Data Science and Business Analytics' (DSBA).

Find more information about the course including lecture presentations, seminar sheets in Smart LMS soon.

[https://t.me/+fVFTFIuG7ho3OGZi DM2 Public Chat]

= Professors and assistants =

The lecturer of the course in 2024 fall term is Boris Radislavovich Danilov (brdanilov@gmail.com).

== Seminar instructors ==
{| class="wikitable" style="text-align:center"
|-
! Group !! 221 !! 222 !! 223 !! 224
|-
|| Teachers || colspan="2" | [https://t.me/brdann Boris Danilov] || colspan="2" | [https://t.me/carlosbuitrago Carlos Buitrago]
|-
|| Assistants || [https://t.me/svklevtsova417 Клевцова Снежана] || [https://t.me/rinpmchs Шередеко Арина] || [https://t.me/masha_soboleva___ Соболева Мария] || [https://t.me/kkkkkkkkirilllll Будяк Кирилл]
|-
|| Lecturer’s assistant || colspan="4"| [https://t.me/Alyona_Chislova Алёна Числова]
|}

= Lectures =
* [https://disk.yandex.ru/i/CwQMNwEFkFtW8A Introduction]
* [https://disk.yandex.ru/i/WHN23DA2gsnJBg Lecture 1]
* [https://disk.yandex.ru/i/SA5_NjXj1RRzZw Lecture 2 (draft)]

= Seminar sheets =
* [https://disk.yandex.ru/i/ta7w7La6GMwMKw Seminar 1]

= Midterm Test =

Midterm test is held past the end of the first module.

= Exam =

Exam is held at the end of the course.

= Grading =
Grade <Final grade> for the course is determined by the formula:

<Final grade> = min(10, round( 0.23 * <HA> + 0.15 * <QZ> + 0.23 * <MT> + 0.39 * <FT>),

where <HA>, <QZ>, <MT>, <FT> are grades for interim assessment activities:

* <HA> - Homework assignments
* <QZ> - Quizzes (small control works on seminars)
* <MT> - Midterm test
* <FT> - Final test (exam)

All grades <HA>, <QZ>, <MT>, <FT> are rational numbers between 0 and 20; grade above 10 is considered "bonus score" for "starred" exercises.

Rounding in the formula means rounding to the nearest integer, tie-values are rounded up.

== Automatic pass ==

If <AU> by the formula below is >=7 then by automatic pass <Final grade> = round(<AU>) 
<AU> = min(10, 0.36 * <HA> + 0.28 * <QZ> + 0.36 * <MT>) 
Please note that expression for <AU> does NOT include rounding.

Discrete Mathematics DSBA 2024/2025

2024-09-08T19:07:41Z

Brdan: /* Assignment deadlines */

== Instructors ==

=== The lecturer ===
My name is Evgeny Dashkov. Feel free to contact me via email: edashkov@gmail.com, [https://t.me/edashkov Telegram], or [https://vk.com/evgeny.v.dashkov VK].

My Assistant (the person responsible for the tables etc.): [https://t.me/elizaaaa_5 Elizaveta Levshina].

=== Seminar Instructors and Teaching Assistants ===
{| class="wikitable" style="text-align:center"
|-
! Group !! 241 !! 242 !! 243 !! 244 !! 245 !! 246
|-
|| Teachers || [https://t.me/edashkov Evgeny Dashkov] ||colspan="2"| [https://t.me/brdann Boris Danilov]|| colspan="2"| [https://t.me/DiegBuitrago Diego Buitrago] ||
|-
|| Teaching Assistants || [https://t.me/svbudygin Sergei Budygin] || [https://t.me/Avgustine_iw Zakhar Zinkin] || [https://t.me/svnsrg Sergey Savin] || [https://t.me/NaviMash Ivan Mashkarin] || [https://t.me/underpl Maxim Titov] || [https://t.me/almanmaria Maria Krotova]
|}

=== Whom should I ask? ===

If you have a question or comment concerning the mathematical content of our course, it is best to post it to our [https://t.me/joinchat/T_YTN4IG1vAJNWT9 student chat]. Alternatively, you may address your question to your Teaching Assistant, Seminar Instructor or the Lecturer (say, if your question discloses an important idea for a HW problem). It is much better to ask and get to know than not to ask and remain ignorant. '''Please do not hesitate to ask your mathematical questions!'''

If you need a more detailed consultation concerning the course's mathematics, please be informed that our Teaching Assistants usually hold periodic consultations while the Seminar Instructors and Lecturer have some designated time for counseling students. Still, the best thing to do is to arrange a consultation in advance via a personal communication.

Homework-grading related questions should be directed to your teaching assistant first; then to your seminar instructor and to the lecturer just in case of any disagreement.

Organizational, administrative, legal or paperwork questions must be addressed to the Student Service Center, Study Office or other relevant offices first and foremost. If you have been redirected to us with such a question nevertheless, please contact the Lecturer's Assistant first.

== Current performance ==

[The Table].

== Homework ==
The homework includes a few problem sets, one in a fortnight or so (the deadlines are announced on giving each set). Every problem set consists of about 10 – 15 problems, some of which are labeled as ‘bonus’ while all the remaining are considered ‘ordinary’. These sets may be subdivided further for students’ convenience.

A student may be required to 'defend' (i.e., to explain orally) his written solution to any problem. His grade for the problem may be decreased if he fails to do so properly.

== Exam 1 ==
A written examination is held past Module 1. Students may not consult any sources during the exam. The examination takes about 120 minutes. Some problems of the exam are labeled as ‘bonus’; the others are ‘ordinary’.

== Colloquium ==
An oral colloquium is held at the beginning of Module 3. Each student is given two questions concerning statements and definitions as well as one question requiring a proof. After no less than 45 minutes of preparation (when using any literature is allowed), the student is required to answer ‘from scratch’, that is, with no recourse to any materials. The examiner may pose additional questions as he sees fit.


== Exam 2 ==
A written examination is held past Module 3. Students may not consult any sources during the exam. The examination takes about 120 minutes. Some problems of the exam are labeled as ‘bonus’; the others are ‘ordinary’.

== Bonus activities ==
Throughout the course, the students may be graded for a variety of ‘bonus activities’ (like quizzes, etc.) either offline or online.

== Course materials ==

[https://t.me/joinchat/T_YTN4IG1vAJNWT9 Course chat]. This is our primary outlet for course announcements, questions, and discussions. '''Please join it!'''

=== Lecture notes ===

[https://drive.google.com/file/d/1mmNLLQ0--EDihGNRKwSyXLOA1KL7A0lD/view?usp=sharing Original English version]

[https://drive.google.com/drive/folders/1cTCdJtVVtO9uDgIKE8HY0qhl285tzOo1?usp=drive_link A Russian translation by volunteering students] (you are welcome to [https://t.me/sigma_algebraa join] their ranks)

=== Classes recordings ===

=== Lecture video archive ===

=== Other resources ===
* [https://tinyurl.com/rwky5vmk The Course's Google Directory]

* [https://www.youtube.com/playlist?list=PL1Uob8iPTHGTidrmrqEHTJ96Pt3-PmML4 Past years' videos]

* We have a [https://meet.edashkov.net.ru dedicated server] to hold an online meeting if we need one.

== Problem sets ==

=== Class problems ===

* [https://drive.google.com/file/d/1EP-diSuOTn9f0ryg18Z2w0xjEp8j0bnl/view?usp=drive_link Problem Set 1]



=== Assignment deadlines ===

{| class="wikitable"
|-
! Home problem set !! colspan="11" | Deadline
|-
| || 241 || 242 || 243 || 244 || 245 || 246
|-
| [https://drive.google.com/file/d/15vCxTrNMwagS4rqQnUzdLParTqOP8y5P/view?usp=drive_link HW1a ] || Sep 19 || Sep 19 || Sep 19 || || ||

|}



'''Each deadline is set by the respective group's instructor.'''

== Assessment and Grading ==

=== Homework ===

The homework is graded in two batches: one (HW_A) includes everything to be submitted in Module1 and the other (HW_B) includes all the rest. For each problem, either ordinary or bonus, the student is given a score from 0 to 1 point (in fractional values) according to the progress he made.

Grade HW_A is computed the following way (before rounding):

HW_A = 8 * ord + 2 * adv, where

ord = (the sum of points given for ordinary problems) / #(ordinary problems);

adv = (the sum of points given for bonus problems) / #(bonus problems).

Grade HW_B is computed similarly but for its respective period of Modules 2 and 3.

=== Exam1 and the Interim Assessment ===

Each problem solution in the exam is graded with a fractional score from 0 to 1 point, and the entire exam with the value (before rounding)

Exam1 = 8 * ord + 2 * adv, where

ord = (the sum of points given for ordinary problems) / #(ordinary problems);

adv = (the sum of points given for bonus problems) / #(bonus problems).

The Interim grade 1 is computed past Module 1 and equals:

Interim1 = round(0.5 * HW_A + 0.5 * Exam1).

(Here and everywhere, rounding is according to arithmetic rules.)

=== Colloquium ===
For each of the 'definition' two questions, the student is given a score from 0 to 2 points, and from 0 to 4 points for the ‘proof’ question (all in fractional values).
The Colloq grade is computed the following way (before rounding):

Colloq = 10 * (the sum of points given) / 8.

=== Bonuses ===
Each student is given a score according to his progress in bonus activities, which results in the grade

Bonus = 10 * #(points given) / #(points possible).

The number of possible points varies but it is between 1 and 25 usually.

=== Exam2, the Second Interim, and the Final Assessment ===
Each problem solution in exam is graded with a fractional score from 0 to 1 point, and the entire exam with the value (before rounding)

Exam2 = 8 * ord + 2 * adv, where

ord = (the sum of points given for ordinary problems) / #(ordinary problems);

adv = (the sum of points given for bonus problems) / #(bonus problems).

The Interim grade 2 is computed past Module 3 and equals:

Interim2 = round(0.295 * HW_B + 0.295 * Colloq + 0.06 * Bonus + 0.35 * Exam2).

The final grade for the course is

Final = round(0.3 * Interim1 + 0.7 * Interim 2)

Generally, '''nobody is exempt from the examinations'''.

== Exam retaking ==
Examinations 1 and 2 are subject to be retaken if either the Interim1 or Final grade, respectively, is unsatisfactory (i.e., < 4). Retaking an exam is similar to the regular examination. The resulting grade is substituted for that of the latter (that is, retake grade is assigned to the variable Exami in the respective formula, whose value is then reevaluated). Those whose Interim or Final grade is still unsatisfactory after the first retake will have a (tough) choice to make.

Please take into account the following regulation according to the ''ПОПАТКУС'':
<blockquote>
On the first and second retake the cumulative course grade is taken into consideration. In case of receiving an unsatisfactory final grade after the first retake, the student may refuse to participate in the second retake and repeat the course according to the individual curricula. Cumulative grade is formed again as a result of repeated course. After the completion of the repeated course, the student is given a second retake only, from which the student has previously refused.
</blockquote>

The 'cumulative grade' here means all the variables in the grading formulas except Exami, which are the only ones to be retaken. The 'second retake' is similar to the first one and it is evaluated according to the same formula with the same values of 'cumulative' variables. This poses an obvious risk for anyone whose 'cumulatives' are low!

== Recommended reading ==
''Please notice that '''The Book''' for our Course does not exist. The latter is based on many sources.''

# Anderson J. A., Discrete Mathematics With Combinatorics. Prentice Hall, 2003.
# Biggs N. L., Discrete mathematics. 2nd ed., New York; Oxford: Oxford University Press, 2004.
# Gavrilov G. P., Sapozhenko A. A. Problems and Exercises in Discrete Mathematics. Kluwer Texts in the Mathematical Sciences 14. Springer, 1996.
# [http://courses.csail.mit.edu/6.042/spring17/mcs.pdf Lehman E., Thomson Leighton F., Meyer A. R. Mathematics for Computer Science, 2017.]
# [http://www.cs.elte.hu/~lovasz/dmbook.ps Lovasz L., Vesztergombi K. Discrete Mathematics. Lecture Notes; Yale University, 1999.]
# Melnikov O., Sarvanov V., Tyshkevich R., Yemelichev V., Zverovich I. Exercises in Graph Theory. Kluwer Texts in the Mathematical Sciences 19. Springer, 1998.
# Rosen K. H. Discrete Mathematics and Its Applications. McGraw-Hill, 1999.
# Stein C., Drysdale R. L., Bogart K. Discrete mathematics for computer scientists. Addison-Wesley, 2010.
# Vinogradov I. M. Elements of number theory. Dover, 1954.

=== In Russian ===
''If you understand Russian (by any chance), you will probably benefit from reading the following books.''

# Виноградов И. М. Основы теории чисел. 9-е изд., М.: Наука, 1981.
# [http://rubtsov.su/public/DM-HSE-Draft.pdf Вялый М., Подольский В., Рубцов А., Шварц Д., Шень А. Лекции по дискретной математике.]
# Гаврилов Г. П., Сапоженко А. А. Задачи и упражнения по дискретной математике. 3-е изд., М.: ФИЗМАТЛИТ, 2004.
# [https://drive.google.com/file/d/1RM6KX_reBFwUXesWGUEu0sFn2NCaBgvz/view?usp=sharing Дашков Е. В. Введение в математическую логику. Множества и отношения. М.: МФТИ, 2019.]
# Зубков А. М., Севастьянов Б. А., Чистяков В. П. Сборник задач по теории вероятностей. 2-е изд., М.: Наука, 1989.
# Мельников О. И. Теория графов в занимательных задачах. 5-е изд., М.: Книжный дом "ЛИБРОКОМ", 2013.
# [http://www.mccme.ru/free-books/shen/shen-induction.pdf Шень А., Математическая индукция. 5-е изд, М.: МЦНМО, 2016.]

Discrete Mathematics 2 DSBA 2024/25

2024-09-04T19:32:17Z

Brdan: /* About */

= About =
This page contains basic information for the course Discrete Mathematics 2 in 2023/2024 academic year at Bachelor’s Programme 'HSE and University of London Double Degree Programme in Data Science and Business Analytics' (DSBA).

Find more information about the course including lecture presentations, seminar sheets in Smart LMS soon.

[https://t.me/+fVFTFIuG7ho3OGZi DM2 Public Chat]

= Professors and assistants =

The lecturer of the course in 2024 fall term is Boris Radislavovich Danilov (brdanilov@gmail.com).

== Seminar instructors ==
{| class="wikitable" style="text-align:center"
|-
! Group !! 221 !! 222 !! 223 !! 224
|-
|| Teachers || colspan="2" | [https://t.me/brdann Boris Danilov] || colspan="2" | [https://t.me/carlosbuitrago Carlos Buitrago]
|-
|| Assistants || [https://t.me/svklevtsova417 Клевцова Снежана] || [https://t.me/rinpmchs Шередеко Арина] || [https://t.me/masha_soboleva___ Соболева Мария] || [https://t.me/kkkkkkkkirilllll Будяк Кирилл]
|-
|| Lecturer’s assistant || colspan="4"| [https://t.me/Alyona_Chislova Алёна Числова]
|}

= Lectures =
* [https://disk.yandex.ru/i/CwQMNwEFkFtW8A Introduction]
* [https://disk.yandex.ru/i/WHN23DA2gsnJBg Lecture 1]

= Seminar sheets =
* [https://disk.yandex.ru/i/ta7w7La6GMwMKw Seminar 1]

= Midterm Test =

Midterm test is held past the end of the first module.

= Exam =

Exam is held at the end of the course.

= Grading =
Grade <Final grade> for the course is determined by the formula:

<Final grade> = min(10, round( 0.23 * <HA> + 0.15 * <QZ> + 0.23 * <MT> + 0.39 * <FT>),

where <HA>, <QZ>, <MT>, <FT> are grades for interim assessment activities:

* <HA> - Homework assignments
* <QZ> - Quizzes (small control works on seminars)
* <MT> - Midterm test
* <FT> - Final test (exam)

All grades <HA>, <QZ>, <MT>, <FT> are rational numbers between 0 and 20; grade above 10 is considered "bonus score" for "starred" exercises.

Rounding in the formula means rounding to the nearest integer, tie-values are rounded up.

== Automatic pass ==

If <AU> by the formula below is >=7 then by automatic pass <Final grade> = round(<AU>) 
<AU> = min(10, 0.36 * <HA> + 0.28 * <QZ> + 0.36 * <MT>) 
Please note that expression for <AU> does NOT include rounding.

Discrete Mathematics 2 DSBA 2024/25

2024-09-03T20:18:54Z

Brdan: /* Seminar sheets */

= About =
This page contains basic information for the course Discrete Mathematics 2 in 2023/2024 academic year at Bachelor’s Programme 'HSE and University of London Double Degree Programme in Data Science and Business Analytics' (DSBA).

Find more information about the course including lecture presentations, seminar sheets, link to the chat will be in Smart LMS.

= Professors and assistants =

The lecturer of the course in 2024 fall term is Boris Radislavovich Danilov (brdanilov@gmail.com).

== Seminar instructors ==
{| class="wikitable" style="text-align:center"
|-
! Group !! 221 !! 222 !! 223 !! 224
|-
|| Teachers || colspan="2" | [https://t.me/brdann Boris Danilov] || colspan="2" | [https://t.me/carlosbuitrago Carlos Buitrago]
|-
|| Assistants || [https://t.me/svklevtsova417 Клевцова Снежана] || [https://t.me/rinpmchs Шередеко Арина] || [https://t.me/masha_soboleva___ Соболева Мария] || [https://t.me/kkkkkkkkirilllll Будяк Кирилл]
|-
|| Lecturer’s assistant || colspan="4"| [https://t.me/Alyona_Chislova Алёна Числова]
|}

= Lectures =
* [https://disk.yandex.ru/i/CwQMNwEFkFtW8A Introduction]
* [https://disk.yandex.ru/i/WHN23DA2gsnJBg Lecture 1]

= Seminar sheets =
* [https://disk.yandex.ru/i/ta7w7La6GMwMKw Seminar 1]

= Midterm Test =

Midterm test is held past the end of the first module.

= Exam =

Exam is held at the end of the course.

= Grading =
Grade <Final grade> for the course is determined by the formula:

<Final grade> = min(10, round( 0.23 * <HA> + 0.15 * <QZ> + 0.23 * <MT> + 0.39 * <FT>),

where <HA>, <QZ>, <MT>, <FT> are grades for interim assessment activities:

* <HA> - Homework assignments
* <QZ> - Quizzes (small control works on seminars)
* <MT> - Midterm test
* <FT> - Final test (exam)

All grades <HA>, <QZ>, <MT>, <FT> are rational numbers between 0 and 20; grade above 10 is considered "bonus score" for "starred" exercises.

Rounding in the formula means rounding to the nearest integer, tie-values are rounded up.

== Automatic pass ==

If <AU> by the formula below is >=7 then by automatic pass <Final grade> = round(<AU>) 
<AU> = min(10, 0.36 * <HA> + 0.28 * <QZ> + 0.36 * <MT>) 
Please note that expression for <AU> does NOT include rounding.

Discrete Mathematics 2 DSBA 2024/25

2024-09-03T20:18:45Z

Brdan: /* Lectures */

= About =
This page contains basic information for the course Discrete Mathematics 2 in 2023/2024 academic year at Bachelor’s Programme 'HSE and University of London Double Degree Programme in Data Science and Business Analytics' (DSBA).

Find more information about the course including lecture presentations, seminar sheets, link to the chat will be in Smart LMS.

= Professors and assistants =

The lecturer of the course in 2024 fall term is Boris Radislavovich Danilov (brdanilov@gmail.com).

== Seminar instructors ==
{| class="wikitable" style="text-align:center"
|-
! Group !! 221 !! 222 !! 223 !! 224
|-
|| Teachers || colspan="2" | [https://t.me/brdann Boris Danilov] || colspan="2" | [https://t.me/carlosbuitrago Carlos Buitrago]
|-
|| Assistants || [https://t.me/svklevtsova417 Клевцова Снежана] || [https://t.me/rinpmchs Шередеко Арина] || [https://t.me/masha_soboleva___ Соболева Мария] || [https://t.me/kkkkkkkkirilllll Будяк Кирилл]
|-
|| Lecturer’s assistant || colspan="4"| [https://t.me/Alyona_Chislova Алёна Числова]
|}

= Lectures =
* [https://disk.yandex.ru/i/CwQMNwEFkFtW8A Introduction]
* [https://disk.yandex.ru/i/WHN23DA2gsnJBg Lecture 1]

= Seminar sheets =
[https://disk.yandex.ru/i/ta7w7La6GMwMKw Seminar 1]

= Midterm Test =

Midterm test is held past the end of the first module.

= Exam =

Exam is held at the end of the course.

= Grading =
Grade <Final grade> for the course is determined by the formula:

<Final grade> = min(10, round( 0.23 * <HA> + 0.15 * <QZ> + 0.23 * <MT> + 0.39 * <FT>),

where <HA>, <QZ>, <MT>, <FT> are grades for interim assessment activities:

* <HA> - Homework assignments
* <QZ> - Quizzes (small control works on seminars)
* <MT> - Midterm test
* <FT> - Final test (exam)

All grades <HA>, <QZ>, <MT>, <FT> are rational numbers between 0 and 20; grade above 10 is considered "bonus score" for "starred" exercises.

Rounding in the formula means rounding to the nearest integer, tie-values are rounded up.

== Automatic pass ==

If <AU> by the formula below is >=7 then by automatic pass <Final grade> = round(<AU>) 
<AU> = min(10, 0.36 * <HA> + 0.28 * <QZ> + 0.36 * <MT>) 
Please note that expression for <AU> does NOT include rounding.

Discrete Mathematics 2 DSBA 2024/25

2024-09-03T20:18:28Z

Brdan: /* Lectures */

= About =
This page contains basic information for the course Discrete Mathematics 2 in 2023/2024 academic year at Bachelor’s Programme 'HSE and University of London Double Degree Programme in Data Science and Business Analytics' (DSBA).

Find more information about the course including lecture presentations, seminar sheets, link to the chat will be in Smart LMS.

= Professors and assistants =

The lecturer of the course in 2024 fall term is Boris Radislavovich Danilov (brdanilov@gmail.com).

== Seminar instructors ==
{| class="wikitable" style="text-align:center"
|-
! Group !! 221 !! 222 !! 223 !! 224
|-
|| Teachers || colspan="2" | [https://t.me/brdann Boris Danilov] || colspan="2" | [https://t.me/carlosbuitrago Carlos Buitrago]
|-
|| Assistants || [https://t.me/svklevtsova417 Клевцова Снежана] || [https://t.me/rinpmchs Шередеко Арина] || [https://t.me/masha_soboleva___ Соболева Мария] || [https://t.me/kkkkkkkkirilllll Будяк Кирилл]
|-
|| Lecturer’s assistant || colspan="4"| [https://t.me/Alyona_Chislova Алёна Числова]
|}

= Lectures =
[*] [https://disk.yandex.ru/i/CwQMNwEFkFtW8A Introduction]
[*] [https://disk.yandex.ru/i/WHN23DA2gsnJBg Lecture 1]

= Seminar sheets =
[https://disk.yandex.ru/i/ta7w7La6GMwMKw Seminar 1]

= Midterm Test =

Midterm test is held past the end of the first module.

= Exam =

Exam is held at the end of the course.

= Grading =
Grade <Final grade> for the course is determined by the formula:

<Final grade> = min(10, round( 0.23 * <HA> + 0.15 * <QZ> + 0.23 * <MT> + 0.39 * <FT>),

where <HA>, <QZ>, <MT>, <FT> are grades for interim assessment activities:

* <HA> - Homework assignments
* <QZ> - Quizzes (small control works on seminars)
* <MT> - Midterm test
* <FT> - Final test (exam)

All grades <HA>, <QZ>, <MT>, <FT> are rational numbers between 0 and 20; grade above 10 is considered "bonus score" for "starred" exercises.

Rounding in the formula means rounding to the nearest integer, tie-values are rounded up.

== Automatic pass ==

If <AU> by the formula below is >=7 then by automatic pass <Final grade> = round(<AU>) 
<AU> = min(10, 0.36 * <HA> + 0.28 * <QZ> + 0.36 * <MT>) 
Please note that expression for <AU> does NOT include rounding.

Discrete Mathematics 2 DSBA 2024/25

2024-09-03T20:18:09Z

Brdan:

= About =
This page contains basic information for the course Discrete Mathematics 2 in 2023/2024 academic year at Bachelor’s Programme 'HSE and University of London Double Degree Programme in Data Science and Business Analytics' (DSBA).

Find more information about the course including lecture presentations, seminar sheets, link to the chat will be in Smart LMS.

= Professors and assistants =

The lecturer of the course in 2024 fall term is Boris Radislavovich Danilov (brdanilov@gmail.com).

== Seminar instructors ==
{| class="wikitable" style="text-align:center"
|-
! Group !! 221 !! 222 !! 223 !! 224
|-
|| Teachers || colspan="2" | [https://t.me/brdann Boris Danilov] || colspan="2" | [https://t.me/carlosbuitrago Carlos Buitrago]
|-
|| Assistants || [https://t.me/svklevtsova417 Клевцова Снежана] || [https://t.me/rinpmchs Шередеко Арина] || [https://t.me/masha_soboleva___ Соболева Мария] || [https://t.me/kkkkkkkkirilllll Будяк Кирилл]
|-
|| Lecturer’s assistant || colspan="4"| [https://t.me/Alyona_Chislova Алёна Числова]
|}

= Lectures =
[https://disk.yandex.ru/i/CwQMNwEFkFtW8A Introduction]
[https://disk.yandex.ru/i/WHN23DA2gsnJBg Lecture 1]

= Seminar sheets =
[https://disk.yandex.ru/i/ta7w7La6GMwMKw Seminar 1]

= Midterm Test =

Midterm test is held past the end of the first module.

= Exam =

Exam is held at the end of the course.

= Grading =
Grade <Final grade> for the course is determined by the formula:

<Final grade> = min(10, round( 0.23 * <HA> + 0.15 * <QZ> + 0.23 * <MT> + 0.39 * <FT>),

where <HA>, <QZ>, <MT>, <FT> are grades for interim assessment activities:

* <HA> - Homework assignments
* <QZ> - Quizzes (small control works on seminars)
* <MT> - Midterm test
* <FT> - Final test (exam)

All grades <HA>, <QZ>, <MT>, <FT> are rational numbers between 0 and 20; grade above 10 is considered "bonus score" for "starred" exercises.

Rounding in the formula means rounding to the nearest integer, tie-values are rounded up.

== Automatic pass ==

If <AU> by the formula below is >=7 then by automatic pass <Final grade> = round(<AU>) 
<AU> = min(10, 0.36 * <HA> + 0.28 * <QZ> + 0.36 * <MT>) 
Please note that expression for <AU> does NOT include rounding.