MAT1830 思维导图

Get Started. It's Free
or sign up with your email address
MAT1830 思维导图 by Mind Map: MAT1830 思维导图

1. 集合 Set

1.1. Set的性质

1.2. Important Set

1.3. Subset and Characteristic Functions

1.4. Set Operations and Venn Diagram

1.5. Ordered Pairs and Cartesian Product

2. 函数 Function

2.1. Domain, Codomain and Image

2.2. Common Functions

2.3. One-to-one Function

2.4. Functions of Several Variables

2.5. Boolean Function

2.6. Composite of Function

2.7. Inverse of Function

3. 关系 Relation

3.1. Binary and Tenary Relation

3.2. Relation v.s. Function

3.3. Subset Relation

3.4. Congruence Relation

3.5. Equivalence Relation and Equivalence Class

3.6. Order Relation

4. 概率 Probability

4.1. Probaibility Space and Events

4.2. Operation on Events

4.3. Independent Events

4.4. Conditional Probability

4.5. Bayes' Theorem

4.6. Random Variables

4.7. Expectation and Variance of Random Variables

4.8. Common Discrete Probability Distribution

5. 图与树 Graph and Tree

5.1. Common Problems with Graph

5.2. Walk, paths and trails

5.3. Degree of Graph and Euler's Theorem

5.4. Bridges

5.5. Property of Tree

5.6. Spanning Tree

5.7. Breath First Ordering and Queue

5.8. Depth First Ordering and Stack

6. 数论 Number Theory

6.1. 整除 divide and divisible

6.1.1. Euclidean Algorithm

6.1.2. Extended Euclidean Algorithm

6.1.3. 鉴别质数

6.2. 同余 congruence

6.2.1. 判定同余的方法

6.2.2. 同余的性质

6.2.3. Solving Linear Congruence

6.2.4. Modular Inverse

7. 逻辑 Logic

7.1. 命题逻辑Propositional Logic

7.1.1. Proposition的性质

7.1.2. Common Connectives

7.1.3. Tautology

7.1.4. Contradication

7.1.5. Logical Equivalence and Useful Logic Laws

7.1.6. Rules of Inference

7.1.7. Consequence

7.2. 谓词逻辑Predicate Logic

7.2.1. Predicate的性质

7.2.2. Building Sentences from Predicates

7.2.3. Quantifiers and Alternating Quantifiers

7.2.4. Interpretation of Sentences

7.2.5. Consequence

7.2.6. Useful Equivalences

7.3. 归纳Induction

7.3.1. (Normal) Mathematical Induction

7.3.2. Strong Mathematical Induction

7.3.3. Well-ordering

8. 排列与广义排列Selection and Arrangement

8.1. Ordered Selection without Repetition

8.2. Ordered Selection with Repetition

8.3. Unordered Selection without Repetiton

8.4. Unordered Selection with Repetition

8.5. Pigeonhole Principle

8.6. Pascal's Triangle and Binomial Theorem

9. 递归 Recursion

9.1. Recursively Defined Function

9.2. Recursive Algorithm

9.3. Sequence and Recurrence Relation