SP MATH 120

Number Theory

CHAPTER 4 MODULAR ARITHMETIC

LESSON 1 CONGRUENCES

Introduction
Congruence modulo n is a congruence relation, meaning that it is an equivalence
relation that is compatible with the operations of addition, subtraction, and multiplication.
Congruence modulo n is denoted: The parentheses mean that (mod n) applies to the entire
equation, not just to the right-hand side (here b). This notation is not to be confused with
the notation b mod n (without parentheses), which refers to the modulo operation: 𝑏 mod
𝑛 denotes the unique integer a such that 0 ≤ 𝑎 ≤ 𝑛 and 𝑎 ≡ 𝑏(𝑚𝑜𝑑 𝑚). (WIKIPEDIA)
Learning Outcomes
At the end of the lesson, you are expected to:
• prove theorem on congruence;
• define congruence and its properties; and
• apply congruence theorem to integers.

Learning activities
Identify the remainder of the following. Write your answer on a separate sheet.
1. 57 is divided by 7.
2. 123 is divided by 15.
3. 357 is divided by 24.
4. 754 is divided by 30.
5. 826 is divided by 27.
Analysis
1. How did you identify the remainder? (State your process).
____________________________________________________________
_____________________________________________________________________
_____________________________________________________________________
_____________________________________________________________________
2. What are the steps in identifying the remainder?
____________________________________________________________
_____________________________________________________________________
_____________________________________________________________________
_____________________________________________________________________
3. Based from the activity, make a conclusion.
____________________________________________________________
_____________________________________________________________________
_____________________________________________________________________
_____________________________________________________________________

69
SP MATH 120
Number Theory

Abstraction
According to Ortega, we can use the following definitions, properties and theorems to
determine congruence to integers.
Definition. Let 𝑚 ∈ 𝑁 be fixed and 𝑎, 𝑏 ∈ 𝑍. We say that a is congruent to b modulo m,
and write.
𝑎 ≡ 𝑏(mod 𝑚 ),
whenever 𝑚 | (𝑎 − 𝑏). If m does not divide a-b, then we write
𝑎 ≢ 𝑏(mod 𝑚)
Example
1. 8 ≡ 3(mod 5) because 5 | (8 − 3)
2. −12 ≡ 8(mod 10) because 10 |(−12 − 8)
3. 11 ≢ 7(mod 5) because 5 | (11 − 7)
Some trivial observations were, the congruence 𝑎 ≡ 𝑏(mod 𝑚 ), holds for all
integers 𝑎 and 𝑏 if and only if 𝑚 = 1.
Two integers 𝑎 and 𝑏 are of the same parity if and only if 𝑎 ≡ 𝑏(mod 2).
The condition for 𝑎 to be congruent to 𝑏 modulo 𝑚 is equivalent to the condition
that 𝑎 = 𝑏 + 𝑘𝑚 for some 𝑘 ∈ 𝑍.
Theorem. Properties of Congruences.
1. If 𝑎 ≡ 𝑏(mod 𝑚 ) and 𝑐 ≡ 𝑑(mod 𝑚), then 𝑎 ± 𝑐 ≡ 𝑏 ± 𝑑 (mod 𝑚).
2. If 𝑎 ≡ 𝑏(mod 𝑚), then 𝑎𝑐 ≡ 𝑏𝑐(mod 𝑚).
3. If 𝑎 ≡ 𝑏(mod 𝑚) and 𝑐 ≥ 1, then 𝑎𝑐 ≡ 𝑏𝑐 (mod 𝑚𝑐 ).
4. If 𝑎 ≡ 𝑏(mod 𝑚) and 𝑐 ≡ 𝑑(mod 𝑚), then 𝑎𝑐 ≡ 𝑏𝑑 (mod 𝑚).
5. If 𝑎 ≡ 𝑏(mod 𝑚), then 𝑎𝑛 = 𝑏𝑛 (mod 𝑚) for all 𝑛 ≥ 1.
6. 𝑎 = 0(mod 𝑚) if and only if 𝑚 | 𝑎.
𝑚
7. If 𝑎𝑐 ≡ 𝑏𝑐 (mod 𝑚) and (𝑐, 𝑚) = 𝑛, then 𝑎 ≡ 𝑏 (mod 𝑛 ).
8. If 𝑎𝑐 ≡ 𝑏𝑐 (mod 𝑚) and (𝑐, 𝑚) = 1, then 𝑎 ≡ 𝑏(mod 𝑚).
9. If 𝑎 ≡ 𝑏(mod 𝑚) and 𝑛 | 𝑚, then 𝑎 ≡ 𝑏(mod 𝑚).
Although you can add, subtract and multiply congruences with respect to the same
modulus, in general, we cannot simply divide out an integer from either side of a
congruence.
Example
32 ≡ 8(mod 24) but 16 ≢ 8(mod 15).
Theorem. Let 𝑎, 𝑏, 𝑐 ∈ 𝑍.
1. 𝑎 ≡ 𝑎(mod 𝑚).
2. If 𝑎 ≡ 𝑏(mod 𝑚), then 𝑏 ≡ 𝑎(mod 𝑚).
3. If 𝑎 ≡ 𝑏(mod 𝑚) and 𝑏 ≡ 𝑐(mod 𝑚), then 𝑎 ≡ 𝑐(mod 𝑚).
Theorem. The integers 𝑎 and 𝑏 have the same remainders when divided by 𝑚 if and only
if 𝑎 ≡ 𝑏(mod 𝑚).
As a consequences of the preceding theorem, any integer must be congruent to
exactly one of 1, 2, … , 𝑚 − 1 modulo 𝑚.

