MATB111
Discrete Mathematics

Course Description

Sets, subsets, intersection and unions. Equivalence relations and functions. Permutations, combinations, inclusion and exclusion principle, and pigeon-hole principle. Integers, Euclidean division, greatest common divisors, Bezout theorem, modular arithmetic, and Fermat little theorem. Polynomials, generating functions, recursive sequences. Graphs. Eulerian and Hamiltonian graphs, bipartite graphs, direct graphs and trees.


Prerequisite

None

Syllabus

Back to Course List