DON MARIANO MARCOS MEMORIAL STATE UNIVERSITY

Mid-La Union Campus

City of San Fernando, La union

College of Technical Education

BACHELOR OF SCIENCE IN INDUSTRIAL EDUCATION (BSIE)

COURSE SYLLABUS
MATH 116 -NUMBER THEORY
1ST Semester SY 2015-2016

PHILOSOPHY Total human development with appropriate competencies.

VISION A premier and globally competitive university.
MISSION Provide relevant quality instruction, research and extension.
GOAL To lead in transforming human resources into productive self-reliant citizens and responsible leaders.

Course Name Number Theory

Course Credits 3 units
Course Description This course deals with the properties of the natural numbersand its properties. In this course, students are introduced to the major ideas of
elementary number theory and the historical framework in which these concepts were developed at the same time strengthening their ability to
analyze and construct formal proofs.
Contact Hours/Week 3 hours
Prerequisite Math 102 – Contemporary Mathematics
Course Objectives At the end of the course, the students should be able to:
1. understand and apply the proof technique of mathematical induction.
2. demonstrate an understanding of divisibility and the distribution of primes.
3. gain an understanding of the Euclidean Algorithm, the Fundamental Theorem of Arithmetic and congruences.
4. solve Linear Diophantine Equations, linear congruences and systems of linear congruences.
5. understand and use divisibility test, Wilson’ Theorem and Fermat’ Little Theorem.
6. understand number theoretic concepts of cryptology.
7. appreciate number theory applications to cryptology.
8. convey mathematical knowledge in a variety of settings, both orally and in writing.
Course Outline and Timeframe
Course Content / Subject Matter
Week 1-9 A. THE INTEGERS
 1. Numbers and sequences
2. Sums and products
3. Mathematical induction
4. The Fibonacci sequence
5. Divisibility
B. PRIMES AND GREATEST COMMON DIVISORS
1. Prime numbers
2. The distribution of Primes
3. Greatest common divisors
4. The Euclidian Algorithm
5. The Fundamental Theorem of Arithmetic
6. Factorization Methods and the Fermat Numbers
7. Linear Diophantine Equations
Week 10-18 C. CONGRUENCES
1. Introduction to Congruences
2. Linear Congruences
3. The Chinese Remainder Theorem
4. Solving Polynomial Congruences
5. Systems of Linear Congruences
6. Application of Congruences
D. Others
1. The Euler – Phi Function
2. The Sum and Numbers of Divisors
3. Perfect Numbers and Mersenne Primes
4. Mobius Function
D. CRYPTOLOGY
1. Character Ciphers
2. Block and Stream Ciphers
3. Exponentiation Ciphers
4. Public Key Cryptography
5. Knapsacks Ciphers
References:
Books:
Burton, David M. Elementary Number Theory. Allyn and Bacon, Inc., 1980.
Koshy, Thomas. Elementary Number Theory with Applications, 2nd ed. Elsevier Inc., 2007.
Rosen, Kenneth H. Elementary Number Theory and its Applications, 6th ed. Addison- Wesley Publishing Company, 2011.
Online Resources:
Clark, W. Edwin.Elementary Number Theory. Available at http:// shell.cas.usf.edu/ ~wclark/ elem_num_th_book.pdf
Santos, David A. Number Theory. Available at http:// www.scribd.com/doc/87334440/Santos-Number-Theory

Prepared by:
Vanessa P. Cayabyab, Ph.D.

Recommending Approval: Approved:

Myal A. Guba Ma.Cleofe F. Bello. Ed.D.

 DON MARIANO MARCOS MEMORIAL STATE UNIVERSITY-MID LA UNION CAMPUS
COLLEGE OF TECHNICAL EDUCATION
Bachelor of Science in Industrial Education
City of San Fernando, La Union

MATH 116 - NUMBER THEORY

COURSE SYLLABUS
1ST Semester SY 2015-2016
Philosophy
Total human development with appropriate competencies.
Vision
A premier and globally competitive university.
Mission
Provide relevant quality instruction, research and extension.
Goal of the University
To lead in transforming human resources into productive self-reliant citizens and responsible leaders.
Objectives
1. Produce effective and globally competitive teachers as catalysts of change;
2. Serve as a learning resource and information center; and
3. Contribute to the upliftment of the quality of life.

Degree Program : Bachelor of Science in Industrial Education

Course Code : Math 116
Course Title : Number Theory
Prerequisite : Math 102 – Contemporary Mathematics
Requisite to : None
Credit Units : 3 Total no. of Hrs: 54 Total No. of Hrs. Per Week : 3
Course Description : This course deals with the properties of the natural numbers and its properties. In this course, students are introduced to the
major ideas of elementary number theory and the historical framework in which these concepts were developed at the same time
strengthening their ability to analyze and construct formal proofs.
Course Objectives:
At the end of the course, the students should be able to:
1. understand and apply the proof technique of mathematical induction.
2. demonstrate an understanding of divisibility and the distribution of primes.
3. gain an understanding of the Euclidean Algorithm, the Fundamental Theorem of Arithmetic and congruences.
4. solve Linear Diophantine Equations, linear congruences and systems of linear congruences.
5. understand and use divisibility test, Wilson’ Theorem and Fermat’ Little Theorem.
6. understand number theoretic concepts of cryptology.
7. appreciate number theory applications to cryptology.
8. convey mathematical knowledge in a variety of settings, both orally and in writing.

