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

Discrete Mathematics DSBA 2023/2024

2023-12-14T10:26:49Z

Obozhenov: /* 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 ===
{| class="wikitable" style="text-align:center"
|-
! Group !! 231 !! 232 !! 233 !! 234 !! 235
|-
|| 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/jinyu_jin Zhou Jinyu] || [https://t.me/Spnya Alexander Ukhanov] || [https://t.me/gmsingularity Marat Galyavov] || [https://t.me/obozhenov Oleg Bozhenov] || [https://t.me/Nkozlovtsev Nikita Kozlovtsev]
|}

== Current performance ==

[https://docs.google.com/spreadsheets/d/1IztdRuZx23HPQGap_5oVHlb54lymSfg70ELs_jTdY1s/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’. One can get either 0, ½, or 1 point for each problem. For the entire homework, two values are computed:

HW = (the sum of points given for ordinary problems) / #(ordinary problems);

HW* = (the sum of points given for bonus problems) / #(bonus problems).

The value HW1 is similar to HW but restricted to the problem sets given in Module 1.

A student may be required 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. Some problems of the exam are labeled as ‘bonus’; the others are ‘ordinary’. Each problem solution is graded with either 0, ¼, ½, ¾, or 1 point, and the entire exam with two values:

Exam1 = (the sum of points given for ordinary problems) / #(ordinary problems);

Exam1* = (the sum of points given for bonus problems) / #(bonus problems)

== 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. The student may get from 0 to 10 integer points for his answer; the value Colloq is just this score.

Please find the question list and rules [https://drive.google.com/file/d/13gNFBATQ6V3lieUj8vym8OXC2RXmbdt4/view?usp=share_link here].

== Exam 2 ==
A written examination is held at the end of the Course. 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’. Each problem solution is graded with either 0, ¼, ½, ¾, or 1 point; finally, two values are computed:

Exam2 = (the sum of points given for ordinary problems) / #(ordinary problems);

Exam2* = (the sum of points given for bonus problems) / #(bonus problems).

== Bonus activities ==
The students may be graded for a variety of ‘bonus activities’ (like quizzes, etc.) with an overall integer value Bonus from 0 to 25.

== Exam retaking ==
Examinations 1 and 2 are subject to be retaken if Module 1 grade or Final grade (see below), respectively, is unsatisfactory. Retaking the exam is similar to the regular examination. The resulting grade is substituted for that of the latter. The last try Commission retaking is held for those whose final grade is still unsatisfactory after the retaking. A designated Commission carefully examines the student’s performance and gives him a final mark not better than ‘satisfactory’; at that the Commission is not bound by the grading formulas herein.

== Course materials ==

[https://t.me/joinchat/T_YTN4IG1vAJNWT9 Course chat].

=== 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
|-
| || 231 || 232 || 233 || 234 || 235
|-
| [https://drive.google.com/file/d/15vCxTrNMwagS4rqQnUzdLParTqOP8y5P/view?usp=drive_link HW1a ] || 09/29 || 10/10 || 10/10 || 09/29 || 09/29
|-
| [https://drive.google.com/file/d/1PTJY1PEG-wUlTqUGXT8KWRsll8H0XLb0/view?usp=drive_link HW1b] || 10/09 || 10/10 || || 10/09 || 10/09
|-
| [https://drive.google.com/file/d/1LOPPwGjyVleR_mclxTKUJ_bxFrxt44sW/view?usp=drive_link HW2a] || Oct 24 ||Oct 24 || Oct 24 ||Oct 24 ||Oct 24
|-
| [https://drive.google.com/file/d/1W7k1OTiIMlPOpo-2mwmGegrc4RDHz5_j/view?usp=drive_link HW2b] || Nov 16 || Dec 7 || Dec 7 || Nov. 19 || Nov. 19
|-
| [https://drive.google.com/file/d/1V99HEXHgcCXT6tjJp0oPV05Jw172Bid8/view?usp=drive_link HW2c] || Dec 18 || Dec 14 || Dec 19 || Dec 20|| Dec 20
|}

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

== Grading system ==
For the final grading, we compute the following values:

Module 1 grade = round ((50*HW1 + 50*Exam1)/100);

basic = (21*Exam1 + 21*Colloq + 28*HW + 30*Exam2)/100;

adv = (30*Exam1* + Bonus + 35*HW* + 35*Exam2*)/100;

Final grade = round(min(10, 8 * basic + 2 * adv)).

The final grade is rounded half up to an integer. All the other values are reported with the greatest precision available.

== 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

2023-11-13T12:31:58Z

Obozhenov: /* 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 ===
{| class="wikitable" style="text-align:center"
|-
! Group !! 231 !! 232 !! 233 !! 234 !! 235
|-
|| 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/jinyu_jin Zhou Jinyu] || [https://t.me/Spnya Alexander Ukhanov] || [https://t.me/gmsingularity Marat Galyavov] || [https://t.me/obozhenov Oleg Bozhenov] || [https://t.me/Nkozlovtsev Nikita Kozlovtsev]
|}

== Current performance ==

[https://docs.google.com/spreadsheets/d/1IztdRuZx23HPQGap_5oVHlb54lymSfg70ELs_jTdY1s/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’. One can get either 0, ½, or 1 point for each problem. For the entire homework, two values are computed:

HW = (the sum of points given for ordinary problems) / #(ordinary problems);

HW* = (the sum of points given for bonus problems) / #(bonus problems).

The value HW1 is similar to HW but restricted to the problem sets given in Module 1.

A student may be required 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. Some problems of the exam are labeled as ‘bonus’; the others are ‘ordinary’. Each problem solution is graded with either 0, ¼, ½, ¾, or 1 point, and the entire exam with two values:

Exam1 = (the sum of points given for ordinary problems) / #(ordinary problems);

Exam1* = (the sum of points given for bonus problems) / #(bonus problems)

== 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. The student may get from 0 to 10 integer points for his answer; the value Colloq is just this score.

Please find the question list and rules [https://drive.google.com/file/d/13gNFBATQ6V3lieUj8vym8OXC2RXmbdt4/view?usp=share_link here].

== Exam 2 ==
A written examination is held at the end of the Course. 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’. Each problem solution is graded with either 0, ¼, ½, ¾, or 1 point; finally, two values are computed:

Exam2 = (the sum of points given for ordinary problems) / #(ordinary problems);

Exam2* = (the sum of points given for bonus problems) / #(bonus problems).

== Bonus activities ==
The students may be graded for a variety of ‘bonus activities’ (like quizzes, etc.) with an overall integer value Bonus from 0 to 25.

== Exam retaking ==
Examinations 1 and 2 are subject to be retaken if Module 1 grade or Final grade (see below), respectively, is unsatisfactory. Retaking the exam is similar to the regular examination. The resulting grade is substituted for that of the latter. The last try Commission retaking is held for those whose final grade is still unsatisfactory after the retaking. A designated Commission carefully examines the student’s performance and gives him a final mark not better than ‘satisfactory’; at that the Commission is not bound by the grading formulas herein.

== Course materials ==

[https://t.me/joinchat/T_YTN4IG1vAJNWT9 Course chat].

=== 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
|-
| || 231 || 232 || 233 || 234 || 235
|-
| [https://drive.google.com/file/d/15vCxTrNMwagS4rqQnUzdLParTqOP8y5P/view?usp=drive_link HW1a ] || 09/29 || 10/10 || 10/10 || 09/29 || 09/29
|-
| [https://drive.google.com/file/d/1PTJY1PEG-wUlTqUGXT8KWRsll8H0XLb0/view?usp=drive_link HW1b] || 10/09 || 10/10 || || 10/09 || 10/09
|-
| [https://drive.google.com/file/d/1LOPPwGjyVleR_mclxTKUJ_bxFrxt44sW/view?usp=drive_link HW2a] || Oct 24 || || ||Oct 24 ||Oct 24
|-
| [https://drive.google.com/file/d/1W7k1OTiIMlPOpo-2mwmGegrc4RDHz5_j/view?usp=drive_link HW2b] || Nov 16 || || || Nov. 19 || Nov. 19
|}

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

== Grading system ==
For the final grading, we compute the following values:

Module 1 grade = round ((50*HW1 + 50*Exam1)/100);

basic = (21*Exam1 + 21*Colloq + 28*HW + 30*Exam2)/100;

adv = (30*Exam1* + Bonus + 35*HW* + 35*Exam2*)/100;

Final grade = round(min(10, 8 * basic + 2 * adv)).

The final grade is rounded half up to an integer. All the other values are reported with the greatest precision available.

== 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

2023-10-21T12:44:57Z

Obozhenov: /* 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 ===
{| class="wikitable" style="text-align:center"
|-
! Group !! 231 !! 232 !! 233 !! 234 !! 235
|-
|| 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/jinyu_jin Zhou Jinyu] || [https://t.me/Spnya Alexander Ukhanov] || [https://t.me/gmsingularity Marat Galyavov] || [https://t.me/obozhenov Oleg Bozhenov] || [https://t.me/Nkozlovtsev Nikita Kozlovtsev]
|}

== Current performance ==

== 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’. One can get either 0, ½, or 1 point for each problem. For the entire homework, two values are computed:

HW = (the sum of points given for ordinary problems) / #(ordinary problems);

HW* = (the sum of points given for bonus problems) / #(bonus problems).

The value HW1 is similar to HW but restricted to the problem sets given in Module 1.

A student may be required 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. Some problems of the exam are labeled as ‘bonus’; the others are ‘ordinary’. Each problem solution is graded with either 0, ¼, ½, ¾, or 1 point, and the entire exam with two values:

Exam1 = (the sum of points given for ordinary problems) / #(ordinary problems);

Exam1* = (the sum of points given for bonus problems) / #(bonus problems)

== 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. The student may get from 0 to 10 integer points for his answer; the value Colloq is just this score.

Please find the question list and rules [https://drive.google.com/file/d/13gNFBATQ6V3lieUj8vym8OXC2RXmbdt4/view?usp=share_link here].

== Exam 2 ==
A written examination is held at the end of the Course. 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’. Each problem solution is graded with either 0, ¼, ½, ¾, or 1 point; finally, two values are computed:

Exam2 = (the sum of points given for ordinary problems) / #(ordinary problems);

Exam2* = (the sum of points given for bonus problems) / #(bonus problems).

== Bonus activities ==
The students may be graded for a variety of ‘bonus activities’ (like quizzes, etc.) with an overall integer value Bonus from 0 to 25.

== Exam retaking ==
Examinations 1 and 2 are subject to be retaken if Module 1 grade or Final grade (see below), respectively, is unsatisfactory. Retaking the exam is similar to the regular examination. The resulting grade is substituted for that of the latter. The last try Commission retaking is held for those whose final grade is still unsatisfactory after the retaking. A designated Commission carefully examines the student’s performance and gives him a final mark not better than ‘satisfactory’; at that the Commission is not bound by the grading formulas herein.

== Course materials ==

[https://t.me/joinchat/T_YTN4IG1vAJNWT9 Course chat].

=== 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]

=== Assignment deadlines ===

{| class="wikitable"
|-
! Home problem set !! colspan="11" | Deadline
|-
| || 231 || 232 || 233 || 234 || 235
|-
| [https://drive.google.com/file/d/15vCxTrNMwagS4rqQnUzdLParTqOP8y5P/view?usp=drive_link HW1a ] || 09/29 || 10/10 || 10/10 || 09/29 || 09/29
|-
| [https://drive.google.com/file/d/1PTJY1PEG-wUlTqUGXT8KWRsll8H0XLb0/view?usp=drive_link HW1b] || 10/09 || 10/10 || || 10/09 || 10/09
|-
| [https://drive.google.com/file/d/1LOPPwGjyVleR_mclxTKUJ_bxFrxt44sW/view?usp=drive_link HW2a] || Oct 24 || || ||Oct 24 ||Oct 24
|}

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

== Grading system ==
For the final grading, we compute the following values:

Module 1 grade = round ((50*HW1 + 50*Exam1)/100);

basic = (21*Exam1 + 21*Colloq + 28*HW + 30*Exam2)/100;

adv = (30*Exam1* + Bonus + 35*HW* + 35*Exam2*)/100;

Final grade = round(min(10, 8 * basic + 2 * adv)).

The final grade is rounded half up to an integer. All the other values are reported with the greatest precision available.

== 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

2023-10-09T12:58:13Z

Obozhenov: /* 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 ===
{| class="wikitable" style="text-align:center"
|-
! Group !! 231 !! 232 !! 233 !! 234 !! 235
|-
|| 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/jinyu_jin Zhou Jinyu] || [https://t.me/Spnya Alexander Ukhanov] || [https://t.me/gmsingularity Marat Galyavov] || [https://t.me/obozhenov Oleg Bozhenov] || [https://t.me/Nkozlovtsev Nikita Kozlovtsev]
|}

== Current performance ==

== 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’. One can get either 0, ½, or 1 point for each problem. For the entire homework, two values are computed:

HW = (the sum of points given for ordinary problems) / #(ordinary problems);

HW* = (the sum of points given for bonus problems) / #(bonus problems).

The value HW1 is similar to HW but restricted to the problem sets given in Module 1.

A student may be required 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. Some problems of the exam are labeled as ‘bonus’; the others are ‘ordinary’. Each problem solution is graded with either 0, ¼, ½, ¾, or 1 point, and the entire exam with two values:

Exam1 = (the sum of points given for ordinary problems) / #(ordinary problems);

Exam1* = (the sum of points given for bonus problems) / #(bonus problems)

== 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. The student may get from 0 to 10 integer points for his answer; the value Colloq is just this score.

Please find the question list and rules [https://drive.google.com/file/d/13gNFBATQ6V3lieUj8vym8OXC2RXmbdt4/view?usp=share_link here].

== Exam 2 ==
A written examination is held at the end of the Course. 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’. Each problem solution is graded with either 0, ¼, ½, ¾, or 1 point; finally, two values are computed:

Exam2 = (the sum of points given for ordinary problems) / #(ordinary problems);

Exam2* = (the sum of points given for bonus problems) / #(bonus problems).

== Bonus activities ==
The students may be graded for a variety of ‘bonus activities’ (like quizzes, etc.) with an overall integer value Bonus from 0 to 25.

== Exam retaking ==
Examinations 1 and 2 are subject to be retaken if Module 1 grade or Final grade (see below), respectively, is unsatisfactory. Retaking the exam is similar to the regular examination. The resulting grade is substituted for that of the latter. The last try Commission retaking is held for those whose final grade is still unsatisfactory after the retaking. A designated Commission carefully examines the student’s performance and gives him a final mark not better than ‘satisfactory’; at that the Commission is not bound by the grading formulas herein.

== Course materials ==

[https://t.me/joinchat/T_YTN4IG1vAJNWT9 Course chat].

=== 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]

=== Assignment deadlines ===

{| class="wikitable"
|-
! Home problem set !! colspan="11" | Deadline
|-
| || 231 || 232 || 233 || 234 || 235
|-
| [https://drive.google.com/file/d/15vCxTrNMwagS4rqQnUzdLParTqOP8y5P/view?usp=drive_link HW1a ] || 09/29 || 10/10 || 10/10 || 09/29 || 09/29
|-
| [https://drive.google.com/file/d/1PTJY1PEG-wUlTqUGXT8KWRsll8H0XLb0/view?usp=drive_link HW1b] || 10/09 || 10/10 || || 10/09 || 10/09
|-
| [https://drive.google.com/file/d/1LOPPwGjyVleR_mclxTKUJ_bxFrxt44sW/view?usp=drive_link HW2a] || || || || ||
|}

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

== Grading system ==
For the final grading, we compute the following values:

Module 1 grade = round ((50*HW1 + 50*Exam1)/100);

basic = (21*Exam1 + 21*Colloq + 28*HW + 30*Exam2)/100;

adv = (30*Exam1* + Bonus + 35*HW* + 35*Exam2*)/100;

Final grade = round(min(10, 8 * basic + 2 * adv)).

The final grade is rounded half up to an integer. All the other values are reported with the greatest precision available.

== 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

2023-10-01T18:34:53Z

Obozhenov: /* 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].

=== Seminar instructors ===
{| class="wikitable" style="text-align:center"
|-
! Group !! 231 !! 232 !! 233 !! 234 !! 235
|-
|| 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/jinyu_jin Zhou Jinyu] || [https://t.me/Spnya Alexander Ukhanov] || [https://t.me/gmsingularity Marat Galyavov] || [https://t.me/obozhenov Oleg Bozhenov] || [https://t.me/Nkozlovtsev Nikita Kozlovtsev]
|}

== Current performance ==

== 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’. One can get either 0, ½, or 1 point for each problem. For the entire homework, two values are computed:

HW = (the sum of points given for ordinary problems) / #(ordinary problems);

HW* = (the sum of points given for bonus problems) / #(bonus problems).

The value HW1 is similar to HW but restricted to the problem sets given in Module 1.

A student may be required 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. Some problems of the exam are labeled as ‘bonus’; the others are ‘ordinary’. Each problem solution is graded with either 0, ¼, ½, ¾, or 1 point, and the entire exam with two values:

Exam1 = (the sum of points given for ordinary problems) / #(ordinary problems);

Exam1* = (the sum of points given for bonus problems) / #(bonus problems)

== 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. The student may get from 0 to 10 integer points for his answer; the value Colloq is just this score.

Please find the question list and rules [https://drive.google.com/file/d/13gNFBATQ6V3lieUj8vym8OXC2RXmbdt4/view?usp=share_link here].

== Exam 2 ==
A written examination is held at the end of the Course. 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’. Each problem solution is graded with either 0, ¼, ½, ¾, or 1 point; finally, two values are computed:

Exam2 = (the sum of points given for ordinary problems) / #(ordinary problems);

Exam2* = (the sum of points given for bonus problems) / #(bonus problems).

== Bonus activities ==
The students may be graded for a variety of ‘bonus activities’ (like quizzes, etc.) with an overall integer value Bonus from 0 to 25.

== Exam retaking ==
Examinations 1 and 2 are subject to be retaken if Module 1 grade or Final grade (see below), respectively, is unsatisfactory. Retaking the exam is similar to the regular examination. The resulting grade is substituted for that of the latter. The last try Commission retaking is held for those whose final grade is still unsatisfactory after the retaking. A designated Commission carefully examines the student’s performance and gives him a final mark not better than ‘satisfactory’; at that the Commission is not bound by the grading formulas herein.

== Course materials ==

[https://t.me/joinchat/T_YTN4IG1vAJNWT9 Course chat].

=== 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
|-
| || 231 || 232 || 233 || 234 || 235
|-
| [https://drive.google.com/file/d/15vCxTrNMwagS4rqQnUzdLParTqOP8y5P/view?usp=drive_link HW1a ] || 09/29 || || || 09/29 ||
|-
| [https://drive.google.com/file/d/1PTJY1PEG-wUlTqUGXT8KWRsll8H0XLb0/view?usp=drive_link HW1b] || 10/09 || || || 10/09 ||
|}

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

== Grading system ==
For the final grading, we compute the following values:

Module 1 grade = round ((50*HW1 + 50*Exam1)/100);

basic = (21*Exam1 + 21*Colloq + 28*HW + 30*Exam2)/100;

adv = (30*Exam1* + Bonus + 35*HW* + 35*Exam2*)/100;

Final grade = round(min(10, 8 * basic + 2 * adv)).

The final grade is rounded half up to an integer. All the other values are reported with the greatest precision available.

== 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

2023-10-01T18:34:44Z

Obozhenov: /* 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].

=== Seminar instructors ===
{| class="wikitable" style="text-align:center"
|-
! Group !! 231 !! 232 !! 233 !! 234 !! 235
|-
|| 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/jinyu_jin Zhou Jinyu] || [https://t.me/Spnya Alexander Ukhanov] || [https://t.me/gmsingularity Marat Galyavov] || [https://t.me/obozhenov Oleg Bozhenov] || [https://t.me/Nkozlovtsev Nikita Kozlovtsev]
|}

== Current performance ==

== 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’. One can get either 0, ½, or 1 point for each problem. For the entire homework, two values are computed:

HW = (the sum of points given for ordinary problems) / #(ordinary problems);

HW* = (the sum of points given for bonus problems) / #(bonus problems).

The value HW1 is similar to HW but restricted to the problem sets given in Module 1.

A student may be required 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. Some problems of the exam are labeled as ‘bonus’; the others are ‘ordinary’. Each problem solution is graded with either 0, ¼, ½, ¾, or 1 point, and the entire exam with two values:

Exam1 = (the sum of points given for ordinary problems) / #(ordinary problems);

Exam1* = (the sum of points given for bonus problems) / #(bonus problems)

== 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. The student may get from 0 to 10 integer points for his answer; the value Colloq is just this score.

Please find the question list and rules [https://drive.google.com/file/d/13gNFBATQ6V3lieUj8vym8OXC2RXmbdt4/view?usp=share_link here].

== Exam 2 ==
A written examination is held at the end of the Course. 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’. Each problem solution is graded with either 0, ¼, ½, ¾, or 1 point; finally, two values are computed:

Exam2 = (the sum of points given for ordinary problems) / #(ordinary problems);

Exam2* = (the sum of points given for bonus problems) / #(bonus problems).

== Bonus activities ==
The students may be graded for a variety of ‘bonus activities’ (like quizzes, etc.) with an overall integer value Bonus from 0 to 25.

== Exam retaking ==
Examinations 1 and 2 are subject to be retaken if Module 1 grade or Final grade (see below), respectively, is unsatisfactory. Retaking the exam is similar to the regular examination. The resulting grade is substituted for that of the latter. The last try Commission retaking is held for those whose final grade is still unsatisfactory after the retaking. A designated Commission carefully examines the student’s performance and gives him a final mark not better than ‘satisfactory’; at that the Commission is not bound by the grading formulas herein.

== Course materials ==

[https://t.me/joinchat/T_YTN4IG1vAJNWT9 Course chat].

=== 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
|-
| || 231 || 232 || 233 || 234 || 235
|-
| [https://drive.google.com/file/d/15vCxTrNMwagS4rqQnUzdLParTqOP8y5P/view?usp=drive_link HW1a ] || 09/29 || || || 09/029 ||
|-
| [https://drive.google.com/file/d/1PTJY1PEG-wUlTqUGXT8KWRsll8H0XLb0/view?usp=drive_link HW1b] || 10/09 || || || 10/09 ||
|}

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

== Grading system ==
For the final grading, we compute the following values:

Module 1 grade = round ((50*HW1 + 50*Exam1)/100);

basic = (21*Exam1 + 21*Colloq + 28*HW + 30*Exam2)/100;

adv = (30*Exam1* + Bonus + 35*HW* + 35*Exam2*)/100;

Final grade = round(min(10, 8 * basic + 2 * adv)).

The final grade is rounded half up to an integer. All the other values are reported with the greatest precision available.

== 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

2023-09-18T14:54:02Z

Obozhenov: added 234 TA

== 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].

=== Seminar instructors ===
{| class="wikitable" style="text-align:center"
|-
! Group !! 231 !! 232 !! 233 !! 234 !! 235
|-
|| 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/jinyu_jin Zhou Jinyu] || || [https://t.me/gmsingularity Marat Galyavov] || [https://t.me/obozhenov Oleg Bozhenov] || [https://t.me/Nkozlovtsev Nikita Kozlovtsev]
|}

== Current performance ==

== 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’. One can get either 0, ½, or 1 point for each problem. For the entire homework, two values are computed:

HW = (the sum of points given for ordinary problems) / #(ordinary problems);

HW* = (the sum of points given for bonus problems) / #(bonus problems).

The value HW1 is similar to HW but restricted to the problem sets given in Module 1.

A student may be required 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. Some problems of the exam are labeled as ‘bonus’; the others are ‘ordinary’. Each problem solution is graded with either 0, ¼, ½, ¾, or 1 point, and the entire exam with two values:

Exam1 = (the sum of points given for ordinary problems) / #(ordinary problems);

Exam1* = (the sum of points given for bonus problems) / #(bonus problems)

== 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. The student may get from 0 to 10 integer points for his answer; the value Colloq is just this score.

Please find the question list and rules [https://drive.google.com/file/d/13gNFBATQ6V3lieUj8vym8OXC2RXmbdt4/view?usp=share_link here].

== Exam 2 ==
A written examination is held at the end of the Course. 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’. Each problem solution is graded with either 0, ¼, ½, ¾, or 1 point; finally, two values are computed:

Exam2 = (the sum of points given for ordinary problems) / #(ordinary problems);

Exam2* = (the sum of points given for bonus problems) / #(bonus problems).

== Bonus activities ==
The students may be graded for a variety of ‘bonus activities’ (like quizzes, etc.) with an overall integer value Bonus from 0 to 25.

== Exam retaking ==
Examinations 1 and 2 are subject to be retaken if Module 1 grade or Final grade (see below), respectively, is unsatisfactory. Retaking the exam is similar to the regular examination. The resulting grade is substituted for that of the latter. The last try Commission retaking is held for those whose final grade is still unsatisfactory after the retaking. A designated Commission carefully examines the student’s performance and gives him a final mark not better than ‘satisfactory’; at that the Commission is not bound by the grading formulas herein.

== Course materials ==

[https://t.me/joinchat/T_YTN4IG1vAJNWT9 Course chat].

=== 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]

=== Homework problems ===

=== Assignment deadlines ===

{| class="wikitable"
|-
! Home problem set !! colspan="11" | Deadline
|-
| || 231 || 232 || 233 || 234
|-
| HW1 || || || ||
|-
| || || || ||
|-
| || || || ||
|}

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

== Grading system ==
For the final grading, we compute the following values:

Module 1 grade = round ((50*HW1 + 50*Exam1)/100);

basic = (21*Exam1 + 21*Colloq + 28*HW + 30*Exam2)/100;

adv = (30*Exam1* + Bonus + 35*HW* + 35*Exam2*)/100;

Final grade = round(min(10, 8 * basic + 2 * adv)).

The final grade is rounded half up to an integer. All the other values are reported with the greatest precision available.

== 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.]

LAaG DSBA 2022/2023

2023-01-19T14:17:48Z

Obozhenov: /* Results */

