Combinatorics

Catalog description

A first course in enumeration. Topics include permutations and combinations of finite sets and multisets, properties of the binomial coefficients, the inclusion-exclusion formula, recurrences, generating functions, the Fibonacci sequence, and applications of Burnside’s lemma. The idea of the combinatorial proof is emphasized throughout the course. Prerequisite(s): CSCI 3030 >= C or MATH 2012 >= C or MATH 2020 >= C or MATH 2030 >= C Lecture Hours: 3 Repeatability: May not be repeated for credit. Grade Mode: Normal, Audit Schedule Type (Primary): Lecture Click here for the Schedule of Classes.