Permutations and Combinations 213

Theorem 1 : The number of circular permutations of n different objects is (n  1) !

Theorem 2 : The number of ways in which n persons can be seated round a table is (n  1)!
Theorem 3 : The number of ways in which n different beads can be arranged to form a
1
necklace, is (n  1)! .
2
Note :  When the positions are numbered, circular arrangement is treated as a linear
arrangement.
 In a linear arrangement, it does not make difference whether the positions are
numbered or not.

Example: 19 In how many ways a garland can be made from exactly 10 flowers [MP PET 1984]
9!
(a) 10 ! (b) 9 ! (c) 2 (9!) (d)
2
1 1
Solution: (d) A garland can be made from 10 flowers in (9!) ways [ n flower's garland can be made in (n  1)!
2 2
ways]
Example: 20 In how many ways can 5 boys and 5 girls sit in a circle so that no boys sit together [II
5 ! 5 !
(a) 5! × 5! (b) 4! × 5 ! (c) (d) None of these
2
Solution: (b) Since total number of ways in which boys can occupy any place is (5  1)! 4! and the 5 girls can be sit
accordingly in 5! ways. Hence required number of ways are 4 ! × 5 !.
Example: 21 The number of ways in which 5 beads of different colours form a necklace is [Rajasthan
(a) 12 (b) 24 (c) 120 (d) 60
Solution: (a) The number of ways in which 5 beads of different colours can be arranged in a circle to form a
necklace are
= (5  1)! 4 ! .
But the clockwise and anticlockwise arrangement are not different (because when the necklace is
turned over one gives rise to another). Hence the total number of ways of arranging the beads =
1
(4 !)  12 .
2
Example: 22 The number of ways in which 5 male and 2 female members of a committee can be seated around a
round table so that the two female are not seated together is [R
(a) 480 (b) 600 (c) 720 (d) 840
Solution: (a) Fix up a male and the remaining 4 male can be seated in 4! ways. Now no two female are to sit
together and as such the 2 female are to be arranged in five empty seats between two consecutive
5
male and number of arrangement will be P2 . Hence by fundamental theorem the total number of
ways is = 4 !  P2  24  20  480 ways.
5

Combinations
5.9 Definition.
Each of the different groups or selections which can be formed by taking some or all of a
number of objects, irrespective of their arrangements, is called a combination.
 214 Permutations and Combinations

Suppose we want to select two out of three persons A, B and C.

We may choose AB or BC or AC.
Clearly, AB and BA represent the same selection or group but they give rise to different
arrangements.
Clearly, in a group or selection, the order in which the objects are arranged is immaterial.
Notation: The number of all combinations of n things, taken r at a time is denoted by
n
C (n, r) or n C r or   .
r
(1) Difference between a permutation and combination : (i) In a combination only selection is
made whereas in a permutation not only a selection is made but also an arrangement in a
definite order is considered.
(ii) In a combination, the ordering of the selected objects is immaterial whereas in a
permutation, the ordering is essential. For example A, B and B, A are same as combination but
different as permutations.
(iii) Practically to find the permutation of n different items, taken r at a time, we first
select r items from n items and then arrange them. So usually the number of permutations
exceeds the number of combinations.
(iv) Each combination corresponds to many permutations. For example, the six
permutations ABC, ACB, BCA, BAC, CBA and CAB correspond to the same combination ABC.
Note :  Generally we use the word ‘arrangements’ for permutations and word “selection”
for combinations.
5.10 Number of Combinations without Repetition.
The number of combinations (selections or groups) that can be formed from n different
n!
objects taken r(0  r  n) at a time is n Cr 
r !(n  r)!
Let the total number of selections (or groups) = x. Each group contains r objects, which can be
arranged in r ! ways. Hence the number of arrangements of r objects = x  (r!) . But the number of
arrangements = n Pr .
n
Pr n!
 x  (r!)  n Pr  x  x n Cr .
r! r !(n  r)!

Important Tips
 n
C r is a natural number.  n C0 n Cn  1, n C1  n
 n
Cr n Cn  r  n
C r  n C r 1  n 1 C r
 n
C x n C y  x  y or x  y  n  n . n 1 C r 1  (n  r  1)n C r 1
n
 If n is even then the greatest value of C r is n C n / 2 .  If n is odd then the greatest value of n
C r is
n n
Cn 1 Cn 1
or .
2 2
n r 1
n
n n 1 Cr
 n
Cr  . C r 1  n

r C r 1 r

 n
C0 n C1 n C2  ..... n Cn  2n  n C0 n C 2 n C4  ...... n C1 n C3 n C5  .....  2n 1
 Permutations and Combinations 215

2 n 1
 C0  2 n 1C1  2 n 1C2  .....  2 n 1Cn  2 2 n  n Cn n 1Cn n  2 Cn  n  3 Cn  ....  2 n 1Cn  2 n Cn 1

Note :  Number of combinations of n dissimilar things taken all at a time

n! 1
n
Cn    1 , ( 0 !  1) .
n !(n  n) ! 0 !
Example: 23 If 15
C 3 r  15 C r  3 , then the value of r is [IIT 1967; Rajasthan PET 1991; MP PET 1998; Karnataka
CET 1996]
(a) 3 (b) 4 (c) 5 (d) 8
Solution: (a) 15
C 3r  Cr3  15 15
C15  3 r  C r  3  15  3r  r  3  r  3 .
15

n
Cr
Example: 24 n
 [MP PET 1984]
C r 1
nr n  r 1 n r 1 n  r 1
(a) (b) (c) (d)
r r r r
n
Cr n! n! (r  1) !(n  r  1)! (n  r  1)(r  1) !(n  r) ! (n  r  1)
Solution: (c)    =  .
n
Cr 1 r!(n  r)! r!(n  r)! n! r(r  1) !(n  r) ! r
n!
(r  1) ! (n  r  1) !
n 1
Example: 25 If C 3  2 n C 2 , then n = [MP PET 2000]

(a) 3 (b) 4 (c) 5 (d) 6

n 1
Solution: (c) C 3  2.n C 2
(n  1)! n! n 1 2
  2.    n 1  6  n  5 .
3!(n  2)! 2!(n  2)! 3 . 2! 2!
Example: 26 If n
C r 1  36 , n C r  84 and n C r 1  126 then the value of r is [IIT 1979; Pb. CET 1993;
DCE 1999; MP PET 2001]
(a) 1 (b) 2 (c) 3 (d) None of these
n n
C r 1 36 Cr 84
Solution: (c) Here n
 and n

Cr 84 C r 1 126
3n  10 r  3 and 4 n  10 r  6 ; on solving we get n  9 and r  3 .
Example: 27 In a conference of 8 persons, if each person shake hand with the other one only, then the total
number of shake hands shall be [M
(a) 64 (b) 56 (c) 49 (d) 28
Solution: (d) Total number of shake hands when each person shake hands with the other once only = 8
C 2  28
ways.
Example: 28 How many words of 4 consonants and 3 vowels can be formed from 6 consonants and 5 vowels.[Rajasthan PET 1985]
(a) 75000 (b) 756000 (c) 75600 (d) None of these
Solution: (b) Required number of words = 6
C 4  5 C 3  7 ! = 756000

[Selection can be made in 6

C 4  5 C 3 while the 7 letters can be arranged in 7!]
Example: 29 To fill 12 vacancies there are 25 candidates of which five are from scheduled caste. If 3 of the
vacancies are reserved for scheduled caste candidates while the rest are open to all, then the number
of ways in which the selection can be made
[Rajasthan PET 1981]
(a) 5
C3  22
C9 (b) 22
C9  C3
5
(c) 22
C3  C3
5
(d) None of these
 216 Permutations and Combinations

Solution: (a) The selection can be made in 5

C 3  22 C 9 [since 3 vacancies filled from 5 candidates in 5
C 3 ways and
22
now remaining candidates are 22 and remaining seats are 9, then remaining vacancies filled by C9
ways. Hence total number of ways C 3  5 22
C9 .

5.11 Number of Combinations with Repetition and All Possible Selections.

(1) The number of combinations of n distinct objects taken r at a time when any object may
be repeated any number of times.
= coefficient of x r in (1  x  x 2  .......  x r )n = coefficient of x r in (1  x )n  n r 1 C r
(2) The total number of ways in which it is possible to form groups by taking some or all of
n things at a time is 2 n  1 .
(3) The total number of ways in which it is possible to make groups by taking some or all
out of n  (n1  n 2  ....) things, when n1 are alike of one kind, n 2 are alike of second kind, and so
on is {(n1  1)(n 2  1)......}  1 .
(4) The number of selections of r objects out of n identical objects is 1.
(5) Total number of selections of zero or more objects from n identical objects is n  1 .
(6) The number of selections taking at least one out of a1  a 2  a 3  ......  an + k objects,
where a1 are alike (of one kind), a 2 are alike (of second kind) and so on...... a n are alike (of nth
kind) and k are distinct = [(a1  1)(a 2  1)(a 3  1).......(an  1)] 2 k  1 .

Example: 30 There are 10 lamps in a hall. Each one of them can be switched on independently. The number of
ways in which the hall can be illuminated is [R
2 10
(a) 10 (b) 1023 (c) 2 (d) 10 !

Solution: (b) Number of ways are = 2 10

 1  1023
[– 1 corresponds to none of the lamps is being switched on.]
Example: 31 10 different letters of English alphabet are given. Out of these letters, words of 5 letters are formed.
How many words are formed when atleast one letter is repeated [U

(a) 99748 (b) 98748 (c) 96747 (d) 97147

Solution: (a) Number of words of 5 letters in which letters have been repeated any times = 10 5

But number of words on taking 5 different letters out of 10 = 10

C5  252

 Required number of words = 10 5  252 = 99748.

Example: 32 A man has 10 friends. In how many ways he can invite one or more of them to a party [A

(a) 10 ! (b) 2 10
(c) 10 !  1 (d) 210
1

Solution: (d) Required number of friend = 210  1 (Since the case that no friend be invited i.e., 10
C 0 is excluded)

Example: 33 Numbers greater than 1000 but not greater than 4000 which can be formed with the digits 0, 1, 2, 3,
4 (repetition of digits is allowed), are [A

(a) 350 (b) 375 (c) 450 (d) 576

Solution: (b) Numbers greater than 1000 and less than or equal to 4000 will be of 4 digits and will have either 1
(except 1000) or 2 or 3 in the first place with 0 in each of remaining places.
After fixing 1st place, the second place can be filled by any of the 5 numbers. Similarly third place can
be filled up in 5 ways and 4th place can be filled up in 5 ways. Thus there will be 5 × 5 × 5 = 125 ways
 Permutations and Combinations 217

in which 1 will be in first place but this include 1000 also hence there will be 124 numbers having 1 in
the first place. Similarly 125 for each 2 or 3. One number will be in which 4 in the first place and i.e.,
4000. Hence the required numbers are 124 + 125 + 125 +1 = 375 ways.

5.12 Conditional Combinations.

(1) The number of ways in which r objects can be selected from n different objects if k
particular objects are
n k n k
(i) Always included = C r k (ii) Never included = Cr
(2) The number of combinations of n objects, of which p are identical, taken r at a time is
n p
= C r  n  p C r 1  n  p C r  2  .......  n  p C 0 if r  p and
n p
= Cr  n  p Cr 1  n  p Cr 2  .......  n p Cr  p if r  p
Example: 34 In the 13 cricket players 4 are bowlers, then how many ways can form a cricket team of 11 players in
which at least 2 bowlers included [R
(a) 55 (b) 72 (c) 78 (d) None of these
Solution: (c) The number of ways can be given as follows:
2 bowlers and 9 other players = 4
C 2 9 C 9 ; 3 bowlers and 8 other players = 4
C 3 9 C 8

4 bowlers and 7 other players = 4 C 4 9 C7

Hence required number of ways = 6 × 1 + 4 × 9 + 1 × 36 = 78.
Example: 35 In how many ways a team of 10 players out of 22 players can be made if 6 particular players are
always to be included and 4 particular players are always excluded [Raja
22 18 12 18
(a) C10 (b) C3 (c) C4 (d) C4
Solution: (c) 6 particular players are always to be included and 4 are always excluded, so total number of
selection, now 4 players out of 12.
12
Hence number of ways = C4 .
Example : 36 In how many ways can 6 persons to be selected from 4 officers and 8 constables, if at least one officer
is to be included
[Roorkee 1985; MP PET 2001]
(a) 224 (b) 672 (c) 896 (d) None of these
Solution: (c) Required number of ways = C1  C5  C 2  C4  C3  C3  C4  C 2 = 4 × 56 + 6 × 70 + 4 × 56 + 1 × 28
4 8 4 8 4 8 4 8

= 896.

5.13 Division into Groups.

Case I : (1) The number of ways in which n different things can be arranged into r different
n r 1 n 1
groups is Pn or n ! C r 1 according as blank group are or are not admissible.
(2) The number of ways in which n different things can be distributed into r different
group is
r n  r C1 (r  1)n  r C 2 (r  2)n  .........  (1)n 1 n Cr 1 or Coefficient of x n is n ! (e x  1)r
Here blank groups are not allowed.
 218 Permutations and Combinations

(3) Number of ways in which m × n different objects can be distributed equally among n
persons (or numbered groups) = (number of ways of dividing into groups) × (number of groups) ! =
(mn )!n ! (mn )!
 .
(m !)n n! (m!)n
Case II : (1) The number of ways in which (m  n) different things can be divided into two
(m  n)!
groups which contain m and n things respectively is, m n C m . n C n  ,m  n .
m !n!
Corollary: If m  n , then the groups are equal size. Division of these groups can be given
by two types.
Type I : If order of group is not important : The number of ways in which 2n different
(2n)!
things can be divided equally into two groups is
2!(n!) 2
Type II : If order of group is important : The number of ways in which 2n different
(2n)! 2n!
things can be divided equally into two distinct groups is  2! 
2!(n!)2 (n!)2
(2) The number of ways in which (m + n + p) different things can be divided into three
(m  n  p)!
groups which contain m, n and p things respectively is m n  p C m . n  p C n . p C p  ,m  n  p
m !n ! p !
Corollary: If m  n  p , then the groups are equal size. Division of these groups can be
given by two types.
Type I : If order of group is not important : The number of ways in which 3p different
(3 p)!
things can be divided equally into three groups is
3!( p!)3
Type II : If order of group is important : The number of ways in which 3p different things
(3 p)! (3 p)!
can be divided equally into three distinct groups is 3
t 3!
3!( p!) ( p!)3

Note :  If order of group is not important : The number of ways in which mn different
mn !
things can be divided equally into m groups is
(n!)m m !
 If order of group is important: The number of ways in which mn different things
(mn )! (mn )!
can be divided equally into m distinct groups is m
 m!  .
(n!) m! (n!)m

Example: 37 In how many ways can 5 prizes be distributed among four students when every student can take one
or more prizes
[BIT Ranchi 1990; Rajasthan PET 1988, 97]
(a) 1024 (b) 625 (c) 120 (d) 60
Solution: (a) The required number of ways = 4 5  1024 [since each prize can be distributed by 4 ways]
Example: 38 The number of ways in which 9 persons can be divided into three equal groups is [O
(a) 1680 (b) 840 (c) 560 (d) 280
 Permutations and Combinations 219

9! 9 8 7 6 5  4
Solution: (d) Total ways =  = 280.
(3!)3 3  2  3  2  3  2
Example: 39 The number of ways dividing 52 cards amongst four players equally, are [IIT 1979]
52! 52! 52!
(a) (b) (c) (d) None of these
(13!)4 (13!)2 4! (12!) 4 4 !
52! 39 ! 26 ! 13 ! 52!
Solution: (a) Required number of ways = 52 C13  39 C13  26 C13  13 C13 =    = .
39 !13 ! 26 !13 ! 13 !13 ! 13 ! (13!)4
Example: 40 A question paper is divided into two parts A and B and each part contains 5 questions. The number of
ways in which a candidate can answer 6 questions selecting at least two questions from each part is [R
(a) 80 (b) 100 (c) 200 (d) None of these
Solution: (c) The number of ways that the candidate may select
2 questions from A and 4 from B = 5 C 2 5 C 4 ; 3 questions form A and 3 from B = 5 C 3 5 C 3
4 questions from A and 2 from B = 5 C4  5 C 2 . Hence total number of ways are 200.

5.14 Derangement.
Any change in the given order of the things is called a derangement.
If n things form an arrangement in a row, the number of ways in which they can be
 1 1 1 1
deranged so that no one of them occupies its original place is n !1     ......  (1)n .  .
 1! 2! 3! n !
Example: 41 There are four balls of different colours and four boxes of colurs same as those of the balls. The
number of ways in which the balls, one in each box, could be placed such that a ball doesn't go to box
of its own colour is [IIT 1992]
(a) 8 (b) 7 (c) 9 (d) None of these
1 1 1
Solution: (c) Number of derangement are = 4 !      12  4  1  9 .
 2 ! 3 ! 4 !
 1 1 1 1 1
(Since number of derangements in such a problem is given by n ! 1     ......  (1)n  .
 1! 2! 3! 4 ! n!

5.15 Some Important Results for Geometrical Problems.

(1) Number of total different straight lines formed by joining the n points on a plane of
which m (< n) are collinear is n C 2  m C 2  1 .
(2) Number of total triangles formed by joining the n points on a plane of which m (< n)
are collinear is n C3 m C3 .
(3) Number of diagonals in a polygon of n sides is n C 2  n .
(4) If m parallel lines in a plane are intersected by a family of other n parallel lines. Then
mn (m  1)(n  1)
total number of parallelograms so formed is m C 2 n C 2 i.e
4
(5) Given n points on the circumference of a circle, then
(i) Number of straight lines = n C 2 (ii) Number of triangles = n C 3 (iii) Number of
quadrilaterals = n C 4 .
(6) If n straight lines are drawn in the plane such that no two lines are parallel and no
three lines are concurrent. Then the number of part into which these lines divide the plane is =
1  n .
 220 Permutations and Combinations
n
(7) Number of rectangles of any size in a square of n  n is r
r 1
3
and number of squares of

n
any size is r
r 1
2
.

np
(8) In a rectangle of n  p (n  p ) number of rectangles of any size is (n  1)(p  1) and
4
n
number of squares of any size is  (n  1  r)(p  1  r) .
r 1

Example: 42 The number of diagonals in a octagon will be [MP PET 1984; Pb. CET 1989,
2000]
(a) 28 (b) 20 (c) 10 (d) 16
Solution: (b) Number of diagonals = 8
C 2  8 = 28  8 = 20.
Example: 43 The number of straight lines joining 8 points on a circle is [M
(a) 8 (b) 16 (c) 24 (d) 28
8
Solution: (d) Number of straight line = C 2 = 28.
Example: 44 The number of triangles that can be formed by choosing the vertices from a set of 12 points, seven of
which lie on the same straight line, is [Roorkee 1989, 2000; BIT Ranchi 1989; MP PET 1995; Pb. CET 1997; DCE 2002]
(a) 185 (b) 175 (c) 115 (d) 105
Solution: (a) Required number of ways = 12
C 3  7 C 3 = 220 – 35 = 185.
Example: 45 Out of 18 points in a plane, no three are in the same straight line except five points which are
collinear. The number of (i) straight lines (ii) triangles which can be formed by joining them [W
(i) (a) 140 (b) 142 (c) 144 (d) 146
(ii) (a) 816 (b) 806 (c) 800 (d) 750
Solution: (c, b) Out of 18 points, 5 are collinear
(i) Number of straight lines = 18
C 2  5 C 2  1  153  10  1  144
(ii) Number of triangles  18 C3 5 C3  816  10  806 .

5.16 Multinomial Theorem.

Let x 1 , x 2 , ......., x m be integers. Then number of solutions to the equation x 1  x 2  ......  x m  n
.....(i)
Subject to the condition a1  x 1  b1 , a 2  x 2  b 2 ,......., a m  x m  b m .....(ii)
is equal to the coefficient of x n in
(x a1  x a1 1  ......  x b1 )(x a2  x a2 1  .....  x b2 )......( x am  x am 1  .....  x bm )
......(iii)
This is because the number of ways, in which sum of m integers in (i) equals n, is the same
as the number of times x n comes in (iii).
(1) Use of solution of linear equation and coefficient of a power in expansions to find the number
of ways of distribution : (i) The number of integral solutions of x 1  x 2  x 3  ......  x r  n where
x 1  0, x 2  0, ...... x r  0 is the same as the number of ways to distribute n identical things among r
persons.
This is also equal to the coefficient of x n in the expansion of (x 0  x 1  x 2  x 3  ......) r
r
 1 
= coefficient of x n in   = coefficient of x in (1  x )r
n

 1  x 
 Permutations and Combinations 221

 r(r  1) 2 r(r  1)(r  2)......(r  n  1) n

= coefficient of x n in 1  rx  x  ......  x  .......
 2! n!
r(r  1)(r  2)....(r  n  1) (r  n  1)! n r 1
   C r 1
n! n!(r  1)!
(ii) The number of integral solutions of x 1  x 2  x 3  .....  x r  n where x 1  1, x 2  1,....... x r  1
is same as the number of ways to distribute n identical things among r persons each getting at
least 1. This also equal to the coefficient of x n in the expansion of (x 1  x 2  x 3  ......) r
r
 x 
= coefficient of x n in   = coefficient of x in x r (1  x )r
n

1  x 
 r (r  1) 2 r (r  1)(r  2).....(r  n  1) n 
= coefficient of x n in x r 1  rx  x  .....  x  .....
 2 ! n ! 
 r(r  1) 2 r(r  1)(r  2).....(r  n  1) n 
= coefficient of x n  r in 1  rx  x  .....  x  ..... 
 2! n! 
r(r  1)(r  2)......(r  n  r  1) r(r  1) (r  2).....(n  1) (n  1) !
= = =  n 1 C r 1 .
(n  r)! (n  r)! (n  r)!(r  1)!

Example: 46 A student is allowed to select utmost n books from a collection of (2n  1) books. If the total number of
ways in which he can select one book is 63, then the value of n is [IIT 1987; Rajasthan PET 1999]
(a) 2 (b) 3 (c) 4 (d) None of these
Solution: (b) Since the student is allowed to select utmost n books out of (2n  1) books. Therefore in order to select
one book he has the choice to select one, two, three,......., n books.
Thus, if T is the total number of ways of selecting one book then T  2 n 1 C1  2 n 1 C 2  .....  2 n 1 C n  63 .

Again the sum of binomial coefficients

2 n 1
C 0  2 n 1 C1  2 n 1 C 2  ......  2 n 1 C n  2 n 1 C n 1 + 2 n 1
C n  2  .....  2 n 1 C 2 n 1  (1  1)2 n 1  2 2 n 1
2 n 1
or, C 0  2( 2 n 1 C1  2 n 1 C 2  .....  2 n 1 C n )  2 n 1 C 2 n 1  2 2 n 1

2 2n 1
 1  2(T )  1  2 2n1  1  T   2 2n  1  63  2 2 n  2 6  2 2 n  n  3 .
2

Example: 47 If x, y and r are positive integers, then x Cr  x Cr 1y C1  x Cr  2 y C2  ..... y Cr 

[Karnataka CET 1993; Rajasthan PET 2001]
x ! y! (x  y )! x y xy
(a) (b) (c) Cr (d) Cr
r! r!
x y
Solution: (c) The result C r is trivially true for r  1, 2 it can be easily proved by the principle of mathematical
induction that the result is true for r also.

5.17 Number of Divisors.

Let N  p 11 . p 2 2 . p 3 3 ...... p k k , where p 1 , p 2 , p 3 ,...... p k are different primes and  1 ,  2 ,  3 ,......,  k are
natural numbers then :
(1) The total number of divisors of N including 1 and N is = ( 1  1) ( 2  1) ( 3  1)....( k  1)
 222 Permutations and Combinations

(2) The total number of divisors of N excluding 1 and N is =

( 1  1) ( 2  1) ( 3  1).....( k  1)  2
(3) The total number of divisors of N excluding 1 or N is = (1  1)( 2  1)( 3  1).....( k  1)  1
(4) The sum of these divisors is
1 2 k
 (p10  p12  p 32  ......  p1 )( p 20  p12  p 22  ...  p 2 ).....( pk0  pk1  pk2  ....  pk )

(5) The number of ways in which N can be resolved as a product of two factors is
1
 2 (1  1)( 2  1)....( k  1), If N is not a perfect square
1
 [(1  1)( 2  1).....( k  1)  1], If N is a perfect square
2
(6) The number of ways in which a composite number N can be resolved into two factors
which are relatively prime (or co-prime) to each other is equal to 2 n 1 where n is the number of
different factors in N.

Important Tips

 All the numbers whose last digit is an even number 0, 2, 4, 6 or 8 are divisible by 2.
 All the numbers sum of whose digits are divisible by 3,is divisible by 3 e.g. 534. Sum of the digits is 12, which are
divisible by 3, and hence 534 is also divisible by 3.
 All those numbers whose last two-digit number is divisible by 4 are divisible by 4 e.g. 7312, 8936, are such that
12, 36 are divisible by 4 and hence the given numbers are also divisible by 4.
 All those numbers, which have either 0 or 5 as the last digit, are divisible by 5.
 All those numbers, which are divisible by 2 and 3 simultaneously, are divisible by 6. e.g., 108, 756 etc.
 All those numbers whose last three-digit number is divisible by 8 are divisible by 8.
 All those numbers sum of whose digit is divisible by 9 are divisible by 9.
 All those numbers whose last two digits are divisible by 25 are divisible by 25 e.g., 73125, 2400 etc.

Example: 48 The number of divisors of 9600 including 1 and 9600 are [I

(a) 60 (b) 58 (c) 48 (d) 46

Solution: (c) Since 9600 = 27  31  5 2

Hence number of divisors = (7  1)(1  1)(2  1)  48 .

Example: 49 Number of divisors of n  38808 (except 1 and n) is [Rajasthan

(a) 70 (b) 68 (c) 72 (d) 74

Solution: (a) Since 38808 = 8 × 4851 = 8 × 9 × 539 = 8 × 9 × 7 × 7 × 11 = 2  3  7  11 3 2 2

So, number of divisors = (3 + 1) (2 + 1) (2 + 1) (1 + 2) – 2 = 72 – 2 = 70.

***