LANAO SCHOOL OF SCIENCE AND TECHNOLOGY INC.

Maranding, Lala, Lanao del Norte

2nd Semester 2022-2023

COLLEGE OF EDUCATION

COURSE OUTLINE IN NUMBER THEORY

OBE-BASED

Course Code: M110 Program Outcomes(CMO No.75,s 2017)

Course Title: Number Theory A. Prove and solve number theoretic propositions and problems by applying
Units: 3 units fundamental concepts and principles in number theory;
Contact Hours: 3 hours per week B. Recognize and or generate number theory concepts and properties from inferring
Instructor: Noel R. Hepiga patterns embedded in problems and real-world phenomena;
C. Generate and communicate results of a mathematical investigation on a number
theoretic conjecture carried out using ICT and research;
D. Design and use activity sheets for selected number theory topics in a teaching
demonstration.
Grading System
Contact No. 09558029980 A. Performance:40 % (behavior /Projects/Graded Recitations)
B. Class Standing:30% (Attendance/ Quizzes/Classroom and school activities)
C. Examination:30% (Prelim/Midterm/Semi-final/Final)

Prelim
Course Content/topics Course Learning Outcomes(CLO) Class Teaching Learning Assessment Allotted Week Date
Schedule Strategies(TLS) Strategy
1. Numbers and  explain the definitions and properties  Brainstorming  quiz Week 1
Sequences of basic concepts related to numbers  Discussion  board work
2. Sums and and sequences by producing examples  reporting  periodical
Products and non-examples;
exam
 use the Well-Ordering Property in
proving propositions about the
integers;
 prove the properties on sums and
products and other related
propositions;

1. Mathematical  prove the first and second principles of  Brainstorming  quiz Week 2-3
Induction Mathematical Induction (PMI);  Discussion  board work
2. Fibonacci Sequence  conjecture formulae based on  reporting  periodical
tabulated data gathered from
 explorations; exam
 apply the principles of mathematical
induction in proving formulae and
other claims related to the integers;
 produce counterexamples to show
falsity of statements;
 generate actual sequences for given
recursive functions;
 prove claims on the Fibonacci
sequence and other similar recursive
functions

1. Binomial  prove the properties of binomial  Brainstorming  quiz Week 4

Coefficients coefficients;  Discussion  board work
2. Divisibility  apply the Binomial Theorem in writing  reporting  periodical
the expansions of binomial powers;
exam
 use definitions and theorems in
proving propositions on divisibility;
 recognize and describe number
patterns on the Pascal Triangle.

Output/Project

Midterm
Course Content/topics Course Learning Outcomes(CLO) Class Teaching Learning Assessment Allotted Week Date
Schedule Strategies(TLS) Strategy
1. Prime Numbers  express relatively large positive  Brainstorming  quiz
2. Greatest Common integers in canonical or prime-factored  Discussion  board work
Divisor form.  reporting  periodical Week 5-6
3. The Euclidean  use different methods in finding the
exam
Algorithm greatest common divisor and least
4. The Fundamental common multiple of given integers;
Theorem of  prove theorems concerning the prime
Arithmetic numbers, greatest common divisor and
least common multiple of integers;
 design and use an activity sheet, and
implement an activity-based learning
episode for meaningful exploration and
discovery.
1. Linear Diophantine  prove the Linear Diophantine Equation  Brainstorming  quiz
Equations Theorem;  Discussion  board work
 solve Linear Diophantine Equations;  reporting  periodical Week 7
 solve word problems including non-
exam
routine problems involving Linear
Diophantine Equations.

1. Introduction to  Illustrate the definition of congruence  Brainstorming  quiz

Congruences through examples and non-examples;  Discussion  board work
 recognize the application of  reporting  periodical Week 8
congruence in real world contexts;
exam
 construct proofs for the basic
properties of congruence;
 solve non-routine problems using
properties of congruence.

Output/Project

Semifinal
Course Content/topics Course Learning Outcomes(CLO) Class Teaching Learning Assessment Allotted Week Date
Schedule Strategies(TLS) Strategy
1. Linear Congruence  apply appropriate properties in solving  Brainstorming  quiz
2. The Chinese linear congruences;  Discussion  board work
Remainder  use the Chinese Remainder Theorem  reporting  periodical Week 9-11
Theorem to solve the ancient Chinese remainder
exam
3. Systems of Linear problem and other similar problems;
Congruence  solve systems of simultaneous linear
congruences;
 construct and solve linear congruence
derived from word problems with real
world contexts.
1. Divisibility Test  apply the concept of congruence in  Brainstorming  quiz
2. Perpetual Calendar proving the different divisibility tests;  Discussion  board work
3. Round-Robin  solve problems applying the perpetual  reporting  periodical Week 12-13
Tournaments calendar concept
exam
construct a round-robin schedule for a given
number of teams

1. Wilson’s Theorem  prove Wilson’s Theorem, Fermat’s  Brainstorming  quiz

2. Euler’s Theorem Little Theorem, and Euler’s Theorem  Discussion  board work
 apply the Wilson’s Theorem and  reporting  periodical Week 14-15
Fermat’s Little Theorem in solving
exam
congruence application problems and
other related problems;
 use the Euler’s Theorem in solving
linear congruences;
 use the Wilson’s Theorem, Fermat’s
Little Theorem, and Euler’s Theorem in
establishing other related propositions.

Output/Project

FINAL
Course Content/topics Course Learning Outcomes(CLO) Class Teaching Learning Assessment Allotted Week Date
Schedule Strategies(TLS) Strategy
1. The Euler-Phi  prove theorems on multiplicative  Brainstorming  quiz
Function functions;  Discussion  board work
2. The Sum and  use appropriate theorems in  reporting  periodical Week 16-18
Number of Divisors determining the values of the Euler-Phi
exam
Function, Number of Divisors and Sum
of Divisors functions;
 conduct a mathematical investigation
on selected arithmetic functions using
ICT tools and research.
Prepared by: Checked by:

NOEL R. HEPIGA LYDIA D. LINGGOLINGGO Ed. D DIOSDADO A. RAMIL

Instructor Dean Program Coordinator