+91 9600 121 800

Plans

Dashboard

Daily & Speed

Quant

Verbal

DILR

Compete

Free Stuff

calendarBack
Quant

/

Numbers

/

Divisibility

Divisibility

MODULES

bookmarked
Divisibility - 2, 5, 10
bookmarked
Divisibility - 3, 9, 11
bookmarked
7, 13 and Composite
bookmarked
Divisibility of Factorial
bookmarked
Last Digit
bookmarked
Last 2 Digits
bookmarked
Past Questions

CONCEPTS & CHEATSHEET

Concept Revision Video

SPEED CONCEPTS

Divisibility 1
-/10
Divisibility 2
-/10

PRACTICE

Divisibility : Level 1
Divisibility : Level 2
Divisibility : Level 3
ALL MODULES

CAT 2025 Lesson : Divisibility - Divisibility - 2, 5, 10

bookmarked
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
101010. This just means that there are 101010 digits in this number system. They are 000, 111, 222, 333, 444, 555, 666, 777, 888, 999.

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
10010^{0}100 and increase with increments of 111 in the power. The table below shows till the seventh digit from the right.

Position (Right to Left) Value
Units' Place 10010^{0}100
Tens' Place 10110^{1}101
Hundreds' Place 10210^{2}102
Thousands' Place 10310^{3}103
Ten Thousands' Place 10410^{4}104
Hundred Thousands' Place 10510^{5}105
Millions' Place 10610^{6}106


∴ The number
25,67825,67825,678 means there are 222 of 104,510^{4}, 5104,5 of 103,610^{3}, 6103,6 of 102,710^{2}, 7102,7 of 10110^{1}101 and 888 of 10010^{0}100.

25678=(2×104)+(5×103)+(6×102)+(7×101)+(8×100)25678 = (2 \times 10^{4}) + (5 \times 10^{3}) + (6 \times 10^{2}) + (7 \times 10^{1}) + (8 \times 10^{0})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)5305680 = (5 \times 10^{6}) + (3 \times 10^{5}) + (0 \times 10^{4}) + (5 \times 10^{3}) + (6 \times 10^{2}) + (8 \times 10^{1}) + (0 \times 10^{0})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)5305680 = (5380 \times 10^{4}) + (5680 \times 10^{0})5305680=(5380×104)+(5680×100) or 5305680=(5×106)+(305×103)+(680×100)5305680 = (5 \times 10^{6}) + (305 \times 10^{3}) + (680 \times 10^{0})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+...,n = a_{1} + a_{2} + a_{3} + ...,n=a1​+a2​+a3​+...,

Rem(nd)\text{Rem} \left(\dfrac{n}{d} \right)Rem(dn​) =Rem(a1+a2+a3+...d)= \text{Rem} \left(\dfrac{a_{1} + a_{2} + a_{3} + ...}{d} \right)=Rem(da1​+a2​+a3​+...​) =Rem(a1d)= \text{Rem} \left(\dfrac{a_{1}}{d} \right) =Rem(da1​​) +Rem(a2d)+ \text{Rem} \left(\dfrac{a_{2}}{d} \right) +Rem(da2​​) +Rem(a3d)+...+ \text{Rem} \left(\dfrac{a_{3}}{d} \right) + ...+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×...,n = a_{1} \times a_{2} \times a_{3} \times ...,n=a1​×a2​×a3​×...,

Rem(nd)\text{Rem} \left(\dfrac{n}{d} \right)Rem(dn​) =Rem(a1×a2×a3×...d)= \text{Rem} \left(\dfrac{a_{1} \times a_{2} \times a_{3} \times ...}{d} \right)=Rem(da1​×a2​×a3​×...​) =Rem(a1d)= \text{Rem} \left(\dfrac{a_{1}}{d} \right)=Rem(da1​​) ×Rem(a2d) \times \text{Rem} \left(\dfrac{a_{2}}{d} \right)×Rem(da2​​) ×Rem(a3d)×...\times \text{Rem} \left(\dfrac{a_{3}}{d} \right) \times ...×Rem(da3​​)×...

Example 1

What is the remainder when 345853458534585 is divided by 444?

Solution

34585=(3×104)34585 = (3 \times 10^{4})34585=(3×104) +(4×103)+ (4 \times 10^{3})+(4×103) +(5×102)+ (5 \times 10^{2})+(5×102) +(8×101)+ (8 \times 10^{1})+(8×101) +(5×100)+ (5 \times 10^{0})+(5×100)

Rem(345854)\text{Rem} \left(\dfrac{34585}{4} \right)Rem(434585​) =Rem((3×104)+(4×103)+(5×102)+(8×101)+(5×100)4)= \text{Rem} \left(\dfrac{(3 \times 10^{4}) + (4 \times 10^{3}) + (5 \times 10^{2}) + (8 \times 10^{1}) + (5 \times 10^{0})}{4} \right)=Rem(4(3×104)+(4×103)+(5×102)+(8×101)+(5×100)​)

Applying sum rule, we write this as

=Rem(3×1044)= \text{Rem}\left(\dfrac{3 \times 10^{4}}{4} \right)=Rem(43×104​) +Rem(4×1034)+ \text{Rem} \left(\dfrac{4 \times 10^{3}}{4} \right)+Rem(44×103​) +Rem(5×1024)+ \text{Rem} \left(\dfrac{5 \times 10^{2}}{4} \right)+Rem(45×102​) +Rem(8×1014)+ \text{Rem} \left(\dfrac{8 \times 10^{1}}{4} \right)+Rem(48×101​) +Rem(5×1004)+ \text{Rem} \left(\dfrac{5 \times 10^{0}}{4} \right)+Rem(45×100​)

