PERMUTATIONS & COMBINATIONS

Total No. of questions in Permutations & Combinations are-

In Chapter Examples ................................................ 42
In Chapter Questions ................................................ 31

Total No. of questions .................................................. 73

1. FACTORIAL NOTATION
The continuous product of first n natural numbers
is called factorial and it can be represented
by notation |n or n! .
So n! = 1.2.3......... (n–1) .n
or n! = n (n–1) (n–2) ........3.2.1
= n { (n–1) (n–2) ........3.2.1.}
n! = n (n–1)! = n (n–1) (n–2 ) !

= n (n–1) (n–2) (n–3) !
n!
n (n–1) ...........(n – r + 1) =
(n  r )!
Some useful results :
0! = 1 4! = 24 8! = 40320
1! = 1 5! = 120 9! = 362880
2! = 2 6! = 720 10! = 3628800
3! = 6 7! = 5040 –n! = Meaningless
2. FUNDAMENTAL PRINCIPLES OF OPERATION
W hen one or more operations can be
accomplished by number of ways then there are
two principles to find the total number of ways to
accomplish one, two, or all of the operations
without counting them as follows :
2.1 Fundamental Principle of Multiplication :
Let there are two parts A and B of an operation
and if these two parts can be performed in
m and n different number of ways respectively,
then that operation can be completed in m × n
ways.
Fundamental Principle of Multiplication
Ex.1 The number of three digit numbers can be
formed without using the digits 0,2,3,4, 5 and
6 is (if repetition of digit is allowed)–
(A) 54 (B) 64
(C) 44 (D) None of these
Sol. We have to determine the total number of
three digit numbers formed by using the digits
1,7,8,9. clearly the repetition of digits is
allowed.
A three digit number has three places viz.
unit’s, ten’s and hundred’s. Unit’s place can
be filled by any of digit 1,7,8,9, so units place
can be filled in 4 ways. Similarly each one of
the ten’s and hundred’s places can be filled
in 4 ways.
 Total number of required numbers
= 4 × 4 × 4 = 64 Ans.[B]
Ex.2 The number of numbers are there between
100 and 1000 in which all the digits are
distinct is –
(A) 648 (B) 548
(C) 448 (D) None of these
Sol. 4 number between 100 and 1000 has three
digits, so we have to form all possible 3-
digit numbers with distinct digits. We cannot
have at the hundred’s place so the hundred’s
place can be filled with any of the digits 1,2,3,
....9. So there are 9 ways of filling the
hundred’s place.
Now 9 digits are left including 0. so ten’s
place can be filled with any of the remaining
9 digits in 9 ways. Now, the unit’s place can
be filled within any of the numbering 8 digits,
so there are 8 ways of filling the unit’s place.
Hence the total number of required numbers
= 9 × 9 × 8 = 648 Ans.[A]
Ex.3 The number of three digit numbers greater
than 600 can be formed by using the digits
2,3,4, 6,7 if repetition of digits is allowed-
(A) 50 (B) 20
(C) 30 (D) None of these
Sol. Since three digit number greaterthan 600 will
have 6 or 7 at hundred’s place. So hundred’s
place can be filled in 2 ways. Each of ten’s
and one’s place can be filled in 5 ways.
Hence total no. of required numbers
= 2 × 5 × 5 = 50 Ans.[A]
2.2 Fundamental Principle of addition :
If there are two operations such that they can be
done independently in m and n ways respectively,
then any one of these two operations can be
done by (m + n) number of ways.
Fundamental Principle of addition
Ex.4 A book seller has 5 books of mathematics,
6 books of physics, and 4 books of chemistry.
A student can purchase any one book of
either mathematics or physics or chemistry
by 5 + 6 + 4 = 15 number of ways but the
same student can purchase one book of
mathematics, physics and chemistry each
by 5 × 6 × 4 = 120 number of ways.
3. COMBINATIONS Ex.6 In how many ways a committee of 5 members
can be selected from 6 men and 5 women,
The different groups or selections of a given
number of things by taking some or all at a time consisting of 3 men and 2 women?
without paying any regard to their order, are (A) 200 (B) 100
called their combinations.
(C) 300 (D) None of these
For example, if three things a, b and c are given
then ab, bc and ac are three different groups, Sol. Three men out of 6 men can be selected in
because ab and ba will give only one group, 6C ways. Two women out of 5 women can
3
similarly bc and cb will give one group and ac be selected in 5C2 ways. Therefore total
and ca will give another group. Thus taking two
things out of three different things a, b and c, the number of ways = 6C3 × 5C2 = 200 ways.
following three groups can be formed : Ans.[A]
ab, bc, ca
The number of combinations of n different things Ex.7 Out of 5 men and 2 women, a committee of
taken r at a time is denoted by 3 is to be formed. In how many ways can it
nC or C (n, r )
r be formed if atleast one woman is to be
n!
nC = included?
r r !(n  r )!
n(n  1)(n  2).....(n  r  1) (A) 20 (B) 30
So nCr = (C) 25 (D) None of these
r!
n
pr Sol. The committee can be formed in the following
Particular cases : nCr =
r! ways:
nC = 1
n
nC = 1 (i) By selecting 2 men and 1 woman
0
(ii) By selecting 1 man and 2 women
Some Important Results :
2 men out of 5 men and 1 woman out of 2
* nCr = nCn–r
women can be chosen in 5C2 × 2C1 ways.
* nCx = nCy  x + y = n
* nCr + nCr–1 = n+1Cr And 1 man out of 5 men and 2 women out
n n–1 of 2 women can be chosen in 5C1 × 2C2
* nCr = . Cr–1
r ways.
1 Total number of ways of forming the committee
* nCr = (n  r  1) nCr–1
r
* nC1= nCn–1 = n = 5C2 × 2C1 + 5C
1 × 2C2 = 20 + 5 = 25
* Greatest value of nCr Ans.[C]
= nC , when n is even
n/2
= nC n
(n–1)/2 or C(n+1)/2 , when n is odd 3.1 Restricted Combinations :
The number of combinations of n different things
Combinations
taking r at a time
Ex.5 In how many ways can a committee of 6
(a) When p particular things are always to be
persons be made out of 10 persons ?
included = n–pCr–p
(A) 210 (B) 300
(C) 151200 (D) None of these (b) When p particular things are always to be
Sol. We have to select 6 persons from 10 given excluded = n–pCr
persons. This can be done in 10C6 ways (c) When p particular things are always included
therefore number of committees.
and q particular things are always excluded
10 ! 10. 9. 8. 7 n–p–qC
= 10C = 10C = = = 210 =
6 4 4! 6! 4. 3. 2.1 r–p
Ans.[A]
 Restricted Combinations Examples Total number of combinations in