Values to be Integrated : accuracy, neatness, critical and logical thinking, perseverance

Course Requirements:
Class Standing 60%
Chapter Test/Unit test/Quizzes 20%
Oral Recitation 20%
Seatwork/ Homework 10%
Research Output 10%
Mid-Term/Final Examination 40%

Midterm Grade = CS + Midterm Exam

Final Term Grade = CS + Final Exam
Final Grade = 40% of Midterm Grade + 60% of Final Term Grade

Methodology: Lecture/discussion, interactive learning, collaborative learning, Mathematical investigation

LEARNING PLAN
Desired Learning Outcomes Course Content/ Subject Textbooks/ Teaching Assessment Resource Time Table
(DLO ) Matter References and Tasks (ATs) Materials
Learning
Activities
(TLAs)
1. Aware of the University’s VMGO Orientation Student Handbook Discussion Observation Student
2. Observe rules and regulations 1. VGMO Syllabus Oral Recitation Handbook 1 hour
3. Understand the course content and 2. Student Handbook Syllabus
the requirements 3. Course Content
1. Determine whether or not a set is well- A. THE INTEGERS Burton, David M. Lecture/ Oral Recitation Lecture
ordered. 1. Numbers And Elementary Number Discussion Written Notes
2. Prove or disprove statements Sequences Theory. Allyn and Collaborative Tests/Output Test 12 hours
concerning numbers. 2. Sums and Products Work Class Materials
Bacon, Inc., 1980.
3. Conjecture a formula for the nth term 3. Mathematical Problem Participation Workbook
of a number sequence. induction Posing Laptop/
4. The fibonacci Rosen, Kenneth H. Exploratory netbook
1. Find the sum of a number sequence. numbers Elementary Number Activity and LCD
2. Find a close formula for hexagonal 5. Divisibility Theory and its Projector
and for heptagonal numbers. Applications, 6th ed.
3. Evaluate equations involving factorial Addison- Wesley
function without multiplying all the terms.
Publishing Company,
1. State the steps in mathematical 2011.
induction.
2. Prove number series and inequalities
using mathematical induction.

1. Find the indicated Fibonacci number.

2. find the sums of Fibonacci numbers.

1. Decide whether or not an integer is

divisible by another integer.
2. Find the quotient and remainder in the
division algorithm with given divisor and
dividend.
1. Differentiate prime and composite B. PRIMES AND Burton, David M. Lecture/ Oral Recitation Lecture
numbers. GREATEST Elementary Number Discussion Written Notes
2. Use the sieve of Eratosthenes to find COMMON Theory. Allyn and Collaborative Tests/Output Test 12 hours
primes less than a given integer. DIVISORS Work Class Materials
Bacon, Inc., 1980.
3. Find the smallest prime in an 1. Prime Numbers Problem Participation Workbook
arithmetic progression. 2. The Distributions of Posing Laptop/
1. State and apply the Prime Number Primes Rosen, Kenneth H. Exploratory netbook
Theorem. 3. Greatest Common Elementary Number Activity and LCD
2. Verify the Goldbach’s Conjecture for Divisors Theory and its Projector
given values of n. 4. The Euclidean Applications, 6th ed.
3. Give the forms consecutive prime Algorithm Addison- Wesley
triplets 5. The Fundamental
Publishing Company,
Theorem of
1. Find the greatest common divisor of Arithmetic 2011.
pairs of integers. 6. Factorization
2. Determine whether or not the integers Methods and the
are relatively prime. Fermat Numbers
3. Find the greatest common divisor of 7. Linear Diophantine
pairs of forms of integers. Equations

1. Use the Euclidean algorithm to find

the GCD of a pair of integers.
2. Express the GCD as a linear
combination of a pair of integers.

1. State and apply the Fundamental

Theorem of Arithmetic.
2. Find the least common multiple of
pairs of integers.

1. Find the prime factorization of

integers.
2. Determine whether or not an integer is
a Fermat number.
3. Factor integers using Fermat
factorization method.

1. Find all the solution of a linear

