MA 530Discrete Mathematics

Catalog

This course provides the student of mathematics or computer science with an overview of discrete structures and their applications, as well as the basic methods and proof techniques in combinatorics. Topics covered include sets, relations, posets, enumeration, graphs, digraphs, monoids, groups, discrete probability theory and propositional calculus. (Prerequisites: college math at least through calculus. Experience with recursive programming is helpful, but not required.)