based on different cases
Ex.8 In how many ways 11 players can be selected Ex.9 In how many ways can I purchase one or
out of 15 players when more shirts if 6 different shirts are available ?
(a) one particular player is always to be (A) 64 (B) 62
selected. (C) 63 (D) 126
(b) one particular player is never to be Sol. Total number of ways
selected. = 6C1 + 6C2+ 6C3+ 6C4 + 6C5 + 6C6
(A) 364,1365 (B) 1001,364 = 26– 1= 63 Ans. [C]
(C) 3003, 364 (D) 3003,1001
Sol. (a) In this case 10 players are to be selected Ex.10 A bag contains 3 one rupee coins, 4 fifty
out of 14 players and it can be done in paise coins and 5 ten paise coins. How many
14.13.12.11 selections of money can be formed by taking
14C = 14C = = 1001 ways
10 4 1. 2. 3. 4 atleast one coin from the bag ?
(b) In this case 11 players are to be selected out (A) 120 (B) 60
of 14 players and it can be done in (C) 119 (D) 59
14.13.12 Sol. Here are 3 things of first kind, 4 things of
14C = 14C = = 364 ways second kind and 5 things of third kind so the
11 3 1. 2. 3
total number of selections
Ans.[B]
= (3+1) (4+1) (5+1) –1 = 119 Ans.[C]
3.2 Total number of combinations in different
cases : 4. PERMUTATIONS
(a) The number of combinations of n An arrangement of some given things taking some
different things taking some or all (or atleast or all of them, is called a permutation of these
one) at a time = nC1+ nC2 + .....+ nCn things.
= 2n – 1 For Example, three different things a, b and c
are given, then different arrangements which can
(b) The number of ways to select some or all be made by taking two things from the three
out of (p + q + r) things where p are alike of given things are
first kind, q are alike of second kind and r ab, ac, bc, ba, ca, cb
are alike of third kind is = (p +1) (q +1) Therefore, the number of permutations will be 6.
( r +1) – 1
4.1 The number of permutations of n different things
Explanation : Since p things are similar , therefore taken r at a time is nPr, where
these p things may or may not be selected in
n!
(p +1) ways. Similarly q things of second type nP =
r (n  r )!
may or may not be selected in (q +1) ways and
= n ( n–1) (n–2) ..... (n–r + 1)
r things of third type may or may not be selected
The number of permutations of n dissimilar things
in (r +1) ways. Thus the number of ways in which
taken all at a time = nPn = n!
the given objects may or may not be chosen
Explanation : Arrangement of n things at r places
= (p + 1) (q +1) (r + 1)
may be done as follows :
Since this includes one way in which nothing is
First we make arrangement for first place which
chosen. Hence the number of ways of selecting
may be done in n ways. After this, we make
the things is = (p + 1) (q + 1) (r + 1) – 1
arrangement for second place which may be done
(c) The number of ways to select some or all out in (n–1) ways. Continuing this process, we shall
of (p + q + t) things where p are alike of first find the arrangements for third, fourth....rth places
kind, q are alike of second kind and remaining may be done in (n–2), (n–3) ....(n–r +1) ways
t are different is = (p +1) (q +1) 2t – 1 respectively.
 Hence total number of permutations of n things Ex.13 In how many ways can three persons sit on
