Loading page · 正在加载页面
Loading page · 正在加载页面
Harvard University · CS 20
计算机科学离散数学
Mathematical tools for computer science including formal proof, logic, set theory, induction, graph theory, combinatorics, number theory, probability, recurrences, and public-key cryptography.
Subject：Discrete Mathematics
Level：Introductory
Suggested stage：Year 1 (inferred)
Public-material edition：Official course page (year not stated)
Language：English
Videos：Not verified
Assignments / solutions：Not verified / Not verified
Not explicitly listed by the official source; no assumption made.
Start here
Lectures, video, assignments and exams are separated so you do not have to hunt through the course homepage.
Use these to browse a complete resource collection; the section above links directly to individual study items.
Every link points to an official university or course-team page. The year identifies the linked public-material edition, not necessarily the latest on-campus offering; a school may have newer materials that are not public. Unknown facts remain unverified rather than guessed.
Harvard John A. Paulson School of Engineering and Applied Sciences · verified 2026-08-22