6.042J | Fall 2010 | Undergraduate
Mathematics for Computer Science


This section contains the course notes, Mathematics for Computer Science. Chapter 8 is not available on MIT OpenCourseWare.

These notes are courtesy of Eric Lehman, Tom Leighton, and Albert Meyer, and are used with permission.

Complete course notes (PDF - 3.2MB)
Part I: Proofs
Chapter 1: Propositions (PDF)
Chapter 2: Patterns of proof (PDF)
Chapter 3: Induction (PDF)
Chapter 4: Number theory (PDF)
Part II: Structures
Chapter 5: Graph theory (PDF)
Chapter 6: Directed graphs (PDF)
Chapter 7: Relations and partial orders (PDF)
Chapter 8: State machines  
Part III: Counting
Chapter 9: Sums and asymptotics (PDF)
Chapter 10: Recurrences (PDF)
Chapter 11: Cardinality rules (PDF)
Chapter 12: Generating functions (PDF)
Chapter 13: Infinite sets (PDF)
Part IV: Probability
Chapter 14: Events and probability spaces (PDF)
Chapter 15: Conditional probability (PDF)
Chapter 16: Independence (PDF)
Chapter 17: Random variables and distributions (PDF)
Chapter 18: Expectation (PDF)
Chapter 19: Deviations (PDF)
Chapter 20: Random walks (PDF)
Course Info
Learning Resource Types
assignment Problem Sets
grading Exams with Solutions
theaters Lecture Videos