taking r at a time 6 chairs?
= n (n–1) (n–2) .......(n–r +1) (A) 150 (B) 140
(C)120 (D) 110
.n P 1 = n
Sol. The Required number of ways are
Note : . nP r = n. n–1 Pr–1 6P = 6.5.4 = 120
3 Ans.[C]
. nP r = (n–r+1) .nPr–1
n nP Ex.14 How many different signals can be made by
. Pn = n–1
5 flags from 8 flags of different colours?
Difference between Permutation and Combination :
(A) 6720 (B) 5720
(a) In combinations the order of things has no (C) 4720 (D) None of these
role to play, while in permutations the order Sol. The total number of signals is the number of
of things plays an important role. arrangements of 8 flags by taking 5 flags at
(b) In combinations the different groups are a time.
formed by taking some or all given things, Hence required number of signals
while in case of permutations all possible
8! 8! 8  7  6  5  4  3!
arrangements of things are made in each = 8P5 = = 3! = 3!
(8  5)!
group. Thus the number of permutations is
always greater than the number of = 6720 Ans.[A]
combinations. Ex.15 How many numbers lying between 100 and
Note: In general, we use the methods of finding 1000 can be formed with the digits 1,2,3,4,5,6
combinations in case of forming groups, if the repetition of digits is not allowed?
teams or committees, while the methods of (A) 30 (B) 120
finding permutations are used in forming (C) 50 (D) None of these
numbers with the help of digits, words with Sol. Every number lying between 100 and 1000 is
the help of letters, distribution of prizes etc. a three digits number. Therefore we have to
find the number of permutations of six digits
Permutations 1,2,3,4,5,6 taken three at a time.
8P Hence, the required number of numbers
Ex.11 The value of 3 is -
6  5  4  3!
(A) 336 (B) 56 = 6 P3 = = 120 Ans.[B]
3!
(C) 386 (D) None of these
Sol. 8P = 8.7.6 = 336 Ex.16 How many four digit numbers are there with
3
distinct digits?
With the help of formula
(A) 4536 (B) 4526
8! 8.7.6.5.4.3.21
. (C) 4516 (D) None of these
8P = = = 8.7.6 = 336
3 (8  3 )! 5.4.3.21
. Sol. The total number of arrangements of ten digits
Ans.[A] 0,1,2,3,4,5,6,7,8,9 taking 4 at a time is 10P4.
But these arrangements also include those
Ex.12 The number of numbers which can be number which have 0 at thousand’s place.
formed with the digits 2, 3, 4, 5, 6 by taking Such numbers are not four digit numbers.
4 digits at a time are- When 0 is fixed at thousand’s place, we have
to arrange remaining 9 digits by taking 3 at
(A) 135 (B) 120
a time. The number of such arrangements is
(C) 150 (D) None of these 9P .
3
Sol. The required numbers So, the total number of numbers having 0 at
thousand’s place = 8P3.
5!
= 5 P4 = = 5.4.3.2.1. = 120 Hence, the total numbers four digit numbers
(5  4 )!
= 10P4 – 9P3 = 5040 – 504 = 4536
Ans.[B]
Ans.[A]
4.2 Permutations in which all things are not
different :
The number of permutations of n things taken
all at a time when p of them are alike and of
one kind, q of them are alike and of second
kind, r of them are alike and of third kind and all
remaining being different is
n!
p ! q !r!
Explanation : If all n things were different then total
number of permutations will be n!, but if p things
are similar, then these p things can be mutually
arranged only in one way, Whereas in the case
when they were dif f erent, their mutual
arrangements could be p!. Similarly when q things
and r things were dif ferent, their mutual
arrangements could be q! and r! respectively.
Thus the total number of permutations is obtained
by dividing n! by p! . q! .r!.
Note : Above formula is applicable only when all n
things are taken at a time.
Examples Permutations in which all things
based on are not different
Ex.17 How many different words can be formed with
the letters of the word “ALLAHABAD” ?
(A) 10080 (B) 8640
(C) 15120 (D) 7560
Sol. There are in all 9 letters in the given word.
Out of them there are 4 ‘A’s, 2 ‘L’s and the
remaining 3 are different . So the total
9!
number of permutations = 7560
4 ! 2!
Ans.[D]
Ex.18 How many numbers can be formed with the
digits 2,3,3,4,2,3 taken all at a time.
(A) 460 (B) 60
(C) 260 (D) None of these
Sol. We have to arrange these six digits, out of
which 2 occurs twice, 3 occurs thrice and
rest are distinct.
6!
The number of such arrangement = = 60
2!  3 !
Ans.[B]
4.3 Permutations in which things may be
repeated :
The number of permutations of n different things
taken r at a time when each thing can be used
once, twice, .....upto r times in any permutation
is nr.
In particular, in above case when n things are
taken at a time then total number of permutation
is nn.
Examples Permutations in which things may
based on be repeated
Ex.19 There are 6 pockets in the coat of a person. In
how many ways can he put 4 pens in these
pockets ?
(A) 360 (B) 1296
(C) 4096 (D) None of these
Sol. First pen can be put in 6 ways.
Similarly each of second, third and fourth pen
can be put in 6 ways.
Hence total number of ways
= 6 × 6 × 6 × 6 = 1296 Ans.[B]
Ex.20 In how many ways 3 prizes can be distributed
among 5 students, when-
(a) no student receives more than a prize.
(b) a student can receive any number of prizes.
(c) a student does not get all prizes.
(A) 60,125,120 (B) 125,60,120
(C) 125,120,60 (D) None of these
Sol. (a) Since the first prize can be given to any one
of the student so it can be given in 5 ways.
The second prize can be given in 4 ways and
the third prize can be given in 3 ways as no
student can get more than one prize.
Therefore, number of ways of distributing 3
prizes among 5 boys.
= 5 × 4 × 3 = 60
(b) Since a student can receive any number of
prizes, therefore each prize can be distributed
in 5 ways. Hence the number of ways of
distribution of 3 prizes among 5 students is
= 5 × 5 × 5 = 53 = 125.
(c) Here the number of ways so that a student
can receive all prizes will be 5, therefore if a
student doesn’t receive all prizes, then
number of ways of distributing 3 prizes among
5 students.
= 53 – 5 = 120 Ans.[A]
4.4 Restricted Permutations : If in a permutation,
some particular things are to be placed at some
particular places or some particular things are
always to be included or excluded, then it is
called a restricted permutation. The following
are some of the restricted permutations.
(a) The number of permutations of n dissimilar
things taken r at a time, when m particular things
always occupy definite places = n–m P r–m
(b) The number of permutations of n different
things taken altogether when r particular things
are to be placed at some r given places.
n–r
= Pn–r = (n–r) !
(c) The number of permutations of n different
things taken r at a time, when m particular things
are always to be excluded = n–mPr
(d) The number of permutations of n different
things taken r at a time when m particular things
are always to be included
= n–m Cr–m × r!
Restricted Permutations
Ex.21 How many numbers lying between 1000 and
2000 can be formed with the digits 1, 2, 3, 4,
5 which are divisible by 5.
(A) 3 (B) 6
(C) 12 (D) 18
Sol. The required numbers will contain 4 digits
in which first and last digits will be 1 and 5
respectively. The remaining two places are to
be filled up from the remaining three digits
and it can be done in 3P2 = 6 ways. Hence
the required number = 1 × 6 = 6
Ans.[B]
Ex.22 How many different words beginning with
S and ending with K can be made by using
the letters of the word ‘SIKAR’ ?
(A) 6 (B) 12
(C) 48 (D) 60
Sol. After putting S and K at their respective
places the remaining 3 letters can be
arranged in 3! ways. Therefore required
number of words = 1 × 3! = 6
Ans.[A]
Ex.23 How many different 3 letter words can be
formed with the letters of the word ‘JAIPUR’
when A and I are always to be excluded ?
(A) 12 (B) 24
(C) 48 (D) 60
Sol. After leaving A and I, we are remained with 4
different letters which are to be used for
forming 3- letter words. Hence the required
number = 4P3 = 4.3.2 = 24.
Ans.[B]
4.5 Permutation of numbers when given digits
include zero :
If the given digits include 0, then two or more
digit numbers formed with these digits cannot
have 0 on the extreme left. In such cases we find
the number of permutations in the following two
ways.
(a) (The number of digits which may be used at
the extreme left) x (The number of ways in
which the remaining places may be filled up)
(b) If given digits be n (including 0) then total
number of m- digit numbers formed with them
= nPm - n–1 Pm–1.
because n–1Pm–1 is the number of such numbers
which contain 0 at extreme left.
Examples Permutations of numbers when given
based on digits include zero
Ex.24 How many six digit numbers can be formed
by using the digits 0,1,2,3,4,5 and 6?
(A) 5040 (B) 4320
(C) 720 (4 ) 5760
Sol. First Method : The total numbers by taking any
six digits from the giv en seven digits
= 7P6 = 5040
The six digits numbers containing zero at
first place = 6P5 = 720
 Required Numbers = 5040 - 720 = 4320
Second Method : Here first we make six squares
in a row in the following way
6 6 5 4 3 2
Obviously first square on extreme left can be
filled in 6 ways, since any non zero six digits
1,2,3,4,5,6 can occupy this square .
The remaining squares can be filled in
6 × 5 × 4 × 3 × 2 = 720 no. of ways
 Required Numbers = 6 × 720 = 4320
