MATH273 - Combinatorics

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

Combinatorics
MATH 273 FA

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

Bogard, Kenneth P., INTRODUCTORY COMBINATORICS, 3rd edition

EXAMINATIONS AND ASSIGNMENTS

Regular homework, 1 or 2 exams, final exam and projects.

ADDITIONAL REQUIREMENTS and/or COMMENTS

Students should review the technique of mathematical induction and linear algebra facts before the beginning of the course. Students should already have taken either Math 223; or Math 228; or Math 221 and Math 222.

COURSE FORMAT: Lecture/Discussion

REGISTRATION INFORMATION

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

Prerequisites: NONE

SECTION 01

Instructor(s): Collins,Karen L.

Times: ..T.R.. 10:30AM-11:50AM; Location: SCIE618;

Reserved Seats: (Total Limit: 25)

SR. major: 0 Jr. major: 0

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

Special Attributes:

Curricular Renewal: Quantitative Reasoning, Writing

Links to Web Resources For This Course.

Last Updated on MAR-30-2006