MODULE WEEK NO.

1-4

Teacher Education Program

Subject Code: M110
Course Title: Number Theory
1st Semester of A.Y. 2023-2024

Rationale

In this module, we will delve into the fundamental concepts related to integers, which are the building
blocks of number theory. Understanding integers is crucial for exploring more advanced topics in number theory,
such as divisibility, prime numbers, and Diophantine equations. Additionally, we will introduce mathematical
induction, an essential proof technique that will be invaluable throughout this course. By the end of this module,
students should have a solid foundation in integer properties and basic proof methods.

Course Learning Outcomes

At the end of this module, the pre-service teachers will be able to:

CLO 1: Develop a deep understanding of integer properties and their significance in number theory.
CLO 2: Apply mathematical induction to prove various mathematical statements involving integers.
CLO 3: Explore sequences and their applications in the context of integers.
COURSE MODULE

CLO 4: Investigate the Fibonacci sequence and binomial coefficients, understanding their properties
and relationships with integers.
Activity
Title: Exploring Integer Properties

Description: In this activity, students will work in pairs or small groups to explore various aspects
of integers. They will investigate sequences, apply mathematical induction, study the Fibonacci
sequence, and analyze divisibility and binomial coefficients. Each group will be responsible for
presenting their findings to the class.
Discussion
MDULE 1: INTEGERS
What is Number Theory?

Number theory is a fascinating branch of mathematics that deals with the properties of various types
of numbers, with a primary focus on positive integers. It explores the relationships and patterns
among these numbers, particularly prime numbers, which are of paramount importance in number
theory. This field has a rich history dating back thousands of years, with ancient Greek
mathematicians like Euclid making foundational contributions, such as proving the infinitude of prime
numbers.

In recent centuries, mathematicians like Pierre de Fermat and Leonhard Euler expanded our
understanding of number theory, providing essential results and conjectures about prime numbers.
Even in the last 100 years, this field has seen substantial development, with powerful techniques
emerging for the study of primes. Notably, the question of whether there are infinitely many twin
primes, pairs of primes differing by 2, remains unsolved, illustrating the ongoing nature of
mathematical exploration in number theory.

Moreover, number theory has significant real-world applications, especially in modern cryptography.
The RSA (Rivest–Shamir–Adleman) cryptosystem, a widely used method for securing communication
and data, relies heavily on number theory concepts like prime factorization. In recent years,
advancements in computer science have enabled efficient primality testing and factorization
algorithms, contributing to the development of secure cryptographic systems.

In the study of number theory, experimentation and exploration play a crucial role. Mathematicians
often examine numerical evidence, searching for patterns and making conjectures, which they then
rigorously prove or disprove. This process remains central to the field, encouraging students to
explore examples, identify patterns, and formulate their conjectures. With the aid of modern
computational tools, students can embark on their mathematical journeys, just as the great
mathematicians of the past did, and potentially make their own contributions to this ever-evolving
field.
1
Crafted by: Mary Cris J Go
 MODULE WEEK NO. 1-4
INTEGERS

In this module on integers, we delve into fundamental concepts that serve as building blocks for
mathematics education majors and are crucial in number theory. We begin by exploring different
sets of numbers, including integers, rational numbers, and algebraic numbers. These foundational
sets lay the groundwork for more advanced mathematical concepts. You will also learn the concept
of approximating real numbers by rational numbers, a practical skill with applications in various
mathematical areas.

A significant focus of this module is on sequences, including important integer sequences like the
Fibonacci numbers. Sequences play a vital role in mathematics, helping us understand patterns and
relationships among numbers. The module also introduces mathematical induction, a key proof
technique that is not only essential in number theory but also widely applicable in various
mathematical disciplines.

Moreover, you will delve into the concept of divisibility, exploring the properties of integer division
and the division algorithm. Understanding divisibility is fundamental in number theory and forms the
basis for exploring prime numbers and unique factorization. Throughout the module, you will
encounter numerous examples and exercises that reinforce their understanding of these essential
mathematical concepts, preparing them for more advanced topics in mathematics education.

Number and Sequence

Numbers

The integers are the numbers in the set { . . . −3, −2, −1, 0, 1, 2, 3, . . . }.
COURSE MODULE

The Well-Ordering Property - Every nonempty set of positive integers has a least
element.

Definition. The real number 𝑟 is rational if there are integers 𝑝 𝑎𝑛𝑑 𝑞, with 𝑞 ≠ 0, such that 𝑟 =
𝑝 / 𝑞. If 𝑟 is not rational, it is said to be irrational.

