MATH 273
Spring 2009 not offered
|
This course will present a broad, comprehensive survey of combinatorics. Topics will include partitions, combinatorial sequences (Fibonacci, Catalan, and Stirling), the technique of inclusion-exclusion, generating functions, recurrence relations, and combinatorial designs. |
|
Essential Capabilities:
None |
| Credit: 1 |
Gen Ed Area Dept:
NSM MATH |
| Course Format: Lecture / Discussion | Grading Mode: Graded |
| Level: UGRD |
Prerequisites: None |
|
Fulfills a Requirement for: (COMP)(MATH)(NS&B) |
Major Readings:
To be announced.
|
Examinations and Assignments:
Regular homework, midterms, final exam and projects. |
Additional Requirements and/or Comments:
Students should review linear algebra facts before the beginning of the course. Students should already have taken MATH201; or MATH223; or MATH228; or MATH221 and MATH222. |
| Drop/Add Enrollment Requests | | | | | |
| Total Submitted Requests: 0 | 1st Ranked: 0 | 2nd Ranked: 0 | 3rd Ranked: 0 | 4th Ranked: 0 | Unranked: 0 |
|