Wesleyan Home Page
WesMaps Home Page
Course Search by CID
Academic Year 2005/2006
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
recurrence relations, and combinatorial designs.
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.
Gen Ed Area Dept:
Links to Web Resources For This Course.
- 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
- Curricular Renewal: Quantitative Reasoning, Writing
Last Updated on MAR-30-2006
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