Ans.[B]
4.6 Circular Permutations
Till now we have calculated the number of linear
permutation in which things are arranged in a
row. Now we shall find the number of permutations
in which things are arranged in a circular shape.
Such permutations are named as circular
permutations. Thus an arrangement of some
given things round a circle is called their circular
permutation.
It should be noted that in a circular permutation
initial and final position of things can not be
specified. Thus all linear permutations of some
given things having the same order of elements
will give the same circular permutation.
For example, there are 6 linear permutations of
three letters A, B and C taken all at a time.
These are ABC, ACB, BAC, BCA, CAB, CBA
A A
C B C B
(Anti- clockwise order) (Clockwise order)
Since the arrangements ABC, BCA, CAB, are in
the same order (clockwise order),
therefore these three linear permutations are
equal to one circular permutation.
From this example, it is clear that from a circular
permutation of three things, there correspond
three linear permutations. Thus, we conclude that
if x be the number of circular permutations of
3 given things then the number of their linear
permutations will be 3x.so
3!
3x = 3!  x = . it is dif ficult to distinguish clockwise and
3
In a similar way it can be seen that if x be the
number of circular permutations of n different
things taking r at a time, then
rx = nPr  x = nPr /r
Thus, we obtain the following results for the
number of circular permutations.
4.6.1 Number of Circular Permutations :
(a) The number of Circular permutations of n
n (C) 2520
Pr
different things taking r at a time r ,
when clockwise and anti-clockwise orders are
treated as different.
(b) The number of circular permutations of n
different things taking altogether
n
Pn
 (n  1)! , when clockwise and anti clockwise
n
orders are treated as different.
(c) The number of Circular permutations of n
different things taking r at a time
n
Pr
2 r , when the above two orders are treated
as same.
(d) The number of circular permutations of n
different things taking altogether
n
Pn 1
 (n  1)! , when above two orders are
2n 2
treated as same.
Note :
(i) In a circular permutation the relative position
among the things is important whereas the place
of a thing has no significance. Thus in a circular
permutation first thing can be placed anywhere.
This operation can be done only in one way, then
relative order begins. Thus the ways for performing
remaining parts of the operation can be calculated
just like the calculation of linear permutation for
example to place 8 different things round a circle,
first we place any one thing at any one place,
there will be only one way to perform this
operation. Then remaining 7 things will
occupy remaining 7 places, for which the numbers
of ways = 7! . Thus required number of circular
permutations is 7!
(ii) In a garland of flowers or a necklace of beads,
anticlockwise orders of things, so a circular
permutation under both these orders is considered
to be the same.
number of Circular Permutations
Ex.25 The number of ways in which 7 persons be
seated at 5 places round a table are-
(A) 252 (B) 504
(D) None of these
Sol. The required number
7
7.6.5.4.3
P5
= = = 504 Ans.[B]
5 5
Ex.26 In how many ways can 5 beads out 7 different Particular case :
beads be strung into a ring ? when p = q = r, then total number of combinations
(A) 504 (B) 2520 are
(C) 252 (D) None of these
3p!
Sol. In this case a clockwise and corresponding
anti clockwise order will give the same
(i)
bg
p!
when groups are differentiable.
3

circular permutation. So the required number 3p!

=
7
P5
=
7.6.5.4.3
= 252 Ans.[C]
(ii)
3 ! p!bg when groups are not differentiable.
3

2.5 2.5
Division into groups
4.6.2 Restricted Circular Permutations : When
there is a restriction in a Circular permutation Ex.28 In how many ways can 15 students
then first of all we shall perform the restricted (i) be divided into 3 groups of 5 each
part of the operation and then perform the (ii) be sent to three different colleges in
remaining part treating it similar to a linear groups of 5 each.
permutation. 15 ! 15! 15 ! 15!
,
(A)
3! 5!
3 ,
bg bg
5!
3 (B)
5!
3
5!
3
bg bg
Restricted Circular Permutations 15 ! 15 ! 15 ! 15 !
, ,
Ex.27 In how many ways can 6 persons be seated
(C)
3! 5! bg bg 3
3 ! 5! 5!
3 (D)
3! 5! bg bg
3 3

round a circular table when two particular Sol. (i) Total number of combinations of 15 students
persons sit together ? 15 !
(A) 120 (B) 240 into 3 groups of 5 each =
3! 5!
3
bg
(C) 48 (D) 24 (ii) In this case the groups are associated with
Sol. First of all let two particular persons be seated different colleges, so the required number
together. They can sit together in 2! = 2 ways. 15!
Then the remaining four persons may sit on
remaining four places in 4 ! = 24 ways, so
=
5!
3
bg
Ans.[A]

the total number of ways Ex.29 In how many way can 52 playing cards be
distributed into 3 groups of 17 cards each
= 2 × 24 = 48 Ans.[C] and one group of one card.
52! 52!
5. DIVISION INTO GROUPS
(a) The number of ways in which (p + q) things
(A)
17 ! bg
3
3!
(B)
17 !
3
bg
can be divided into two groups of p and q 52!
things is (C)
bg
3
17 ! 3 ! 2!
(D) None of these

