About MATH 2678 A
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.
Notes
Prereqs enforced by the system: MATH 2055 or CS 1640; Open to Degree and PACE students
Section Description
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.
Section Expectation
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.
Evaluation
Grades will be based on homework and in-class tests, with plenty of opportunities to improve before the end of the semester.
Important Dates
Note: These dates may change before registration begins.
Note: These dates may not be accurate for select courses during the Summer Session.
| Last Day to Add | |
|---|---|
| Last Day to Drop | |
| Last Day to Withdraw with 50% Refund | |
| Last Day to Withdraw with 25% Refund | |
| Last Day to Withdraw |
Resources
There are no courses that meet this criteria.
Interest Form
MATH 2678 A is closed to new enrollment.
But we can remind you a few days before the next term opens. You can also see what terms are enrolling currently.