Дворниченко, Аліна ВасилівнаДворниченко, Алина ВасильевнаDvornychenko, Alina VasylivnaЛисенко, Олександр Володимирович (ЕлІТ)Лысенко, Александр Владимирович (ЕлІТ)Lysenko, Oleksandr Volodymyrovych (ЕлІТ)2022-07-192022-07-192022Dvornichenko A. V., Lysenko O. V. Discrete Mathematics and Theory of Algorithms : lecture notes for students of speciality 113”Applied Mathematics” of full-time course of stud.: in four parts. P. 2. Sumy : Sumy State University, 2022. 148 p.0000-0003-4530-4262https://essuir.sumdu.edu.ua/handle/123456789/88704A discrete mathematics and theory of algorithms course has more than one purpose. Students should learn a particular set of mathematical facts and how to apply them; more importantly, such a course should teach students how to think logically and mathematically. To achieve these goals, this text stresses mathematical reasoning and the different ways problems are solved. Two important themes are interwoven in this text: inductions and recursions and counting. A successful discrete mathematics and theory of algorithms course should carefully blend and balance two these themes. In the lecture materials, we used a number of books, among which we will single out the wonderful book by [1]. In the second part of the lecture notes, we consider the following sections: “Inductions and Recursions” and “Counting”.encneдискретна математикаалгоритмиdiscrete mathalgorithmsLearning Object