[ Wesleyan Home Page ] [ WesMaps Home Page ] [ WesMaps Archive ] [ Course Search ] [ Course Search by CID ]
Academic Year 2005/2006

Combinatorics
MATH 273 SP

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.

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.

COURSE FORMAT: Lecture/Discussion

REGISTRATION INFORMATION

Level: UGRD    Credit: 1    Gen Ed Area Dept: NSM MATH    Grading Mode: Graded   

Prerequisites: NONE Links to Web Resources For This Course.

Last Updated on MAR-30-2006

Contact wesmaps@wesleyan.edu to submit comments or suggestions. Please include a url, course title, faculty name or other page reference in your email

Copyright Wesleyan University, Middletown, Connecticut, 06459