“The essence of mathematics is
not making simple things
complicated, but making
complicated things simple”
ce Breaker
• How can you add eight 8’s to get 1000?
• How can you make number 7 an even
number without using addition,
subtraction, multiplication, and division?
• How can you take 2 from 5 and leave 4?
MODULAR
ARITHMETIC
MARVELINO M. NIEM, PhD
Instructor, College of Arts, Sciences, and Education
FAITH Colleges: First Asia Institute of Technology and
Humanities
mmniem@[Link]
MODULAR ARITHMETIC
What will the clock
show in 10 hours?
MODULAR ARITHMETIC
Well, 9 + 10 = 19, but
“19 o’clock” is not
something can be
displayed on a clock
with numbers 1 – 12.
MODULAR ARITHMETIC
We subtract 12 from
19 and proudly say
the clock will show
7:00.
MODULAR ARITHMETIC
This is the idea
behind modular
arithmetic, which is
sometimes referred
to as “clock
arithmetic”.
MODULAR ARITHMETIC
19 mod 12 = 7 mod 12,
where 7 represents the
remainder when 19 is
divided by 12.
MODULAR ARITHMETIC
It is a system of arithmetic for
integers, which considers the
remainder.
Drill
1. What is 16 mod 12?
2. What about 15 mod 2?
3. If you have 18 mod 9?
The trick for modular arithmetic is
to focus on the remainder!
4. Evaluate – 97 mod 11.
- 97 divided by 11 equals -8 remainder – 9.
But since this remainder is negative, we have to
increase our quotient by 1 to say – 97 divided by 11
equals -9 remainder 2, as 11(-9) + 2 = -97!
Therefore, -97 mod 11 equals 2.
MODULAR ARITHMETIC
a is congruent to b modulo m
If a – b or b – a is divisible by m.
Verify if the following congruence are true:
𝟑 ≡ 𝟗 ( 𝒎𝒐𝒅 𝟐 )
It is TRUE since 3 – 9 = - 6, which
is divisible by 2.
Verify if the following congruence are true:
𝟒 ≡ 𝟏𝟓 (𝒎𝒐𝒅 𝟑 )
It is FALSE since 4 – 15 = - 11,
which is not divisible by 3.
Verify if the following congruence are true:
𝟒 ≡ 𝟏𝟓 (𝒎𝒐𝒅 𝟒 )
It is TRUE since 7 – 15 = - 8,
which is divisible by 4.
Verify if the following congruence are true:
𝟓 ≡ 𝟐𝟎 (𝒎𝒐𝒅 𝟑 )
It is TRUE since 5 – 20 = - 15,
which is divisible by 3.
Verify if the following congruence are true:
𝟒 ≡ 𝟐𝟎 (𝒎𝒐𝒅 𝟑 )
It is FALSE since 4 – 20 = - 16,
which is not divisible by 3.
MODULAR ARITHMETIC:
LEAST RESIDUE
To determine the least residue is
to simply get the remainder
when b is divided by m.
𝒓 ≡ 𝒃 (𝒎𝒐𝒅 𝒎 )
MODULAR ARITHMETIC:
LEAST RESIDUE
𝒓 ≡ 𝒃 (𝒎𝒐𝒅 𝒎 )
b (mod m) means b divided by m.
m referred to as the modulus.
Solve the least residue “r”.
Solve the least residue “r”.
6.
7.
8.
9.
10.
11.
ABSTRACTION
CALENDAR
TRY THIS:
Find the day of the week of the following
important dates.
[Link] 20, 1969 → First Man in the Moon
2. June 5, 2013 → First Man on Mars
ISBN
CHECK DIGIT
CRYPTOLOGY
Shift Transformation
And Affine Transformation
ANALYSIS
REFLECTION:
[Link] did you solve real world
applications of congruences?
[Link] are the steps in solving real world
applications of congruences?
[Link] a conclusion on your learning
about the lesson.
APPLICATION
ASSESSMENT
AGREEMENT
REFERENCES
THANK YOU!