Study Guide in Mathematics in the Modern World FM-AA-CIA-15 Rev.
0 10-July-2020
GE 7 Mathematics in the Modern World Module 5: Mathematical System
MODULE 5
MODULE OVERVIEW
Mathematical system consists of modular arithmetic, congruences and the different applications of
these two in real world.
LEARNING OBJECTIVES
At the end of lesson, you should be able to:
1. Perform the operations on 12-hour clock and day of the week.
2. Find the remainder and quotient when an integer is divided by another integer.
3. Show that the remainder is nonnegative.
4. Define divisibility.
5. Find the greatest common divisor of the integers using Euclidean algorithm.
6. Perform the Euclidean algorithm to find the value of x and y
LEARNING CONTENTS
LESSON 1: INTRODUCTION TO MODULAR ARITHMETIC
1.1 Clock Arithmetic
Think of time when attempting to understand modular arithmetic. Time keeps going on forever,
which means it has no end. We designate whether the time is before noon or after noon by using the
abbreviations A.M. and P.M. Many clocks have the familiar 12-hour design. In this case, once 12:00 is
reached on the clock, we begin again with 1.
Keep the idea of the clock in mind. You see 12 numbers on the clock. The modulus is 12 with
the twelve remainders 0,1,2,3,4,5,6,7,8,9,10,11. To determine a time in the future or in the past, we
actually give a remainder between 0 and 11.
To determine the time 5 hours after 3 o’clock A.M. , we add 3 and 5. It does not pass 12 o’clock,
the time is 8 o’clock A.M. However, to determine the time 5 hours after 11 o’clock A.M., we must take
into consideration that once we have passed 12 o’clock, we begin again wit h 1. Therefore, 5 hours after
11 o’clock A.M. is 4 o’clock P.M.
We use the symbol to denote addition on a 12-hour clock. Using this notation,
and on a 12-hour clock.
We can also perform subtraction on a 12-hour clock. If the time now is 3 o’clock A.M., then 7
hours ago, the time was 8 o’clock P.M. Use the symbol to denote subtraction on a 12-hour clock and
PANGASINAN STATE UNIVERSITY 1
Study Guide in Mathematics in the Modern World FM-AA-CIA-15 Rev. 0 10-July-2020
GE 7 Mathematics in the Modern World Module 5: Mathematical System
write
.
A similar example involves day-of-the-week arithmetic. If we associate each day of the week with a
number,
Monday = 1 Friday = 5
Tuesday = 2 Saturday = 6
Wednesday = 3 Sunday = 7
Thursday = 4
Then, 12 days after Sunday is Friday. In symbols, we write
Take note that we are using the symbol for day-of-the-week arithmetic to differentiate from the
symbol for clock arithmetic.
Another way to determine the day of the week is to note that when the sum is
divided by 7, the number of days in a week, the remainder is 5, the number is associated with Friday.
This works because the days of the week repeat every after 7 days.
Disregarding A.M. and P.M. Evaluate each expression, where indicate addition, using a 12-hour
clock.
a.) 12 3 d.) 5 10
b.) 8 9 e.) 8 8
c.) 6 7 f.) 11 10
Evaluate each expression, where indicate addition, using days-of-the-week arithmetic.
a.) 6 4 b.) 3 5
1.2 Division Algorithm
Theorem 1.2 Division algorithm
Given integers , with , there exist unique integers satisfying
.
The integers are called the quotient and remainder , respectively, in the division of by .
(Burton, 2007)
Use the division algorithm to find the quotient and remainder when .
Solution:
By division algorithm , substitute the value of and b which is so
. Therefore, the value of quotient and remainder is 9 and 5.
PANGASINAN STATE UNIVERSITY 2
Study Guide in Mathematics in the Modern World FM-AA-CIA-15 Rev. 0 10-July-2020
GE 7 Mathematics in the Modern World Module 5: Mathematical System
Corollary 1.2
If are integers, with , then there exist unique integer such that
, . (Burton, 2007)
When b < 0, let us take b = . Let to satisfy that the remainder is
nonnegative then , then the expressions are
()
()
()()
()
Therefore, the remainders are nonnegative.
Find the remainder (r) and quotient (q) given the following values of a and b.
a.) If a = 21 and b = 12.
b.) If a = – 12 and b = 21.
c.) when 21 is divided by 5.
d.) when – 21 is divided by 5.
Lesson 1.3 The Greatest Common Divisor
Definition 1.3.1 Divisibility
An integer a is said to be divisible by an integer b and we write if from the division
algorithm We can also say that b is a factor of a, or a is a multiple of b. If ,
then a is not divisible by b and we write . We can also say that b is a divisor of a, b is a factor of a
or that a is a multiple of b. (Burton, 2007)
is divisible by 4, since () However, 10 is not divisible by 3; since by division
algorithm, () for there is no integer q which makes true.
Theorem 1.3.1
For integers a, b, c the following hold:
(i) , , .
(ii) .
(iii) If then .
(iv) .
(v) If then ( ).
PANGASINAN STATE UNIVERSITY 3
Study Guide in Mathematics in the Modern World FM-AA-CIA-15 Rev. 0 10-July-2020
GE 7 Mathematics in the Modern World Module 5: Mathematical System
Is 42 divisible by 3?
YES because 42 = 3 14 + 0. Thus, by division algorithm and .
Let a = 3, b = 21 and c = 42. Since because 21 = 3(7)+0 and 21|42 because 42 =
21(2)+0, then by Theorem 1.3.1 (iii), 3|42.
Definition 1.3.2 Common divisor
Given . A positive integer d is said to be a common divisor of if . If
one of is not zero, then there are only a finite numbers of common divisors of . (Burton,
2007)
The positive divisor of are 1,2,3,4,6 and 12 while those of 30 are 1,2,3,5,6,10,15 and 30.
Hence, the positive common divisors of are 1,2,3 and 6.
Definition 1.3.3 Greatest Common Divisor (GCD)
Let , not both zero. The greatest common divisor of denoted by ( ) or
simply ( ) is defined as the largest among all common divisors of . (Burton, 2007)
It is the positive integer d satisfying the following:
(i)
(ii) If then .
Remark: ( ) ( )
In Example 1.3.4, since 6 is the largest of the integers, it follows that () .
What is the common divisor of the following?
a.) 24 and 54
b.) – 24 and 54
c.) 24 and – 54
d.) 10 and 100
e.) 12 and 21
PANGASINAN STATE UNIVERSITY 4