DIVISIBILITY &
CONGRUENT MODULO n
LEARNING OUTCOMES
Evaluate mathematical arguments and solve problems
involving number theory using logical and modular
reasoning.
DIVISIBILITY
• It refers to whether one integer can be divided by another integer
without leaving a remainder.
• We say that an integer 'a' is divisible by an integer 'b' (where b ≠ 0) if
there exists an integer 'k' such that a=bk. In this case, 'b' is a divisor
(or factor) of 'a', and 'a' is a multiple of 'b'. We can denote this
relationship as b∣a.
123 321
EXAMPLES 321
Is 20 divisible by 4?
Yes. When 20 is divided by 4, the result is 5 with no remainder
(20=4×5). So, 4 is a divisor of 20, and 20 is a multiple of 4. We write
4∣20.
123
EXAMPLES 321
Is 15 divisible by 6?
No. When 15 is divided by 6, the result is 2 with a remainder of 3
(15=6×2+3). Since there's a remainder, 15 is not divisible by 6.
123
DIVISIBILITY RULES
[Link] by 2
Rule: A number is divisible by 2 if it ends in 0, 2, 4, 6,
Example: or 8.
48 → ends in 8 → ✅ divisible by 2
73 → ends in 3 → ❌ not divisible by 2
DIVISIBILITY RULES
2. Divisible by 3
Rule: A number is divisible by 3 if the sum of its digits
is divisible by 3.
Example:
123 → 1+2+3 = 6 → 6 ÷ 3 = 2 → ✅
124 → 1+2+4 = 7 → 7 ÷ 3 = 2.33 → ❌
DIVISIBILITY RULES
2. Divisible by 3
Try this : Yes or No
1. Is 4,284 divisible by 3? Yes
2. Is 7,726 divisible by 3? No
DIVISIBILITY RULES
3. Divisible by 4
Rule: A number is divisible by 4 if the last two digits
form a number divisible by 4.
Example:
716 → last two digits = 16 → 16 ÷ 4 = 4 → ✅
718 → last two digits = 18 → 18 ÷ 4 = 4.5 → ❌
DIVISIBILITY RULES
3. Divisible by 4
Try this : Yes or No
1. Is 9,918 divisible by 4? No
2. Is 672 divisible by 4? Yes
DIVISIBILITY RULES
4. Divisible by 5
Rule: A number is divisible by 5 if it ends in 0 or 5.
Example:
85 → ends in 5 → ✅
92 → ends in 2 → ❌
DIVISIBILITY RULES
5. Divisible by 6
Rule: A number is divisible by 6 if it is divisible by both
2 and 3.
Example:
84 → ends in 4 (even, divisible by 2) and 8+4=12
(divisible by 3) → ✅
45 → divisible by 3, but not by 2 → ❌
DIVISIBILITY RULES
5. Divisible by 6
Try this : Yes or No
1. Is 26,476 divisible by 6? No
2. Is 612 divisible by 6? Yes
DIVISIBILITY RULES
6. Divisible by 8
Rule: A number is divisible by 8 if the last three digits
form a number divisible by 8.
Example:
7,136→ last three digits = 136 ÷ 8=17 → ✅
1,234 → last three digits = 234 → 234 ÷ 8 = 29.25
→❌
DIVISIBILITY RULES
6. Divisible by 8
Try this : Yes or No
1. Is 1,000 divisible by 8? Yes
2. Is 19,640 divisible by 8? Yes
DIVISIBILITY RULES
7. Divisible by 9
Rule: A number is divisible by 9 if the sum of its digits
is divisible by 9.
Example:
729 → 7+2+9 = 18 → 18 ÷ 9 = 2 → ✅
731 → 7+3+1 = 11 → 11 ÷ 9 = 1.22 → ❌
DIVISIBILITY RULES
7. Divisible by 9
Try this : Yes or No
1. Is 42,619 divisible by 9? No
2. Is 18,315 divisible by 9? Yes
DIVISIBILITY RULES
8. Divisible by 10
Rule: A number is divisible by 10 if it ends in 0.
Example:
120 → ends in 0 → ✅
125 → ends in 5 → ❌
PRIME NUMBERS
• A prime number is a natural number greater than 1 that has
exactly two distinct positive divisors: 1 and itself. Any natural
number greater than 1 that is not prime is called a composite
number.
PRIME NUMBERS
Key
Ideas:
• The number 1 is unique; it is neither prime nor composite
• The smallest and only even prime number is 2.
• The Fundamental Theorem of Arithmetic states that every integer
greater than 1 can be uniquely expressed as a product of prime
numbers (ignoring the order of the factors). This is also known as
unique prime factorization.
EXAMPLES
PRIME NUMBERS:
2 (divisors: 1, 2)
3 (divisors: 1, 3)
5 (divisors: 1, 5)
7 (divisors: 1, 7)
11 (divisors: 1, 11)
13 (divisors: 1, 13)
EXAMPLES
COMPOSITE NUMBERS:
4 (divisors: 1, 2, 4)
6 (divisors: 1, 2, 3, 6)
9 (divisors: 1, 3, 9)
12 (divisors: 1, 2, 3, 4, 6, 12)
CONGRUENCES
• Two integers, a and b, are said to be congruent modulo “n” (where “n” is a
positive integer called the modulus) if they have the same remainder
when divided by “n”.
• This is expressed using the congruence symbol: a≡b(modn)
–- this statement is equivalent to saying that “n” divides the difference a - b.
In other words, a - b = kn for some integer k.
123
EXAMPLES
17≡5(mod6):
When 17 is divided by 6, the remainder is 5 (17=6×2+5).
When 5 is divided by 6, the remainder is 5 (5=6×0+5).
Alternatively, 17−5=12, and 12 is divisible by 6 (12=6×2).
EXAMPLES
2≡12(mod5):
When 2 is divided by 5, the remainder is 2.
When 12 is divided by 5, the remainder is 2 (12=5×2+2).
Alternatively, 12−2=10, and 10 is divisible by 5 (10=5×2).
EXAMPLES
Clock Arithmetic:
If it's currently 9 o'clock, what time will it be in 5 hours?
This is 9+5=14. On a 12-hour clock, 14(mod12)=2. So, it will be 2
o'clock.
EXAMPLES
Day of the Week Calculation:
If today is Thursday (let Thursday be day 4, starting with Sunday
as 0), what day will it be in 25 days?
We are working modulo 7.
4+25=29
29(mod7): 29=4×7+1. The remainder is 1.
Since Sunday is 0, Monday is 1. So, in 25 days, it will be Monday.
Thank
you!