Mathematics: Basic Combinatorial Theory

Introduction to basic combinatorial principles emphasizing problem-solving techniques. Enumeration, generating functions, Fibonacci numbers, pigeonhole principle, inclusion-exclusion, and graph theory. Prerequisites: MATH 2055 (preferred) or CS 1640.

Prereqs enforced by the system: MATH 2055 or CS 1640; Open to Degree and PACE students

This is a first course in combinatorial theory for undergraduate students. This course is proof-based, but not much knowledge will be assumed and it will be an opportunity to strengthen your mathematical foundations. The course will cover topics such as functions, combinatorial enumeration, generating functions, discrete probability, basic graph theory and applications.

This course will be offered as a lecture, with time spent in class discussing problems. Students should expect to spend 6-8 hours per week on this course outside of class time, reviewing the material and completing homework problems. There is no textbook, but we will use lecture notes as well as various resources which are all available for free.

Grades will be based on homework and in-class tests, with plenty of opportunities to improve before the end of the semester.