p + q Cp = p + qC =
bp  qg! Sol. The total number of ways
p! q! q 52! 52!
Particular case : when p = q, then total number 17! 17 ! 17 ! 3 !
=
17 !
3
bg
3!
of combinations are Ans.[A]
2p! Ex.30 3 copies each of 4 different books are
(i)
bg
p!
2 when groups are differentiable. available. The number of ways in which these
can be arranged on the shelf is-
2p! 12!
(ii)
bg when groups are not differentiable.
2! p!
2 (A) 12! (B)
3! 4!
(b) The number of ways in which (p + q + r) (C) 369,600 (D) 369,000
things can be divided into three groups Sol. The total no. of ways to arrange 3 copies
containing p, q and r things is each of 4 different books-
12 !
bp  q  r g! =
( 3 !) 4
= 369,600
p! q! r !
Ans.[C]
Ex.31 The number of ways of dividing 20 persons Ex.34 The number of words by taking 4 letters out
into 10 couples is- of the letters of the word ‘COURTESY’, when
20 ! 20C T and S are always included are-
(A) 10 (B) 10
2 (A) 120 (B) 720
20 !
(C) (D) None of these (C) 360 (D) None of these
(2!) 9
Sol. Here the order of the couples is not important. Sol. Since T and S are to be included in every
20! word, therefore first we choose 2 letters out
So, required number of ways is 10 of the remaining letters which can be done in
2 10 !
Ans. [D] 6C ways. Now each group of letters will give
2
4! words. Therefore number of words
6. PERMUTATIONS IN WHICH THE OPERATION = 6C2 × 4! = 15 × 24 = 360 Ans.[C]
OF SELECTION IS NECESSARY
There are questions of permutation in which we
7. DEARRANGEMENT THEOREM
have to start with the operation of selection for
the given number of things. After this we calculate Any change in the given order of the things is
the number of different arrangements for each of called a Dearrangement .
such selected group.
(a) If n items are arranged in a row, then the
Examples Permutations in which operation of number of ways in which they can be
based on selection is necessary rearranged so that no one of them occupies
Ex.32 How many words can be formed containing 4 the place assigned to it is
consonants and 3 vowels out of 6 consonants
L
M 1 1 1 1 1O
n! P
n
and 5 vowels ? 1     .....( 1)
(A) 6C4 × 5C3 (B) 6C4 × 5C3× 7!
n!
N 1! 2! 3! 4! Q
6
(C) P4 × P35 (D) 6P4 × 5P3× 7! (b) If n things are arranged at n places then
Sol. First we select 4 consonant out of 6 and 3 the number of ways to rearrange exactly r
vowels out of 5. This can be done in 6C4 × things at right places is
5C ways. After such a selection of 7 letters
3 n!L
M 1 1 1 1
1    .... ( 1) nr
1 O
P
then can be arranged in 7! ways. So the
total number of words
r!N 1! 2! 3 ! 4! (n  r )! Q
= 6C4 × 5C3× 7! Ans. [B] Dearrangement Theorem
Ex.33 In how many ways can 7 persons be seated
round two circular tables when 4 persons can Ex.35 There are 3 letters and 3 envelopes. Find the
sit on the first table and 3 can sit on the number of ways in which all letters are put in
other ? the wrong envelopes.
(A) 420 (B) 35
(A) 6 (B) 4
(C) 210 (D) 2520
(C) 2 (D) None of these
Sol. First we divide 7 persons into two groups of
4 and 3 persons. The total number of such Sol. The required number of ways
division
L
M 1 1 1O
1   P
=
7!
4 ! 3!
= 35
= 3!
N 1! 2! 3! Q
3!
Now for such a division of 4 and 3 persons = 3! – 3! + –1
there are 3! x 2! ways of sitting round the 2!
given two tables. Hence total number of  3–1=2 Ans.[C]
required arrangements
= 35 × 12 = 420 Ans.[A]
Ex.36 There are 4 balls of different colour and 4 So, In general
boxes of colours same as those of the balls. 2
Then find the number of ways to place two (x+y+z)2 =   ! 1 2 !3 !
( x )1 ( y ) 2 (z) 3 , where
balls in the boxes with respect to their colour.
1+2+3 = 2 &    1,2,3  w
(A) 6 (B) 4
(C) 2 (D) None of these 8.2 Number of distinct terms :
Sol. The required number of ways Since (x1 + x 2 + x 3 + ..... + xn)r is multiplication
4!L
M 1 1
1 
O
P
of (x1 + x 2 + x 3+......+ x n), r times & will be a
homogeneous expansion of r th degree in
2!N 1! 2! Q x1, x 2,......xn So in each term sum of powers of
L1  1  1 O
= 4.3 M
N 2P
variables must be r
Q= 6 Ans.[A]
So number of distinct terms will be total number
of non-negative integral solution of equation is
8. MULTINOMIAL THEOREM & ITS APPLICATIONS 1 + 2 + 3+......+n= r

8.1 Multinomial Theorem : = Number of ways of distributing r identical

objects among n persons
The expansion of [x1 + x 2 + x 3 + ..... + x n] r
where n & r are integers (0 < r  n) is a r balls (n-1) separators
homogenous expression in x1, x2, x3, ..... xn and
given as below :
[x1 + x2 + x3 + ..... + xn] r
= number of arrangements of r identical balls &
 r!  1  2 3 n n – 1 identical separators.
=   
  !  !  ! .....  !  x1 x 2 x 3 ..... x n
 1 2 3 n 
(where n & r are integers 0  r  n and (n  1  r )!
= = n + r – 1C = n + r – 1C
1, 2, ....., n are non negative integers) (n  1) ! r ! r n–1

Such that 1 + 2 + ..... + n = r

8.3 Coefficient of a particular term :
(valid only if x1, x2, x 3, ..... xn are independent
of each other) Since coefficient of any specific term tells number
of ways in which that particular term can be
coefficient of x 11 x 2 2 x 33 ..... = total number of
obtained in the expansion therefore coefficient of
arrangements of r objects out of which 1 number
x 1 1 x 2 2 x 3 3 ........ x n n
of x1’s are identical 2 number of x2’s are identical
and so on ..... = Number of ways selecting 1 number of x1,
 1   2  3  ..... n  !  r! 2 number of x2.........n number of xn out of
=   !  !  ! .....  !  =  !  !  ! .....  !
 1 2 3 n  1 2 3 n r factors.

= total number of permutation of 1 number of

eg. In the expansion of
identical x1, 2 number of identical x 2, 3
(x+y+z)2 = x2 + y2 + z2 + 2xy + 2yz + 2zx
number of identical x 3,......,n number of
2 2 2 identical xn.
= 0 0 2 x2y0z0+ 0 2 0 x0y2z0+ 0 0 2 x0y0z2
(1   2 ......   n )! r!
 1!  2 !  3 !
= 1!  2 !  3 !
2 2 2
+ 1 1 0 x1y1z0+ 0 1 1 x0y1z1+ 1 0 1 x1y0z1 Coefficient of x 11 x 2 2 x 33 ........ x n n

r!
= 1!  2 !  3 !
8.4 Application of multinomial theorem  Required number of ways = coeff of xn in
If we want to distribute n identical objects in r (x0 + x1 + x2 +...... x6)(x0 + x 1 + x 2 +......x7)
different groups under the condition that empty (x0 + x1 + x2+.....x8)
groups are not allowed. a1 + a2 + a3 +.....+ ar=n = coeff of x 10 in
Boundary conditions are 1  a1, a2......ar  n  1(1  x 7 )  1(1  x 8 )  1(1  x 9 ) 
   
(As each box contains at least one object)  1  x   1  x   1  x 
Number of ways = coeff of x 10 in
= coefficient of x n in (x 1 + x 2 +......+x n)r [(1 – x7)(1 – x8)(1 – x9)] [ 1 – x]–3
= coeff of x 10 in
= coefficient of xn–r in (1 + x + x2 +.....+xn–1)r
(n – r) + r – 1C n–1C (1 – x 7 – x 8 – x 9......)(1 + 3C1x + 4C2x 2
= r–1 = r–1 + 5C3x 3 + ......12C10x10 +.....)
{Note that powers >10 are unimportant and
Ex.37 Find the number of ways in which 16 identical hence ignored}
toys are to be distributed among 3 children = 12C10 – 5C3 – 4C2 – 3C1 = 66 – 10 – 6 – 3 – = 47
such that each child does not receive less
than 3 toys. Ex.40 In how many ways 5 identical balls can be
distributed into 3 different boxes so that no
Sol. Let x1, x2, x3 be the number of toys received
box remains empty?
by the three children
Sol. The required number of ways = 5-1C3–1
Then, x1, x2, x3,  3 and x1, x2, x3 = 16
Let u1 = x1– 3, u2 = x2 – 3 and u3 = x3 – 3 4.3
=4C2 = = 6
1 .2
Then, u1, u2, u3  0 and u1+ u2 + u3 = 7
Here, n = 7 and r = 3 Ex.41 Find the number of permutation of 4 letters
 Number of ways = n+r–1C = 9C2= 36 taken from the word EXAMINATION.
