[WesMaps Home Page] [Course Search] [Course Search by CID]
MATH273

Combinatorics
MATH273 SP

Next Offered in 9899 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. In addition, we will discuss the four-color theorem and learn about platonic solids. Amaze your friends by learning to create magic squares of any odd order! A lifetime supply of binomial coefficients is provided.

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

REGISTRATION INFORMATION

Level: UG Credit: 1.00 Gen Ed Area & Dept: NSM MATH

Prerequisites: MATH201 or MATH228

Last Updated on MAR-03-1998


Contact wesmaps@wesleyan.edu to submit comments or suggestions.

Copyright Wesleyan University, Middletown, Connecticut, 06459