Example 1.1. The numbers −22/7, 0 = 0/1, 2/17, 𝑎𝑛𝑑 1111/41 are rational numbers.

Theorem 1.1. √2 is irrational.

Example 1.2. The irrational number √2 is algebraic, because it is a root of the polynomial 𝑥 2 − 2.

2
Crafted by: Mary Cris J Go
 MODULE WEEK NO. 1-4

The Greatest Integer Function

COURSE MODULE

Diophantine Approximation

In the context of mathematics education, Diophantine approximation serves as a captivating

application of number theory concepts, engaging you in exploring the relationship between real
numbers and their rational approximations. This module introduces the fundamental idea that even
among the first 𝑛 multiples of a real number 𝑎 , there must exist at least one multiple that is
exceptionally close to an integer, with a distance less than 1/𝑛. This concept is demonstrated using
the pigeonhole principle, a simple yet powerful mathematical tool introduced by Dirichlet. The
pigeonhole principle's application in number theory highlights its versatility and importance in solving
various mathematical problems.

For example, consider the real number 𝜋 (𝑝𝑖). By applying diophantine approximation, you can
discover that among the first 𝑛 𝑚𝑢𝑙𝑡𝑖𝑝𝑙𝑒𝑠 𝑜𝑓 𝜋, there exists a multiple that is exceptionally close to an
integer. This concept provides a fascinating connection between the transcendental 𝑛𝑢𝑚𝑏𝑒𝑟 𝜋 and
the integers, offering a deeper understanding of the properties of real numbers and their relationship
with rational approximations. Through such examples and proofs, you, mathematics education
majors can gain valuable insights into the application of number theory in problem-solving and
mathematical exploration.

3
Crafted by: Mary Cris J Go
 MODULE WEEK NO. 1-4
COURSE MODULE

Sequences

4
Crafted by: Mary Cris J Go
 MODULE WEEK NO. 1-4

Definition. A set is countable if it is finite or it is infinite and there exists a one-to-one

correspondence between the set of positive integers and the set. A set that is not countable is called
uncountable.
COURSE MODULE

5
Crafted by: Mary Cris J Go
 MODULE WEEK NO. 1-4
Activity No. 1

1. Determine whether each of the following sets is well ordered. Either give a proof using the well-
ordering property of the set of positive integers, or give an example of a subset of the set that
has no smallest element.
a) the set of integers greater than 3
b) the set of even positive integers
c) the set of positive rational numbers
d) the set of positive rational numbers that can be written in the form 𝑎/2, where a is a
positive integer
e) the set of nonnegative rational numbers
2. Use the well-ordering property to show that √3 is irrational.
3. Find the following values of the greatest integer function.

Sums and Products

COURSE MODULE

6
Crafted by: Mary Cris J Go
 MODULE WEEK NO. 1-4
COURSE MODULE

7
Crafted by: Mary Cris J Go
 MODULE WEEK NO. 1-4
COURSE MODULE

8
Crafted by: Mary Cris J Go
 MODULE WEEK NO. 1-4

Activity No. 2

1. Find each of the following sums.

2. Without multiplying all the terms, verify these equalities.

Mathematical Induction

By examining the sums of the first n odd positive integers for small values of n, we can conjecture
a formula for this sum. We have
COURSE MODULE

For mathematics education majors, understanding and applying the principle of mathematical
induction is a crucial skill when it comes to proving results about integers and other mathematical
concepts. This module introduces the principle and demonstrates how it is used as a powerful proof
technique. First, the basis step involves proving that the statement holds true for the integer 1,
establishing a starting point for the induction process. Second, the inductive step demonstrates that
if the statement is true for a particular positive integer n, it must also be true for the next integer,
𝑛 + 1. This process ensures that the statement holds for all positive integers, forming a solid
foundation for rigorous mathematical reasoning.

To illustrate the principle of mathematical induction, consider proving the formula for the sum of the
first n odd positive integers: 1 + 3 + 5 + . . . + (2𝑛 − 1) = 𝑛2 . The basis step shows that this formula
is valid for 𝑛 = 1 (12 = 1), and the inductive step demonstrates that if it holds for 𝑛 = 𝑘, then it
must also hold for 𝑛 = 𝑘 + 1. By establishing these two steps, we can confidently conclude that the
formula holds true for all positive integers, showcasing the power and utility of mathematical
induction in number theory and beyond.

