MATH 3710 - Combinatorics

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.

Grade Mode: Normal, Audit

Prerequisites: MATH2012 >= C

Credit Hours: 3
Lecture Hours: 3

Repeat Status: No

Click here for the Schedule of Classes.

Print this Page

Information for:

Resources

Learning
Like No
Other

MATH 3710 - Combinatorics