BullsEye 4

Download as pdf or txt
Download as pdf or txt
You are on page 1of 9

MATH

Numbers - Divisibility

MBA

Every Year 1 Crore Students Trust Us for Test Prep


https://hitbullseye.com/courses.php
L
1800-572-7347
Numbers - Divisibility Rules

1. By 2 - A number is divisible by 2 when its unit’s


place is 0 or divisible by 2., e.g. 120, 138.
2. By 3 - 19272 is divisible by 3 when the sum of the
digits of 19272 = 21 is divisible by 3.
3. By 4 - A number is divisible by 4 when the last two
digits of the number are 0s or are divisible by 4. As
100 is divisible by 4, it is sufficient if the divisibility
test is restricted to the last two digits. e.g. 145896,
128, 18400
4. By 5 - A number is divisible by 5 if its unit’s digit is
5 or 0., e.g. 895, 100
5. By 6 - A number is divisible by 6 if it is divisible by
both 2 and by 3 i.e. the number should be an even
number and the sum of its digits should be
divisible by 3.
6. By 8 - A number is divisible by 8 if the last three
digits of the number are 0s or are divisible by 8. As
1000 is divisible by 8, it is sufficient if the
divisibility test is restricted to the last three digits,
e.g. 135128, 45000

1
7. By 9 - A number is divisible by 9 if the sum of its
digits is divisible by 9. e.g. 810, 92754
8. By 11 - A number is divisible by 11 if the difference
between the sum of the digits at odd places and
the sum of the digits at even places of the number
is either 0 or a multiple of 11.
e.g. 121, 65967. In the first case 1+1 - 2 = 0. In the
second case 6+9+7 = 22 and 5+6 = 11 and the
difference is 11. Therefore, both these numbers are
divisible by 11.
9. By 12 - A number is divisible by 12 if it is divisible
by both 3 and by 4. i.e., the sum of the digits
should be divisible by 3 and the last two digits
should be divisible by 4. e.g. 144, 8136
10. By 15 – A number is divisible by 15 if it is divisible
by both 5 and 3.
11. By 25 – 2358975 is divisible by 25 if the last two
digits of 2358975 are divisible by 25 or if the last
two digits are 0s.
12. By 75 - A number is divisible by 75 if it is divisible
by both 3 and 25 i.e. the sum of the digits should
be divisible by 3 and the last two digits should be
divisible by 25.

2
13. By 125 - A number is divisible by 125 if its last
three right-hand digits are divisible by 125 or if the
last three digits are 0s. e.g. 1254375, 12000
14. The number of factors of a number can be found
by knowing how many prime factors it has.
The number of factors of a number, say 48, can be
found by knowing how many prime factors it has.
48 has four 2s and one 3.
(24  31)
So 48 has  (4 + 1) (1 + 1) = 10.
Factors of 48 are 1, 2, 3, 4, 6, 8, 12, 16, 24 & 48.
If J = px × qy × rz, (p, q & r are prime) then J has
(x + 1)(y +1)(z +1) factors.
15. By 7 – A number is divisible by 7, if the number of
tens added to five times the number of units is
divisible by 7. e.g. if you check 259, number of tens
= 25 and 5 times units digit 5  9 = 45 now 25 + 45
= 70. As 70 is divisible by 7 so this number is
divisible by 7.
OR There is a concept of seed number, which can
be applied to check the divisibility of certain
numbers. The process is that if the sum of the

3
products of the digits of the number from left to
right with increasing powers of the seed number is
divisible by 7 or is zero. The seed number of 7 is –
2. e.g. 2863
2(-2)0 + 8(-2)1 + 6(-2)2 + 3(-2)3
= 2 – 16 + 24 – 24 = -14. As this is divisible by 7,
the number is divisible by 7.
16. By 13 – If the number of tens added to four times
the number of units is divisible by 13. Then the
number is divisible by 13. e.g. 4394 no. of tens =
439, number of units = 4  4 = 16
 439 + 16 = 455, which is divisible by 13, so the
