MATH 2678 A (CRN: 12634)
Mathematics: Basic Combinatorial Theory (A)
3 credit hours
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 (preferred) or CS 1640; Open to Degree and PACE students
Section Description
Introduction to basic combinatorial principles emphasizing problem-solving techniques. Topics will include basic enumeration, inclusion-exclusion, generating functions, and Polya counting. Mathematica will be used throughout the course.
Section Expectation
There will be ungraded homework for practice, as well as assignments and exams that count toward the grade. The two mid-term exams will be held in the evening (dates/times TBA). If you have a conflict with an evening exam, you will be allowed to reschedule.
Evaluation
Grades will be based on assignments, two mid-term exams, and a cumulative final exam.
Important Dates
Courses may be cancelled due to low enrollment. Show your interest by enrolling.
| 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 |