r–1
Sol. Number of permutations are :
Ex.38 Find the number of non-negative integral (AA), (I I), (NN), E, X, M, T, O
solutions of x1+ x2+ x3 + 4x4 = 20. 3 5
Sol. Here, clearly 0  x4  5, x1, x2, x3,  0
 x x 2   x
= Coefficient of x4 in 4! 1   
1  
and x1 + x2 + x 3 = 20 – 4x 4  1! 2!   1! 
 r = 3 and n = 20 – 4x1 3
 x 2 
If x4 = 0 number of ways 20+3 – 1C = 22C
= Coefficient of in 4!  1  x 
x4 1 x 5
3–1 2
 2 ! 
If x4 = 1 number of ways 16+3 – 1C
= 18C
3–1 2
= Coefficient of x4 in 4!
Similarly, if x 4 = 2, 3, 4, 5, number of ways
= 14C2, 10C2, 6C2, 2C2 respectively  x6 3 3 
3
 Total number of ways (1  x )   (1  x )2 x 2  x 4 (1  x ) .1 x 5
 8 2 4 
= 22C + 18C + 14C + 10C + 6C2 + 2C2 = 536
2 2 2 2
= Coefficient of x4 in 4!
Ex.39 In how many ways can 10 identical toys be
distributed among 3 children such that the
 8 x6 3 3 
 (1  x )  (1  x )5  x 2 (1  x 7 )  x 4 (1  x )6 
first receives a maximum of 6 toys, the  8 2 4 
second receives a maximum of 7 toys and
 3 3
the third receives a maximum of 8 toys. = 4!  8 C 4  0  7 C2  
 2 4
Sol. Let x1, x2 and x3 be the number of toys
received by the three children.  8.7.6.5 3 7.6 34 
= 24     
Then,  1.2.3.4 2 1.2 3 
x1+x 2+x 3=10, 0  x 1  6, = 8.7.6.5 + 6 (3.7.6) + 6.3
= 1680 + 756 + 18 = 2454
0  x 2  7, 0  x3  8
9. DIVISIBILITY OF NUMBERS (b) Sum of the total numbers which can be formed
with given n different digits a1, a2, a3 .....an is
The following chart shows the conditions of (a1 + a2 + a3 + ....+ an)(n–1)!.(111 ...n ties)
divisibility of numbers by 2,3,4,5,6,8,9,25
Ex.42 The sum of all numbers which can be formed
Divisible by Condition
with digits 1,2 and 3 is-
(A) 716 (B) 1432
2 whose last digit is even (C) 2148 (D) None of these
(2, 4, 6, 8, 0) Sol. The sum of the digits = 1 + 2 + 3 = 6 and
n = 3, so the sum of all numbers formed
3 sum of whose digits is divis
= 6 . 2! (111)
ible by 3
= 12 × 111 = 1432 Ans.[B]
4 whose last two digits number
is divisible by 4 11. SOME IMPORTANT RESULTS ABOUT POINTS

5 whose last digit is either 0 or 5 If there are n points in a plane of which m (< n)
are collinear, then
6 which is divisible by both 2 and 3
(a) Total number of different straight lines
8 whose last three digits number obtained by joining these n points is
is divisible by 8 nC – mC + 1
2 2
9 sum of whose digits is divis (b) Total number of different triangles formed by
ible by 9 joining these n points is
nC – mC
25 whose last two digits are 3 3
(c) Number of diagonals in polygon of n sides is
divisible by 25
nC
n (n  3 )
2 – n i.e.
10. SUM OF NUMBERS 2
(d) If m parallel lines in a plane are intersected
(a) For given n different digits a1, a2, a3 ......,an by a family of other n parallel lines. Then
the sum of the digits in the unit place of all total number of parallelograms so formed is
numbers formed (if numbers are not repeated) is
mC
mn (m  1) (n  1)
(a1+ a2 + a3 + ......+ an) (n-1)! 2 × nC2 i.e.
4
i.e. (sum of the digits) (n-1)!
 SOLVED EXAMPLES
1 1 x Ex.5 How many different words beginning with
Ex.1 If + = , then the value of x is - A and ending with L can be formed by using
9! 10 ! 11!
(A) 123 (B) 125 the letters of the word’ ANILMANGAL’?
(A) 10080 (B) 40320
(C) 121 (D) None of these
(C) 20160 (D) None of these
1 1 x 1 1 x
Sol.  =  + = Sol. After fixing the letters A and L in the first and
9 ! 10 ! 11! 9! 10 . 9 ! 11 . 10 . 9 ! last places, the total number of available
1 L 1 OF x I 1 1 x places are 8 and the letters are also 8. Out
M
N P QG
H JK
 9! 1  10 = 11 . 10 .9 !  1  10 = 11.10 of these 8 letters there are 2 groups of alike
letters.
11 x
 10 = 11.10  x = 11 . 11 = 121 8!
Therefore no. of words = =10080
Ans.[C] 2! 2!
Ans.[A]
Ex.2 The number of different words (meaningful or
Ex.6 How many numbers can be formed between
meaningless) can be formed by taking four
20000 and 30000 by using digits 2, 3, 5, 6,
different letters from English alphabets is- 9 when digits may be repeated?
(A) (26)4 (B) 358800 (A) 125 (B) 24
(C) (25)4 (D) 15600 (C) 625 (D) 1250
Sol. The first letter of four letter word can be Sol. First digit between 20000 and 30000 will be
chosen by 26 ways, second by 25 ways, 2 which can be chosen by one way. Every
third by 24 ways and fourth by 23 ways. So number will be of five digits and all the digits
number of four letter words can be anything from the given five digit
except first digit. So each digit of the
= 26 × 25 × 24 × 23 = 358800
remaining four digits can be chosen in 5
Ans.[B] ways

Ex.3 If 56P r +6 : 54 P  required numbers = 1 × 5 × 5 × 5 × 5 = 625

r +3= 30800 : 1 then the
Ans. [C]
value of r is -
(A) 14 (B) 41 (C) 51 (D) 10
Ex.7 The number of three letters words can be
56
Pr  6 30800 formed from the letters of word ‘SACHIN’
Sol. 
54
Pr  3 1 when I do not come in any word is-
(A) 120 (B) 60 (C) 24 (D) 48
56 ! (30800) x 54 !
 (56  r  6) ! = (54  r  3) ! Sol. There are 6 letters in the given word. Then