number is divisible by 13
OR A number is divisible by 13, if the sum of the
digits of the number from left to right with 1, 4, 3, -
1, - 4, -3…. Successively is divisible by 13.
e.g. 4394  4(1) + 3(4) + 9(3) + 4(-1) = 4 + 12 + 27
– 4 = 39, which is divisible by 13. So the number is
divisible by 13.
17. By 17 – A number is divisible by 17, if the number
of tens added to twelve times the number of units
is divisible by 17.

4
18. By 19 – A number is divisible by 19, if the number
of tens added to twice the number of units is
divisible by 19.
OR The seed number for 19 is 2; A number is
divisible by 19 if the sum of the product of the
digits of the number from left to right with
increasing powers of the seed number is divisible
by 19. e.g. 1083  1(2)0 + 0(2)1 + 8(2)2 + 3(2)3
= 1 + 0 + 32 +24 = 57, which is divisible by 19, so
the number is divisible by 19.
19. By 29 – A number is divisible by 29, if the number
of tens added to thrice the number of units is
divisible by 29.

5
Important Results on Numbers

1. The sum of 5 successive whole numbers is always


divisible by 5.
2. The product of 3 consecutive natural numbers is
divisible by 6.
3. The product of 3 consecutive natural numbers, the
first of which is an even number is divisible by 24.
4. The sum of a two-digit number and a number
formed by reversing its digits is divisible by 11. E.g.
28 + 82 = 110, which is divisible by 11. At the same
time, the difference between those numbers will be
divisible by 9. e.g. 82 – 28 = 54, which is divisible
by 9.
n(n  1)
5. n = , n is the sum of first n natural
2
numbers.
n(n  1)(2n  1)
6. n2 = , n2 is the sum of first n perfect
6
squares.
E.q. What is the value of P, where P = 12 + 22 +
….102?

6
You have to find the sum of first 10 perfect
squares.
The above mentioned formula is to be applied.
10  11  21
102 =  385.
6

3
n 2 (n  1) 2
7. n = = (n)2, n3 is the sum of first n
4
perfect cubes.
8. xn + yn = (x + y) (xn-1 - xn-2.y + xn-3.y2 - ... +yn-1) when n is
odd. Therefore, when n is odd, xn + ynis divisible by x
+ y. e.g. 33 + 23 = 35 and is divisible by 5.
9. xn - yn = (x + y) (xn-1 - xn-2.y + ... yn-1) when n is even.
Therefore, when n is even, xn - ynis divisible by x + y.
e.g 72 - 32 = 40, which is divisible by 10.
10. xn - yn = (x - y) (xn-1 + xn-2.y + .... + yn-1) for both odd
and even n. Therefore, xn - yn is divisible by x - y.
e.g. 94 - 24 = 6545 which is divisible by 7.
11. The number of divisors of a composite number: If D
is a composite number in the form D = ap × bq × cr,
where a, b, c are primes, then the no. of divisors of
D, represented by n is given by

7
n = (p+1)(q+1)(r +1).
e.g. What is the total number of factors of 200?
As calculated above 200 can be written as 23 × 52.
The values of p & q in this case are 3 & 2
respectively.
Thus the total number of factors are (3 + 1) × (2 +
1) = 12.
So 200 has 12 factors in total.
The factors are 1 × 200, 2 × 100, 4 × 50, 5 × 40, 8 ×
25, 10 × 20.
The sum of all those divisors of Sn is given by the
following formula
(a p 1  1)(bq 1  1)(c r 1  1)
Sn 
(a  1)(b  1)(c  1)

e.g. What is the sum of all the factors of 200?


(23 1  1)(5 2 1  1)
As per the above formula Sn 
(2  1)(5  1)

15 124
 15 × 31 = 465.
4

You might also like