[ Wesleyan Home Page ] [ WesMaps Home Page ] [ WesMaps Archive ] [ Course Search ] [ Course Search by CID ]
Academic Year 2002/2003

Combinatorics
MATH 273 FA

Selected topics in the theory of enumeration, including generating functions, recurrence relations, the principle of inclusion-exclusion, counting techniques and the pigeon-hole principle. Writing clear, elegant proofs will be the main focus of the course.

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.

Unless preregistered students attend the first class meeting or communicate directly with the instructor prior to the first class, they will be dropped from the class list. NOTE: Students must still submit a completed Drop/Add form to the Registrar's Office.

COURSE FORMAT: Lecture/Discussion

REGISTRATION INFORMATION

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

Prerequisites: MATH201 OR (MATH221 AND MATH222) OR MATH223 OR MATH228 Links to Web Resources For This Course.

Last Updated on MAR-18-2003

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