Mathematics for Computer Science

6.042 course logo: 4 by 4 square with numbers in each square.

6.042 serves as an introduction to discrete mathematics, probability, and mathematical thinking for computer scientists. (Image by OpenCourseWare, based on an image by Nick Matsakis.)


MIT Course Number

6.042J / 18.062J

As Taught In

Spring 2015



Cite This Course

Course Description

Course Features

Course Description

This subject offers an interactive introduction to discrete mathematics oriented toward computer science and engineering. The subject coverage divides roughly into thirds:

  1. Fundamental concepts of mathematics: Definitions, proofs, sets, functions, relations.
  2. Discrete structures: graphs, state machines, modular arithmetic, counting.
  3. Discrete probability theory.

On completion of 6.042J, students will be able to explain and apply the basic methods of discrete (noncontinuous) mathematics in computer science. They will be able to use these methods in subsequent courses in the design and analysis of algorithms, computability theory, software engineering, and computer systems.

Interactive site components can be found on the Unit pages in the left-hand navigational bar, starting with Unit 1: Proofs.

Other Versions

Related Content

Albert Meyer, and Adam Chlipala. 6.042J Mathematics for Computer Science. Spring 2015. Massachusetts Institute of Technology: MIT OpenCourseWare, License: Creative Commons BY-NC-SA.

For more information about using these materials and the Creative Commons license, see our Terms of Use.