Featuring recorded lectures from the Harvard School of Engineering and Applied Sciences course Computer Science 20, this course covers widely applicable mathematical tools for computer science, including topics from logic, set theory, combinatorics, number theory, probability theory, and graph theory. It includes practice in reasoning formally and proving theorems. Students meet twice a week via web conference to solve problems collaboratively.
Welcome to Discrete Mathematics, a subject that is off the beaten track that most of us followed in school but that has vital applications in computer science, cryptography, engineering, and problem solving of all types. Most of the mathematics taught after elementary school is aimed at preparing students for one subject—calculus, which is the mathematics of how things grow and change continuously, like waves in the water or clouds in the sky. Discrete mathematics, on the other hand, deals with quantities that can be broken into neat little pieces, like pixels on a computer screen, the letters or numbers in a password, or directions on how to drive from one place to another.