1. Basic Divisibility Rules
-
Idea: Checking whether a number is divisible by common numbers such as 2, 3, 4, 5, 8, 9, 10 and 11.
-
Formula / Rule:
- Divisible by 2 → last digit is even.
- Divisible by 3 → sum of digits is divisible by 3.
- Divisible by 4 → last 2 digits are divisible by 4.
- Divisible by 5 → last digit is 0 or 5.
- Divisible by 8 → last 3 digits are divisible by 8.
- Divisible by 9 → sum of digits is divisible by 9.
- Divisible by 10 → last digit is 0.
- Divisible by 11 → difference between sums of alternate digits is 0 or a multiple of 11.
-
Example: Is 5832 divisible by 8?
Solution: Last three digits are 832.
832 ÷ 8 = 104Therefore, 5832 is divisible by 8.
2. Missing Digit / Missing Number Divisibility
-
Idea: Finding an unknown digit so that a number becomes divisible by a given number.
-
Formula / Rule: Apply the divisibility rule of the required divisor.
-
Example: Find the digit (x) so that (54x32) is divisible by 9.
Solution:
5 + 4 + x + 3 + 2 = 14 + xFor divisibility by 9:
14 + x = 18 x = 4Answer: (x=4)
3. Divisibility by Composite Numbers
-
Idea: Breaking a number into smaller factors and checking divisibility by each factor.
-
Formula / Rule: If (a) and (b) are coprime,
-
Example: Check whether 9765 is divisible by 15.
Solution:
15 = 3 × 5Digit sum:
9 + 7 + 6 + 5 = 27So it is divisible by 3.
Last digit is 5, so it is divisible by 5.
Therefore, it is divisible by 15.
4. Divisibility by 6, 12, 15, 18, 24, 36 and Similar Numbers
-
Idea: Combining basic divisibility rules to handle common composite numbers.
-
Formula / Rule:
6 = 2 × 3 12 = 3 × 4 15 = 3 × 5 18 = 2 × 9 24 = 3 × 8 36 = 4 × 9Check the required factors separately.
-
Example: Is 7380 divisible by 36?
Solution:
For 4:
Last two digits = 80 80 is divisible by 4For 9:
7 + 3 + 8 + 0 = 18 18 is divisible by 9Therefore, 7380 is divisible by 36.
5. Algebraic Divisibility
-
Idea: Using standard algebraic divisibility patterns instead of calculating large powers.
-
Formula / Rule:
-
Example: Is (7^{15}+3^{15}) divisible by 10?
Solution:
Since 15 is odd,
is divisible by (x+y).
Here,
x+y=7+3=10Therefore,
715+315is divisible by 10.
6. Remainder-Based Divisibility
-
Idea: Using the remainder of a number or expression to determine divisibility without calculating the complete value.
-
Formula / Rule:
If
then (N) is divisible by (d) when (r=0).
-
Example: Find the remainder when (2^{10}) is divided by 7.
Solution:
2³ = 8 ≡ 1 (mod 7)Therefore,
2¹⁰ = 2⁹ × 2 ≡ 1³ × 2 ≡ 2 (mod 7)Remainder = 2
7. Cyclicity of Powers
-
Idea: Finding the last digit or remainder of very large powers using repeating patterns.
-
Formula / Rule: Powers of a number often repeat their last digits in a fixed cycle.
-
Example: Find the last digit of (7^{103}).
Solution:
Powers of 7 have the cycle:
7, 9, 3, 1Cycle length = 4.
103 ÷ 4 → remainder 3Take the 3rd number in the cycle:
3Answer: 3
8. Digital Root
-
Idea: Quickly reducing a number to a single digit to test divisibility patterns or compare numerical properties.
-
Formula / Rule:
-
Example: Find the digital root of 987654.
Solution:
9 + 8 + 7 + 6 + 5 + 4 = 39 3 + 9 = 12 1 + 2 = 3Answer: 3
9. Factorial Divisibility
-
Idea: Finding how many times a prime number divides a factorial such as (10!), (50!), or (100!).
-
Formula / Rule:
-
Example: Find the highest power of 5 in (100!).
Solution:
Therefore, (5^{24}) divides (100!), but (5^{25}) does not.
10. Number of Zeros in a Factorial
-
Idea: Finding trailing zeros in (n!).
-
Formula / Rule:
-
Example: Find the number of trailing zeros in (100!).
Solution:
Answer: 24
Advanced
11. Highest Power of a Composite Number in (n!)
-
Idea: Finding the highest power of a composite number such as 12, 18 or 24 that divides (n!).
-
Formula / Rule: Factor the divisor into primes and compare the available powers in (n!).
-
Example: Find the highest power of 12 dividing (50!).
Solution:
12 = 2² × 3In (50!):
Power of 2 = 25 + 12 + 6 + 3 + 1 = 47 Power of 3 = 16 + 5 + 1 = 22Each factor of 12 needs 2 twos and 1 three.
47 ÷ 2 = 23 22 ÷ 1 = 22Therefore, the limiting factor is 3.
Answer: (12^{22}) divides (50!).
12. Advanced Missing-Digit Divisibility
-
Idea: Finding one or more missing digits when several divisibility conditions must hold simultaneously.
-
Formula / Rule: Apply all required divisibility conditions together.
-
Example: Find (x) such that (35x4) is divisible by both 3 and 4.
Solution:
Divisibility by 4:
Last two digits = x4Possible values:
04, 24, 44, 64, 84Divisibility by 3:
So (x) must be divisible by 3.
From the possible digits:
x = 0 or 6
Therefore:
x = 0 or 6Premium Content
Unlock Divisibility Rules and all premium lessons with a subscription.
From ₹199.99/year — See plans