[WesMaps 98/99 Home Page]
[Course Search]
[Course Search by CID]
MATH273
Combinatorics
MATH273 FA
| Section | Class Size | *Available | Times | POI | Prereq |
|---|
| 1 | 42 | 3 | Times: .T.T... 10:00AM-11:20AM; | No | Yes |
*The number of spaces listed as available is based on class seats open for
the Blue Add phase of registration. Some seats may be taken in previous
phases while others may be held out for subsequent phases of registration.
(Last Updated on Tue Aug 10 05:00:30 EDT 1999
)
Selected topics in the theory of enumeration, including
generating functions, recurrence relations, the principle of
inclusion-exclusion, counting techniques and the
pigeon-hole principle. The emphasis will be on "why" as
opposed to "how", and on theorems (and proofs) as opposed to
computations. There will be no applications, just the study
of mathematics for its own sake.
MAJOR READINGS
INTRODUCTORY COMBINATORICS, 3rd edition by
Richard Brualdi
EXAMINATIONS AND ASSIGNMENTS
Weekly group homework, exams
if appropriate.
ADDITIONAL REQUIREMENTS and/or COMMENTS
Beyond various
facts and techniques from linear algebra (vectors and
matrices), the most important requirement is a willingness
to accept formalism and abstraction in mathematics.
COURSE FORMAT: Discussion Lecture
REGISTRATION INFORMATION
Level: UG Credit: 1.00
Prerequisites:
MATH221 or MATH223
- Section 01
- Coven, E
- Times: .T.T... 10:00AM-11:20AM;
- Grading Mode: A/F
- Registration Preference (1 high to 6 low, 0=Excluded) Sr: 1, Jr: 1, So: 1, Fr: 1
- No Major Preference Given
Last Updated on MAR-22-1999
Contact wesmaps@wesleyan.edu to
submit comments or suggestions.
Copyright Wesleyan University, Middletown, Connecticut, 06459