We studied divisibility rules in secondary school. In this lesson, we will examine the basis behind these rules. This involves application of two vital concepts from Number Theory and Factors and Remainders lessons. These concepts are restated below. We will also look at concepts related to last digit and factorial.
1. Revisiting Basics
1.1 Decimal Number System
Numbers are used to measure and count. The number system used globally is the decimal number system, where the base is 10. This just means that there are 10 digits in this number system. They are 0, 1, 2, 3, 4, 5, 6, 7, 8, 9.
In this number system, the placement of digits in a number creates the value for that number. In this lesson, we will be working with positive integers (or natural numbers) only.
From right to left, the places before the decimal points are units' place, tens' place, hundreds' place, thousands' place, etc. Each of these places have a certain value attached to it. They start with 100 and increase with increments of 1 in the power. The table below shows till the seventh digit from the right.
| Position (Right to Left) |
Value |
| Units' Place |
100 |
| Tens' Place |
101 |
| Hundreds' Place |
102 |
| Thousands' Place |
103 |
| Ten Thousands' Place |
104 |
| Hundred Thousands' Place |
105 |
| Millions' Place |
106 |
∴ The number
25,678 means there are 2 of 104,5 of 103,6 of 102,7 of 101 and 8 of 100.
25678=(2×104)+(5×103)+(6×102)+(7×101)+(8×100)
This forms the value of every number in the decimal system. The following is an example for a relatively larger number.
5305680=(5×106)+(3×105)+(0×104)+(5×103)+(6×102)+(8×101)+(0×100)
We can also merge some of the places. For instance, the above number can also be expressed as
5305680=(5380×104)+(5680×100) or 5305680=(5×106)+(305×103)+(680×100)
1.2 Remainder rules
Sum Rule: Remainder of Sum of numbers = Sum of remainders when each of the numbers is divided by the divisor
When n=a1+a2+a3+...,
Rem(dn) =Rem(da1+a2+a3+...) =Rem(da1) +Rem(da2) +Rem(da3)+...
Product Rule: Remainder of product of numbers = Product of remainders when each of the numbers is divided by the divisor
When n=a1×a2×a3×...,
Rem(dn) =Rem(da1×a2×a3×...) =Rem(da1) ×Rem(da2) ×Rem(da3)×...
Example 1
What is the remainder when 34585 is divided by 4?
Solution
34585=(3×104) +(4×103) +(5×102) +(8×101) +(5×100)
Rem(434585) =Rem(4(3×104)+(4×103)+(5×102)+(8×101)+(5×100))
Applying sum rule, we write this as
=Rem(43×104) +Rem(44×103) +Rem(45×102) +Rem(48×101) +Rem(45×100)
If n≥2,10n will perfectly divide 22 and leave a remainder of 0.
∴ Applying Product rule,
=Rem(43×0) +Rem(44×0) +Rem(45×0) +Rem(48×101) +Rem(45×100)
=Rem(480) +Rem(45) =0+1=1
Answer: 1
Note: This is the logic behind looking at the last two digits for divisibility by 4.
2. Divisibility Rules / Remainder Rules
This section will provide the shortcuts to calculate the remainder for division by certain integers. A number is perfectly divisible by another, if the remainder equals
0.
∴ The same rules apply for finding the remainder and for checking divisibility.
2.1 Divisor is
2n and 5n
Rule: Remainder when a number is divided by 2n or 5nequals the remainder when the last n digits of the number is divided by 2n or 5n.
Explanation
10=2×5. Likewise, 10n=2n×5n
Place value of (n+1)th digit from the right in a number is 10n, which would perfectly divide 2n and 5n. Digits to the left of it will have higher place values and perfectly divide 2n and 5n.
∴ Remainder of a number, when divided by 2n or 5n equals the remainder left by the number's last n digits.
So, if we divide a number by 125(=53), all place values that are 103 and more perfectly divide 125.
∴ We look at the remainder for the last 3 digits only, whose place values 102, 101 and 100 do not perfectly divide 125.
The following table provides the divisibility/remainder pattern for divisibility upto 25 and 55.
| Remainder when n is divided by x |
| x |
Remainder Rule |
| 2 |
Last digit of n divided by 2 |
| 4 |
Last 2 digits of n divided by 4 |
| 8 |
Last 3 digits of n divided by 8 |
| 16 |
Last 4 digits of n divided by 16 |
| 32 |
Last 5 digits of n divided by 32 |
| 5 |
Last digit of n divided by 5 |
| 25 |
Last 2 digits of n divided by 25 |
| 125 |
Last 3 digits of n divided by 125 |
| 625 |
Last 4 digits of n divided by 25 |
Additionally, a number divides
1)
2 only if it's last digit is 2, 4, 6, 8 or 0.
2) 5 only if it's last digit is 5 or 0.
3) 25 only if it's last 2 digits are 00, 25, 50 or 75.
Example 2
67485923576 is divisible by
(1) 4 but not 8, 16 and 32
(2) 4 and 8 but not 16 and 32
(3) 4, 8 and 16 but not 32
(4) 4, 8, 16 and 32
Solution
Rem(476=0);Rem(8576=0);Rem(163576=8)
As the number is not divisible by 16, it will not be divisible by 32.
∴ Number is divisible by 4 and 8 only.
Answer: (2) 4 and 8 but not 16 and 32
2.2 Divisor is 10n
Rule: Remainder when a number is divided by
10n is the same as the last n digits of the number.
Likewise, if a number is divisible by 10n, then the last n digits will be zeroes.
Example 3
Radha, Geeta, Ram and Lakhan donated 41373, 92324,43288 and 13245 gold coins to a trust. The trust decided to distribute an equal number of these gold coins to each of their 100 beneficiaries. What is the minimum number of gold coins left after such distribution?
Solution
Minimum number of gold coins left will be the remainder when the total gold coins are divided by 100.
Rem(10041373+92324+43288+13245)
=Rem(10073+24+88+45)=Rem(100230)=30
Answer: 30