calendarBack
Quant

/

Numbers

/

Divisibility
ALL MODULES

CAT 2025 Lesson : Divisibility - Concepts & Cheatsheet

bookmarked
Note: The video for this module contains a summary of all the concepts covered in this lesson. The video would serve as a good revision. Please watch this video in intervals of a few weeks so that you do not forget the concepts. Below is a cheatsheet that includes all the formulae but not necessarily the concepts covered in the video.

   6. Cheatsheet

1) List of divisibility rules

Number Divisibility Rule
22 Last digit divisible by 22
33 Sum of digits divisible by 33
44 Last two digits divisible by 44
55 Last digit is 00 or 55
66 Divisible by 22 and 33
77 Difference between sum of alternate sets of digits is divisible by 77
88 Last three digits divisible by 88
99 Sum of digits divisible by 99
1010 Last digit is 00
1111 Difference between sum of alternate sets of digits is divisible by 1111
1212 Divisible by 33 and 44
1313 Difference between sum of alternate sets of digits is divisible by 1313
1414 Divisible by 22 and 77
1515 Divisible by 33 and 55
1616 Last 44 digits divisible by 1616
1818 Divisible by 22 and 99
2020 Divisible by 44 and 55
2424 Divisible by 33 and 88
2525 Last 22 digits divisble by 2525
3232 Last 5 digits divisible by 3232
100100 Last 22 digits are 00
125125 Last 33 digits divisible by 125125


2) For all composite numbers,
Divisibility Rule: Check for divisibility by each of the prime factors raised to their respective powers.
Remainder Rule: Apply Chinese Remainder theorem.

3) Where pp is a prime number, greatest power of p that divides n! is the sum of quotients when nn is successively divided by pp.

4) Where
aa, bb and cc are prime numbers and x=apbqcrx = a^{p}b^{q}c^{r}, to find the greatest power of x that divides n!,
(a) find the largest powers for each of
aa, bb and cc that can divide n!n! ;
(b) divide these respective powers by
pp, qq and rr and write down the quotients.
(c) The least quotient is the highest power of
xx that can perfectly divide n!n!.

5) To find the last
nn digits in the product of certain numbers, we can simply multiply the last nn digits of each of these numbers.

6) Cyclicity of units digit is
(a)
1\bm{1} for 00, 11, 55, 66
(b)
2\bm{2} for 44, 99
(c)
4\bm{4} for 22, 33, 77, 88

77) Last 22 digits of xnx^{n} when

xx is a Last 22 digits
number that ends in 55 If power is even, then 2525. If power is odd, then 2525 if tens digit of base is even and 7575 if tens digit of base is odd.
number that ends in 00 Last 22 digits are 0000
multiple of 22 but not 44 Last 22 digits of x40k+1=x+50x^{40k + 1} = x + 50
multiple of 44 Last 22 digits of x40k+1=xx^{40k + 1} = x
number that ends in 11 Last digit is 11, tens digit is U(tens digit ofx×units digit ofn)U(\text{tens digit of} x \times \text{units digit of} n)
number that ends in 33, 77 or 99 Raise it by a power so that the number ends in 11. Then, apply the above rule for 'number that ends in 11'.
Loading...Loading Video....