# Class Notes for 6.042J at Massachusetts Institute of Technology (MIT)

- 21 Results
- About MIT

## 6.042J Lecture Notes - Lecture 8: Public-Key Cryptography, Coprime Integers, Boolean Satisfiability Problem

27

In 1977, three professors at mit proposed a highly secure crypto-system, called rsa, based on number theory. The purpose of the rds scheme is to transm

View Document## 6.042J Lecture Notes - Lecture 1: Perfect Number, Number Theory, Linear Combination

8

Number theory underlies modern cryptography, which is what makes secure online communication possible. Number theory also provides an excellent environ

View Document## 6.042J Lecture Notes - Lecture 4: Binary Relation, Partial Function, Total Relation

5

A function assigns an element of one set (the domain) to an element of another set (the codomain) The notation : a > b indicated that is a function wit

View Document## 6.042J Lecture Notes - Lecture 20: Pigeonhole Principle, Bijection, Disjoint Sets

6

Number of operations to update a data structure. This is the same as saying how many comparisons are needed to sort n items. This is the same as saying

View Document## 6.042J Lecture Notes - Lecture 22: Partially Ordered Set, If And Only If, Antisymmetry

21

The properties of the walk relation in dags. For any digraph, g, the walk relations g+ and g* are transitive. A binary relation, r, on a set, a, is tra

View Document## 6.042J Lecture Notes - Lecture 26: Directed Acyclic Graph, Antichain, Partially Ordered Set

5

## 6.042J Lecture Notes - Lecture 18: Cumulative Distribution Function, Bernoulli Distribution, Random Variable

6

## 6.042J Lecture Notes - Lecture 7: Generating Function, Fibonacci Number, Pigeonhole Principle

10

## 6.042J Lecture Notes - Lecture 11: Conditional Expectation, Random Variable, Sample Space

9

The expectation or expected value of a random variable is a single number that reveals a lot about the behavior of the variable. The expectation of a r

View Document## 6.042J Lecture Notes - Lecture 12: Mathematical Induction, If And Only If, Graph Coloring

9

A bipartite graph is a graph whose vertices can be partitioned into two sets, l(g) and r(g), such that every edges has one endpoint in l(g) and one end

View Document