If
n≥2,10nn \ge 2, 10^{n}n≥2,10n will perfectly divide 222^{2}22 and leave a remainder of 000. ∴ Applying Product rule,

=Rem(3×04)= \text{Rem}\left(\dfrac{3 \times 0}{4} \right)=Rem(43×0​) +Rem(4×04)+ \text{Rem} \left(\dfrac{4 \times 0}{4} \right)+Rem(44×0​) +Rem(5×04)+ \text{Rem} \left(\dfrac{5 \times 0}{4} \right)+Rem(45×0​) +Rem(8×1014)+ \text{Rem} \left(\dfrac{8 \times 10^{1}}{4} \right)+Rem(48×101​) +Rem(5×1004)+ \text{Rem} \left(\dfrac{5 \times 10^{0}}{4} \right)+Rem(45×100​)

=Rem(804)= \text{Rem} \left(\dfrac{80}{4}\right)=Rem(480​) +Rem(54)+ \text{Rem} \left(\dfrac{5}{4}\right)+Rem(45​) =0+1=1= 0 + 1 = 1=0+1=1

Answer:
111

Note: This is the logic behind looking at the last two digits for divisibility by
444.

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
000.

∴ The same rules apply for finding the remainder and for checking divisibility.

2.1 Divisor is 2n2^{n}2n and 5n5^{n}5n

Rule: Remainder when a number is divided by
2n2^{n}2n or 5n5^{n}5nequals the remainder when the last n digits of the number is divided by 2n\bm{2^{n}}2n or 5n\bm{5^{n}}5n.

Explanation

10=2×510 = 2 \times 510=2×5. Likewise, 10n=2n×5n10^{n} = 2^{n} \times 5^{n}10n=2n×5n

Place value of
(n+1)th(n + 1)^{\text{th}}(n+1)th digit from the right in a number is 10n10^{n}10n, which would perfectly divide 2n2^{n}2n and 5n5^{n}5n. Digits to the left of it will have higher place values and perfectly divide 2n2^{n}2n and 5n5^{n}5n.

∴ Remainder of a number, when divided by
2n2^{n}2n or 5n5^{n}5n equals the remainder left by the number's last nnn digits.

So, if we divide a number by
125(=53)125 \boldsymbol{(= 5^{3})}125(=53), all place values that are 10310^{3}103 and more perfectly divide 125125125.

∴\therefore∴ We look at the remainder for the last 3\bm{3}3 digits only, whose place values 10210^2102, 10110^1101 and 10010^0100 do not perfectly divide 125125125.

The following table provides the divisibility/remainder pattern for divisibility upto
252^{5}25 and 555^{5}55.

            Remainder when n is divided by x
x Remainder Rule
222 Last digit of nnn divided by 2
444 Last 222 digits of nnn divided by 444
888 Last 333 digits of nnn divided by 888
161616 Last 444 digits of nnn divided by 161616
323232 Last 555 digits of nnn divided by 323232
555 Last digit of nnn divided by 5
252525 Last 222 digits of nnn divided by 252525
125 Last 333 digits of nnn divided by 125
625625625 Last 444 digits of nnn divided by 252525

Additionally, a number divides
1)
222 only if it's last digit is 222, 444, 666, 888 or 000.
2)
555 only if it's last digit is 555 or 000.
3)
252525 only if it's last 222 digits are 000000, 252525, 505050 or 757575.

Example 2

674859235766748592357667485923576 is divisible by

(1)
444 but not 888, 161616 and 323232         (2) 444 and 888 but not 161616 and 323232
(3)
444, 888 and 161616 but not 323232         (4) 444, 888, 161616 and 323232

Solution

Rem(764=0);Rem(5768=0);Rem(357616=8)\text{Rem} \left(\dfrac{76}{4} = 0\right) ; \text{Rem} \left(\dfrac{576}{8} = 0 \right) ; \text{Rem} \left(\dfrac{3576}{16} = 8 \right)Rem(476​=0);Rem(8576​=0);Rem(163576​=8)

As the number is not divisible by
161616, it will not be divisible by 323232.

∴ Number is divisible by
444 and 888 only.

Answer: (2)
444 and 888 but not 161616 and 323232

2.2\bm{2.2}2.2 Divisor is 10n\bm{10^{n}}10n

Rule: Remainder when a number is divided by
10n\bm{10^{n}}10n is the same as the last n digits of the number.

Likewise, if a number is divisible by
10n10^{n}10n, then the last nnn digits will be zeroes.

Example 3

Radha, Geeta, Ram and Lakhan donated 413734137341373, 92324,4328892324, 4328892324,43288 and 132451324513245 gold coins to a trust. The trust decided to distribute an equal number of these gold coins to each of their 100100100 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 100100100.

Rem(41373+92324+43288+13245100)\text{Rem} \left(\dfrac{41373 + 92324 + 43288 + 13245}{100} \right)Rem(10041373+92324+43288+13245​)

=Rem(73+24+88+45100)=Rem(230100)=30= \text{Rem}\left(\dfrac{73 + 24 + 88 + 45}{100} \right) = \text{Rem} \left(\dfrac{230}{100} \right) = 30=Rem(10073+24+88+45​)=Rem(100230​)=30

Answer:
303030
Loading...Loading Video....