LECTURE 3

Modular Arithmetic

April 23, 2023

1 Modular Arithmetic

Let a, b, and m be integers, with m 6= 0. We say that a and b are congruent

modulo m if m divides a − b. We denote this by a ≡ b(modm). This means a
and b gives the same remainder when divided by m.
The relation “ ≡ ” on the set Z of integers is called the congruence relation. If
m does not divide a − b, then we say that integers a and b are not congruent
modulo m and we write a 6= b (modm).

Divisibility of 5
10 is equivalent to 20 mod 5. ie 10 and 20 gives the same remainder when
divided by 5.
33 ≡ 43 ≡ 3 (mod5)

1
 0(mod5) 1(mod5) 2(mod5) 3(mod5) 4(mod5)
5 6 7 8 9
50 11 22 63 99
(−3) (−2) (−1)

Difference between any two numbers from the same group is divisible by 5.
a ≡ b(mod5) if and only if 5 divides a − b.
a ≡ b(modn) if and only if n divides a − b.

5 − 55 = (−50) .

All natural numbers can be divided into 5 groups .

If we add any multiple of 5 the remainder remains the same. (mod5)
7−5=2
4 − 5 = −1
∴ 4 ≡ (−1) (mod5)
3 ≡ 3 − 5 ≡ (−2) (mod5)
(−3) + 5 ≡ 2
∴ (−3) ≡ 2(mod5)
(−9) + 10 = 1
∴ (−9) ≡ 1(mod5)
−22 ≡ −22 + 25 ≡ 3(mod5)
−53 ≡ −53 + 55 = 2(mod5)
−102 ≡ −102 + 105 ≡ 3(mod5)

Note
1. a ≡ b(modn), then a ≡ b ± nk(modn)

2. akm+n = akm · an = (ak )m · an

3. We try to find the powers that gives remainders ±1 . These are very
useful.

4. akm+n = akm · an = (ak )m · an

Properties :
1. Any perfect square is 0, 1 mod 4.
(mod4)
a(mod4) a2 (mod4)
0 0
1 1
2 4≡0
3 9≡1

2
 2) Any perfect square is 0, 1 mod 3.
a(mod3) a2 (mod3)
0 0
1 1
2 4≡1

• Solved Examples :

1. Find the remainder 132341567890241575 is divided by 7.

2. Find power of 4 which gives me remainder 1 (mod9)

3. Find the remainder 72033 (mod100)

Applications
1. Find the reminder when 9564322189675218 is divided by 8.
2. Find the reminder when 75429818902198 is divided by 8.

3. 6925621987260191 (mod9)
4. 1470689192 (mod7)
5. Prove that 299 + 1 is divisible by 11.
6. Determine the last 2 digits of the number 72349 .

7. Find the remainders

a) 2897787 (mod7)
b)113218998 (mod60)
c) 68620321 (mod37)
d) 93725 (mod41)
e) 32350 (mod7)
f) 7121 (mod50)
8. Definition: n! = 1 · 2 · 3 · · · n = product of all natural numbers till n .
Find the remainder when 1! + 2! + 3! + 4! + · · · + 99! + 100! is divided by
100.

9. Find the remainder when 15 + 25 + · · · + 1005 is divided by 4.

10. Find the remainder when 44444444 is divided by 9.
11. Find the remainder when 44443333 + 33334444 is divided by 7.

3
12. Find all integers solutions to the equation a2 + 1 = 4b2
13. Find all integers solutions to the equation a2 + 7 = 999b
14. Prove that a3 − b3 = 2012 has no solution over integers.