Summer Semester 2008/09
Winter Semester 2009/10
Winter Semester 2010/11
Winter Semester 2011/12
Winter Semester 2012/13
Winter Semester 2013/14
Summer Semester 2015/16
Discrete Mathematics IN081203
Course content:
1.Tee mathematical induction and complete induction. Recursion, the recursive definitions of sequences,
2. Selected elements of the theory of numbers: Euclidean algorithm, modular arithmetic.
3. Basic combinatorial definitions, counting techniques.
4. Stirling Numbers of the first and second kind.
5. Basic concepts of graph theory. Computer representation of graphs. Trees and their characterization and the spanning trees graph.
6. The Hamilton and Euler cycles and paths .
Learning outcomes:
student can use the induction,the elements of number theory, the basic techniques of combinatorial, basic concepts of the graph theory
(in Polish) Rodzaj przedmiotu
Course coordinators
Term 2013Z: | Term 2009Z: | Term 2010Z: | Term 2012Z: | Term 2011Z: |
Bibliography
a) basic references:
1. Victor Bryant, Aspekty kombinatoryki, Wydawnictwo Naukowo-Techniczne, Warszawa 1997.
2. Kenneth A. Ross, Charles R.B. Wright, Matematyka dyskretna, Wydawnictwo Naukowe PWN, Warszawa
2001.
3. Robin J. Wilson, Wstęp do teorii grafów, Wydawnictwo Naukowe PWN, Warszawa 1998.
b) supplementary references:
1. Ronald L. Graham, Donald E. Knuth, Oren Patashnik, Matematyka konkretna, Wydawnictwo Naukowe PWN,
Warszawa 1998.
2. Donald E. Knuth, Sztuka programowania, t. 1-3, Wydawnictwo Naukowo-Techniczne, Warszawa 2003.
3. Witold Lipski, Kombinatoryka dla programistów, Wydawnictwo Naukowo-Techniczne, Warszawa 1982.