the number of three letters words from the
 56 × 55 × (51–r) = 30800 remaining 5 letters after removing I is -
30800 = 5P3 = 5 × 4 × 3 = 60
 (51–r) = 56 x 55 = 10 Ans.[B]
 r = 51 – 10 = 41 Ans. [B]
Ex.8 The number of numbers lying between 100
Ex.4 The number of ways in which 2 vacancies and 1000 which can be formed with the digits
can be filled up by 13 candidates is- 0, 1, 2, 3, 4, 5, 6 is-
(A) 180 (B) 216
(A) 25 (B) 78 (C) 156 (D) 169
(C) 200 (D) None of these
Sol. The no. of ways to fill up 2 vacancies by 13
Sol. Required numbers will have 3 digits so their
candidates is-
total number = 7P3 - 6P2 = 180
13P = 13 × 12 = 156 Ans.[C]
2 Ans.[A]
Ex.9 How many numbers between 1000 and 4000 Sol. The given expression can be written as
(including 4000) can be formed with the digits 5

0,1,2,3,4 if each digit can be repeated any  52r C 3 + 47C4

r 1
number of times? = 51C3 + 50C3 + 49C3 + 48C3 + 47C3 + 47C4
(A) 125 (B) 275 (C) 375 (D) 500 [We know that n+1Cr+1 = nCr + nCr+1]
Sol. Required number will have 4 digits and their = 51C3 + 50C3 + 49C3 + 48C3 + 48C4
thousand digit will be 1 or 2 or 3 or 4. The = 51C3 + 50C3 + 49C3 + 49C4
number of such numbers will be 124, 125, = 51C3 + 50C3 + 50C4
125 and 1 respectively. = 51C3 + 51C4 = 52C4 Ans.[B]

 Total numbers = 124 + 125 + 125 + 1 = 375 Ex.13 A candidate is required to answer 6 out of 10
Ans. [C] questions which are divided into two groups
each containing 5 questions and he is not
Ex.10 The number of ways in which 7 girls can be permitted to attempt more than 4 from each
stand in a circle so that they do not have the group. The number of ways in which he can
same neighbour in any two arrangements? make up his choice is-
(A) 100 (B) 200 (C) 300 (D) 400
(A) 720 (B) 380
Sol. Let there be two groups A and B each
(C) 360 (D) None of these
containing 5 questions. Questions to be
Sol. Seven girls can keep stand in a circle by attempted is 6, but not more than 4 from any
(7  1) ! group. The candidate can select the questions
number of ways, because there is in following ways:
2!
no difference in anticlockwise and clockwise (i) 4 from group A and 2 from group B.
order of their standing in a circle. (ii) 3 from group A and 3 from group B.
(7  1) ! (iii) 2 from group A and 4 from group B
 = 360 Ans.[C] The number of selections in the above cases
2!
are 5 C 4 × 5 C 2 , 5 C 3 × 5 C 3 , 5 C 2 × 5 C 4
Ex.11 The number of ways in which 7 men and 7 respectively.
women can sit on a circular table so that no  Number of ways of selecting 6 questions
two women sit together is = 5C4 × 5C2+ 5C3× 5C3+ 5C2 × 5C4
(A) 7! . 7! (B) 7! . 6! = 50 + 100 + 50 = 200 Ans.[B]
(C) (6!)2 (D) 7! Ex.14 In how many ways can a committee
Sol. Here one women will sit between two men. consisting of one or more members be formed
Now fixing the place of one man the remaining out of 12 members of the Municipal
6 men on the circular table can sit in 6! Corporation-
ways. Since there are seven places between (A) 4095 (B) 5095 (C) 4905 (D) 4090
7 men. Therefore seven women can sit on Sol. Required number of ways
these places in 7! ways. = 12C1 + 12C2+ 12C3 +.....+ 12C12 = 212 –1
= 4096 – 1 = 4095 Ans. [A]
Thus 7 men and 7 women under the given
condition can sit in 7! . 6! ways. Ex.15 Out of 10 white, 9 black and 7 red balls, the
Ans.[B] number of ways in which selection of one or
more balls can be made, is-
5
(A) 881 (B) 891 (C) 879 (D) 892
Ex.12 47C
4 +  52r C 3 is equal to - Sol. The required number of ways are
r 1

(A) 51C (B) 52C4 (10 + 1) (9 + 1) (7+ 1) – 1

4
(C) 53C (D) None of these = 11 × 10 × 8 –1 = 879
4
Ans. [C]
Ex.16 The number of words which can be formed Ex.20 The number of diagonals in an octagon are -
taking 4 different letters out of the letters of (A) 28 (B) 48
the word ‘ASSASSINATION’, is- (C) 20 (D) None of these
(A) 13C4 . 4! (B) 6C4 . 4! Sol. Here n = 8 (given)
13
(C) P4 / 2! (D) None of these The number of diagonals are given by
Sol. Total No. of selections of 4 different letters = 6C4 n (n  3 )
=
 Total no. of different words = 6C4 . 4! 2
Ans.[B] 8 (8  3) 8. 5
 = = 20 Ans.[C]
2 2
Ex.17 There are four balls of different colours and
four boxes of colours same as those of the Ex.21 To f ill up 12 v acancies, there are 25
balls. The number of ways in which the balls, candidates of which 5 are from SC. If 3 of
one each box, could be placed such that a these vacancies are reserv ed f or SC
ball does not go to box of its own colour is- candidates while the remaining are open to
all; then the number of ways in which the
(A) 8 (B) 7 selection can be made is-
(C) 9 (D) None of these
(A) 5C3 × 15C9 (B) 5C3 × 22C9
Sol. Number of derangements are (C) 5C3 × 20C9 (D) None of these
R
S1 1

1U
 V