70
SP MATH 120
Number Theory

In particular, for convenience, 𝑎 ≡ 𝑚 − 1(mod 𝑚) is computationally the same as

𝑎 ≡ −1(mod 𝑚).
Example
1. Find the remainder when 3241 is divided by 7.
Solution
Since 32 ≡ 4(mod 7), you have
3241 ≡ 441 (mod 7)
≡ (46 )6 ∙ 45 (mod 7)
≡ 16 ∙ 2 (mod 7)
≡ 1 ∙ 2 (mod 7)
≡ 2 (mod 7)
3241 ≡ 2 (mod 7) ⟹ remainder is 2
2. What is the remainder when 5231 is divided by 6?
Solution
Since 52 ≡ 7(mod 9).

5231 ≡ (72 )3(5) ∙ 7 (mod 9) Since 72 = 49, then 49 ≡ 4(mod 9)

≡ (43 )5 ∙ 7 (mod 9) Since 43 = 64, then 64 ≡ 1(mod 9)
≡ 15 ∙ 7 (mod 9) Since 1𝑘 = 1, then 15 = 1(mod 9)
≡ 1 ∙ 7 (mod 9)
5231 ≡ 7 (mod 9) ⟹ remainder is 7
3. What is the unit digit in the sum of 413 + 917 ?
Solution
The unit digit of a number is the remainder when the number is divided by 10. Since
4 = 6(mod 10) and 92 = 1(mod 10). Thus
2

413 + 917 ≡ (42 )6 ∙ 4 + (92 )8 ∙ 9(mod 10)

≡ (62 )3 ∙ 4 + (1)8 ∙ 9(mod 10)
≡ 63 ∙ 4 + (1)8 ∙ 9(mod 10)
≡ 6 ∙ 4 + 9(mod 10)
≡ 24 + 9(mod 10)
≡ 33(mod 10)
413 + 917 ≡ 3(mod 10) ⟹ remainder is 3
Theorem. Euler’s Theorem. Let 𝑎 ∈ 𝑍 and 𝑚 ∈ 𝑁 such that 𝑔𝑐𝑑(𝑎, 𝑚) = 1. Then

𝑎𝜙(𝑚) ≡ 1(mod 𝑚)

71
SP MATH 120
Number Theory

