Inst. coordinator:
Contact: Office

Back to module list

FCS-00054: Discrete Mathematics (summer)


Description:Mathematical induction; recursion and chosen methods of its solving. Basics of arithmetics of integers; modular arithmetics. Basic notions and objects of combinatorics, their properties and techniques of counting, in particular the Pigeon Hole Principle and the Principle of Inclusion - Exclusion Principle. Generating functions. Asymptotics of functions. Basic notions and theorems of graph theory, in particular, a characterization of Euler and Hamiltonian graphs, properties of connected graphs, planar graphs and trees, counting of spanning trees, colourings of graphs.


Current teachers:
Zbigniew Zaczkiewicz (

NOTE: This module is also available in WINTER