Sol. 3 vacancies for SC candidates can be filled
= 4!
T2! 3! 4! W = 12 – 4 + 1 = 9 up from 5 candidates in 5C3 ways.
After this for remaining 12 – 3 = 9 vacancies,
{Since number of derangements in such a
there will be 25 – 3 = 22 candidates. These
problems is given by n! vacancies can be filled up in 22C9 ways.
Hence required number of ways = 5C3 × 22C9
R
S 1 1 1
1  
1
 ...( 1)
1U
V n Ans.[B]
T 1! 2! 3! 4! n! W
Ex.22 Out of 10 given points 6 are in a straight line.
Ans.[C] The number of the triangles formed by joining
any three of them is-
Ex.18 The number of 4 digit numbers divisible by 5
(A) 100 (B) 150
which can be formed by using the digits 0,
(C) 120 (D) None of these
2, 3, 4, 5 is-
Sol. A triangle can be formed by joining three
(A) 36 (B) 42 points, so there will be 10C3 triangles joining
(C) 48 (D) None of these any three out of 10 points. But 6 of these 10
Sol. For a number to be divisible by 5, unit place points are collinear so these 6 points will
should be occupied by 0 or 5- give no triangle. Hence the required number
(i) If unit place is 0 then remaining 3 places of triangles =10C3 – 6C3
can be filled by 4P3 ways = 24 = 120 – 20 = 100
Ans.[A]
(ii) If unit place is 5 then no. of ways
= 4! – 3! = 18 Ex.23 The number of ways in which 5 biscuits can
be distributed among two children is-
 Total number of ways
= 24 + 18 = 42 Ans.[B] (A) 32 (B) 31
(C) 30 (D) None of these
Ex.19 The sum of all 5 digit numbers which can be Sol. Each biscuit can be distributed in 2 ways.
formed using digits 1, 2, 3, 4, 5 is- Therefore number of ways of distributing
the biscuits
(A) 6666666 (B) 6600000
= 25 = 32
(C) 3999960 (D) None of these
Now number of ways in which either of the
Sol. Using formula (Here n = 5) two children does not get any biscuit = 2.
Sum = (1+ 2 + 3 + 4 + 5) 4! (11111)  Required number of ways of distribution
= 15 × 24 × 11111 = 3999960 = 32 – 2 = 30
Ans.[C] Ans.[C]
Ex.24 How many five-letter words containing 3 Ex.27 How many numbers can be formed with the
vowels and 2 consonants can be formed using digits 0,1,2, 3,4,5 which are greater than
the letters of the word ”EQUATION’ so that 3000?
the two consonants occur together?
(A) 180 (B) 360
(A) 1380 (B) 1420
(C) 1380 (D) 1500
(C) 1440 (D) none
Sol. There are 5 vowels and 3 consonants in the Sol. The numbers greater than 3000 may contain
word ‘EQUATION’. Three vowels out of 5 and 4,5 or 6 digits. Now the 6 digit numbers can
2 consonants out of 3 can be chosen in be formed by using all 6 given digits which
5C × 3C ways. So, there are 5C × 3C will be 6P6. These numbers include the
3 2 3 2
groups each containing two consonants and numbers which starts with 0. Such type of
three vowels. Now, each group contains 5 numbers are 5P5.
letters which are to be arranged in such a
Therefore 6 digit numbers greater than 3000
way that 2 consonants occur together.
Considering 2 consonants as one letter, we = 6P6 – 5P5 = 600
have 4 letters which can be arranged in 4! Similarly 5 digit numbers greater than 3000
ways. But two consonants can be put = 6P5 – 5P4 = 600
together in 2! ways. Therefore, 5 letters in
each group can be arranged in 4! × 2! ways. Now 4 digit numbers which are greater than
3000 should begin with the digit 3,4 or 5. If
Hence, the required number of words =
the first place of the number is occupied by
(5C3 × 3C2) × 4! × 2! = 1440 Ans.[C] the digit 3, 4 or 5, then the remaining three
places of the number can be filled in 5P3 =
Ex.25 Find the total number of proper factors of
60 ways.
7875.
Therefore numbers of 4 digits greater than
(A) 20 (B) 22
3000 = 3 x 60 = 180
(C) 24 (D) None of these
Hence required numbers = 600 + 600 + 180 = 1380
Sol. We have : 7875 = 32 × 53 × 71
Ans.[C]
The total number of ways of selecting some
or all out of two 3’s, three 5’s and one 7’s is Ex.28 In how many ways the letters AAAAA, BBB,
(2+1) (3+1) (1+1) – 1 = 23 CCC, D, EE, F can be arranged in a row
when the letter C occur at different places?
But this includes the given number itself.
Therefore, the required number of proper 12! 12!
(A) 13
(B) x13P3
factors is 22. Ans.[B] 5 ! 3 ! 2!  C 3 5 ! 3 ! 2!
13 !
(C) (D) None of these
Ex.26 The number of different seven digit numbers 5 ! 3 ! 2! 3 !
that can be written using only the three digits Sol. After removing three C from the given letters,
1,2 and 3 with the condition that the digit 2 we get 12 letters which can be arranged in
occurs twice in each number is-
12!
(A) 7P2 .25 (B) 7C2 .25 a row in ways.
5 ! 3 ! 2!
(C) 7C2 . 52 (D) None of these
Sol. Choose any two of the seven digits (in the Now there are 13 places where we can write
seven digit number) . This may be done in C.This can be done in 13C3 ways.
7C ways. Put 2 in these two digits. The Hence required no. of ways
2
remaining 5 digits may be arranged using 1
and 3 in 25 ways. So, required number of 12!
=  13 C 3 . Ans.[A]
numbers = 7C2 × 25. Ans.[B] 5 ! 3 ! 2!
Ex.29 In the given figure of squares, 6 A’s should Sol. Here we have to fill 4 places. The first place
be written in such a manner that every row can be filled in 7 ways as any one of 7
contains at least one’A’ , it is possible in capital letters can be written at this place.
number of ways is- Now the remaining three places are to be
filled in with the help of 3 vowels and 5
(A) 24 (B) 25
consonants so that at least one vowel is
(C) 26 (D) 27 always included. The no. of ways = 8P3 – 5P3
Sol. There are 8 squares and 6 ‘A’ in given figure. Therefore required no. of words = 7(8P3– 5P3)
First we can put 6 ‘A’ in these 8 squares by = 7 (336-60) = 7 x 276 = 1932
8C number of ways. Ans. [C]
6

Ex. 31 If the letters of the word ‘RACHIT’ are

(I) (II)
According to question, atleast one’A’ should
be included in each row. So after subtracting
these two cases, number of ways are
= (8C6 – 2) = 28 – 2 = 26 Ans.[C]
Ex.30 How many words can be formed taking
4 letters from the given 7 capital, 3 vowels
and 5 consonants so that each word starts
with a capital and contains atleast one vowel?
(A) 276 (B) 322
(C) 1932 (D) None of these
arranged in all possible ways and these words
are written out as in a dictionary, then the
rank of this word is-
(A) 365 (B) 702
(C) 481 (D) None of these
Sol. The number of words beginning with A (i.e. in
which A comes in first place) is 5P5 = 5!.
Similarly number of words beginning with C
is 5!, beginning with H is 5! and beginning
with I is also 5!.
Now letters of R, four letters A, C, H, I can
occur in 4 (5!) = 480 ways. Now word
‘RACHIT’ happens to be the first word
beginning with R. Therefore the rank of this
word = 480 + 1 = 481. Ans.[C]