MAT 148 - Discrete Mathematics

Course Objectives

To provide the necessary discrete mathematics background to mathematics majors.

Course Description

Counting and finite sets. Additive and multiplicative counting. Combinations and permutations. Inclusion/exclusion and pigeon-home principles. Ramsey theory. Partial and total functions. Recursion and recursive functions. Recursive counting. Generating functions, and counting with generating functions. Graphs. Directed and undirected graphs. Simple graphs. Isomorphisms of graphs. Walks and paths on graphs. Geodesic paths and distance on graphs. Eccentricity, radius and diameter on graphs. Representations of graphs. Counting paths on graphs.