654 Arithmetic

Chapter-34

Permutation and Combination

Introduction 1 1 x
or, 9! 109! 11 10 9!
In this section, we shall introduce the term and
notation of factorial which will be often used in 1 1 x 1
this chapter. or, 1
9! 10 11 10 9!
Factorial 1 x
or, 1
The continued product of first n natural numbers 10 11 10
is called the n factorial and is denoted by n! or 11 x
or,
n 10 11 10
ie n! = 1 2 3 4 5 ... (n 1) n. x = 11 11 = 121
Thus, 3! = 1 2 3 = 6 Ex. 3: Find the value of n, if
4! = 1 2 3 4 = 24 (i) (n + 2)! = 2550 n!
5! = 1 2 3 4 5 = 120 (ii) (n + 1)! = 12 (n 1)!
6! = 1 2 3 4 5 6 = 720 etc. Soln: (i) (n + 2)! = 2550 n!
Clearly, n! is defined for positive integers only. or, (n + 2) (n + 1) n! = 2550 n!
or, (n + 2) (n + 1) = 2550

K KUNDAN
Zero Factorial or, n2 + 3n 2548 = 0
As we will require zero factorial in the later sections or, (n + 52) (n 49) = 0
of this chapter and it does not make any sense to or, n = 49 [ n 0]
define it as the product of the integers from 1 to (ii) (n + 1)! = 12 (n 1)!
zero. So, we define 0! = 1. or, (n + 1) n (n 1)! = 12 (n 1)!
or, n(n + 1) = 12
Factorials of proper fractions or negative or, n2 + n 12 = 0
integers are not defined. or, (n + 4) (n 3) = 0
Factor ial n is defined only for whole or, n = 3 [ n 0]
numbers. n! n!
Ex. 4: If 2! (n 2)! and 4 ! (n 4 )! are i n t he
Property of Factorial n!
ratio of 2 : 1, find the value of n.
We know that n! = 1 2 3 4 ... (n 1) n
= [1 2 3 4 ... (n 1) n n! n!
= n[(n 1)!] Soln: We have 2! (n 2)! : 4! (n 4)! = 2 : 1
Thus n! = n[(n 1)!]
n! 4! (n 4)! 2
For example, 8! = 8(7!), 6! = 6(5!), 4! = 4(3!) etc. or, 2! (n 2)!
The following examples will illustrate the use n! 1
of this property of factorial n. 4! (n 4)! 2
Ex. 1: Find the LCM of 4!, 5! and 6!. or, 2! (n 2) (n 3) (n 4)! 1
Soln: We have 5! = 5 4!
6! = 6 5 4!
4 3 2! 2
LCM of 4!, 5!, 6! or, 2! (n 2) (n 3) 1
= LCM of [4!, 5 4!, 5 6 4!]
= (4!) 5 6 = 6! = 720 or, (n 2) (n 3) = 6
1 1 x or, n2 5n = 0
Ex. 2: If , find the value of x. or, n(n 5) = 0
9 ! 10 ! 11!
or, n = 0, 5
1 1 x But for n = 0, (n 2)! and (n 4)! are not
Soln:
9! 10! 11! meaningful. So n = 5
Permutation and Combination 655

Ex. 5: Prove that (n! + 1) is not divisible by any 25 33 < 26

natural number between 2 and n. s = 5
Soln: Let m be divisible by k and r be any natural So, E2 (33!)
number between 1 and k. If (m + r ) is
divided by k, t hen we obtain r as the 33 33 33 33 33
=
remainder. 2 22 23 24 25
Since n! = 1 2 3 4 ... (n 1) n, = 16 + 8 + 4 + 2 + 1 = 31
it follows that n! is divisible by ev ery Hence, the exponent of 2 in 33! is 31 ie
natural number bet ween 2 and n. So 33! is divisible by 231. But 231 is divisible
(n! + 1), when divided by any nat ural by 215 also. Hence, 33! is divisible by 215
number between 2 and n, leaves 1 as the and the largest integer n such that 33! is
remainder. Hence (n! + 1) is not divisible divisible by 2n is 31.
by any natural number between 2 and n. Ex. 8: Find the exponent of 15 in 100!
Soln: We have 15 = 3 5
Exponent of Prime p in n!
[On prime factorizing 15, we get 3 5]
Let p be a prime number and n be a positive integer, Now, E3(100!) = 48 [See Ex. 6]
n 100 100
then denotes the greatest integer less than E5(100!) =
p 5 52
[ 52 < 100 < 53 s = 2]
n = 20 + 4 = 24
or equal to p
Exponent of 15 in 100!
= min(24, 48) = 24
10 12 15 Ex. 9: Find the exponent of 6 in 33!
For example, = 3, = 2, = 5 etc.
3 5 3 Soln: We have 6 = 2 3
Let Ep(n) denote the exponent of the prime p in E2(33!) = 31 [See Ex. 7]
the positive integer n. Then, 33 33 33

K KUNDAN
E3(33!) =
n n n 3 32 33
Ep(n!) = p 2 ... s ; [ 33 < 33 < 34 s = 3]
p
p
= 11 + 3 + 1 = 15
Where s is the largest positive integer such that Hence, exponent of 6 in 33!
ps n ps + 1. = min(15, 31) = 15
The following examples will illustrate the above. Ex. 10: Find the number of zeros at the end
Ex. 6: Find the exponent of 3 in 100!. 100!?
Soln: Let Ep(n) denote the exponent of p in n. Soln: In t erms of pr ime f act or s 100 can be
written as 2a 3b 5c 7d ...
n n n
Then, Ep(n!) = p 2 ... s ; Now, E2(100!)
p p
100 100 100 100
Where s is the largest positive integer =
such that ps n ps + 1 2 22 23 24
Here, n = 100, p = 3 and
34 < 100 < 35 s = 4 100 100
5 6
2 2
100 100 100 100
So, E3(100!) = [ 26 < 100 < 27]
3 32 33 3 4
= 50 + 25 + 12 + 6 + 3 + 1 = 97
= 33 + 11 + 3 + 1 = 48
Ex. 7: Prove that 33! is divisible by 215. What 100 100
[ 52 < 100 < 53]
5 52
is the largest integer n such that 33! is E5(100!) =
divisible by 2n? = 20 + 4 = 24
Soln: Let Ep(n) denote the exponent of prime p Therefore,
in n. 100! = 297 3b 524 7d ...
Then, we know that = 273 (2 5)24 3b 7d ...
n n n n = 1024 273 3b 7d ...
Ep(n!) = p 2 3 ... s ; Thus, the number of zeros at the end of
p p p 100! is 24.
Where s is the largest integer such that
ps n ps + 1
Here, n = 33, p = 2
656
Fundamental Principles of Counting
In this section we shall discuss two fundamental
principles viz. principle of addition and principle
of multiplication. These t wo pr inciples will
enable us to under st and per mut ation and
combination. In fact these two principles form the
basis of permutation and combination.
Fundamental Principle of Multiplication: If
there are two jobs such that one of them can be
completed in m ways, and when it has been
completed in any one of these m ways, second job
can be completed in n ways; then the two jobs in
succession can be completed in m n ways.
Ex. 11: In a class there are 10 boys and 8 girls.
The teacher wants to select a boy and
a gi r l t o repr esent t he cl ass in a
function. In how many ways can the
teacher make this selection?
Soln: Here the teacher is to perform two jobs:
(i) selecting a boy among 10 boys, and
(ii) selecting a girl among 8 girls.
The first of these can be performed in
10 ways and t he second in 8 ways.
Therefore by the fundamental principle
of multiplication, the required number of
ways is 10 8 = 80
In general, the above principle can be
extended for any finite number of jobs as
K KUNDAN
stated below:
If there are n jobs J1, J2, ..., Jn such that
job Ji can be performed independently in mi
ways; where i = 1, 2, 3, ..., n. Then the total
number of ways in which all the jobs can be
performed is m1 m2 m3 ... mn.
Fundamental Principle of Addition: If there
are two jobs such that they can be performed
independently in m and n ways, then either of the
two jobs can be performed in (m + n) ways.
Ex. 12: In a class there are 10 boys and 8 girls.
The teacher wants to select either a
boy or a girl to represent the class in a
function. In how many ways the teacher
can make this selection?
Soln: Here the teacher is to perform either of
the following two jobs:
(i) selecting a boy among 10 boys, or
(ii) selecting a girl among 8 girls
The first of these can be performed in
10 ways and t he second in 8 ways.
Therefore, by fundamental principle of
addition, either of the two jobs can be
performed in (10 + 8 =) 18 ways. Hence,
the teacher can make the select ion of
either a boy or a girl in 18 ways.
Ex. 13: How many different signals can be given
using any number of flags from 5 flags
of different colours?
Soln: The signals can be made by using at a time
one or two or three or four or five flags.
Arithmetic
The total number of signals when r
flags are used at a time from 5 flags is
equal to the number of arrangements of 5,
taking r at a time ie 5Pr. Since r can take
v alues 1, 2, 3, 4, 5. Hence by t he
fundamental principle of addition, the total
number of signals
= 5P1 + 5P2 + 5P3 + 5P4 + 5P5
5! 5! 5! 5! 5!
= (5 1)! (5 2)! (5 3)! (5 4)! (5 5 )!
5! 5! 5! 5! 5!
=
4! 3! 2! 1! 0!
= 5 + (5 4) + (5 4 3) + (5 4 3 2)
+ (5 4 3 2 1)
= 5 + 20 + 60 + 120 + 120 = 325
Difference Between the Two Principles: As
we have discussed in the pr inciple of
multiplication a job is divided or decomposed into
a number of sub-jobs which are connected to each
other and the job is said to be performed if each
sub-job is performed.
While in the principle of addition, there are a
number of independent jobs and we have to perform
one of them. So, the t otal number of ways of
completing any one of the sub-jobs is the sum of
the number of ways of completing each sub-job.
Ex. 14: There are 3 candidates for a classical,
5 for a Mat hemat i cal , and 4 for a
Natural science scholarship.
(i) I n how m any ways can t hese
scholarships be awarded?
(ii) I n how m any ways one of t hese
scholarships be awarded?
Soln: Clear ly, classical scholarship can be
awar ded t o, any one of t he t hree
candidat es. So, t here are 3 ways of
awarding the classical scholarship.
Similarly, Mathematical and Natural
Science scholarships can be awarded in
5 and 4 ways respectively.
So,
(i) Number of ways of awar ding three
scholarships = 3 5 4 = 60
[By Fundamental Principle
of Multiplication]
And
(ii) Number of ways of awarding one of the
three scholarships = 3 + 5 + 4 = 12
[By Fundamental Principle
of Addition]
Permutations
A per mut ation is an arr angement in a
definite order of a number of objects taken some or
all at a time. Consider the following examples.
Permutation and Combination
Ex. 15: Write down all the permutations of the
set of three letters A, B, C.
Soln: The permutations of three letters A, B, C
taking all at a time are:
ABC, ACB, BCA, BAC, CBA, CAB
Clearly, there are 6 permutations.
Ex. 16: Write down all the permutations of the
v owels A, E, I , O and U i n Engl ish
alphabet taking three at a time and
starting with A.
Soln: The permutations of vowels A, E, I, O, U
taking three at a time and starting with A
are:
AEI, AIE, AEO, AOE, AEU, AUE, AIO, AIU,
AUI, AOU, AUO
Clearly, there are 12 permutations.
Number of permutations of n distinct things
taken r at a time: If n and r are positive integers
such t hat 1 r n, t hen t he number of all
permutations of n distinct things, taken r at a time
is denoted by P(n, r) or nPr and and it is equal to
n!
(n r )!
n!
Thus, nPr or P(n, r) = (n r )! = Total number of
permutations of n distinct things taken r at a time.
K KUNDAN
From the above we can have, the number of
all permutations n of distinct things, taken all
at a time is n!.
Now, consider the following examples.
Ex. 17: In how many ways three different rings
can be worn in four fingers with at
most one in each finger?
Soln: The total number of ways is same as the
number of arrangements of 4 finger s,
taken 3 at a time. So, required number of
ways
4! 4!
= 4P3 = (4 3)! 1! = 4!
= 4 3 2 1 = 24
Alternative Method:
Let R1, R2, R3 be three rings. Since R1 can
be put in any one of the four fingers. So,
there are four ways in which R 1 can be
worn. Now, R2 can be worn in any one of
the remaining three fingers in 3 ways. In
the remaining 2 fingers ring R 3 can be
worn in 2 ways. So, by the fundamental
principle of counting the total number of
ways in which three different rings can
be worn in four fingers = 4 3 2 = 24.
Ex. 18: Seven athletes are participating in a
race. In how many ways can the first
three prizes be won?
Soln: The total no. of ways in which first three
pr izes can be won is t he number of
arrangements of seven different things
657
taken 3 at a time.
So, required number of ways
7! 7! 7 6 5 4!
= 7P3 = (7 3)! 4! = 210
4!
Alternative Method: First prize can be
won in seven ways. Second prize can be
won by any one of t he r emaining six
athletes in 6 ways. Now, five athletes are
left. So, third prize can be won by any
one of the remaining 5 athletes in 5 ways.
Hence by the fundamental principle of
counting, the required number of ways
= 7 6 5 = 210
Ex. 19: The flag of a newly formed forum is in
the form of three blocks, each
to be coloured differently. If there are
6 different col ours on t he whole to
choose from, how many such designs
are possible?
Soln: The total number of possible designs is
the number of arrangements of 6 different
colours taking 3 colours at a time.
Hence required number of designs
6! 6! 6 5 4 3!
= 6P3 = (6 3)! 3! 3!
= 6 5 4 = 120
Alternative Method:
Since there are 6 colours to choose from,
therefore, first block can be coloured in 6
ways.
Now, the second block can be coloured
by any one of the remaining colours in
five ways. So, there are five ways to colour
the second block.
After colouring first two blocks only
four colours are left. The third block can
now be colour ed by any one of t he
remaining four colours. So, there are four
ways to colour the third block. Hence by
fundamental principle of multiplication,
the number of flag-designs = 6 5 4 =
120
Ex. 20: How many different signals can be made
by 5 flags from 8 flags of different
colours?
Soln: The total number of signals is the number
of arrangements of 8 flags by taking 5 flags
at a time.
Hence the required number of signals
8! 8!
= 8P5 = (8 5)! 3!
8 7 6 5 4 3!
= = 6720
3!
Ex. 21: In how many ways can 6 persons stand
in a queue?
Soln: The number of ways in which 6 persons
can stand in a queue is same as the number
658
of arrangements of 6 different things taken
all at a time.
Hence, the required number of ways = 6P6
6! 6!
= (6 6)! 0! = 6!
= 6 5 4 3 2 1 = 720
Ex. 22: I t is r equir ed to seat 5 m en and 4
women in a r ow so that the women
occupy the even places. How many such
arrangements are possible?
Soln: In all 9 persons are to be seated in a row
and in the row of 9 positions there are
exact ly f our ev en places viz second,
fourth, sixth and eighth. It is given that
these four even places are to be occupied
by 4 women. This can be done in 4P4 ways
(ways of arr anging 4 women in 4
positions). The remaining 5 positions can
be filled by the 5 men in 5P5 ways. So, by
the fundamental principle of counting the
number of required sitting arrangements
4! 5!
= 4P4 5P5 = (4 4)! (5 5)!
= 4! 5! = 24 120 = 2880
Ex. 23: Three men have 4 coats, 5 waist coats
and 6 caps. In how many ways can they
K KUNDAN
wear them?
Soln: The total number of ways in which three
men can wear 4 coats is the number of
arrangements of 4 different coats taken 3
at a time. So, 3 men can wear 4 coats in
4
P3 ways. Similarly, 5 waist coats and 6
caps can be worn by three men in 5P 3
and 6P3 ways respectively. Hence, by the
fundamental principle of counting, the
required number of ways
= 4P3 5P3 6P3
4! 5! 6! 4! 5! 6!
= (4 3)! (5 3)! (6 3)! =
1! 2! 3!
= (4 3 2 1) (5 4 3) (6 5 4)
= 172800
Ex. 24: How many numbers lying between 100
and 1000 can be formed with the digits
1, 2, 3, 4, 5 if the repetition of digits is
not allowed?
Soln: Every number lying between 100 and 1000
is a three-digit number. Therefore, we
have to find the number of permutations
of five digits 1, 2, 3, 4 and 5 taken 3 at a
time.
Hence, the required number of numbers
5! 5! 5 4 3 2!
= P3 = (5 3)! 2!
5 Ex. 28: How m any wor ds ( wi t h or wi t hout
2!
= 5 4 3 = 60
Arithmetic
Ex. 25: How many four-digit numbers are there
with distinct digits?
Soln: The total number of arrangements of 10
digits 0, 1, 2, 3, 4, 5, 6, 7, 8 and 9 taking
4 at a time is 10P4. But these arrangements
also include those numbers which have
0 at thousands place. Such numbers are
not four-digit numbers.
When 0 is fixed at thousands place,
we have to arrange remaining 9 digits by
taking 3 at a time. The number of such
arrangements is 9P3.
So, the total number of numbers having 0
at thousands place = 9P3.
Hence, t he t ot al number of four -digit
numbers
= 10P4 9P3
10! 9! 10! 9!
= (10 4)! (9 3)! 6! 6!
= (10 9 8 7 9 8 7)
= 5040 504 = 4536
Ex. 26: How many four-letter words with or
without meaning, can be formed out of
the letters of the word LOGARITHMS,
if repetition of letters is not allowed?
Soln: Ther e ar e 10 let t er s in t he wor d
LOGARITHMS. So, the number of four-
letter words = number of arrangements of
10 letters, taken 4 at a time = 10P4
10! 10!
= (10 4)! 6!
= 10 9 8 7 = 5040
Ex. 27: A room has 6 doors. In how many ways
can a man enter the room through one
door come out through a different door?
Soln: Here a man has to do two jobs:
(i) entering the room and
(ii) coming out through the door.
Clearly, a person can enter the room
through any one of the 6 doors. So there
are 6P1 ways of entering into the room.
After entering into the room, the man
can come out through any one of the
remaining 5 doors. So, he can come out
through a different door in 5P1 ways.
Hence the number of ways in which a
man can enter a room through one door
and come out through a different door
= 6P1 5P1
6! 5! 6! 5!
= (6 1)! (5 1)! 5! 4!
= 6 5 = 30
meaning) of three distinct letters of the
English alphabets are there?
Soln: Ther e ar e 26 let t er s in t he English
alphabet. The total number of words (with
Permutation and Combination
or without meaning) of 3 distinct letters
is the number of arrangements of 26 letters
taking 3 letters at a time.
Hence the required number of words
= 26P3
26! 26!
= (26 3)! 23!
= 26 25 24 = 15600.
Alternative Method:
Here we have to fill up three places by
distinct letters of the English alphabets.
Since there are 26 letters of the English
alphabet, the first place can be filled by
any of these letters. So, there are 26 ways
of f illing up the fir st place. Now, t he
second place can be filled up by any of
the remaining 25 letters. So, there are 25
ways of filling up the second place. After
filling up t he first two places only 24
letters are left to fill up the third place.
So the third place can be filled in 24 ways.
Hence, the r equired number of wor ds
= 26 25 24 = 15600
Permutations Under Certain Conditions
In this section we shall discuss permutations
where either distinction between some of the items
K KUNDAN
are ignored or repetitions of items are allowed or a
particular item occurs in every arrangement etc.
Such t ype of per mutat ions ar e known as
per mutat ions under cert ain condit ions as
discussed below.
(i) Permutations when all the objects are
not distinct objects.
(ii) Permutations when object can repeat ie
when repetition is allowed.
(iii) Permutations when particular object(s)
occur(s) together or do(es) not occur
together.
(i) Permutations When all the Objects are not
Distinct Objects:
The number of permutations of n objects, where
p1 objects are of one kind, p2 are of second kind
..., pk are of kth kind and the rest, if any, are of
n!
different kind is p ! p !...p ! .
1 2 k
Ex. 29: Find the number of permutations of the
letters of the word ALLAHABAD.
Soln: Here, there are 9 objects (letters) of which
there are 4 As, 2 Ls and rest are all
different.
Ther efor e t he r equir ed number of
arrangements
9! 98765
= = 7560
4!2! 2
659
Ex. 30: How m any di ffer ent words can
be form ed wi t h t he l ett er s of t he
MISSISSIPPI?
Soln: Here, there are 11 objects (letters) of which
there are 4 Ss, 4 Is, 2 Ps and the rest M
is different.
So, total number of words is the number
of arrangements of 11 things, of which 4
are similar of one kind, 4 are similar of
second kind and 2 are similar of third
11!
kind ie .
4!4!2!
Hence, the total number of words
11!
= = 34650
4!4!2!
(ii) Permutations When Objects Can Repeat:
The number of per mutat ions of n dif ferent
things, taken r at a time, when each may be repeated
any number of times in each arrangement, is nr .
Ex. 31: Find the number of four-letter words,
with or without meaning, which can be
formed out of the letters of the word
ROSE, where the repetition of the letters
is allowed.
Soln: Accor ding to t he abov e r ule, since
repetition is allowed, the required number
of words = 44 = 256
Ex. 32: How many numbers of three digits can
be formed with the digits 1, 2, 3, 4, 5
when digits may be repeated?
Soln: The units place can be filled in 5 ways.
Since, the repetition of digits is allowed,
therefore, tens place can be filled in 5
ways and hundreds place can also be filled
in 5 ways. Therefore, by fundament al
pr inciple of count ing, the requir ed
number of three-digit numbers
= 5 5 5 = 53 = 125
Ex. 33: Find the number of numbers of five
di gi ts that can be form ed wi th t he
digits 0, 1, 2, 3, 4 if the digits can be
repeated in the same number.
Soln: In a five-digit number 0 cannot be put in
ten thousands place. So, the number of
ways of filling up the 10 thousands place
4! 4!
= 4P1 = (4 1)! 3! = 4
Since the repetition of digits is allowed,
therefore, each of the other places can be
filled in 5 ways.
Hence, the required number of numbers
= 4 5 5 5 5 = 2500
Ex. 34: How many four-digit numbers are there,
when a di gi t may be r epeated any
number of times?
Soln: In a four-digit number 0 cannot be placed
660
at thousands place. So, thousands place
can be filled with any digit from 1 to 9.
Thus, thousands place can be filled in
9
P1 = 9 ways.
Since repetition is allowed, therefore, each
of the remaining 3 places can be filled in
10 ways by using the digits from 0 to 9.
Hence, the required number of numbers
= 9 10 10 10
= 9 103 = 9000.
Ex. 35: In how many ways 5 rings of different
types can be worn in 4 fingers?
Soln: The first ring can be worn in any of the 4
fingers. So, there are 4 ways of wearing
it. Similarly, each one of the other rings
can be worn in 4 ways.
Hence the requisite number of ways
= 4 4 4 4 4 = 45
Ex. 36: In how many ways can 5 let ters be
posted in 4 letter boxes?
Soln: Since each letter can be posted in any
one of the four letter boxes. So, a letter
can be posted in 4 ways. Since there are
5 letters and each letter can be posted in
4 ways. So, total number of ways in which
all the five letters can be posted
= 4 4 4 4 4 = 45
Ex. 37: I n how many ways can 3 pr izes be
K KUNDAN
distributed among 4 boys, when
(i) no boy gets more than one prize?
(ii) a boy m ust get any number of
prizes?
(iii) no boy gets all the prizes?
Soln: (i) The total number of ways is the number
of arrangements of 4 taken 3 at a time.
So, the requisite number of ways
= 4P3 = 4! = 24
Alternative Method:
The first prize can be given away in 4
ways as it may be given to any one of the
4 boys. The second prize can be given
away in 3 ways, because the boy who got
the first prize cannot receive the second
prize. The third prize can be given away
to anyone of the remaining 2 boys in 2
ways.
So, the number of ways in which all
the prizes can be given away = 4 3 2 =
24
(ii) The first prize can be given away in 4
ways as it may be given to anyone of the 4
boys. The second prize can also be given
away in 4 ways, since it may be obtained
by the boy who has already received a
prize. Similarly, third price can be given
away in 4 ways.
Hence, the number of ways in which
all the prizes can be given away = 4 4
4 = 43 = 64
Arithmetic
(iii) Since any one of the 4 boys may get all
the prizes. So, the number of ways in
which a boy gets all the three prizes = 4
So, t he number of ways in which
a boy does not get all the prizes = 64 4
= 60.
( i ii ) Permutation when particular object( s)
occur(s) together or do( es) not occur
together:
Ex. 38: In how many ways can the letters of
the word PENCIL be arranged so that
(i) N is always next to E?
(ii) N and E are always together?
Soln: (i) Let us keep EN together and consider it
as one letter. Now we have 5 letters which
can be arranged in a row in 5P5 = 5! = 120
ways.
Hence t he t otal number of ways in
which N is always next to E is 120.
(ii) Keeping E and N together and considering
it as one letter, we have 5 letters which
can be arranged in 5P5 = 5! = 120 ways.
But E and N can put together in 2P2
= 2! = 2 ways.
Hence total number of ways
= 5! 2! = 240
Ex. 39: How m any different wor ds can be
formed with the letters of the word
EQUATION so that
(i) the words begin with E?
(ii) the words begin with E and end
with N?
(iii) the words begin and end with a
consonant?
Soln: Clear ly, the giv en word EQUATION
contains 8 letter out of which 5 are vowels
and 3 are consonants.
(i) Since all words must begin with E. So,
we fix E at the first place. Now, remaining
7 letters can be arranged in 7P7 = 7! ways
So, total number of words = 7!
(ii) Since all words must begin with E and
end with N. So, we fix E at the first place
and N at the last place.
Now, r emaining 6 lett er s can be
arranged in 6P6 = 6! ways.
Hence the required number of words
= 6P6 = 6!
(iii) There are 3 consonants and all words
should begin and end with a consonant.
So, first and last places can be filled with
3 consonants in 3P2 = 3! ways.
Now, the remaining 6 places are to be
filled up with the remaining 6 letters in
6
P6 = 6! ways
Hence the required number of words
= 3! 6! = 6 720 = 4320
Permutation and Combination
Ex. 40: How many words can be formed with
the letters of the word ORDINATE so
that vowels occupy odd places?
Soln: There are 4 vowels and 4 consonants in
the word ORDINATE.
We have to arrange 8 letters in a row such
that vowels occupy odd places.
There are 4 odd places 1, 3, 5 and 7.
Four vowels can be arranged in these 4
odd places in 4P4 = 4! ways.
Remaining 4 even places viz 2, 4, 6, 8 are
to be occupied by the 4 consonants.
This can be done in 4P4 = 4! ways.
Hence the total number of words in which
vowels occupy odd places = 4! 4! = 576
Ex. 41. In how many ways 5 boys and 3 girls
can be seated in a row so that no two
girls are together?
Soln: B B B B B
The 5 boys can be seated in a row in
(5P5 = )5! ways.
In each of these arrangements 6 places
are created, shown by the cross-mark, as
given above.
Since no two girls are to sit together, so
we may arrange 3 girls in 6 places.
This can be done in 6P 3 ways ie 3 girls
can be seated in 6P3 ways.
K KUNDAN
Hence, t he t ot al number of seating
arrangements
6!
= 5P5 6P3 = 5! (6 3)!
= 5! 6 5 4 = 14400
Ex. 42: How many words can be formed from
the letters of the word DAUGHTER so
that
(i) the vowels always come together?
(ii) the vowels never come together?
Soln: Ther e ar e 8 lett er s in the wor d
DAUGHTER, including 3 vowels (A, U,
E) and 5 consonants (D, G, H, T, R).
(i) Considering three vowels as one letter,
we have 6 letters which can be arranged
in 6P6 = 6! ways.
But corresponding each way of these
arrangements, the vowels A, U, E can be
put together in 3P3 = 3! ways.
Hence, the required number of words
= 6! 3! = 720 6 = 4320
(ii) The total number of words formed by using
all the eight letters of the word DAUGHTER
is 8P8 = 8! = 4032
So, the total number of words in which
vowels are never together = Total numbers
of words Number of words in which
vowels are always together
= 40320 4320 = 36000
Ex. 43: When a group photograph is taken, all
the seven teachers should be in the first
row and all the twenty students should
661
be in the second row. If the two corners
of the second row are reserved for the
two tallest students, interchangeable
only between them, and if the middle
seat of the front row is reserved for
the principal how many arrangements
are possible?
[MAT2006]
Soln: Since the middle seat of the front row is
reserved for the principal, the remaining
6 teachers can be arranged in the front
row in 6P6 = 6! ways
The two corners of the second row are
reserved for the two tallest students. They
can occupy these two places in 2P2 = 2!
ways.
The remaining 18 seats may be occupied
by the remaining 18 student s in 18 P 18
= 18! ways.
Hence, by the fundamental principle of
counting the total number of arrangements
= 6! (18! 2!) = 18! 1440
Ex. 44: How many even numbers are there with
three digits such that if 5 is one of the
digits, then 7 is the next digit?
Soln: We have to determine the total number of
even numbers formed by using the given
conditions.
So, at units place we can use one of the
digits 0, 2, 4, 6, 8. If 5 is at tens place
then, as per the given condition, 7 should
be at units place. In such a case the
number will not be an even number. So, 5
cannot be at t ens and units places.
Hence, 5 can be only at hundreds place.
Now, two cases arise.
Case-I: When 5 is at hundreds place.
If 5 is at hundreds place, then 7 will be
at tens place.
Hence unit s place can be f illed in
5
P1 = 5 ways by using the five digits 0, 2,
4, 6 and 8.
So, total number of even numbers
= 1 1 5 = 5
Case II: When 5 is not at hundreds
place.
Now, hundreds place can be filled in 8P1
= 8 ways
( 0 and 5 cannot be used at hundreds
place)
In tens place we can use any one of the
ten digits except 5. Hence tens place can
be filled in 9P1 = 9 ways.
At units place we have to use one of the
even digits 0, 2, 4, 6, 8. So, units place
can be filled in 5P1 = 5 ways
So, total number of even numbers
= 8 9 5 = 360
Hence, the total number of required even
numbers = 360 + 5 = 365.
662
Ex. 45: A code word i s t o consi st of two
distinct English alphabets followed by
two distinct numbers from 1 to 9. For
example, DE45 is a code word.
(i) How m any such code words are
there?
(ii) How many of them end with an even
integer?
Soln: (i) There 26 English alphabets.
So, first two places in the code word
can be filled in 26P2 ways.
In last two places we have to use two
distinct numbers from 1 to 9. Hence, last
two places can be filled in 9P2 ways.
Hence, by the fundamental principle
of count ing, the total number of code
words
= 26P2 9P2 = 650 72 = 46800
(ii) Number of code words ending with an
even integer.
In this case, the code word can have
any of the numbers 2, 4, 6, 8 at t he
extreme right position.
Hence the extreme right position can
be filled in 4P1 = 4 ways.
Now, next left position can be filled
with any one of the remaining 8 digits in
8
P1 = 8 ways and the two extreme left
K KUNDAN
positions can be filled by two English
alphabets in 26P2 ways.
Hence, the total number of code words
which end with an even integer
= 4 8 26P2 = 4 8 650
= 20800
Ex. 46: How many numbers between 400 and
1000 can be formed with the digits 0,
2, 3, 4, 5, 6 if no digits is repeated in
the same number?
Soln: Numbers between 400 and 1000 consist
of three digits with digit at hundreds place
greater than or equal to 4.
Hundreds place can be filled, by using
the digits 4, 5, 6 in 3P1 = 3 ways.
Now, tens and units places can be filled
by the remaining 5 digits in 5P2 ways.
Hence the required number of numbers
= 3 5P2
5!
= 3 (5 2)!
5!
= 3 = 3 5 4
3!
= 60
Ex. 47: How many four-digit numbers divisible
by 4 can be made with the digits 1, 2,
3, 4 and 5 if the repetition of digits is
not allowed?
Soln: Recall that a number is divisible by 4 if
the number formed by the last two digits
Arithmetic
is divisible by 4.
The digits at units and tens places can
be arranged as follows:
Thousands Hundreds Tens Units
1 2
2 4
3 2
5 2
Now, corresponding to each such way the
remaining three digits at thousands and
hundreds places can be arranged in 3P2
ways.
Hence, the required number of numbers
= 3P2 4 = 3! 4 = 24
Ex. 48: Find the number of ways in which 5
boys and 5 girls be seated in a row so
that
(i) No two girls may sit together.
(ii) All the girls sit together and all
the boys sit together
(iii) All the girls are never together.
Soln: (i) Sitting arrangement of the 5 boys and 5
girls, as per the given condition, will be
as given below.
B B B B B
5 boys can be seated in a row in 5P5
= 5! ways
Now, in the 6 gaps as shown above, 5 girls
6!
can be arranged in 6P5 = (6 5 )! = 6! ways.
Hence the number of ways in which no
two girls sit together = 5! 6P5 = 5! 6!
(ii) The two groups of girls and boys can be
arranged in 2P2 = 2! ways.
5 girls can be arranged among themselves
in 5P5 = 5! ways.
Similarly, 5 boys can be arranged among
themselves in 5P5 = 5! ways
Hence, by the fundamental principle of
counting, the total number of requisite
seating arrangements = 2!(5! 5!) = 2(5!)2
(iii) The total number of ways in which all
the girls are never together
= Total number of arrangements Total
number of arrangements in which all the
girls are always together
Hence, total number of arrangements
= 10P10 = 10!
Total number of arrangements in which
all the girls are always together
= 5P5 6P6 = 5! 6!
required number of arrangements
= 10! 5! 6!
Ex. 49: Five boys and five girls form a line with
the boys and girls alternating. Find the
number of ways of making the line.
Soln: 5 boys can be ar r anged in a line in
5
P5 = 5! ways.
Since the boys and girls are alternating,
Permutation and Combination 663

so, the corresponding each of the 5! ways
of arrangements of 5 boys we obtain 5
places marked by cross as shown below:
(i) B1 B2 B3 B4 B5
(ii) B1 B2 B3 B4 B5
Clearly, 5 girls can be arranged in 5 places
marked by cross in (5! + 5!) ways.
Hence, the total number of ways of making
the line = 5! (5! + 5!) = 2(5!)2
Ex. 50: (i) How many different words can be
formed with the letters of the word
HARYANA?
(ii) How many of these begin with H
and end with N?
(iii) In how many of these H and N are
together?
Soln: (i) There are 7 letters in the word HARYANA
of which 3 are As and remaining all are
each of its own kind.
Hence, the total number of words
As. Also there are 4 even places viz 2nd,
4th, 6th and 8th.
So, these 4 even places can be occupied
4!
by 4 vowels in = =1 way
4!
Now, we are left with 5 places in which
5 letters, of which 2 are alike (2 Ls) and
others are distinct, can be arranged in
5!
ways.
2!
Hence the total number of words in which
vowels occupy the even places
5! 4! 5!
= = 5 4 3 = 60
2! 4! 2!
(ii) Consider both L together and treat them
as one letter we have 8 letters out of which
A repeats 4 times and others are distinct.

7! 7 6 5 4 3! 8!
= These 8 letters can be arranged in
3! 3! 4!
= 7 6 5 4 = 840 ways.
(ii) After fixing H in first place and N in last So, the number of words in which both L
place, we have 5 letters out of which three come together
are alike ie As and remaining all are each 8!
of its own kind. = = 1680
4!

K KUNDAN
So, total number of words
Hence the number of words in which both
5! 5 4 3! L do not come together
= = 20
3! 3! = Total number of words Number of
(iii) Considering H and N together we have words in which both L come together
(7 2 + 1 =) 6 letters out of which three = 7560 1680 = 5880
are alike ie As and others are each of its Ex. 52: (i) How many arrangements can be
own kind. These 6 letters can be arranged m ade wi t h l et ter s of the wor d
MATHEMATICS?
6! (ii) In how many of them vowels are
in ways.
3! together?
But H and N can be arranged amongst [MAT2005]
themselves in 2P2 = 2! ways. Soln: (i) Ther e ar e 11 let t er s in t he wor d
Hence, the requisite number of words MATHEMATICS of which t wo are Ms,
two are As, two are Ts and all others
6! are dist inct . So, r equir ed number of
= 2! = 120 2 = 240
3! arrangements
Ex. 51: How m any different wor ds can be 11!
formed by using all the letters of the = = 4989600
2!2!2!
word ALLAHABAD? (ii) Ther e ar e 4 v owels v iz A, E, A, I.
(i) In how many of them vowels occupy Consider ing t hese f our vowels as one
the even positions? letter we have 8 letters (M, T, H, M, T, C,
(ii) In how many of them both L do not S and one letter obtained by combining
come together? all vowels), out of which M occurs twice,
Soln: Ther e ar e 9 lett er s in the wor d T occurs twice and the rest all are distinct.
ALLAHABAD out of which 4 are As, 2 are These 8 letters can be arranged in
Ls and the rest are all distinct. 8!
So, the requisite number of words ways.
2!2!
9! But the four vowels (A, E, A, I) can be put
= = 7560
4!2! 4!
(i) There are 4 vowels and all are alike ie 4 together in ways.
2!
664
Hence, the total number of arrangements
in which vowels are always together
8! 4!
= Soln:
2!2! 2!
= 10080 12 = 120960
Ex. 53: If all the letters of the word AGAIN be
arranged as in a dictionary, what is
the fiftieth word?
Soln: In dictionary the words at each stage are
arranged in alphabetical order. Starting
with the letter A, and arranging the other
four letters G, A, I, N we obtain 4P4 = 4!
= 24 words
Thus, there are 24 words which start with
A. These are the first 24 words.
Then, starting with G, and arranging the
other four letters A, A, I, N in different
4! 22
ways, we obtain = 12 words
2! 2 6!
Thus, there are 12 words which start with
G.
Now, we start with I. The remaining 4
4!
letters A, G, A, N can be arranged in
2!
= 12 ways
Hence, there are 12 words, which start
K KUNDAN
with I.
Thus, we have so f ar constr uct ed 48
words.
The 49th word should be started with the
letter N.
So, the 49th word is NAAGI and hence
the 50th word is NAAIG.
Ex. 54: If the different permutations of the
word EXAMINATION are listed as in a
dictionary, how many items are there
in the list before the first word starting
with E?
Soln: In a dictionary the words at each stage
are arranged in alphabetical order. In the
given problem we have to find the total
number of words starting with A, because
the very next word will start with E.
For finding the number of words starting
with A, we have to find the number of
arrangements of the remaining 10 letters
E, X, M, I, N, A, T, I, O, N, of which there
are 2 Is, 2 Ns and the others each of its
own kind.
The number of such arrangements
10!
= = 907200
2!2!
Hence, t he required number of it ems
= 907200.
Arithmetic
Ex. 55: How many num ber s gr eat er than a
million can be formed with the digits
2, 3, 0, 3, 4, 2, 3?
Any number greater than a million will
contain all the seven digits.
Now, we hav e to ar range these sev en
digits, out of which 2 occurs twice, 3
occurs thrice and the rest are distinct.
The number of such arrangements
7!
= = 420
2!3!
These arrangements also include those
numbers which contain 0 at the millions
place.
Keeping 0 fixed at the millionth place,
we have 6 digits out of which 2 occurs
twice and 3 occurs thrice and the rest are
distinct.
These 6 digits can be arranged in
2!3!
= 60 ways
Hence the number of required numbers
= 420 60 = 360.
Circular Permutations
If we arrange the objects along a closed curve viz a
circle etc, the permutations are known as circular
permutations. So f ar , we have discussed
permutations of objects (or things) in a row. This
type of permutations are generally known as linear
permutations.
As we have seen in the earlier sections of this
chapter t hat ev er y linear ar r angement has a
beginning and an end, but there is nothing like
beginning or end in a circular permutation. Thus
in a circular permutation, we consider one object
as fixed and the remaining objects are arranged as
in case of linear arrangements.
The number of circular arrangements (permutations)
of n different things taken all at a time is (n 1)! if
clockwise and anticlockwise orders are taken as
different arrangements.
Consider the following circular permutations.
We observe that in both, the order of the circular
arrangement is A1, A2, A3, A4.
Figure-1 Figure-2
In Figure 1, the order is anticlockwise whereas
in Figure 2, the order is clockwise. Thus t he
number of circular permutations of n things in
Permutation and Combination
which clockwise and anti-clockwise arrangements
give rise to different permutations is (n 1)!.
For example, the number of permutations of 6
persons seated around a table is (6 1)! = 5!.
Because with respect to table, the clockwise and
anti-clockwise arrangements are distinct.
If anti-clockwise and clockwise order of
arrangements are not distinct e.g. arrangements
of beads in a necklace, arrangement of flowers in
gar land etc. , t hen t he number of cir cular
1 These 18 persons can be arranged around
permutations of n distinct items is (n 1)! .
2 But B 1 and B 2 can be arranged among
Ex. 56: (i) In how many ways can 5 persons
be seated around a circular table?
(ii) I n how m any of t hese ar r ange-
ments will two particular persons
be next to each other?
Soln: (i) 5 persons can be seated around a circular
table in (5 1)! = 4! = 24 ways
(ii) Considering two particular persons as one
person, we have 4 persons in all. These
4 persons can be seated around a circular
t able in (4 1)! = 3! ways. But two
particular persons can be arranged among
themselves in 2! ways.
Hence, the total number of arrangements
= 3! 2! = 12
K KUNDAN
Ex. 57: (i) If 20 persons were invited for a
party, in how many ways can they
and t he host be seated at a
circular table?
(ii) I n how m any ways wi l l t wo
particular persons be seat ed on
either side of the host?
Soln: (i) Clearly, there are 21 persons, including
the host to be seated around a circular
table. These 21 persons can be seated
round a circular table in (21 1)! = 20!
ways.
(ii) Let P1 and P2 be the two particular persons
and H be the host. Number of arrangements
of these two particular persons can be
seated on either side of the host = 2P2 = 2!
= 2 ways ie (i) P1HP2 and (ii) P2HP1
Consider the two particular persons and
t he host as one person, we hav e 19
persons in all. These 19 persons can be
seated round a circular table in (19 1)! =
18! ways.
But two particular persons can be seated
on either side of the host in 2 ways. So,
the number of ways sitting 21 persons at
a circular table with two particular persons
on either side of the host = 18! 2
Ex. 58: There are 20 persons among whom are
two brothers. Find the number of ways
in which we can arrange them around
a circle so that there is exactly one
person between the two brothers.
665
Soln: Let B1 and B2 be two brothers among 20
persons and let M be a person.
Clearly, person M can be chosen from 18
persons (excluding B1 and B2) in
18!
18
P1 = (18 1)! = 18 ways
Considering the two brothers B 1 and B2
and person M as one person, we have
(20 3 + 1 = ) 18 persons in all.
a circle in (18 1)! = 17! ways.
themselves in 2P2 = 2! = 2 ways ie (i) B1MB2
and (ii) B2MB1
Hence, by the fundamental principle of
counting, the total number of ways
= 18 17! 2! = 2 18!
Ex. 59: In how many ways can a party of 4
m en and 4 wom en be seated at a
circular table so that no two women
are adjacent?
Soln: The 4 men can be seated at the circular
table such that there is a vacant seat
between every pair of men in (4 1)! = 3!
ways.
Now, 4 vacant seats can be occupied by 4
women in 4P4 = 4! ways
Hence, the required number of sitting
arrangements
= 3! 4! = 144
Ex. 60: A round table conference is to be held
between 20 delegates of 2 countries. In
how many ways can they be seated if
two particular delegates are (i) always
together? (ii) never together?
Soln: (i) Let D1 and D2 be two particular delegates.
Considering D1 and D2 as one delegate,
we have (20 1 =) 19 delegates in all.
These 19 delegates can be seated round a
circular table in (19 1)! = 18! ways.
But t wo part icular delegat es can be
arranged among themselves in
2
P2 = 2! = 2 ways ie D1D2 and D2D1.
Hence, the total number of ways
= 2 18! = 2(18!)
(ii) To find the number of ways in which two
particular delegates never sit together, we
subtract the number of ways in which
they sit together from the total number of
sitting arrangements of 20 persons.
Clearly, 20 persons can be seated round a
circular table in (20 1 =) 19! ways.
Hence, the required number of sitting
arrangements
= 19! 2 18!
= 19 18! 2 18!
= 18! (19 2) = 17(18!)
Ex. 61: There are 5 gentlemen and 4 ladies to
dine at a round table. In how many
666
ways can they seat themselves so that
no two ladies are together?
Soln: Five gentlemen can be seated at a round
table in (5 1)! = 4! ways. Soln:
Now, 5 places are created (as shown in
figure marked by cross-lines) in which 4
ladies can be arranged in
5!
5
P4 = (5 4)! = 5! ways
Hence, the total number of ways in which
no two ladies sit together
= 4! 5! = 2880
Ex. 62: In how many ways can seven persons
sit around a table so that all shall not
have the same neighbours in any two
arrangements?
Soln: Clearly, 7 persons can sit at a round table
in (7 1)! = 6! ways Combination
But, in clockwise and ant iclockwise
arrangements, each person will have the
K KUNDAN
same neighbours.
So, the required number of ways
1 and C taken 2 at a time are AB, AC and BC. Note
= (6! ) = 360
2 t hat AB and BA ar e 1 combinat ion but 2
Ex. 63: Three boys and three girls are to be
seated around a table in a circle. Among
them, the boy X does not want any girl
neighbour and the girl Y does not want
any boy neighbour. How many such
arrangements are possible?
[MAT 2002] taken 4 at a time.
Soln: Let B1, B2 and X be three boys and G1, G2
and Y be three girls. Since the boy X does
not want any girl neighbour. Therefore
boy X will have his neighbours as boys B1
and B2 as shown in the figure. Similarly,
girl Y has her neighbours as girls G1 and
G2 as shown in fig.
But the boys B1 and B2 can be arranged
among themselves in 2! ways and the
girls G1 and G2 can be arranged among
themselves in 2! ways.
Hence, t he r equir ed number of
arrangements = 2! 2! = 4
Arithmetic
Ex. 64: Find the number of ways in which 10
di ffer ent beads can be arr anged to
form a necklace.
10 different beads can be arranged in
circular form in (10 1)! = 9! ways. Since
t her e is no dist inction bet ween t he
clockwise and ant iclockwise arr ange-
ment s. So, t he r equir ed number of
1
arrangements = (9! )
2
Ex. 65: Find the number of ways in which 8
different flowers can be strung to form
a garland so that 4 particular flowers
are never separated.
Soln: Considering 4 particular flowers as one
flower, we have (8 4 + 1 =) 5 flowers
which can be strung to form a garland
= (5 1)! = (4!) ways
(Since the moment we fix 4 particular
flowers, the clockwise and anticlockwise
arrangements in the garland are distinct.)
But 4 particular flowers can be arranged
in 4P 4 = 4! ways. Thus t he r equir ed
number of ways = (4!) 4! = 576
A combination is a grouping of selection of all or
part of a number of things without reference to the
ar rangement of t he things selected. Thus t he
number of combinations of the three letters A, B
permutations of the letters A and B.
n
The symbol nCr or C(n, r) or r represents the
number of combinations (selections, groups) of n
different things taken r at a time. Thus 9C4 denotes
the number of combinations of 9 different things
Generally we use the word arrangement for
per mutat ion and the wor d selection f or
combinations.
Notation and Important Properties
( i ) The number of all combinations of n distinct
objects, taken r at a time is given by
n
n! Pr
n
Cr =
(n r )! r ! r!
n (n 1)((n 2)...(n r 1)
=
1.2.3...r
n
( i i) Cn = nC0 = 1
n
( i ii ) Cn r = nCr
n
( iv) Cr + nCr-1 = n+1Cr
(v) If n and r are non-negative integers such
n n 1
that 1 r n, then nCr = . C r -1
r
n n
( vi) If Cx = Cy, then either x = y or x + y = n
Permutation and Combination 667

( vii) If n is even, then the greatest value of nCr (0 Ex. 72: If there are 12 persons in a party, and
r n) is nCn/2. if each two of them shake hands with
(viii) If n is odd, then the greatest value of nCr (0 each other , how m any handshakes
n n
happen in the party?
C n1 C n1 Soln: It is to note here that, when two persons
r n) is or .
2 2 shake hands, it is count ed as one
Ex. 66: If nC7 = nC4, find the value of n. handshake, not two. Because if X shaking
Soln: We have, nCx = nCy x + y = n or x = y hands with Y and Y with X will not be
So, nC7 = nC4 n = 7 + 4 = 11 two different handshakes. Here order is
Ex. 67: Find the value of 10C3. not important. So, this is a question of
n n 1 combination.
Soln: We have nCr = . C r-1 The total number of handshakes is
r
same as the number of ways of selecting
10 9
10C3 = C2 2 persons among 12 persons.
3 12! 12!
10 9 8 = 12C2 = (12 2)!2! 10!2!
= C1
3 2
12 11 10!
10 9 8 7 = 2 10! = 66
= C0
3 2 1 Ex. 73: A question paper has two parts. Part
10 9 A and Par t B, each cont ai ni ng 10
= 8 1 [ 7C = 1] questions. If the student has to choose
3 2 0

= 120 8 from Part A and 5 from Part B, in

Ex. 68: If nC15 = nC8, find the value of nC21. how m any ways can he choose t he
Soln: n
C15 = nC8 n = 15 + 8 = 23 questions?
[ nCx = nCy x + y = n] Soln: There are 10 questions in Part A out of
nC21 = 23C21 = 23C23-21 [ nCr = nCn-r] which 8 questions can be chosen in 10C8
ways.

K KUNDAN
23 22 Similarly, 5 questions can be chosen from
= 23
C2 = C1
2 Part B containing 10 questions in 10C 5
ways.
23 22 21
= C0 Hence, by the fundamental principle of
2 1 counting, the total number of ways of
23 22 selecting 8 questions from Part A and 5
= 1 [ nC = 1] from Part B
0
2 1
= 23 11 = 253 10! 10!
= 10C8 10C5 = (10 8)!8! (10 5)!5!
Ex. 69: If 10Cx = 10Cx + 4, find the value of x.
10
Soln: Cx = 10Cx + 4 x + x + 4 = 10 10! 10!
2x = 6 x = 3 = = 11340
2!8! 5!5!
Ex. 70: From a class of 32 students, 4 are to Ex. 74: In how many ways a committee of 5
be chosen for a competition. In how members can be selected from 6 men
many ways can this be done? and 5 women, consisting of 3 men and
Soln: The required number of ways 2 women?
32 32! Soln: 3 men out of 6 men can be selected in 6C3
C4
= 28!4! ways. 2 women out of 5 women can be
Ex. 71: Three gentlemen and three ladies are selected in 5C 2 ways. Therefore, by the
candidates for two vacancies. A voter fundamental principle counting, 3 men
has to vote for two candidates. In how out of 6 men and 2 women out of 5 women
many ways can one cast his vote? can be selected in 6C3 5C2
Soln: Clearly, there are 6 candidates and a voter 6 5 4 5 4
has to vote for any two of them. So, the = = 200 ways
3 2 1 2 1
required number of ways is the number of Ex. 75: In how many ways can a cricket eleven
ways of selecting 2 out of 6 ie 6C2. be chosen out of a batch of 15 players
Hence, the required number of ways if
6! 6! (i) t her e is no r est r i ct i on on t he
= 6C2 = (6 2)!2! 4!2! selection?
(ii) a par ti cular pl ayer i s al ways
6 5 4! chosen?
= 4! 2 = 15
(iii) a particular player is never chosen?
668
Soln: (i) The total number of ways of selecting 11
players out of 15 is
15
C11 = 15C15-11 = 15C4
15 14 13 12
= = 1365
4 3 2 1
(ii) If a particular player is a ways chosen.
This means that 10 players are selected
out of the remaining 14 players.
required number of ways
= 14C10 = 14C14-10 = 14C4 = 1001
(iii) If a particular player is never chosen. This
means that 11 players are selected out of
the remaining 14 players.
required number of ways
= 14C11 = 14C14-11 = 14C3 = 364
Ex. 76: A committee of 12 is to be formed from
9 women and 8 men. In how many ways
this can be done if at least five women
have to be included in a committee? In
how many of these committees (i) the
women are in majority (ii) and the men
are in majority?
Soln: Ther e ar e 9 women and 8 men. A
committee of 12, consisting of at least 5
women, can be formed by choosing:
(I) 5 women and 7 men
(II) 6 women and 6 men
(III) 7 women and 5 men
K KUNDAN
(IV) 8 women and 4 men
(V) 9 women and 3 men
In (I),
Number of ways of choosing 5 women out
of 9 women = 9C5
Number of ways of choosing 7 men out of
8 men = 8C7
Number of ways of f or ming t he
committee in this case = 9C5 8C7
Similarly, in (II), (III), (IV) and (V), we have,
the number of ways of forming committee
are (9C6 8C6), (9C7 8C5), (9C8 8C4) and
(9C9 8C3) respectively.
Since committee is formed in any of the
above ways.
Hence, total number of ways of forming
t he committ ee, by t he f undament al
principle of addition
= ( 9C 5 8C 7) + ( 9C 6 8C 6) + ( 9C 7 8C 5 )
+ (9C8 8C4) + (9C9 8C3)
= (126 8) + (84 28) + (36 56)
+ (9 70) + (1 56) = 6062
(i) Clearly, women are in majority in (III), (IV)
and (V) cases as discussed above.
So, total number of committees in which
women are in majority
= (9C7 8C5) + (9C8 8C4) + (9C9 8C3)
= (36 56) + (9 70) + (1 56)
= 2702
(ii) Clearly, men are in majority in only (I)
case as discussed above.
Arithmetic
So, total number of committees in which
men are in majority
= (9C5 8C7) = (126 8) = 1008
Ex. 77: A committee of 5 is to be formed out of
6 gents and 4 ladies. In how many ways
this can be done, when
(i) at least two ladies are included?
(ii) at most two ladies are included?
Soln: (i) A committee of 5 persons, consisting of at
least two ladies, can be formed in the
following ways
(a) Selecting 2 ladies out of 4 and 3 gents
out of 6. This can be done in 4C2 6C3
ways.
(b) Selecting 3 ladies out of 4 and 2 gents
out of 6. This can be done in 4C3 6C2
ways.
(c) Selecting 4 ladies out of 4 and 1 get
out of 6. This can be done in 4C4 6C1
ways.
Since the committee is formed in any of
t he abov e ways, t her efor e, by t he
fundamental principle of addition, the total
number of forming the committee
= (4C2 6C3) + (4C3 6C2) + (4C4 6C1)
= 120 + 60 + 6 = 186
(ii) A committee of 5 persons, consisting of at
most two ladies can be constituted in the
following ways:
(a) Selecting 5 gents only out of 6.
This can be done in 6C5 ways.
(b) Selecting 4 gents only out of 6 and one
lady out of 4.
This can be done in (6C4 4C1) ways.
(c) Selecting 3 gents only out of 6 and two
ladies out of 4.
This can be done in (6C3 4C2) ways.
Since the committee is formed in any of
the above ways, so, the total number of
ways of forming the committee
= 6C5 + (6C4 4C1) + (6C3 4C2)
= 6 + 60 + 120 = 186
Ex. 78: A box contains 5 different red and 6
di ffer ent whi te bal ls. I n how many
ways can 6 balls be selected so that
there are at least two balls of each
colour?
Soln: The selection of 6 balls, consisting of at
least two balls of each colour from 5 red
and 6 white balls, can be made in the
following ways:
Red Ball White Ball
(i) 2 4
(ii) 3 3
(iii) 4 2
(i) By selecting 2 red balls, out of 5 and 4
white balls out of 6, this can be done
in (5C2 6C4) ways.
(ii) By selecting 3 red balls out of 5 and 3
Permutation and Combination
white balls out of 6, this can be done
in (5C3 6C3) ways.
(iii) By selecting 4 red balls out of 5 and 2
white balls out of 6, this can be done
in (5C4 6C2) ways.
Since t he select ion of 6 balls can be
completed in any one of the above ways.
Hence, by the fundamental principle of
addition, the total number of ways to select
the balls
= (5C2 6C4) + (5C3 6C3) + (5C4 6C2)
= (10 15) + (10 20) + (5 15)
= 425
Ex. 79: In how many ways can a cricket team
be selected from a group of 25 players
containing 10 batsmen, 8 bowlers, 5
all rounders and 2 wicket keepers?
Assume that the team of 11 players
requires 5 batsmen, 3 all-rounders 2
bowlers and 1 wicket keeper.
Soln: The selection of team is divided into four
phases:
(i) Selection of 5 batsmen out of 10. This
can be done in 10C5 ways.
(ii) Selection of 3 all-rounders out of 5.
This can be done in 5C3 ways.
(iii) Selection of 2 bowlers out of 8. This
can be done in 8C2 ways.
K KUNDAN
(iv) Selection of one wicket keeper out of
2. This can be done in 2C1 ways.
The selection of team is completed by
completing all the four phases.
By t he f undament al pr inciple of
multiplication, the team can be selected
in 10C5 5C3 8C2 2C1 = 141120 ways.
Ex. 80: A person wishes to make up as many
different parties as he can out of his
20 fr i ends such t hat each par t y
consi sts of t he same num ber of
persons. How many friends should he
invite?
Soln: Suppose he invites r friends at a time.
Then the total number of parties is 20Cr .
We have to find the maximum value of
20
Cr, which is for r = 10.
We know [See Property (vii) in the section
Notation and Important Properties] that,
n shows available space for the minus ()
if n is even, then nCr is maximum for r =
2
Hence, he should invite 10 friends at a
time in order to form the maximum number
of parties.
Ex. 81: From a class of 25 students, 10 are to
be chosen for an excursion party. There
are 3 students who decide that either
all of them will join or none of them
will join. In how many ways can they
be chosen?
Soln: We have the following possibilities:
669
(i) Three par t icular student s join t he
excursion party
In t his case, we hav e t o choose 7
st udents f rom the remaining 22
students. This can be done in 22C7 ways.
(ii) Three particular students do not join
the excursion party.
In this case, we hav e to choose 10
st udents f rom the remaining 22
students. This can be done in 22C 10
ways.
Hence, by the fundamental principle of
addition, the required number of ways
= 22C7 + 22C10 = 817190
Ex. 82: A boy has 3 library tickets and 8 books
of his interest in the library. Of these
8, he does not want t o borr ow
Chemistry Part II, unless Chemistry
Part I is also borrowed. In how many
ways can he choose the three books to
be borrowed?
[MAT1999]
Soln: We have the following two possibilities:
(i) When Chemistry Part I is borrowed.
In t his case, t he boy may bor row
Chemistry Part II. So, he has to select
now two books out of the remaining 7
books of his interest. This can be done
in 7C2 ways.
(ii) When Chemistry Part I is not borrowed.
In this case, the boy does not want to
borrow Chemistry Part II. So, he has to
select three books from the remaining
6 books. This can be done in 6C3 ways.
Hence, by the fundamental principle of
addition, the required number of ways
= 7C2 + 6C3 = 21 + 20 = 41
Ex. 83: In how many ways can 7 plus (+) signs
and 5 minus () signs be arranged in a
row so that no two minus () signs are
together?
Soln: The plus signs (+) can be arranged in only
one way, because all are identical, as
shown below:
+ + + + + + +
A blank box in the above arrangement
. signs. Since there are 7 plus signs (+),
the number of blank boxes is therefore 8.
The f ive minus signs are now t o be
arranged in the 8 boxes so that no two of
them are together.
Now, 5 boxes out of 8 can be chosen in
8
C 5 ways. Since all minus signs ar e
ident ical, so 5 minus signs can be
arranged in 5 chosen boxes in only one
way.
Hence, t he number of possible
arrangements = 1 8C5 1 = 56
670 Arithmetic

Ex. 84: In how many ways can 21 identical = Number of ways of selecting 2 out of n
books one English and 19 identical n (n 1)
books on Hindi be placed in a row on a = nC2 =
2
shelf so that two books on Hindi may Out of these lines, n lines are the sides of
not be together? the polygon.
Soln: In order that no two books on Hindi are Number of diagonals of the polygon
together, we must first arrange all books
on English in a row. Since all English n (n 1) n (n 3)
= n
books ar e identical, so t hey can be 2 2
arranged in a row in only one way as Ex. 88: A polygon has 44 diagonals. Find the
shown below: number of its sides.
E E E E E ..... E E [FMS-DU2002]
Here, E denotes the position of an English Soln: Let there be n sides of the polygon.
book and () that of a Hindi book. We know that the number of diagonals of
Since, there are 21 books on English, the
number places mark () are therefore 22. n (n 3)
n-sided polygon is
Now, 19 books on Hindi are to be arranged 2
in these 22 places so that no two of them
are together. n (n 3)
Therefore, = 44
Out of 22 places 19 places for Hindi books 2
can be chosen in 22C19 ways. or, n2 3n 88 = 0
Since, all books on Hindi are identical, or, (n 11) (n + 8) = 0
so, 19 books on Hindi can be arranged in or, n = 11 and -8 [ n > 0]
19 chosen places in only one way. n = 11
Hence the required number of ways Hence, there are 11 sides of the polygon.
= 1 22C19 1 = 1540 Ex. 89: I f m par all el l i nes i n pl ane ar e
Ex. 85: For the post of 5 teachers, there are intersected by a family of n parallel lines.
23 applicants, 2 posts are reserved for Find the num ber of paral l el ogram s

K KUNDAN
SC candi dat es and t here are 7 SC
candidates among the applicants. In
how many ways can the selection be
m ade?
Soln: Clearly, there are 7 SC candidates and 16
other candidates.
We have to select 2 out of 7 SC candidates
and 3 out of 16 other candidates.
This can be done in 7C2 16C3 ways
The number of ways of making t he
selection = 7C2 16C3 = 11760
Application of Combinations in
Geometrical Problems
Ex. 86: How many triangles can be formed by
joining the vertices of a hexagon?
Soln: There are 6 vertices of a hexagon.
One triangle is formed by selecting a group
of 3 vertices from the given 6 vertices.
This can be done in 6C3 ways
6! 6!
Number of triangles = (6 3)!3! 3!3! = 20
Ex. 87: How many diagonal s are ther e in a
polygon with n sides?
Soln: A polygon of n sides has n vertices.
By joining any two vertices of a polygon,
we obtain either a side or a diagonal of
the polygon.
Number of line segments obt ained by
joining the vertices of a n-sided polygon
taken 2 at a time
form ed.
Soln: A parallelogram is formed by choosing two
straight lines from the set of m parallel
lines and two straight lines from the set
of n parallel lines.
Two straight lines from the set of m
parallel lines can be chosen in mC2 ways
and two straight lines from the set of n
parallel lines can be chosen in nC2 ways.
Hence the number of parallelograms
formed
m (m 1) n (n 1)
= mC2 nC2 =
2 2
mn (m 1)(n 1)
=
4
Mixed Problems on Permutations and
Combinations
Ex. 90: Out of 7 consonants and 4 vowels, how
many wor ds of 3 consonants and 2
vowels can be formed?
Soln: Three consonants out of 7 and 2 vowels
out of 4 can be chosen in 7C3 4C2 ways.
Thus there are ( 7C3 4C 2) groups each
containing 3 consonants and 2 vowels.
Since each gr oup cont ains 5 let t ers,
which can be arranged among themselves
in 5P5 = 5! ways.
Hence the required number of words
= (7C3 4C2) 5! = 25200
Permutation and Combination
Ex. 91: How many four-let ter wor ds can be
formed using the letters of the word
FAILURE, so that
(i) F is included in each word?
(ii) F is not included in any word?
Soln: There are 7 letters in the word FAILURE.
( i ) To include F in every four-letter word,
we first select four letters from the 7
letters of the word FAILURE such that
F is included in every selection. This
can be done by selecting three letters
from the remaining 6 letters, A, I, L,
U, R and E in 6C3 ways. Now, there are
4 letters in each of 6C3 selections.
Consider one of these 6C 3 selections.
This selection contains 4 letters which
can be arranged in 4P4 = 4! ways. Thus,
each of 6C3 selections provide 4! words.
Hence the total number of words
= 6C3 4! = 480
(ii) If F is not to be included in any word,
then we first select 4 letters from the
remaining 6 letters. This can be done
in 6C4 ways.
Now, ever y select ion has 4 let ter s
which can be arranged in a row in 4P4
= 4! ways.
Hence, the total number of words
K KUNDAN
= 6C4 4! = 360.
Ex. 92: How many five-letter words containing
3 v owel s and 2 consonant s can be
formed using the letters of the word
EQUATION so that the two consonants
occur together?
Soln: There are 5 vowels E, U, A, I, O and 3
consonant s Q, T, N in the given word
EQUATION.
3 vowels out of 5 and 2 consonants out of
3 can be chosen in (5C3 3C2) ways
Hence, there are ( 5C3 3C2) groups each
containing 3 vowels and 2 consonants.
Now, each group contains 5 letters which
are to be arranged in such a way that 2
consonants occur together.
Considering 2 consonants as one letter,
we have 4 letters which can be arranged
in 4P4 = 4! ways. But 2 consonants can be
put together in 2! ways. Therefore 5 letters
in each group can be arranged in 4! 2!
ways.
Hence, the required number of words
= (5C3 3C2) (4! 2!) = 1440
Difference between a Permutation and a
Combination
( i ) In combinat ion only selection is made
whereas in permutation not only a selection
is made but also an ar rangement in a
definite order is considered.
( i i) In a combinat ion, t he or der ing of t he
671
selected objects is immaterial whereas in
permutation, the ordering is essential. For
example, (A), (B) and (B), (A) are same as
combinations but different as permutations.
( i ii ) Practically to find the permutations of n
different things 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
permut at ions. For example, t he six
permutations ABC, ACB, BCA, BAC, CBA
and CAB corr espond t o the same
combination ABC.
Note: Generally, we use the word arrangements
for permutations and the word selections
for combinations.
Ex. 93: How m any words can be form ed by
taking 4 letters at a time out of the
letters of the word MATHEMATICS?
[MAT2005]
Soln: There are 11 letters viz MM, AA, TT, H,
E, I, C, S. All these letters are not distinct,
so we cannot use nPr . We can choose 4
letters from the following ways:
(i) All the four distinct letters.
(ii) Two distinct and two alike letters.
(iii) Two alike of one kind and two alike
of another kind.
(i) All the four distinct letters: There
are 8 distinct letters viz M, A, T, H, E,
I, C, S out of which 4 can be chosen in
8
C4 ways. So, the total number of groups
of 4 letters = 8C 4. Each such groups
has 4 letters which can be arranged in
(4P4 =)4! ways. Hence the total number
of words = 8C4 4! = 8P4 = 1680
(ii) Two distinct and two alike letters:
There are 3 pairs of alike letters viz.
MM, AA, TT, out of which one pair can
be chosen in 3C1 ways. Now we have
t o choose t wo let ter s out of the
remaining 7 different types of letters
which can be done in 7C 2 ways. So,
the total number of groups of 4 letters
in which two are different and two are
alike in 3C1 7C2. Each such group has
4 let t er s of which 2 are alike and
remaining two distinct and they can
4!
be arranged in ways. Hence the
2!
total number of words in which two
letters are alike
4!
= 3C1 7C2 = 756
2!
(iii) Two alike of one kind and two alike
of other kind: There are 3 pairs of 2
alike letters out of which 2 pairs can
be chosen in 3C 2 ways. So, there are
672
3
C2 groups of 4 letters each. In each
group there are 4 letters of which 2
are alike of one kind and 2 are alike of
other kind. These 4 let t er s can be
4!
arranged in ways. Hence, the total
2!2!
number of words in which two letters
are alike of one kind and two alike of
other kind
4!
= 3C2 2! 2! = 18
From (i), (ii) and (iii), the total number of
four-letter words
= 1680 + 758 + 18 = 2454
Ex. 94: How many four-let ter wor ds can be
formed using the letter of the word
INEFFECTIVE?
Soln: Ther e ar e 11 let t er s in t he wor d
INEFFECTIVE viz. EEE, FF, II, C, T, N, V.
The four-letter words may consist of:
(i) 3 alike letters and 1 distinct letter.
(ii) 2 alike letters of one kind and 2 alike
letters of the second kind.
(iii) 2 alike letters and 2 distinct letters.
(iv) all different letters.
Now we will discuss these four cases
one by one:
(i) 3 alike letters and 1 distinct letter:
K KUNDAN
There is one set of three alike letters
viz. EEE. So, three alike letters can be
selected in one way. Out of t he 6
different letters F, I, T, N, V, C one
let ter can be select ed in 6C 1 ways.
Thus, thr ee alike and one differ ent
letter can be selected in 1 6C1 = 6C1
ways. So, there are 6C1 groups each of
which contains 3 alike letters and one
different letter. These 4 letters can be
4!
arranged in 3!1! ways.
Hence, t he t otal number of words
consisting of three alike and distinct
letters
4!
= 6C1 3!1! = 6C1 4 = 24
(ii) 2 alike letters of one kind and 2 alike
letters of second kind: There are three
sets of two alike letters viz. EE, FF, II.
Out of these three sets 2 can be selected
in 3C2 ways. So, there are 3C2 groups
each of which contains 4 letters out of
which 2 are alike of one type and two
are alike of second type. Now, 4 letters
in each group can be ar r anged in
4!
ways.
2! 2!
Arithmetic
Hence, t he t otal number of words
consisting of two alike letters of one
type and 2 alike letters of second type
4!
= 3C2 2! 2! = 18
(iii) 2 alike and 2 different letters: Out
of 3 sets of two alike letters one set
can be chosen in 3C1 ways. Now, from
the remaining 6 distinct letters, 2 letters
can be chosen in 6C 2 ways. Thus, 2
alike letters and 2 distinct letters can
be selected in (3C1 6C2) ways. So, there
are (3C1 6C2) groups of 4 letters each.
Now, let t er s of each gr oup can be
4!
ar ranged among t hemselves in
2!
ways.
Hence, t he t otal number of words
consisting of two alike letters and 2
distinct letters
4!
= 6C1 6C2 = 540
2!
(iv ) All different letters: There are 7
distinct letters E, F, I, T, N, V, C out of
which 4 can be selected in 7C4 ways.
So, there are 7C 4 groups of 4 letters
each. The letters in each of 7C4 groups
can be arranged in 4! ways. So, the
total number of four-letter words in
which all letters are distinct = 7C4 4!
= 840
Hence, the total number of four-letter
words
= 24 + 18 + 540 + 840 = 1422
Derangement
If there are n different things and n assigned
places then total number of arrangements of n
different things such that none of the things goes
to assigned places. This is called derangement.
Number of derangements
1 1 1 1
= n !1 ... ( 1)n
1! 2! 3! n!
Ex. 95: There are 4 letters and 4 addressed
envelopes corresponding to each of the
letters. Find the number of ways in
which all letters can be put in wrong
envelopes.
Soln: Required number of ways
1 1 1 1
= 4! 1
1! 2! 3! 4!
= 22 24 + 12 4 + 1 = 9