Lecture Notes | Mathematics for Computer Science | Electrical Engineering and Computer Science | MIT OpenCourseWare

Course Info

Instructors

Departments

As Taught In

Spring 2024

Level

Undergraduate

Topics

Learning Resource Types

Lecture Videos

Lecture Notes

Readings

Problem Sets

Open Textbooks

Download Course

Lecture Notes

Notes are unavailable for lecture 23.

Lecture 01: Proofs, Lecture Notes

Lecture 02: Contradiction and Induction, Lecture Notes

Lecture 03: Casework and Strong Induction, Lecture Notes

Lecture 04: State Machines, Lecture Notes

Lecture 05: Sums, Lecture Notes

Lecture 06: Asymptotics, Lecture Notes

Lecture 07: Recurrences, Lecture Notes

Lecture 08: Divisibility, Lecture Notes

Lecture 09: Modular Arithmetic, Lecture Notes

Lecture 10: Cryptography, Lecture Notes

Lecture 11: Graphs and Coloring, Lecture Notes

Lecture 12: Matching, Lecture Notes

Lecture 13: Connectivity Trees, Lecture Notes

Lecture 14: Diagraphs, Lecture Notes

Lecture 15: Relations and Counting, Lecture Notes

Lecture 16: Counting, Lecture Notes

Lecture 17: More Counting, Lecture Notes

Lecture 18: Introduction to Probability, Lecture Notes

Lecture 19: Conditional Probability, Lecture Notes

Lecture 20: Independence, Lecture Notes

Lecture 21: Random Variables, Lecture Notes

Lecture 22: Expectation, Lecture Notes

Lecture 24: Large Deviations, Chebyschev and Chernoff Bound, Wrap Up Lecture Notes

Course Info

Instructors

Departments

As Taught In

Spring 2024

Level

Undergraduate

Topics

Learning Resource Types

Lecture Videos

Lecture Notes

Readings

Problem Sets

Open Textbooks

Download Course

MIT Open Learning

Over 2,500 courses & materials

Freely sharing knowledge with learners and educators around the world. Learn more

© 2001–2025 Massachusetts Institute of Technology

Accessibility

Creative Commons License

Terms and Conditions

Proud member of:

© 2001–2025 Massachusetts Institute of Technology