## Topic outline

• ### Subject Synopsis

Subject Synopsis - Discrete Mathematics and Applications

• ### Number Theory 1

1.1 Factorability
1.2 Primes
1.3 The Division Algorithm
• This topic

### Number Theory 2

1.4 Greatest Common Divisors (GCD)
1.5 Least Common Multiples (LCM)
• ### Number Theory 3

1.6 Euclidean Algorithm
1.7 Extended Euclidean Algorithm
1.8 Modular Arithmetic

• ### Sets

2.1 Set Terminologies and Concepts
2.2 Operation on Sets
2.3 Cartesian Products
2.4 Power sets
2.5 Applications of sets theory
• ### Functions

2.6 Introduction to Functions
2.7 One-to-One and Onto Functions
• ### Relations

2.8 Relations and Their Properties• Reflexive• Symmetric• Transitive
• ### Sets, Functions and Relations: Assessment

Sets, Functions and Relations: Assessment

Test 1

• ### Logic 1

3.1 Propositional Logic

3.2 Logical Connectives
3.3 Propositional Equivalences

• ### Logic 2

3.4 Predicates and  Quantifiers
3.5 Rules of Inference

• ### Proof Techniques 1

4.1 Direct Proof
4.2 Indirect Proof
4.3 Contradiction Method

• ### Proof Techniques 2

4.4 Mathematical Induction
4.5 Strong Induction and Well-Ordering

• ### Abstract Algebra: Assessment

Abstract Algebra: Assessment Quiz 5

Test 2