Diophantine equation.
2. Solve word problems involving linear
Diophantine equations.
MIDTERM EXAMINATION 2 hours
1. Show whether or not a given C. CONGRUENCES Burton, David M. Lecture/ Oral Recitation Lecture
congruence holds. 1. Introduction to Elementary Number Discussion Written Notes
2. Find the positive value of the modulus Congruences Theory. Allyn and Collaborative Tests/Output Test 10 hours
to which a congruence statement is true. 2. Linear Congruences Work Class Materials
Bacon, Inc., 1980.
3. Prove the congruence statement 3. The Chinese Problem Participation Workbook
involving arbitrary integers. Remainder Theorem Posing Laptop/
4. Construct tables for addition and 4. Solving Polynomial Rosen, Kenneth H. Exploratory netbook
multiplication modulo. Congruences Elementary Number Activity and LCD
5. Find the least positive residue of a 5. Systems of Linear Theory and its Projector
large integer, using modular Congruences Applications, 6th ed.
exponentiation. 6. Application of Addison- Wesley
Congruences
Publishing Company,
1. Solve linear congruence in one
variable. 2011.
2. Find the inverse modulo n of an
integer.
3. Solve linear congruence in two
variables.

1. Solve systems of linear congruences

in one variable using the Chinese
Remainder Theorem.
2. Solve word problems involving
systems of linear congruence in one
variable.

1. Find all solutions of a polynomial

congruence.
2. Determine the number of incongruent
solutions of a polynomial congruence.

1. Solve system of linear congruence in

two and three variables.
2. Determine the number of incongruent
solutions of a system of linear
congruence in three variables.

1. Determine whether or not a large

integer is divisible by another integer.
2. Find the day of the week of important
dates in Philippine history and
celebrations.
3. Set up a round-robin tournament
schedule for a team.
4. Set up a hashing function and collision
resolution policy for assigning parking
places based on license plates.
5. Determine whether or not a given
ISBN is valid.
1. Determine whether or notan arithmetic D. Burton, David M. Lecture/ Oral Recitation Lecture
function is completely multiplicative. 1. The Euler Phi- Elementary Number Discussion Written Notes
2. Find the value of the Euler- phi Function Theory. Allyn and Collaborative Tests/Output Test 8 hours
function at a given integer. 2. The Sum and Work Class Materials
Bacon, Inc., 1980.
Numbers of Divisors Problem Participation Workbook
1. Find the sum and number of positive 3. Perfect Numbers and Posing Laptop/
divisors of an integer. Mersenne Primes Rosen, Kenneth H. Exploratory netbook
2. Find the positive integers that have 4. Mobius Function Elementary Number Activity and LCD
exactly two, three or four positive Theory and its Projector
divisors. Applications, 6th ed.
Addison- Wesley
1. Find the six smallest even perfect
numbers. Publishing Company,
2. Identify whether an integer is deficient 2011.
perfect or abundant.
3. Show that the pair of integers is
amicable pair.
4. Use the Lucas- Lehmer test to
determine whether a Mersenne number
is prime or not.

1. Find the value of Mobius Function.

2. Use the Mobius inversion formula to
show that ϕ (n) is multiplicative
1. Encrypt a message using the Caesar E. CRYPTOLOGY Burton, David M. Lecture/ Oral Recitation Lecture
cipher, affine transformation or shift 1. Character Ciphers Elementary Number Discussion Written Notes
transformation. 2. Block and Stream Theory. Allyn and Collaborative Tests/Output Test 7 hours
2. Decrypt a message which was Ciphers Work Class Materials
Bacon, Inc., 1980.
encrypted using Caesar ciphers, affine 3. Exponentiation Problem Participation Workbook
transformation or shift transformation. Ciphers Posing Laptop/
4. Public Key Rosen, Kenneth H. Exploratory netbook
1. Encrypt a message using the Cryptography Elementary Number Activity and LCD
Vigenere cipher. 5. Knapsacks Ciphers Theory and its Projector
2. Decrypt a message which was Applications, 6th ed.
enciphered using the Vigenere cipher. Addison- Wesley
Publishing Company,
1. Find the plaintext message that
corresponds to a given ciphertext that is 2011.
produced using modular- exponentiation.
1. Determine the ciphertext that is
produced when RSA encryption is used
to encrypt a given message.
2. Encrypt a message using a Rabin
cipher.

1. Encrypt a message using the

knapsack cipher based on a given
sequence.
2. Decrypt a ciphertxt that was encrypted
using the knapsack cipher based on a
given sequence.
FINAL TERM EXAMINATION 2 hours
Supplementary Reading Materials:
Koshy, Thomas. Elementary Number Theory with Applications, 2 nd ed. Elsevier Inc., 2007.
Mollin, Richard A. Fundamental Number Theory With Applications, 2nd ed. Chapman & Hall/CRC, 2008.
Silverman, Joseph H. A Friendly Introduction to Number Theory, 4th ed., Pearson Education, Inc., 2012.
Tattersall, James J. Elementary Number Theory in Nine Chapters, 2nd ed. Cambridge University Press, 20
On-Line Resources
Clark, W. Edwin.Elementary Number Theory. Available at http:// shell.cas.usf.edu/ ~wclark/ elem_num_th_book.pdf
Santos, David A. Number Theory. Available at http:// www.scribd.com/doc/87334440/Santos-Number-Theory

Prepared by: Recommending Approval: Approved:

Vanessa P. Cayabyab, Ph.D. Myal A. Guba Ma.Cleofe F. Bello, Ed.D.