Mathematics for Computer Science (6.042J)

Proof and discrete math for computing

This course builds the discrete mathematics behind computer science and engineering. Definitions and proofs come first, with applicable methods following them, so you learn to reason rigorously about the structures software relies on.

Core topics

• Formal logic and proof methods, including induction
• Sets, relations and elementary graph theory
• Integer congruences and the growth of functions
• Counting principles and discrete probability

Further options

Recursive definitions, state machines, recurrences and generating functions may also be covered. Readers who want a mathematical foundation for algorithms and systems design will find it directly relevant. The emphasis on precise definitions makes it a useful companion to any later course that relies on proofs about graphs or probability.