Discrete Mathematics for Computer Science

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.