[ Wesleyan Home Page ] [ WesMaps Home Page ] [ WesMaps Archive ] [ Course Search ] [ Course Search by CID ]
Academic Year 2000/2001

Combinatorics
MATH 273 SP

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

Weekly homework, a midterm and a final

ADDITIONAL REQUIREMENTS and/or COMMENTS

If you do not meet the course prerequisites, you may add this course with the permission of the instructor.

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-26-2001

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