6.120a Discrete Mathematics And Proof For Computer Science -

Logical notation, set theory, and relations.

This is where 6.120a separates the novice from the practitioner. Students learn not just what is true, but why it is true. The major proof strategies include: 6.120a Discrete Mathematics And Proof For Computer Science

The alumni of 6.120a report that this course directly prepares them for: Logical notation, set theory, and relations

The RSA cryptosystem, which secures online transactions, is built entirely on modular exponentiation and the difficulty of factoring large numbers. Understanding why RSA works requires proving that encryption and decryption are inverses using Fermat’s theorem. Moreover, hashing, checksums, and pseudorandom number generators all rely on modular arithmetic. 6.120A demystifies these connections, showing how pure discrete mathematics directly enables secure communication. The major proof strategies include: The alumni of 6

is an undergraduate subject at MIT designed to provide students with the foundational mathematical tools and rigorous proof techniques essential for modern computer science. Course Overview