9
Crafted by: Mary Cris J Go
 MODULE WEEK NO. 1-4
COURSE MODULE

10
Crafted by: Mary Cris J Go
 MODULE WEEK NO. 1-4
COURSE MODULE

Recursive Definitions

11
Crafted by: Mary Cris J Go
 MODULE WEEK NO. 1-4

Activity No. 3

1. Use mathematical induction to prove that .

COURSE MODULE

2.

The Fibonacci Numbers

For you, mathematics education majors, understanding the historical context of mathematical
problems can enhance their appreciation of the subject. In this module, we explore a classic problem
posed by the mathematician Fibonacci in his book Liber Abaci, written in 1202. Fibonacci's problem
involves the population growth of rabbits on an island, with specific rules governing their breeding.
The question is how many pairs of rabbits will be on the island after 𝑛 months.

To address this problem, you will be introduced to the recursive definition of the sequence In,
representing the number of pairs of rabbits after n months. The recursive definition states that 𝐼1 =
1 (𝑡ℎ𝑒 𝑜𝑟𝑖𝑔𝑖𝑛𝑎𝑙 𝑝𝑎𝑖𝑟), 𝐼2 = 1 (as the original pair doesn't breed yet), and 𝐼𝑛 = 𝐼𝑛 − 1 + 𝐼𝑛 − 2 𝑓𝑜𝑟 𝑛 ≥
3, as each new pair comes from a pair at least two months old. This recursive definition leads to the
development of the Fibonacci sequence, a famous integer sequence with numerous intriguing
properties and applications, including in combinatorics, algebra, and even art and nature.

As mathematics education majors study this problem, you not only gain insight into mathematical
modeling but also see how historical mathematical questions like Fibonacci's rabbit problem have
far-reaching implications and can serve as engaging teaching tools in their future classrooms.

12
Crafted by: Mary Cris J Go
 MODULE WEEK NO. 1-4
COURSE MODULE

13
Crafted by: Mary Cris J Go
 MODULE WEEK NO. 1-4
How Fast Do the Fibonacci Numbers Grow?

The following inequality, which shows that the Fibonacci numbers grow faster than a geometric
series with common ratio 𝑎 = (1 + √5)/2, will be used in Module 3.
COURSE MODULE

Activity No. 4

1. Find the following Fibonacci numbers.

2.

Divisibility

14
Crafted by: Mary Cris J Go
 MODULE WEEK NO. 1-4
COURSE MODULE

15
Crafted by: Mary Cris J Go
 MODULE WEEK NO. 1-4

Greatest Common Divisors

If 𝑎 𝑎𝑛𝑑 𝑏 are integers, not both 0, then the set of common divisors of 𝑎 𝑎𝑛𝑑 𝑏 is a finite set of
COURSE MODULE

integers, always containing the integers + 1 𝑎𝑛𝑑 − 1. We are interested in the largest integer among
the common divisors of the two integers.

Definition. The greatest common divisor of two integers a and b, which are not both 0, is the
largest integer that divides both 𝑎 𝑎𝑛𝑑 𝑏.

Activity No. 5

1. Decide which of the following integers are divisible by 7.

2. Find these greatest common divisors by finding all positive integers that divide each integer in
the pair and selecting the largest that divides both.

16
Crafted by: Mary Cris J Go
 MODULE WEEK NO. 1-4
Assessment

Answer the given activity nos 1-5.

Direction:
1. It must be handwritten.
2. For uniformity purposes, answer it in a clean long bond paper. All solutions must be seen in your
paper.
3. Submit it f2f to my office.
4. Deadlines:
• Activity Nos. 1-2 (Last Scheduled Meeting in Week 2)
• Activity No. 3 (Last Scheduled Meeting in Week 3)
• Activity Nos. 4-5 (Last Scheduled Meeting in Week 4)

Reflection

Answer the following question as your guide questions for your reflection: (20 pts.)
Direction:
• It must be handwritten.
• For uniformity purposes, answer it in a clean long bond paper.
• Submit it f2f to my office.
• Deadline: Last Scheduled Meeting in Week 4

1. What surprised you with this topic, and why?

2. What’s the most important thing you learned in this lesson? Why do you think so?
3. What do you want to learn more about, and why?
4. As future teacher, how are you going to relate this topic to real life situation?
COURSE MODULE

Resources and Additional Resources

Rosen, K. (2011). Elementary Number Theory and Its Applications. Pearson.

17
Crafted by: Mary Cris J Go