1 |
Title of discipline |
Discrete mathematics and graph theory |

2 |
Year of study |
1, Specialty “Mathematics (scientific and design activities)” |

3 |
Semester of study |
2 |

4 |
Number of credits |
2 |

5 |
Full name of lecturer |
Doctor of physical and mathematical sciences, Professor Emelichev Vladimir Alekseevich |

6 |
Objectives of studying the discipline |
Acquaintance with the problems and methods of discrete mathematics. Forming the skills of discrete mathematical thinking and the ability to apply it in solving specific problems. |

7 |
Prerequisites |
Initial information from the theory of mappings, set theory and linear algebra |

8 |
Content of discipline |
Samples, cube, permutations. Subsets, Boolean. Binomial theorem and consequences. Method of mathematical induction. Inclusion and exclusion method, Eratosthenes sieve. The number of disorders, Euler’s formula. Recurrence relations, the Binet formula. Generating functions. Elements of the theory of coding. |

9 |
Recommended literature |
1. Vilenkin N.Ya. Combinatorics. – Moscow: Nauka, 1969. (in Russian) |

10 |
Teaching methods |
Reproductive (passive), visual, comparative, dialog-heuristic, problem, research |

11 |
Language of study |
Russian |

12 |
Current test activities |
Theoretical colloquium, written test work |

13 |
Type of current certification |
Test |