COURSE LEARNING PLAN

Course Code/ Description: MAT17– Number Theory

Name of Faculty: REYNIER I. JORDAN
Schedule/Room: 9:00am - 12:00pm Saturday Room 2

Learning Outcome Topic Methodology Resources Assessment

Knowledge of the properties of - Preliminary Notions -Problem Solving -Computer -Process-oriented performance
Integers 1.1 Properties of Integers (Board works, Multimedia
Applies divisibility techniques 1.2 Summation and -Lecture -Projector
presentations)
and theorems Multiplication Symbols -Discussion
1.3 Mathematical Induction -Paper and pencil tests (Quizze
- 1.4 Indirect Proof -Recitation Seat works, Home works,
- Divisibility Short/Long tests, Formative an
-Demonstration
2.1 DIvisibility Diagnostic tests)
2.2 Division Lagorithm
-

Uses unique factorization 1. Greastest Common Divisor -Problem Solving -Computer -Process-oriented performance
theorem 3.1 Euclidean Algorithm (Board works, Multimedia
3.2 Relatively Prime Integers -Lecture -Projector
presentations)
3.3 Least Common Multiple -Discussion
2. Linear Diophantine Equation -Paper and pencil tests (Quizze
4.1 Linear Diophantine Equation -Recitation Seat works, Home works,
in Two Variables Short/Long tests, Formative an
-Demonstration
3. Sequences of Primes Diagnostic tests)
5.1 Sieve of Erasthotenes

Course Title Date Effective: Date Revised: Prepared by: Reviewed by: Approved by:
Page 1 of 3

NUMBER THEORY January 2019 February 2019 Reynier I. Jordan, REE MS. KRISH BERNADETTE P. PALAY, LPT, MAH Jimson F. Oliveros, MTE
 5.2 Fundamental Theorem of
Arithmetic
Solves Linear Congruences 4. Congruences -Problem Solving -Computer -Process-oriented performance
6.1 Congruent Integers (Board works, Multimedia
6.2 Divisibility Criteria -Lecture -Projector
presentations)
5. Conditional Congruences -Discussion
7.1 Linear Congruences -Paper and pencil tests (Quizze
7.2 Polynomial Congruences of -Recitation Seat works, Home works,
Higer Degree Short/Long tests, Formative an
-Demonstration
6. Special Functions Diagnostic tests)
8.1 Number Theoretic Functions
8.2 Multiplicative Functions
8.3 Perfect Numbers
FInds primitive roots and uses 7. Mobius and Bracket Functions -Problem Solving -Computer -Process-oriented performance
9.1 Mobius Function (Board works, Multimedia
9.2 Bracket Function -Lecture -Projector
presentations)
8. Euler - Fermat Theorem -Discussion
10.1 Euler Function -Paper and pencil tests (Quizze
10.2 Properties of the - Function -Recitation Seat works, Home works,
10.3 Euler Generalization of Short/Long tests, Formative an
-Demonstration
Fermat’s Theorem Diagnostic tests)

Solves Linear Diophantine 9. Primitive Roots -Problem Solving -Computer -Process-oriented performance
Equations 11.1 Order of an Integer Modulo (Board works, Multimedia
m -Lecture -Projector
presentations)
11.2 Primitive Roots of Prime -Discussion
and Composites -Paper and pencil tests (Quizze
10. Quadratic Residues -Recitation Seat works, Home works,
12.1 Quadratic Congruences Short/Long tests, Formative an
-Demonstration
12.2 Quadratic Resideus Diagnostic tests)

Course Title Date Effective: Date Revised: Prepared by: Reviewed by: Approved by:
Page 2 of 3

NUMBER THEORY January 2019 February 2019 Reynier I. Jordan, REE MS. KRISH BERNADETTE P. PALAY, LPT, MAH Jimson F. Oliveros, MTE
 11. Application
13.1 Bar Codes
13.2 Perpetual Calendar

Course Title Date Effective: Date Revised: Prepared by: Reviewed by: Approved by:
Page 3 of 3

NUMBER THEORY January 2019 February 2019 Reynier I. Jordan, REE MS. KRISH BERNADETTE P. PALAY, LPT, MAH Jimson F. Oliveros, MTE