| Activities | Percentages |
|---|---|
| 3 In-class Exams | 50% |
| Problem Sets | 50% |
Table of Contents
Syllabus
Syllabus
 When you click the Amazon logo to the left of any citation and purchase the book (or other media) from Amazon.com, MIT OpenCourseWare will receive up to 10% of this purchase and any other purchases you make during that visit. This will not increase the cost of your purchase. Links provided are to the US Amazon site, but you can also support OCW through Amazon sites in other regions. Learn more. |
Prerequisite
Calculus (18.02)
Description
This course covers topics such as enumeration, generating functions, recurrence relations and construction of bijections. It also provides an introduction to graph theory, network algorithms and extremal combinatorics. Prior experience with abstraction and proofs will be helpful.
Recommended Textbooks
Required Textbook
Bona, M. A Walk through Combinatorics. 1st ed. Singapore, SG: World Scientific Publishing Company, 2002. ISBN: 9810249012.
Additional Reading
Stanley, R. P., Sergey Fomin, B. Bollobas, W. Fulton, A. Katok, F. Kirwan, P. Sarnak, and B. Simon. Enumerative Combinatorics. Vol. 1 and 2. Cambridge, UK: Cambridge University Press, 2001. ISBN: 0521789877.
Brualdi, R. Introductory Combinatorics. 3rd or 4th ed. Upper Saddle River, NJ: Prentice Hall. ISBNs: 0131814885 or 0131001191.
Problem Sets
Five, due every second Tuesday.
Grading
The grade for this course will be determined by 3 quizzes and problem sets.