**MATH 402**

**Enumerative Combinatorics**

**Units: 3.00**

Enumerative combinatorics is concerned with counting the number of elements of a finite set. The techniques covered include inclusion-exclusion, bijective proofs, double-counting arguments, recurrence relations, and generating functions. Given jointly with MATH 802.

**Learning Hours:**120 (36 Lecture, 84 Private Study)

**Requirements:**Prerequisite MATH 210 or MATH 211. Recommended Experience with abstract mathematics and mathematical proof, and a good foundation in linear algebra.

**Offering Faculty:**Faculty of Arts and Science

**Course Learning Outcomes:**

- Understand the role of generating functions in combinatorial analysis.
- With the study of examples and proofs, interact with a variety of concepts and techniques from enumerative combinatorics.
- Work with counting techniques, permutations, partitions, cardinality, and Fibonacci and Catalan numbers.