Math 413. Intro to Combinatorics
Instructor Syllabus
Text: Richard A. Brualdi, Introductory Combinatorics, 3rd Edition, Prentice-Hall, 1999.
The aim of this course is to give an introduction to finite mathematics, like enumerations, sieve method, designs and other symmetric configurations, (no or very little about graphs). We emphasize techniques, but also present proofs of theorems.
| Class Hours |
|
| What is Combinatorics (Sections 1.1, 1.2, 1.4, 1.5) | 4 |
| Pigeonhole (Ch. 2) | 3 |
| Permutations and Combinations (Ch. 3) | 6 |
| Binomial coefficients (Ch. 5 minus 5.7) | 6 |
| Inclusion-Exclusion (Ch. 6 minus 6.5) | 4 |
| Recurrence and generating functions (Ch. 7) | 8 |
| Special sequences (Catalan, Stirling) (Ch. 8 minus 8.4) | 3 |
| Combinatorial Designs (Ch. 10) | 5 |
| Exams and leeway | 5 |
| Total | 44 |
Last modified June 17, 2002