This is an archived course. A more recent version may be available at ocw.mit.edu.
Lectures: 2 sessions / week, 1.5 hours / session
Calculus (18.02)
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.
Bona, M. A Walk through Combinatorics. 1st ed. Singapore, SG: World Scientific Publishing Company, 2002. ISBN: 9810249012.
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.
Five, due every second Tuesday.
The grade for this course will be determined by 3 quizzes and problem sets.
| Activities | Percentages |
|---|---|
| 3 In-class Exams | 50% |
| Problem Sets | 50% |
MIT OpenCourseWare makes the materials used in the teaching of almost all of MIT's subjects available on the Web, free of charge. With more than 2,200 courses available, OCW is delivering on the promise of open sharing of knowledge.
© 2001–2015
Massachusetts Institute of Technology
Your use of the MIT OpenCourseWare site and materials is subject to our Creative Commons License and other terms of use.
Subscribe to the OCW Newsletter
