Course description: In this course, we will study various counting techniques that arise in many fields of mathematics. Topics include: generating functions, recurrence relations, permutations and combinations, inclusion-exclusion, enumeration, and graph theory. We will use the textbook for the course as a guide but outside material will also be introduced.

Prerequisite: Math 501 or an equivalent course, or permission of professor.

Homework: Homework is the most important part of this class. It should demonstrate your knowledge of the material and your skill at writing proofs. Homework will typically be collected at the end of class on Friday. Working in groups is both allowed and encouraged but you should write up your solutions independently. The beginning of each class will be used to go over selected homework problems.
Detailed information on homework and exams

Text: Combinatorics: Topics, Techniques, Algorithms (First Edition), by Peter J. Cameron.

Examinations: There will be 2 midterm exams and a final exam. Each exam will have an in-class component and a take home component. The in-class component will be fairly routine but the take home component will be rather difficult.

Grading: The course grades will be computed as follows.
40% Homework; 40% Midterms; 20% Final.

Help: Office hours will officially be Monday 9:00 - 10:00 and Friday 9:00 - 10:00. Unofficially, you should drop by whenever you like. My office is Weber 220.