TecLand

Logic and Proposition

1 DAG Definition: A directed acyclic graph (DAG) is a directed graph with no cycles.2 Scheduling2.1 Topological SortA topological sort of a finite DAG is a list of all the vertices such that each verte

Unit 2-Lecture 3-4: Euler’s Theorem & RSA Public key Encryption1 Euler’s Theorem

1 SumsArithmetic sumsGeometric sumsHarmonic sums1.1 Integral methodTheorem: let f:R+→R+ f: R^+ \to R^+ be weakly increasing function. Define S::=∑i=1nf(i)S ::= \sum_{i=1}^nf(i) and I::=∫n1f(x

A relation R:A→AR: A \to A is the same as a digraph with vertices A. - Reflexivity: R is reflexive when ∀x∈A.xRx\forall x \in A.xRx Every vertex in R has a self-loop. - Irreflexivity: R is irr

1 Simple graphsSimple graphs are defined as digraphs in which edges are undirected.2 Handshaking LemmaThe sum of the degrees of the vertices in a graph equals twice the number of edges.3 Some Common Gr

1 The Division RuleA k-to-1 function maps exactly k elements of the domain to every element of the codomain. Rule: If  f:A→B  is  k−to−l, then  |A|=k⋅|B|If\ \ f:A \to B\ \ is\ \ k-to-l,\ then\ \ |A|

1 The Pigeonhole PrinciplePigeonhole Principle: If there are more pigeons than holes they occupy, then at least two pigeons must be in the same hole. Generalized Pigeonhole Principle: If |a|>k⋅|b| |

1 The Four Step Method to Solve Problems like “What is the probability that… ?” Step 1: Find the Sample Space:Every possible combination of these randomly-determined quantities is called an outcome.T

1 Conditional Probility1.1 DefinitionLet X and Y be events where Y has positive probability, then Pr[X|Y]::=Pr[X∩Y]Pr[Y]Pr[X|Y] ::= \frac{Pr[X\cap Y]}{Pr[Y]}1.2 The Four Step Method for Conditional

1 IndependenceDefinition:An event with probability 0 is defined to be independent of every event (including itself).If Pr[b]≠0Pr[b] \neq 0 , then the event A is independent of event B iff Pr[A|B]=Pr[

1 Random Variable1.1 Definition:A random variable R on a probability space is a total function whose domain is the sample space.Notice that the name “random variable” is a misnomer, random variables

1 Vertex DegreesDefinition: The in-degree of a vertex in a digraph is the number of arrows coming into it, and similarly its out-degree is the number of arrows out of it.Hand shake theory:Lemma: ∑

1 Counting One Thing by Counting AnotherThe Bijection Rule： if you figure out the size of one set, then you can immediately determine the sizes of many other sets via bijections.2 Counting SequencesPro

Modular Arithmetic

Well Order Principle : Every nonempty set of nonnegative integers has a smallest element.

Unit 1-Lecture 2：证明的方法

Proof基本概念的定义

Quantifiers and Predicate Logic

Set and Sequence

Binary Relation & Function

Induction

State Machine

Recursive Data Type

Unit 2-Lecture9: Coloring & Connectivity1 ColoringGraph coloring problem: given a graph G, assign colors to each node such that adjacent nodes have different colors. Chromatic number: The minimum valu

1 DefinitionAn acyclic graph is called a forest. A connected acyclic graph is called a tree. A degree 1 node in a forest is called a leaf.2 Properties of TreeEvery connected subgraph is a tree.Ther

1 Exception1.1 Definition:If R is a random variable defined on a sample space S, then the expectation of R is: Ex[R]::=∑w∈SR(ω)Pr[ω]Ex[R] ::= \sum_{w\in S}R(\omega)Pr[\omega]Alternate Definition for