== Teachers and Assistants ==
{| class="wikitable" style="text-align:center"
|-
! Group !! 211 (M+P+) !! 212 !! 213 !! 214
|-
|| Lecturer ||colspan="4"| [https://www.hse.ru/org/persons/224875083 Andrey Mazhuga]
|-
|| Teacher || [https://www.hse.ru/org/persons/224875083 Andrey Mazhuga] || Vladislav Balakirev ([https://t.me/vvbalakirev tg]) || colspan="2"| [https://www.hse.ru/org/persons/209813351 Nikita Medved] ([https://t.me/medvednikita tg])
|-
|| Consultations || Sat, 17:00 -- 21:00, via Zoom One must notify me beforehand || || colspan="2"| write me in telegram
|-
|| Assistant || Белоновский Пётр pibelonovskiy@edu.hse.ru
|| Астанина Ксения kkastanina@edu.hse.ru
|| Боженов Олег [https://t.me/obozhenov @obozhenov]
|| Науменко Дарья [https://t.me/yalmess @yalmess]
|- 
|}

== Course Description ==
The course introduces students to the elements of linear algebra and analytic geometry, provides the foundations for understanding some of the main concepts of modern mathematics. There is a strong emphasis in this course on complete proofs of almost all results.

We will approach the subject from both a practical point of view (learning methods and acquiring computational skills
relevant for problem solving) and a theoretical point of view (learning a more abstract and theoretical approach that focuses on achieving a deep understanding of the different abstract concepts).

Topics covered include: matrix algebra, systems of linear equations, permutations, determinants, complex numbers, fields, abstract vector spaces, bilinear and quadratic forms, Euclidean spaces, some elements of analytic geometry, linear operators. It took mathematicians at least two hundred years to comprehend these objects. We plan to accomplish this in one year.

== Grading system ==

<div class="mw-collapsible">

During the academic year, the student will be formally graded on the following:
*two in-class oral tests (O1 and O2);
*two in-class written tests (W1 and W2);
*several quizzes (Q1 and Q2, where Qi is the average grade of all the quizzes in the i-th semester);
*several homework assignments (H1 and H2, where Hi is the average grade of all the homework assignments in the i-th semester);
*two written exams (E1 and E2).

All grades (namely, O1, O2, W1, W2, Q1, Q2, H1, H2, E1, and E2) are real numbers from 0 to 10.

'''The cumulative course grade for the first semester''', C1, is obtained '''without rounding''' by the following formula:

'''C1 = 5/16*O1 + 4/16*W1 + 4/16*Q1 + 3/16*H1.'''

'''The intermediate course grade for the first semester''', I1, is obtained by the following formula:

'''I1 = Round1(3/10*E1 + 7/10*C1),'''

where the function Round1(x) is defined as follows: if the decimal part of x is less than 0.2, the grade is rounded downwards; if the decimal part of x is greater than 0.7, the grade is rounded upwards; if the decimal part of x is from the interval [0.2;0.7] and the student's seminar attendance during the first semester is not below 66%, the grade is rounded upwards; otherwise the grade is rounded downwards.

'''The cumulative course grade for the second semester''', C2, is obtained '''without rounding''' by the following formula:

'''C2 = 5/16*O2 + 4/16*W2 + 4/16*Q2 + 3/16*H2.'''

'''The intermediate course grade for the second semester''', I2, is obtained by the following formula:

'''I2 = Round2(3/10*E2 + 7/10*C2),'''

where the function Round2(x) is defined as Round1(x) but with "during the first semester" replaced by "during the second semester".

'''The final grade for the course''', F, is obtained by the following formula:

'''F = Round(1/4*I1 + 3/4*I2),'''

where the function Round(x) is defined as Round1(x) but with "during the first semester" replaced by "during the academic year".

The final grade for the course is included in a diploma supplement.

</div>

== Lecture Notes ==
''' Module 3 '''
* [https://www.dropbox.com/s/nf44zccqg3rythp/LAaG_Lecture_16.pdf?dl=0 '''Lecture 16'''] (16.01.2023) The direct sum of subspaces; main properties of the direct sum; the rank of a matrix; column and row spaces of a matrix; column and row ranks of a matrix.

* [https://www.dropbox.com/s/cl7djenawtlgp0o/LAaG_Lecture_15.pdf?dl=0 '''Lecture 15'''] (09.01.2023) Main properties of change of basis matrices; the sum, the intersection, and the direct sum of vector subspaces; the dimension of the sum of two vector subspaces.

''' Module 2 '''
* [https://www.dropbox.com/s/pozm47tzgaibf4k/LAaG_Lecture_14.pdf?dl=0 '''Lecture 14'''] (12.12.2022) Vector spaces (Part III); m-element subsets of an n-dimensional vector space; extension to a basis; the dimension of a subspace of a finite dimensional vector space; ordered basis; basis matrix; change of basis matrix.

* [https://www.dropbox.com/s/10v3w4efz6zi332/LAaG_Lecture_13.pdf?dl=0 '''Lecture 14'''] (05.12.2022) Vector spaces (Part II); Main theorem on linear dependence; a basis of a vector space; dimension of a vector space; finite and infinite dimensional vector spaces; some main properties of finite dimensional vector spaces.

* [https://www.dropbox.com/s/snko9y9r7ccw8qk/LAaG_Lecture_12.pdf?dl=0 '''Lecture 13'''] (28.11.2022) Vector spaces (Part I); a subspace of a vector space; linear combinations; the linear span; trivial and non-trivial linear combinations; linearly dependent and linearly independent sets.

* [https://www.dropbox.com/s/lqtmy2vaatj11em/LAaG_Lecture_11.pdf?dl=0 '''Lecture 11'''] (21.11.2022) Polynomials; the degree of a polynomial; division with remainder; a root of a polynomial; factor theorem; the multiplicity of a root; algebraically closed fields; fundamental theorem of algebra; interpolation polynomials in the Lagrange form.

* [https://www.dropbox.com/s/o4xtwn4a5hth67j/LAaG_Lecture_10.pdf?dl=0 '''Lecture 10'''] (14.11.2022) Complex numbers (part II); main properties of the conjugate and the absolute value of a complex number; polar (= trigonometric) form of a complex number; de Moivre's Formula; the set of n-th roots of a complex number, its description.

* [https://www.dropbox.com/s/qxrzppzu8oor5zq/LAaG_Lecture_9_v_2.pdf?dl=0 '''Lecture 9'''] (07.11.2022) The determinant of a Vandermonde matrix; fields; the field of complex munbers; Cartesian and algebraic forms of a complex number; the absolute value (=module) and the argument of a complex number, the complex conjugate.

* [https://www.dropbox.com/s/s849r4boozi6qu9/LAaG_Lecture_8.pdf?dl=0 '''Lecture 8'''] (31.10.2022) Block matrices; the determinant of a block matrix; minors and cofactors of a matrix; Laplace expansion; false expansion; the adjugate of a matrix; Cramer's rule.

''' Module 1 '''
* [https://www.dropbox.com/s/prpheqo8fbe12oq/LAaG_Lecture_7.pdf?dl=0 '''Lecture 7'''] (17.10.2022) Determinant of an elementary matrix; determinant of a product of matrices; determinant test for invertibility.

* [https://www.dropbox.com/s/ph1bk3pxksea1cw/LAaG_Lecture_6.pdf?dl=0 '''Lecture 6'''] (15.10.2022) Determinant; the Leibniz Formula; Sarrus' Rule; determinant of matrix transpose; three main properties of the determinant; the determinant of a matrix with a zero row or column.

* [https://www.dropbox.com/s/rnvhxr8m3acn8r4/LAaG_Lecture_5.pdf?dl=0 '''Lecture 5'''] (10.10.2022) Permutations; two-line notation of a permutation; the sign of a permutation; even and odd permutation; transpositions.

* [https://www.dropbox.com/s/lqwfw0ytlpn2o1j/LAaG_Lecture_4.pdf?dl=0 '''Lecture 4'''] (03.10.2022) Systems of linear equations (SoLE); homogeneous, inhomogeneous, consistent, and inconsistent SoLE; the matrix form of a SoLE; leading and free variables; the augmented matrix of a SoLE; a general algorithm for solving SoLE.

* [https://www.dropbox.com/s/h0p48gpr8cfaywf/LAaG_Lecture_3.pdf?dl=0 '''Lecture 3'''] (21.09.2022) Elementary row matrix operations; elementary matrices; elementary row operations as matrix pre-multiplication; reduced row echelon form; Gaussian elimination.

* [https://www.dropbox.com/s/hp9hrjorgv3ez3o/LAaG_Lecture_2.pdf?dl=0 '''Lecture 2'''] (14.09.2022) Matrix transposition; symmetric and skew-symetric matrices; inverse of a matrix; invertible (non-singular) matrices; the trace of a matrix; main properties of matrix transposition, matrix inverse, and the trace.

* [https://www.dropbox.com/s/xbzr7b3upj63rhy/LAaG_Lecture_1.pdf?dl=0 '''Lecture 1'''] (07.09.2022) Matrices, main definitions; special matrices (square matrices, triangular matrices, identity matrices, zero matrices); matrix scalar multiplication; matrix addition; matrix multiplication; main properties of these operations.

== Homework ==

=== The obligatory homework for group 221: ===

'''Module 3'''
* [https://www.dropbox.com/s/3a2j085ktpgu9w6/LAaG_HW_16_C%28221%29.pdf?dl=0 '''HW_16'''] (release: 16.01.2023; deadline: 22.01.2023) ([https://www.dropbox.com/s/v6c5lmf9u4uqdc8/jpg2pdf%20-%202023-01-16T193523.173.pdf?dl=0 seminar notes]) ([https://www.dropbox.com/s/62ufhz5njgc6u0a/LAaG_Seminar_16_21%20%284%29.pdf?dl=0 seminar notes])
* [https://www.dropbox.com/s/gm4r01xqw7lcwt4/LAaG_HW_15_C%28221%29.pdf?dl=0 '''HW_15'''] (release: 09.01.2023; deadline: 22.01.2023) ([https://www.dropbox.com/s/t401p7hyyrs5lrd/LAaG_Seminar_15_21%20%285%29.pdf?dl=0 seminar notes])
* [https://www.dropbox.com/s/7s643k1zhfrjxz7/LAaG_HW_14_C%28221%29.pdf?dl=0 '''HW_14'''] (release: 09.01.2023; deadline: 15.01.2023) ([https://www.dropbox.com/s/xyngepjx1btpczg/LAaG_Seminar_13%20%285%29.pdf?dl=0 seminar notes]) ([https://www.dropbox.com/s/6iwke6xy2fhg0qb/LAaG_Seminar_14%20%285%29.pdf?dl=0 seminar notes])

'''Module 2'''
* [https://www.dropbox.com/s/vkfpyha3hvt8blb/LAaG_HW_12_C%28221%29.pdf?dl=0 '''HW_12'''] (release: 02.12.2022; deadline: 11.12.2022) ([https://www.dropbox.com/s/i00mye96ypo9nz4/LAaG_Seminar_12.pdf?dl=0 seminar notes])
* [https://www.dropbox.com/s/1yjtu2ncpvmrnos/LAaG_HW_11_C%28221%29.pdf?dl=0 '''HW_11'''] (release: 27.11.2022; deadline: 04.12.2022) ([https://www.dropbox.com/s/x5y305l82lz6vnv/LAaG_Sem_26_11_22.pdf?dl=0 seminar notes])
* [https://www.dropbox.com/s/yghhc6t9h054pqk/LAaG_HW_10_C%28221%29.pdf?dl=0 '''HW_10'''] (release: 21.11.2022; deadline: 27.11.2022) ([https://www.dropbox.com/s/3a4x3lqatmp4w0w/LAaG_Sem_21_11_22.pdf?dl=0 seminar notes])
* [https://www.dropbox.com/s/zjpp8emz49w8key/LAaG_HW_9_C%28221%29.pdf?dl=0 '''HW_9'''] (release: 14.11.2022; deadline: 20.11.2022) ([https://www.dropbox.com/s/rf3bfr5e8jnfxkw/LAaG_Sem_14_11_22.pdf?dl=0 seminar notes])
* [https://www.dropbox.com/s/drhs254ubyi8xig/LAaG_HW_8_C%28221%29.pdf?dl=0 '''HW_8'''] (release: 07.11.2022; deadline: 13.11.2022) ([https://www.dropbox.com/s/344oifqz9ejrbn5/LAaG_Seminar_8%20%281%29.pdf?dl=0 seminar notes])
* [https://www.dropbox.com/s/g640u1jqu9ftpxz/LAaG_HW_7_C%28221%29.pdf?dl=0 '''HW_7'''] (release: 31.10.2022; deadline: 06.11.2022) ([https://www.dropbox.com/s/nw07dzjy2a1y10n/LAaG_Sem_31_10_22.pdf?dl=0 seminar notes])

'''Module 1'''
* [https://www.dropbox.com/s/8jwy4bgxtrlbt9j/LAaG_HW_6_C%28221%29.pdf?dl=0 '''HW_6'''] (release: 17.10.2022; deadline: 31.10.2022) ([https://www.dropbox.com/s/2ylm89wzhfj65xo/LAaG_Sem_6_17_10_22.pdf?dl=0 seminar notes])
* [https://www.dropbox.com/s/hj3jl4bk1ybwvzq/LAaG_HW_5_C%28221%29%20%281%29.pdf?dl=0 '''HW_5'''] (release: 15.10.2022; deadline: 23.10.2022) ([https://www.dropbox.com/s/tbcdn98m3n7omyj/LAaG_Sem_5_15_10_22.pdf?dl=0 seminar notes])
* [https://www.dropbox.com/s/gw9mf98sgronh3z/LAaG_HW_4_C%28221%29.pdf?dl=0 '''HW_4'''] (release: 10.10.2022; deadline: 16.10.2022) ([https://www.dropbox.com/s/vwr6akxdm0j9tcx/LAaG_%D0%A1%D0%B5%D0%BC_10_10_g221.pdf?dl=0 seminar notes])
* [https://www.dropbox.com/s/cjdp4127l7avi6q/LAaG_HW_3_C%28221%29.pdf?dl=0 '''HW_3'''] (release: 03.10.2022; deadline: 09.10.2022)
* [https://www.dropbox.com/s/9svjx3l8r61ovl3/LAaG_HW_2_C%28221%29.pdf?dl=0 '''HW_2'''] (release: 21.09.2022; deadline: 02.10.2022)
* [https://www.dropbox.com/s/gwvb5xv7h71cab3/LAaG_HW_1_C%28221%29%20%281%29.pdf?dl=0 '''HW_1'''] (release: 13.09.2022; deadline: 20.09.2022)

=== The obligatory homework for group 222: ===
'''Module 3'''
* [https://www.dropbox.com/s/18j7b49qj7yaabj/LAaG_HW_15.pdf?dl=0 '''HW 15'''] (release: 14.01.2022; deadline: 21.01.2022 9a.m.) ([https://www.dropbox.com/s/8nxpp9drbul0us7/LAaG_Sem_15.pdf?dl=0 seminar notes])
* As the lectures shifted numeration, I will denote this seminar again as 15, so we have two seminars 15 -- before and after the winter break. That's life.

'''Module 2'''
* There will be no HW 15. ([https://www.dropbox.com/s/1hpzfbfq90czrc2/LAaG_Sem_15.pdf?dl=0 seminar notes])
* [https://www.dropbox.com/s/yx4x69nnq2lmdmj/LAaG_HW_14.pdf?dl=0 '''HW 13+14'''] (release: 10.12.2022; deadline: 17.12.2022 9a.m.) ([https://www.dropbox.com/s/85b0ltsrqyovhbl/LAaG_Sem_13.pdf?dl=0 seminar notes 13][https://www.dropbox.com/s/flgs2eowdsdyw6g/LAaG_Sem_14.pdf?dl=0 seminar notes 14])
* [https://www.dropbox.com/s/a02t9ejuelak8m4/LAaG_HW_12.pdf?dl=0 '''HW 12'''] (release: 02.12.2022; deadline: 10.12.2022 9a.m.) ([https://www.dropbox.com/s/vroav7pr6nrh0rw/LAaG_Sem_12.pdf?dl=0 seminar notes])
* [https://www.dropbox.com/s/f6m8lveqnsvxkvb/LAaG_HW_11.pdf?dl=0 '''HW 11'''] (release: 25.11.2022; deadline: 03.12.2022 9a.m.) ([https://www.dropbox.com/s/jeo3hirevot8c07/LAaG_Sem_11.pdf?dl=0 seminar notes])
* [https://www.dropbox.com/s/jx9ncl5pxzpcdeo/LAaG_HW_10.pdf?dl=0 '''HW 10'''] (release: 18.11.2022; deadline: 26.11.2022 9a.m.) ([https://www.dropbox.com/s/cvpqoix7mwawots/LAaG_Sem_10.pdf?dl=0 seminar notes])
* [https://www.dropbox.com/s/wu7h8hgpqr8zbmq/LAaG_HW_9.pdf?dl=0 '''HW 9'''] (release: 14.11.2022; deadline: 21.11.2022 9a.m.) ([https://www.dropbox.com/s/57ynuk7mraekoiu/LAaG_Sem_9.pdf?dl=0 seminar notes])
* [https://www.dropbox.com/s/jvec4ofkttlqx8n/LAaG_HW_8.pdf?dl=0 '''HW 8'''] (release: 09.11.2022; deadline: 14.11.2022 9a.m.) ([https://www.dropbox.com/s/49gymbq5o6azaog/LAaG_Sem_8.pdf?dl=0 seminar notes])
* [https://www.dropbox.com/s/gp2i8ntemqqzydr/LAaG_HW_7.pdf?dl=0 '''HW 7'''] (release: 01.11.2022; deadline: 07.11.2022 9a.m.) ([https://www.dropbox.com/s/7uwll461y9w7k7z/LAaG_Sem_7.pdf?dl=0 seminar notes])

'''Module 1'''
* [https://www.dropbox.com/s/vgh5sa6bydm28er/LAaG_HW_6.pdf?dl=0 '''HW 6'''] (release: 19.10.2022; deadline: 31.10.2022 9a.m.) ([https://www.dropbox.com/s/l9swf9g7p7f797o/LAaG_Sem_6.pdf?dl=0 seminar notes])
* [https://www.dropbox.com/s/gw5x7zhlb4m69nt/LAaG_HW_5.pdf?dl=0 '''HW 5'''] (release: 13.10.2022; deadline: 18.10.2022 9a.m.) ([https://www.dropbox.com/s/oalj9gr6huq4er0/LAaG_Sem_5.pdf?dl=0 seminar notes])
* [https://www.dropbox.com/s/lypa2w54mqvihy5/LAaG_HW_4.pdf?dl=0 '''HW 4'''] (release: 03.10.2022; deadline: 10.10.2022 9a.m.) ([https://www.dropbox.com/s/32l5prkkxrx5v9e/LAaG_Sem_4.pdf?dl=0 seminar notes])
* [https://www.dropbox.com/s/mvvhnpvvsarysu4/LAaG_HW_3.pdf?dl=0 '''HW 3'''] (release: 24.09.2022; deadline: 29.09.2022 9a.m.) ([https://www.dropbox.com/s/mvrf3pkcxsfr8cs/LAaG_Sem_3.pdf?dl=0 seminar notes])
* [https://www.dropbox.com/s/27hx74eiy4ecsg6/LAaG_HW_2.pdf?dl=0 '''HW 2'''] (release: 15.09.2022; deadline: 22.09.2022 9a.m.) ([https://www.dropbox.com/s/wb7kf9dq4aju85x/LAaG_Sem_2.pdf?dl=0 seminar notes])
* [https://www.dropbox.com/s/hyowddyxx9umo6y/LAaG_HW_1.pdf?dl=0 '''HW 1'''] (release: 08.09.2022; deadline: 15.09.2022 9a.m.) ([https://www.dropbox.com/s/3vqmiuj5uzll5e1/LAaG_Sem_1.pdf?dl=0 seminar notes])

=== The obligatory homework for group 223: ===
'''Module 3'''
* [https://www.dropbox.com/s/18j7b49qj7yaabj/LAaG_HW_15.pdf?dl=0 '''HW 15'''] (release: 14.01.2022; deadline: 21.01.2022 9a.m.) ([https://www.dropbox.com/s/8nxpp9drbul0us7/LAaG_Sem_15.pdf?dl=0 seminar notes])
* As the lectures shifted numeration, I will denote this seminar again as 15, so we have two seminars 15 -- before and after the winter break. That's life.

'''Module 2'''
* There will be no HW 15. ([https://www.dropbox.com/s/1hpzfbfq90czrc2/LAaG_Sem_15.pdf?dl=0 seminar notes])
* [https://www.dropbox.com/s/yx4x69nnq2lmdmj/LAaG_HW_14.pdf?dl=0 '''HW 13+14'''] (release: 10.12.2022; deadline: 17.12.2022 9a.m.) ([https://www.dropbox.com/s/85b0ltsrqyovhbl/LAaG_Sem_13.pdf?dl=0 seminar notes 13][https://www.dropbox.com/s/flgs2eowdsdyw6g/LAaG_Sem_14.pdf?dl=0 seminar notes 14])
* [https://www.dropbox.com/s/a02t9ejuelak8m4/LAaG_HW_12.pdf?dl=0 '''HW 12'''] (release: 02.12.2022; deadline: 10.12.2022 9a.m.) ([https://www.dropbox.com/s/vroav7pr6nrh0rw/LAaG_Sem_12.pdf?dl=0 seminar notes])
* [https://www.dropbox.com/s/f6m8lveqnsvxkvb/LAaG_HW_11.pdf?dl=0 '''HW 11'''] (release: 25.11.2022; deadline: 03.12.2022 9a.m.) ([https://www.dropbox.com/s/jeo3hirevot8c07/LAaG_Sem_11.pdf?dl=0 seminar notes])
* [https://www.dropbox.com/s/jx9ncl5pxzpcdeo/LAaG_HW_10.pdf?dl=0 '''HW 10'''] (release: 18.11.2022; deadline: 26.11.2022 9a.m.) ([https://www.dropbox.com/s/cvpqoix7mwawots/LAaG_Sem_10.pdf?dl=0 seminar notes])
* [https://www.dropbox.com/s/wu7h8hgpqr8zbmq/LAaG_HW_9.pdf?dl=0 '''HW 9'''] (release: 14.11.2022; deadline: 21.11.2022 9a.m.) ([https://www.dropbox.com/s/57ynuk7mraekoiu/LAaG_Sem_9.pdf?dl=0 seminar notes])
* [https://www.dropbox.com/s/jvec4ofkttlqx8n/LAaG_HW_8.pdf?dl=0 '''HW 8'''] (release: 09.11.2022; deadline: 14.11.2022 9a.m.) ([https://www.dropbox.com/s/49gymbq5o6azaog/LAaG_Sem_8.pdf?dl=0 seminar notes])
* [https://www.dropbox.com/s/gp2i8ntemqqzydr/LAaG_HW_7.pdf?dl=0 '''HW 7'''] (release: 01.11.2022; deadline: 07.11.2022 9a.m.) ([https://www.dropbox.com/s/7uwll461y9w7k7z/LAaG_Sem_7.pdf?dl=0 seminar notes])

'''Module 1'''
* [https://www.dropbox.com/s/vgh5sa6bydm28er/LAaG_HW_6.pdf?dl=0 '''HW 6'''] (release: 19.10.2022; deadline: 31.10.2022 9a.m.) ([https://www.dropbox.com/s/l9swf9g7p7f797o/LAaG_Sem_6.pdf?dl=0 seminar notes])
* [https://www.dropbox.com/s/gw5x7zhlb4m69nt/LAaG_HW_5.pdf?dl=0 '''HW 5'''] (release: 13.10.2022; deadline: 18.10.2022 9a.m.) ([https://www.dropbox.com/s/oalj9gr6huq4er0/LAaG_Sem_5.pdf?dl=0 seminar notes])
* [https://www.dropbox.com/s/lypa2w54mqvihy5/LAaG_HW_4.pdf?dl=0 '''HW 4'''] (release: 03.10.2022; deadline: 10.10.2022 9a.m.) ([https://www.dropbox.com/s/32l5prkkxrx5v9e/LAaG_Sem_4.pdf?dl=0 seminar notes])
* [https://www.dropbox.com/s/mvvhnpvvsarysu4/LAaG_HW_3.pdf?dl=0 '''HW 3'''] (release: 24.09.2022; deadline: 29.09.2022 9a.m.) ([https://www.dropbox.com/s/mvrf3pkcxsfr8cs/LAaG_Sem_3.pdf?dl=0 seminar notes])
* [https://www.dropbox.com/s/27hx74eiy4ecsg6/LAaG_HW_2.pdf?dl=0 '''HW 2'''] (release: 15.09.2022; deadline: 22.09.2022 9a.m.) ([https://www.dropbox.com/s/wb7kf9dq4aju85x/LAaG_Sem_2.pdf?dl=0 seminar notes])
* [https://www.dropbox.com/s/hyowddyxx9umo6y/LAaG_HW_1.pdf?dl=0 '''HW 1'''] (release: 08.09.2022; deadline: 15.09.2022 9a.m.) ([https://www.dropbox.com/s/3vqmiuj5uzll5e1/LAaG_Sem_1.pdf?dl=0 seminar notes])

=== The obligatory homework for group 224: ===

'''Module 3'''
* [https://www.dropbox.com/s/mr7xmjm8c7aq4dm/LinAlg_seminars%20%2815%29.pdf?dl=0 '''HW_13'''] (release: 11.01.2023; deadline: 18.01.2023) ([https://www.dropbox.com/s/znkyiukrl3c42t6/laag%20note%20%289%29.pdf?dl=0 seminar notes])

'''Module 2'''
* [https://www.dropbox.com/s/6l2ptap5enbmvzg/LinAlg_seminars%20%2813%29.pdf?dl=0 '''HW_12'''] (release: 10.12.2022; deadline: 19.12.2022) ([https://www.dropbox.com/s/oenr2rr8rk34qjr/laag%20note%20%288%29.pdf?dl=0 seminar notes])
* [https://www.dropbox.com/s/44bzoj1uk1oml35/LinAlg_seminars%20%2812%29.pdf?dl=0 '''HW_11'''] (release: 01.12.2022; deadline: 08.12.2022) ([https://www.dropbox.com/s/tgmv9i5tzwu2xk6/laag%20note%20%287%29.pdf?dl=0 seminar notes])
* [https://www.dropbox.com/s/iowr7wnd25rjkgt/HW10.pdf?dl=0 '''HW_10'''] (release: 23.11.2022; deadline: 01.12.2022) ([https://www.dropbox.com/s/14xczv0pj96r3fs/laag%20note%20%286%29.pdf?dl=0 seminar notes])
* [https://www.dropbox.com/s/s5tg4flwaix7mpk/LinAlg_seminars%20%2810%29.pdf?dl=0 '''HW_9'''] (release: 16.11.2022; deadline: 25.11.2022) ([https://www.dropbox.com/s/ogsyyzbi0y0x5xj/laag%20note%20%285%29.pdf?dl=0 seminar notes])
* [https://www.dropbox.com/s/upau4ng5d3c6zdx/LinAlg_seminars%20%289%29.pdf?dl=0 '''HW_8'''] (release: 13.11.2022; deadline: 20.11.2022) ([https://www.dropbox.com/s/rkox0h7j1ynhmm1/laag%20note%20%284%29.pdf?dl=0 seminar notes])
* [https://www.dropbox.com/s/rsvo61ndgn8n1ym/LinAlg_seminars%20%287%29.pdf?dl=0 '''HW_7'''] (release: 04.11.2022; deadline: Skyrim's 11th anniversary) ([https://www.dropbox.com/s/yhjyngbobuqcxg9/laag%20note%20%282%29.pdf?dl=0 seminar notes])
'''Module 1'''
* [https://www.dropbox.com/s/uf2d7zpx4rztlvk/LinAlg_seminars%20%286%29.pdf?dl=0 '''HW_6'''] (release: 24.10.2022; deadline: 31.10.2022) ([https://www.dropbox.com/s/5etp6gouttre296/laag%20note%20%281%29.pdf?dl=0 seminar notes])
* [https://www.dropbox.com/s/sscmack5j8en3gl/LinAlg_seminars%20%285%29.pdf?dl=0 '''HW_5'''] (release: 16.10.2022; deadline: 23.10.2022) ([https://www.dropbox.com/s/92lxi866vsptvru/laag%20note.pdf?dl=0 seminar notes])
* [https://www.dropbox.com/s/4mcyst1dk93ptgt/LinAlg_seminars%20%284%29.pdf?dl=0 '''HW_4'''] (release: 08.10.2022; deadline: 14.10.2022)
* [https://www.dropbox.com/s/67vyu45xvu7m851/LinAlg_seminars%20%283%29.pdf?dl=0 '''HW_3'''] (release: 01.10.2022; deadline: 07.10.2022)
* [https://www.dropbox.com/s/sfuqhbox7azwn02/LinAlg_seminars%20%282%29.pdf?dl=0 '''HW_2'''] (release: 23.09.2022; deadline: 29.09.2022)
* [https://www.dropbox.com/s/avc19ij1dimwubr/LinAlg_seminars.pdf?dl=0 '''HW_1'''] (release: 15.09.2022; deadline: 21.09.2022)

== Exams ==

== Materials ==
[https://disk.yandex.ru/d/gc-_nasS-wYcJw Folder with some seminar (and lectures?) recordings] (managed by the Study Office)

== Results ==

'''Spring'''
{| class="wikitable" style="text-align:center"
|-
! [https://docs.google.com/spreadsheets/d/1dDhbutRcoeUOFCIM_GCoezoIxpaBnrV3H_hcRFx0Scg/edit?usp=sharing 221] !! [ 222] !! [https://docs.google.com/spreadsheets/d/1MfTxr03Iy5mILTyaMzZA1O9ho_jniyY-JCCp3kSjgzk/edit?usp=sharing 223] !! [https://docs.google.com/spreadsheets/d/1yc9sV-qfX33xP3Be2ziv5zs_R3diRc-tAU4pEUgpOhY/edit?usp=sharing 224]
|}

'''Fall'''
{| class="wikitable" style="text-align:center"
|-
! [https://docs.google.com/spreadsheets/d/1dDhbutRcoeUOFCIM_GCoezoIxpaBnrV3H_hcRFx0Scg/edit?usp=sharing 221] !! [https://docs.google.com/spreadsheets/d/1gSx67C3U62-n6IgoVs6s0JX7SMhD7rrupxEPcL2bKzo/edit 222-223] !! [https://docs.google.com/spreadsheets/d/1Jy4wq6Nza4c2CQcTVh3ab5xDKp-GXviXh2pO6jCvBOs/edit?usp=sharing 224]
|}

== Navigation ==
<div style="border:1px; border-style:solid; border-color:#a2a9b1; padding:3px">
<table style="border-spacing:0; background:transparent; color:inherit; width:100%">
<tr>
<th scope="colgroup" style="background-color:#cfe3ff" colspan="2"><div id="DSBA22" style="font-size:114%; margin:0 5em">DSBA 2022/2023</div></th>
</tr>
<tr >
<th scope="row" style="border-top-width:2px; border-top-color:#fdfdfd; border-top-style:solid; width:10%; background-color:#dcebff">First year</th>
<td style="text-align:left; border-left-width:2px; border-left-style:solid; border-color:#fdfdfd; width:90%; padding:0px">
<div style="padding:0em 0.25em">
<ul><li style="display:inline-block; padding:2px">[[LAaG_DSBA_2022/2023|Linear Algebra and Geometry]] • </li><li style="display:inline-block; padding:2px">[[Discrete_Mathematics_DSBA_2022/2023|Discrete Mathematics]] • </li><li style="display:inline-block; padding:2px">[[Calculus_DSBA_2022/2023|Calculus]] • </li><li style="display:inline-block; padding:2px">[[Introduction_to_Programming_DSBA_2022/2023|Introduction to Programming]] • </li><li style="display:inline-block; padding:2px">[[Algebra_DSBA_2022/2023|Algebra]] </li></ul>
</div></td>
</tr>
</table>
</div>

LAaG DSBA 2022/2023

2022-09-05T19:09:55Z

Obozhenov: /* Teachers and Assistants */