Example
What is the remainder when 1698 is divided by 21?
Solutions
Since 𝜙 (21) = 1, 2, 4, 5, 8, 10, 11, 13, 16, 17, 19, 20 then 𝜙(21) = 12 and
𝑔𝑐𝑑(16, 21) = 1, by Euler’s theorem, we have 1612 = 1(mod 21). Thus,
1698 ≡ (1612 )8 ∙ 162 (mod 21)
≡ (18 ) ∙ 162 (mod 21)
≡ 1 ∙ 4(mod 21)
1698 ≡ 4(mod 21)
So, the remainder is 4 when 1698 is divided by 21
Theorem. Fermat’s Little Theorem. Let 𝑝 be a prime and 𝑎 ∈ 𝑍. If gcd(𝑎, 𝑝) = 1, then
𝑎𝑝−1 ≡ 1(mod 𝑝).
Example
What is the remainder when 121515 is divided by 43?
Solution
By Fermat’s Little Theorem, 1242 = 1(mod 43) since 𝑔𝑐𝑑(12, 43) = 1, Thus, you have
121515 ≡ (1242 )36 ∙ 123 (mod 43)
≡ (136 ) ∙ 8 (mod 43)
≡ 1 ∙ 8 (mod 43)
121515 ≡ 8 (mod 43)
So, the remainder is 8 when 121258 is divided by 43.
Corollary. Let 𝑝 be prime and 𝑎 ∈ 𝑍. Then 𝑎𝑝 ≡ 𝑎(mod 𝑝).
Example
What is the remainder when 101370 is divided by 37?
Solution
By Fermat’s Little Theorem, 1036 = 1(mod 37) since 𝑔𝑐𝑑(10, 37) = 1, Thus, you have
101370 ≡ (1036 )37 ∙ 1036 ∙ 102 (mod 37)
≡ (137 ) ∙ 1 ∙ 26(mod 37)
≡ 1 ∙ 1 ∙ 26(mod 37)
101370 ≡ 26(mod 37)
So, the remainder is 26 when 101370 is divided by 37.
Try me!
Apply congruence theorem to following. Write your answer on a separate sheet.
1. Find the remainder when 3572 is divided by 6.
2. Find the remainder when 1429 is divided by 11.

72
SP MATH 120
Number Theory

3. Find the remainder when 27124 is divided by 19.

4. Find the unit digit in the sum of 3358 + 2779 .
5. Find the unit digit in the product of 4224 ∙ 2442 .
Application
Perform the different corollary, definition and theorems to solve the following statements.
Write your answer on a separate sheet.
1. Jerry has 44 boxes of soda in his truck. The cans of soda in each box are packed
oddly so that there are 113 cans of soda in each box. Jerry plans to pack the sodas
into cases of 12 cans to sell. After making as many complete cases as possible, how
many sodas will Jerry have leftover?

2. Marian has 3 packs of Durian candy and 4 packs of chocolate candy in her bag. If
the pack of durian candy contains 30 pieces and the pack of chocolate candies
contains 20 pieces. How many leftovers will Marian have if she gave the candies
to her friend equally?
Assessment
Apply congruence theorem to the following. Write your answer on a separate sheet.
1. Find the remainder of 3185 when divided by 21
2. Find the unit digit in the sum of 62014 + 2014 .
3. Find the unit digit in the product of 20192020 ∙ 1920 .
4. Find the remainder in the difference of 7337 − 373 when divided by 71.
5. Find the remainder in the product of 202019 ∙ 2019 when divided by 14.
Agreement
Determine the value of 𝑥 of the following congruences. Write your answer on a separate
sheet.
1. 9𝑥 ≡ 9 (mod 21).
2. 8𝑥 ≡ 1 (mod 15).
3. 15𝑥 ≡ 3 (mod 18).
4. 17𝑥 ≡ 13 (mod 29).
5. 24𝑥 ≡ 17 (mod 25).
References
AoPSOnline. (2020). Retrieved July 9, 2020, from Modular arithmetic/Introduction:
https://artofproblemsolving.com/wiki/index.php/Modular_arithmetic/Introduction
Clark, W. E. (2002). Elementary Number Theory. South Florida, Florida, United States of
America. Retrieved June 6, 2020, from
http://joshua.smcvt.edu/numbertheory/book.pdf
Lindahl, L.-A. (2002). Lectures on Number. Uppsala. Retrieved June 6, 2020, from
http://www2.math.uu.se/~astrombe/talteori2016/lindahl2002.pdf
Ortega, O. M. (n.d.). Math 527 - Number Theory. Tacloban City, Leyte, Philippines.
Retrieved September 30, 2018
WIKIPEDIA. (n.d.). Retrieved July 9, 2020, from Modular arithmetic:
https://en.wikipedia.org/wiki/Modular_arithmetic

73