CHAPTER 4:
MATHEMATICAL
SYSTEM
Objectives:
Compare modular arithmetic into group
theory.
Illustrate accurately the modular
arithmetic and its operation as well as
operations on group theory.
Make use of modular arithmetic and
group theory to apply in a real
situation.
LESSON 4.1
MODULAR
ARITHMETIC
Objectives:
1. Define modular arithmetic.
2. Compare a clock arithmetic into modular
arithmetic.
3. Explain comprehensively modular
arithmetic.
4. Name different properties of modular
arithmetic.
5. Tell whether the congruence is a
congruence or not.
6. Solve and perform operations on clock and
Special type of
arithmetic which
involves only integer (Z)
is what we called
“modular arithmetic”.
Let us use a 12-hour clock as an illustration
to get an idea what a modular arithmetic is.
Let us have a simple illustration with
the use of the 12-hour clock. Here, we
use the numbers 0-11 instead of the
numbers 1-12 to deal with modular
arithmetic. The reason is that 0-11 are
the remainders modulo 12. In general,
when we work modulo n we replace all
the numbers by their remainders
modulo n. So, 12 here is replace by
Example: to determine the time 8
hours after 3 o’clock, we add 3 and 8.
Because we did not pass 12 o’clock,
the time is 11 o’clock.
To determine the time 8 hours after 9 o’clock, we
must take into consideration that once we have
passed 12 o’clock, we begin again with 1. Hence, 8
hours after 9 o’clock is 5 o’clock.
We will use the symbol
+ to denote addition on
a 12-hour clock and – to
denote subtraction.
Let the clock would be:
Example: Perform the + or – operator
a) 8 + 3 = 11
b) 8 - 5 = 3
c) 8 + 16 = 0
d) 8 + 9 = 5
e) 8 - 10 = 10
f) 8 - 12 = 8
Example 2. If it is 11
o'clock and you have to
finish your math
homework in 18 hours,
what hour will it be at that
time?
Answer: 11 + 18 = 5.
Hence the time that the
homework could it be
finished is 5 o’clock.
Example 3. If it is 12:00 now,
what time is it in 12 hours?
What is the remainder when
you divide 12 by 12?
Answer: Using the 12-hour clock
based on the given figure, if it is
now 12:00, the time after another
12 hour is also 12 o’clock and it
has an equivalent number as zero
(0). If we are going to divide 12
by 12, it is very obvious that the
remainder is 0.
Example 4. If it is 12:00 now,
what time is it in 18 hours?
What is the remainder when
you divide 18 by 12?
Answer: Similar on what we do to
example 3, if it is now 12:00,
adding 18 hours starting from 12
(0) would give us 6 o’clock.
Dividing 18 by 12, the remainder
would be 6. Hence, the time after
18 hours starting to 12 o’clock is
6 o’clock.
If we assigned a number for each day of the week
as shown below, then 6 days after Friday is
Thursday and 16 days after Monday is Wednesday.
Monday = 0
Tuesday = 1
Wednesday = 2
Thursday = 3
Friday = 4
Saturday = 5
Sunday = 6
We could write this as:
4 + 6 = 3 (Thursday)
0 + 16 = 2 (Wednesday)
Another way to determine the day of the
week is to note that when the sum 4 + 6 =
10 is divided by 7, the number of days in a
week, the remainder is 3, which is assigned
to Thursday. When 0 + 16 = 16 is divided by
7, the remainder 2 is the number assigned in
Wednesday. This works because the days of
the week repeat every 7 days. This could be
done also to 12-hour clock arithmetic.
Example 5. Let us say today
is Wednesday. What would be
the day 11 days after
Wednesday? What would be
the remainder if we are going
to divide 13 by 7?
Answer: Based on our given days in a
week above, the equivalent number
for Wednesday is 2. Adding 11 days
after Wednesday, we got Sunday
where this day has an equivalent
number as 6. Adding 2 by 11, the
result is 13 and if we are going to
divide 13 by 7, the result is 6. Hence, 2
Definition: Modular
Arithmetic
be congruent modulo n, where n ∈
i. Two integers a and b are said to
write a ≡ b (mod n). The number n
N, if is an integer. In this case, we
statement a ≡ b (mod n) is called a
is called the modulus. The
congruence.
ii. If a, b ∈ Z and n ∈ ,
then a ≡ b (mod n) if
and only if n | a – b.
Looking back in our clock
arithmetic, instead of 13 = 1, in
modular arithmetic we write 13
≡ 1 (mod 12) and read it “13 is
congruent to 1 modulo 12” or, to
abbreviate, “13 is 1 modulo 12”.
Example 1. Based on the given table
above, each expression follows the
modular arithmetic under modulo 12.
a) 12 ≡ 0 (mod 12)
b) 21 ≡ 9 (mod 12)
c) 37 ≡ 1 (mod 12)
d ) 17≡ 5 (mod 12)
the form a ≡ b(mod n)
Example 2. Write in
the statement 3 | 6.
Answer:
3 | 6 could be written as 3 | (18 –
12); here n = 3, a = 18 and b =
18 ≡ 12 (mod 3) or 12 ≡ 18 (mod
12. So, we could write this as
3)
Example 3. Is 53 ≡ 17
(mod 3)? How about 53 ≡
53 ≡ 11(mod 3)?
14 (mod 3)? What about
Answer:
The 53 ≡ 17 (mod 3) can be written in a
= = 11 ∈ 𝑍. So the congruence is true.
form of . Now, let a = 53, b = 17 and n = 3.
Now, let us take a look for 53 ≡ 14 (mod 3).
= = 13 ∈ 𝑍. So, it is congruence and so as
Let a = 53, b=14 and n = 3. It is seen that
53 ≡ 11(mod 3).
Example 4. Another way to be able to write in a
congruence modulo n is by dividing by n and take
14(mod 3) ≡ 2; that is 14 = (3)(4) + 2. The
the remainder. Let us say n = 3. Then;
9 (mod 3) ≡ 0; that is 9 = (3)(3) + 0. The
remainder is 2.
2 (mod 3) ≡ 2; since 2 = (3)(0) + 2.
remainder is 0.
-1 (mod 3) ≡ 2; since -1 = (3)(-1) + 2
-5 (mod 3) ≡ 1; since -5 = (3)(-2) + 1. The
remainder is 1.
Example 5. Tell whether the congruence
29 ≡ 8 mod 3 This is a true congruence!
is true or not.
7 ≡ 12 mod 5 This is a true congruence!
Why?
15 ≡ 4 mod 6 This is not a true
Why?
congruence. Why?
An alternative method to
a ≡ b(mod n), where a and b
determine a true congruence in
are whole numbers, then when
a and b is divided by n, they
must have the same remainder.
53 ≡ 17 (mod 3). Now, if we divide 53to 3,
Example 6. Let us say the given modulo is
then;
53 = (3)(17) + 2. The remainder is 2
and if we divide 17 to 3, we get;
Hence, 53 ≡ 17 (mod 3) is a true congruence.
17 = (3)(5) + 2. The remainder is also 2.
(42+5) mod 5
47 mod 5 =
2
(42 – 11) mod 5
31 mod 5 =
1