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

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

EXAMINATIONS AND ASSIGNMENTS

ADDITIONAL REQUIREMENTS and/or COMMENTS

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

SECTION 01

Instructor(s): Collins,Karen L.   

Instructor's Course Page

Times: .M.W... 01:10PM-02:30PM;     Location: SCIE638

Reserved Seats:    (Total Limit: 30)

SR. major: 8   Jr. major: 7

SR. non-major: 2   Jr. non-major: 2   SO: 8   FR: 3

Special Attributes:

Curricular Renewal:    Quantitative Reasoning, Writing

Last Updated on MAR-26-2001

Copyright Wesleyan University, Middletown, Connecticut, 06459