Permutation Combination Quick Rules

Permutation & Combination
In this chapter, we include only rules (ie Quicker Methods) based on the questions asked in the various exams like,
CAT, MAT, XLRI, FMS, Bank PO, AAO, Provident Fund,
CET, UT1 etc. For basics, please refer to 'Magical Book on
Quicker Maths'. Many aspirants find difficulty in understanding the basics of "Permutation and Combination".
Therefore we advise you to go through all the rules discussed in the following pages and try to understand the
detail method'. Still you are unable to understand, just mug
the rules, apply to the appropriate questions and get the
desired answers. Since weightage of this chapter is not much,
only I or 2 questions are asked in the various competitive
exams mentioned above, we again advise you to stick with
these rules your purpose will be served.
= n ( n - l ) ( n - 2 ) . . . ( n - r + 1)
(n-r)
Caution:
n\ ,
,*I
For example,
= 8 x 7 x 6 x 5 = 1 6 8 0 * 1 - 1 ! 2>
4!
U .
V -
(n-r).
Where " P = number of permutations or arranger
Some Important Notations and F o r m u l a e

From the examination point of view the following few
results are useful. Without going into details you should
simply remember the results.
1.
Factorial Notations
The product of n consecutive positive integers beginning with 1 is denoted by n! or |n and read as
factorial n.
Thus according to the definition of |n
Jn = 1 * 2 x 3 ... x ( - 1) x
= n x (n - 1) x ( n - 2 ) x ... x 3 x 2 x l
x
ments of n different things taken r at a time.
4.
ri
re
(n-r)
5.
different things taken r at a time.

From (3) and (4), we have
"P = r ! x "C
r
Total number of arrangements = total no. of groups or

selections * r!.
| 6 = 1 x 2 x 3 x 4 x 5 x 6 = 6 x 5 x 4 x 3 x 2 x 1 = 720
According to the definition of Jn

(a) |n = n x ( n - 1) x ( n - 2 ) x ... x 3 x 2 x ]
= n { ( n - l ) x ( n - 2 ) x . . . x 3 x 2 x 1}
= n(n - 1 ) {(n - 2 ) x ... x 3 x 2 x l } and so on.
.-. |n = n [ n - 1 = n(n - 1) |n - 2
= n ( n - l ) ( n - 2 ) In - 3
(b) If r and n are positive integers and r < n, then
n\ M x ( f l - l ) x ( r t - 2 ) x . . . x ( r + l ) x r x ( r - l ) x . . . x 3 x 2 x l
r\ - l)x(r - 2)x...x3x 2x 1
Where "C,. = number of selections, or groups of n
For example,
2.
"C
If "C = "C then either x = y or x + y = n

x
Number of permutations of n things out of which P

are alike and are of one type, q are alike and are of the
other type, r are alike and are of another type and
remaining [n - (p + q + r)] all are different =
8.
9.
= ( - l X - 2 ) . . ( r + l)
10.
, ,^ .
Number of selections of r things (r < n) out of n

identical things is 1.
Total number of selections of zero or more things from
n identical things = n + 1.
Total number of selections of zero or more things from
PRACTICE BOOK ON QUICKER MATHS
642
n different things
=
= " C + "Cj + " C , + . . . + "C =2"
0
11.
12.
'Cr-l
42!
42x41x40!
2! 40!
2x1x40!
= 21 x 4 1 = 8 6 1
16!
2! ( 1 6 - 2 )
16x15x14!
= 8x15 = 120
2x1x14!
maximum no. of handshakes = 86
(b) 0! = l
120 = 981.
I. Permutations
(c) " C = " C - =
13.
Case 2: Total no. of handshakes among the group of 16 women
(a)
(d) " r
42!
2! ( 4 2 - 2 )
C='
.'
Number of ways to distribute (or divide) n identical

things among r persons where any persons may get
any no. of things =
4 2
Rule 1
!
(n-r)
= "C =1
n
Problems based on direct application of the formula.

n\
"P.
(n-r).-
Some F u n d a m e n t a l Principles of Counting
(a) Multiplication Rule

Suppose one starts his journey from place X and has
to reach place Z via a different place Y.
For Y, there are three means of transport - bus, train
and aeroplane - from X. From Y, the aeroplane service is not
available for Z. Only either by a bus or by a train can one
reach Z from Y. Also, there is no direct bus or train servie for
Z from X. We want to know the maximum possible no. of
ways by which one can reach Z from X.
For each means of transport from X to Y there are two
means of transport for going from Y to Z. Thus, for going
from X to Z via Y there will be 2 (firstly, by bus to Y and again
by bus to Z; secondly, by bus to Y and thereafter by train to
Z.)
+2 (firstly, by train to Y and thereafter by bus to Z;
secondly, by train to Y and thereafter again by train to Z.)
+2 (firstly by aeroplane to Y and thereafter by bus to
Z, secondly by aeroplane to Y and thereafter by train to Z.) =
3 2 = 6 possible ways
We conclude:
If a work A can be done in m ways and another work
B can be done in n ways and C is the final work which is done
only when both A and B are done, then the no. of ways of
doing the final work, C = m x n.
In the above example, suppose the work to reach Y
from X = the work A in m i.e. 3 ways. The work to reach
Z from Y = the work B in n i.e. 2 ways. Then the final work
to reach Z from X == the final work C > in m x n, i.e. 3 x 2 =
6 ways.
Working R u l e
(n-r).
= n(n-\fn-2)...
tor factors.
If LHS is the product of r consecutive integers, express RHS also as the product of r consecutive integers.
Factorise the RHS, find out the greatest factor and tr>
with that factor. I f greatest factor does not suit then
try with greatest factor x least factor. Look at the example given below and try to understand the working
rule.
(ii)
(iii)
when
Work
(0
CO
Illustrative E x a m p l e
Ex:
If "P = 3 6 0 , find n.
4
Soln: Given "P. = 3 6 0

n\
(b) Addition Rule

Suppose there are 42 men and 16 women in a party.
Each man shakes his hand only with all the men and each
woman shakes her hand only with all the women. We have
to find the maximum no. of handshakes that taken place at
the party.
Case 1: Total no. of handshakes among the group of 42 men
n\
P,
(0
360
" (-4)
or, ( - l X - 2 X > 7 - 3 ) = 360 = 6 x 5 x 4 x 3
.-. n = 6
[Here LHS is the product of 4 consecutive integers
therefore, RHS ie 360 is to be expressed as the product of 4 consecutive integers.
360 = 2 x 2 x 2 x 3 x 3 x 5 , greatest of these factors is
5, therefore try with 5.
Integers just before and after 5 are 4 and 6. Both 4 anc
6 are factors of 360. Thus we get four consecuti\
integers 6, 5,4 and 3 whose product is 360.
If 5 does not suit, then try with 2 x 5 i.e. 10 etc.]
Exercise
1.
I f "P = 9 2 4 0 , find n.
2.
If
1 0
p - 7 2 0 , find r.
Soln:
Permutations & Combinations
643
Answers
1.
n\
* 7 =
\n - 3 J!
Hint: Given, " A = 9240
or, ( - l X - 2 ) = 9240 = 2 2 x 2 1 x 2 0
.'. n = 22
[Here 9240 = 2 x 2 x 2 x 3 x 5 x 7 x 1 1 , greatest of those
factors is 11 but it does not serve our purpose, therefore try with 22]
2
Hint:Given,
1 0
10!
P = 720 ' ( _ , . ) =
r
1 0
.-. 10 x 9 x 8 x ...torfactors = 7 2 0 = 10 x 9 x 8
5.
be formed with the digits 0, 1,2, 3, 4, 5 and 6; no digit

being repeated in any number?
a) 480
b)560
c)660
d)580
How many positive numbers can be formed by using
any number of the digits 0, 1,2,3 and 4; no digit being
repeated in any number?
a) 360
b)260
c)620
d)280
Answers
1. a; Hint: [Here nothing has been given about repetition
of digits, therefore, we will assume that repetition of
digits is not allowed.]
Any number between 400 and 1000 must be of three
digits only.
.\3
4 or 5 or 6
Rule 2
Problems based on formation of numbers with digits
when repetition of digits is not allowed.
3 ways
Working Rule
(i)
First of all decide of how many digits the required
numbers will be.
(ii)
Then fill up the places on which there are restrictions
and then apply the formula " p
P ways
2
Since the number should be greater than 400, therefore, hundreds place can be filled up by any one of
the three digits 4, 5 and 6 in 3 ways.
Remaining two places can be filled up by remaining
for filling up the
five digits in P ways.

5
remaining places with remaining digits.
51
.-. Required number = 3

thousands place
hundreds place
tens place
units place
2. d;
Ex.:
How many numbers of four digits can be formed with
the digits 1,2,3,4, and 5? (if repetition of digits is not
allowed).
i p = 3 x - = 60
3!
Hint: Any number between 300 and 3000 must be of 3

or 4 digits.
Case I : When number is of 3 digits.
3 or 4 or 5
Soln:
rlere n = number of digits = 5
and r = number of places to be filled up = 4
. J .
J.^.^L^-l
VT;".',-;..'!
.-. Required number = P = = 5 x 4 x 3 x 2 = 120

4
Exercise
1. How many numbers between 400 and 1000 can be made
with the digits 2,3,4, 5,6 and 0?
a) 60
b)70
c)40
d) 120
2. Find the number of numbers between 300 and 3000 that
can be formed with the digits 0,1,2,3,4 and 5, no digits
being repeated in any number.
a) 90
b) 120
c)160
d) 180
3. Ho/ many even numbers of four digits can be formed
with the digits 0, 1,2, 3, 4, 5 and 6; no digit being used
more than once?
a)300
b)140
c) 120
d)420
4. How many numbers of four digits greater than 23Q0 can
3 ways
/> ways
2
Hundreds place can be filled up by any one of the

three digits 3,4 and 5 in 3 ways.
5
.. Number of numbers formed in this case = 3
p =
5!
3x-=60.
Case I I : When number is of 4 digits
1 or 2
1
2 ways
P ways
3
Thousands place can be filled up by any one of the
644
PRACTICE BOOK ON QUICKER
of 3 , 4 , 5 , 6 occurs at thousands' place the number will

be definitely greater than 2300 but when 2 occurs at
thousands' place there will be also restriction on hundreds' place to make the number greater than 2300.]
Case I : When 2 occurs at thousands' place:
two digits 1 and 2 in 2 ways and remaining three places

can be filled up by remaining five digits in P ways.
5
.-. Number of numbers formed in this case

,
= 2*
3. d;
5!
3
MATHS
= 2 x = 120
3 or 4 or
.-. Required number = 60 + 120 = 180

H i n t : Each even number must have 0 , 2 , 4 or 6 in its
units' place.
Here total number of digits = 7.
5 or
1 way
4 ways
1
5
ways
Thousands' place can be filled up by 2 in 1 way and

hundreds' place can be filled up by any one of the
four digits 3,4, 5 and 6 in 4 ways.
0 or 2 or 4 or 6
[When 0 occurs at units place there is no restriction

on other places and when 2 or 4 or 6 occurs at units
place there is restriction on thousands place as 0 can
not be put at thousands' place.]
Case I : When 0 occurs at units' place

5

= ] x 4 x p , = 4 x = 80
5
3!
i
6
Case I I : When anyone of 3,4,5 and 6 occurs at thousands' place:
ways
3 or 4 or 5 or 6
1 way
Units place can be filled up by 0 in 1 way and remaining three places can be filled up by remaining 6 digits
4 ways
in P ways.
6
I
6
ways
Thousands' place can be filled up by any one of the

four digits 3 , 4 , 5 and 6 in 4 ways and remaining three
.-. Number o f numbers formed in this case =
places can be filled up by remining six digits in P

6
l x P = = 120
6
ways.
3!
Case I I : When 0 does not occur at units' place.
3
. 4 x A = 4 x = 480
3!
6
any one of remaining six

digits except zero
2 or 4 or 6
5.b;
.-. Required number = 80 + 480 = 560

H i n t : Case I : When number is of five digits:
1 or 2 or 3 or 4
5 ways
'
P ways
2
3 ways
Ten thousands' place can be filled up by any one of

the four digits 1,2,3 and 4 in 4 ways and the remaining four places can be filled up by the remaining four
digits in P ways.
51
x3 x p
5
4 ways
4. b;
Units' place can be filled up by any one of the three

digits 2 , 4 and 6 in 3 ways.
Thousands place can be filled up by any one of the
remaining six digits except zero in 5 ways.
=15 x
- = 300
.-. Required number = 120 + 300 = 420

H i n t : [Since number must be of four digits and greater
than 2300, therefore any one of the five digits 2 , 3 , 4 ,
5 and 6 will occur at thousands' place. When any one
P ways
4
.-. Number of numbers formed in this case = 4 x p

4
Case I I : When number is of four digits.

1 or 2 or 3 or 4
i
4 ways
i
4
P ways
3
645
.-. Number of numbers formed in this case = 4 x P

4
2.
Case I I I : When number is of three digits?

or 2 or 3 or 4
3.
4 ways
P ways
2
.-. Number of numbers formed in this case = 4x P

4
Case IV: When number is of two digits:
4.
1 or 2 or 3 or 4
4 ways
a) 243
b)343
c)433
d)2187
A telegraph has 5 arms and each arm is capable of 4
distinct positions, including the position of rest. What
is the total number of signals that can be made?
a) 1023
b)1024
c)3124
d)3125
A letter lock consists of three rings each marked with 10
different letters. In how many ways it is possible to make
an unsuccessful attempt to open the lock.
a) 1000
b)999
c) 1001
d) None of these
How many numbers greater than 1000 but not greater
than 4000 can be formed with the digits 0,1,2,3,4 repetition of digits being allowed.
a)357
b)375
c) 135
d) None of these
Answers
lb;
Hint:
P, ways
1st prize
2nd prize
.-. Number of numbers formed in this case = 4x A,

4
Case V: When number is of one digit:

Number of positive numbers formed in this case = 4
.-. Required number
= 4x P +4x P +4x P +4x P,+4
4
= 96 + 96 + 48+16 + 4 = 260
Rule 3
2. a;
Number of permutations when repetition is allowed:
> same arm
.-. Required number = 4 _ ] = ] 023

Hint: Two rings may have same letter at a time but
same ring cannot have two letters at a time, therefore,
we must start with ring.
5
3.b;
. 1st Friend
same friend; ,
,,
2nd Friend > same servant
.-. Required number = 3 x 3 x 3 x 3 x 3 x 3 = 3<> = 729.
Two arms may have same position but one arm cannot have two positions at a time, therefore, we must
start with arm.]
Each of the 5 arms can have any one of the 4 positions in 4 ways. But all the 5 arms will be in rest position in l x i x i x i x l = l way and in this case no
signal will be made.
n r
Here we observe that invitation cards cannot be sent

to the same friend by different servants but invitation
cards may be sent to different friends by the same
servant. Thus same servant may be repeated for different friends, therefore, we must start with friend.
Invitation cards may be sent to each of the six friends
by any one of the three servants in 3 ways.
Two prizes can be given to the same boy but two

boys cannot get the same prize, therefore, we must
start with prize.]
Each of the three prizes can be given away to any one
of the 7 boys in 7 ways.
.-. Required number 7 x 7 x 7 = 343.
Hint:
= n x n x n .... r times = .
Note: In such type of problems, you have to first determine
as to which item can be repeated. And consider the
value of repeated item as 'r' in the above formula.
1st Servant
2nd Servant
1 st arm
same position;
Position
2nd position
2nd arm >
Working Rule:
Number of permutations of n different things taken r at a time
when things can be repeated any number of times.
Ex.:
A gentleman has 6 friends to invite. In how many
ways can he send invitation cards to them i f he has
three servants to carry the cards.
Soln:
.
1 st Boy
same boy;
*
-> same prize
4.b;
Each of the three rings can have any one of the 10

different letters in 10 ways.
.-. Total number of attempts = 10 x 10 x 10= 1000
But out of these 1000 attempts only one attempt is
successful.
.*. Required number of unsuccessful attempts
= 1000-1=999
Hint: We have to form a 4 digit number x such that
100<x<4000.
Clearly, number of such numbers = number of 4 digit
numbers y such that 1000 < y < 4000. Any number
Exercise
1. In how many ways 3 prizes can be given away to 7 boys
when each boy is eligible for any of the prizes.
greater than or equal to 1000 but less than 4000 must

be of 4 digits and digits at its thousands place must
646
PRACTICE B O O K ON Q U I C K E R MATHS
Now there are 8 places for 3 girls
be 1 or 2 or 3.
1 or 2 or 3
.-. 3 girls can be arranged in P, ways
0 or 1 or 2 or 3 or 4
1
5 ways 5 ways
5 ways
3 ways
Thousands' place can be filled up by any one of the
three digits 1,2 and 3 in 3 ways.
Hundreds', tens' and units' places can each be filled
by any one of the five digits 0, 1,2,3 and 4 in 5 ways.
.-. Required number = 3 x 5 x 5 * 5 = 375
.-. Required number of ways = P

a
7.
71 = x /.
Quicker Method: Applying the above theorem, we

have
Required answer =
7+1
8!
P3 7!=x7!
X
Exercise
1. In how many ways can 8 I.A. and 6 I.Sc. students be
Theorem: If there are two groups A and B consisting of'm'
seated in a row so that no two of the I . Sc. students may
and 'n' things respectively, then the number of ways in which
sit togther?
no two of group B occur together are given by
P x ml).
9!8!
8!7!
9!8!
a)
b) -c) ~
d) None of these
Provided that n<mJ!
2!
4!
2. In how many ways can 6 I.A. and 4 I.Sc. students be
Illustrative E x a m p l e s
seated in a row so that no two of the I . Sc. students may
Ex. 1: In how many ways can 7 I.A. and 5 I.Sc. students be
sit togther?
seated in a row so that no two of the I . Sc. students
7!3!
7!6!
7!3!
may sit togther?
a)
b)
c)
d) Can't be determined
Soln: Detail Method: Here, there is no restriction on I.A.
students, therefore, first we must fix the positions of
3. In a class of 12 students, there are 4 girls. In how many
7 I.A. students.
different ways can they be arranged in a row such that
x I.A. x I.A. x I.A. x I.A. x I.A. x I.A. x l.A. x
no two of the three girls are consecutive?
Now 7 I.A. students can be seated in a row in 7! ways.
9!8!
9!8!
9!5!
9!8!
Now i f I.Sc. students sit at the place (including the
two ends) indicated by ' ' then no two of the five
a)
b)
c )
d )
I.Sc. students will come together.
4. In a class of 15 students, there are 5 girls. In how many
Now there are 8 places for 5 I.Sc. students
different ways can they be arranged in a row such that
no two of the three girls are consecutive?
.-. The five I.Sc. students can be seated in P ways
Rule 4
ir
^r
11110!
a)
,,
11110!
b)
j!
8
x J] = x7!

have,
required answer =
7+1
.-. Required number of ways in which 7 I.A. students

and 5 I.Sc. students can sit = P
ir
8!
%*7!=^x7!
Ex.2:
In a class of 10 students, there j r ^ 3 girls. In how

many different ways can they be arranged in a row
such that no two of the three girls are consecutive?
Soln: Detail Method: Number of girls = 3, number of boys =
7. Since there is no restriction on boys, therefore first
of all fix the positions of the 7 boys.
Now 7 boys, can be arranged in a row in 7! ways.
xBxBxBxBxBxBxBx
If the positions of girls are fixed at places (including

the two ends) indicated by crosses, no two of three
girls will be consecutive.
Answers
l.a
2.b
11110!
c)
o!
3.a
-,
8!
d) None of these
4.b
Rule 5
Theorem: The number of ways in which 'n' examination
papers can be arranged so that the best and the worst papers never come together are given by [ ( - 2 ) x ( - ] ) ] ways.
Ex.:
In how many ways can 10 examination papers be arranged so that the best and the worst papers never
come together.
Soln: Detail Method: The number of permutations of 10
papers when there is no restriction = P = 10!
When the best and the worst papers come together,
regarding the two as one paper, we have only 9 pal 0
] 0
647
But the three girls can be arranged among themselves
in 3! ways
.-. number of ways when three girls are together
pers.
These 9 papers can be arranged in P = 9 ! ways
9
But these two papers can be arranged among themselves in 2! ways.

.-. number of arrangements when the best and the
worst papers do not come together
= 6! x 3 !
.-. Required number of ways in which all the three

girls do not sit together = 8 ! - 6 ! x 3! = 6! (8 * 7 - 6 )
= 50x61=36000.
= 101-9! x 2 ! = 9 ! ( 1 0 - 2 ) = 8 x 9 ! .

have
the required no. of ways = (5 + 3)! (5 + 1)! x 3!

have,
the required number of ways = ( 1 0 - 2 ) x ( l 0 - l ) !
= 8x91=8x9!
Note: The number of ways in which ' n ' books may be arranged on a shelf so that two particular books shall
not be together is [(n - 2) x (n - 1)!]
Exercise
1. In how many ways can 12 examination papers be arranged so that the best and the worst papers never come
together.
a) 1 0 x 1 1 !
2.
3.
b) 1 2 x 1 1 !
c) 1 0 x 1 2 !
d) 1 0 ! x l l !
In how many ways can 15 examination papers be arranged so that the best and the worst papers never come
together.
a) 13! x 14! b) 1 3 x 1 0 !
c) 13x14! d)Noneofthese
Find the number of ways in which 21 books may be
arranged on a shelf so that the oldest and the newest
books never come together.
a) 19! x 20!
b) 1 9 x 2 1 !
c) 19 x 20!
Answers
l.a
2.c
3.c; Hint: See Note.
= 8!-6! x 3! = 5 0 x 6 ! =36000.
Note: There are'm' boys and ' n ' girls. The no. of ways in
which they can be seated in a row so that all the boys
do not sit together are given by [(m + n)! - (n + 1)!
m!] ways.
x
Exercise
1. There are 3 boys and 2 girls. In how many ways can they
be seated in a IOW so that all the three boys do not sit
together.
a)72
b)42
c)172
d) 190
2. There are 8 boys and 4 girls. In how many ways can they
be seated in a row so that all the girls do not sit together,
a) 1320x9!
c) 1344x9!
3.
b) 1296 x 9!
d) 1296x 12!
There are 9 boys and 5 girls. Find the no. of ways in

which they can be seated in a row so that all the boys do
not sit together.
a)240240x9!
c)240234x9!
b)240240x5!
d)240236x9!
Answers
l.a
2.b
3. c; Hint: See Note.
Rule 6
Theorem: There are 'm' boys and 'n'girls. The no. of ways
in which they can be seated in a row so that all the girls do
not sit together are given by [(m + ) - (m +1) x ri\
Note: This rule is different from the Rule-I. In Rule-I, "o
two occur together" is given whereas in this rule "all
the girls do not sit together" is given.
Ex.:
There are 5 boys and 3 girls. In how many ways can
they be seated in a row so that all the three girls do
not sit together.
Soln: Detail Method: Total number of persons = 5 + 3 = 8
When there is no restriction they can be seated in a
row in 8! ways.
But when all the three girls sit together, regarding the
three girls as one persons, we have only 5 + 1 = 6
persons.
These 6 persons can be arranged in a row in 6! ways.
Rule 7
Theorem: The number of ways in which m boys and'm'
girls can be seated in a row so that boys and girls are alternate are given by 2(m! ml) ways.
Ex.:
In how many ways 4 boys and 4 girls can be seated in
a row so that boys and girls are alternate?
Soln: Detail Method:
Case I : When a boy sits at the first place:
Possible arrangement will be of the from
B
Now there are four places namely 1 st, 3rd, 5th and 7th
for four boys, therefore, four boys can be seated in 4!
ways. Again there are four places namely 2nd, 4th,
6th and 8th for four girls.
.-. four girls can be seated in 4! ways.
.-. Number of ways in this case = 4! 4!
648
Case I I : When a girl sits at the first place, possible
arrangement will be of the form
G
row so that they are alternate?

a)2(5!4!)
b)4!4!
c)2(4!4!)
Answers
l.a
2.a
.-. Number of arrangements in this case = 4! 4!

.-. Requirednumber = 4!4!+4!4!=2(4!4!)= 1152.
have
the requ ired answer = 2 (4! 4!) = 1152.
Exercise
1. In how many ways 3 boys and 3 girls can be seated in a
row so that boys and girls are alternate?
a) 9
b)36
c)72
d) Data inadequate
a) 14400
b) 28800
c) 28000
d) None of these
a) 4
b)2
c)8
d) 16
Answers
l.c
2.b
3.c
d)5!4!
3.d
Rule 9
Theorem: .'.'< ..unber of ways in which 'm' persons of a
particular group, caste, country etc. and'm' persons of the
other group, caste, community, country etc can be seated
along a circle so that they are alternate, given by [m! (m 1)!J ways.
Ex.:
In how many ways can 5 Indians and 5 Englishmen
be seated along a circle so that they are alternate?
Soln: Detail Method: 5 Indians can be seated along a circle
in 4! ways [See Note in Rule - 10].
If the Englishmen sit at the places indicated by cross
' ' then Indians and Englishmen will be alternate.
x
Rule 8
Theorem: The number of ways in which m boys and (m - 1 )
girls can be seated in a row so that they are alternate is
given by [m! (m - 1)!] ways.
Ex.:
In how many ways 4 boys and 3 girls can be seated in
a row so that they are alternate?
Soln: Detail Method: Possible arrangement will be of the
form
B
There are four places namely 1 st, 3rd, 5th and 7th for
four boys.
.-. Four boys can be seated in 4! ways. Again there
are three places namely 2nd, 4th and 6th for three
girls.
.-. Three girls can be seated in 3! ways
.-. Requird number = 4! 3! = 144
have
the required answer = 4! 3! = 144.
Exercise
1. In how many ways 10 boys and 9 girls can be seated in
a row so that they are alternate?
a)10!9!
b) 10111!
c ) 9 ! l l ! d) Data inadequate
row so that they are alternate?
a)8!7!
b)2(8!7!)
c)8!8!
d)8!9!
Now there are 5 places for 5 Englishmen.

.-. 5 Englishmen can be seated in 5! ways.
.-. Required number = 4! 5!.
have,
the required number = 4! 5!.
Exercise
1. In how many ways can 4 Indians and 4 Englishmen be
seated along a circle so that they are alternate?
a)2(4!3!)
b)4!4!
c)4!3!
d)4!5!
a)6!5!
b)6!6!
c)2x6!5! d) None of these
a)8!8!
b)8!9!
c)8!7!
d) None of these
Answers
l.c
2.a
3.c
Rule 10
Theorem: A round table conference is to be held between
'n' delegates. The no. of ways in which they can be seated
so that'm 'particular delegates always sit together are given
by f(n - m)! x ml] ways.
Ex.:
A round table conference is to be held between 20
649
delegates of 20 countries. In how many ways can

they be seated if two particular delegates are always
to sit together?
Soln: Detail Method: Regarding two particular delegates
who are to sit together as one person, we have only
18+1 = 19 persons. These 19 persons can be seated
at the round table in 18! ways. [See Note]
But two particular persons can be arranged among
themselves in 2! ways.
.-. Required number = 18! 2!
have
and anticlockwise arrangements are not different,

therefore, 6 beads can be arranged to form a necklace
(6-l)
in - ways =
5x4x3x2x1
= 60 ways

have,
the required no. = \ = -j = 60 ways. [See Note
of Rule 10].
the required number = ( 2 0 - 2 ) ! * 2! = 18! * 2!

Note: Always remember the following results based on the
Circular Permutations.
1. Number of circular arrangements of 'n' different
things = (n - 1)!.
2. When clockwise and anticlockwise arrangements
are not different, number of circular arrangements
Exercise
1. Find the number of ways in which 7 different beads can
be arranged to form a necklace.
6!
5!
4!
d) None of these
a) b) c)
2
2
'2
Find the number of ways in which 8 different beads can
8!
7!
9!
6!
a)b ) c)d)
2
''2
''2
' 2
Find the number of ways in which 12 different beads can
of'n'different things = ( " - l ) Exercise

1. A round table conference is to be held between 18 delegates of 3 countries. In how many ways can they be
seated i f two particular delegates are always to sit together?
a) 15!* 3!
b) 18! 3!
c)15!*5!
d) Data inadequate
seated i f two particular delegates are always to sit together?
a)13!><3!
b)15!2!
c) 13**21
d)12!><2!
seated i f two particular delegates are always to sit together
9
a) 16!* 5!
Answers
l.a
2.c
b)ll!><5!
c)11!*4!
d) None of these
3.b
Rule 11
Theorem: The number of ways in which 'n'different beads
-(-!)
can be arranged to form a necklace are given by
11!
a)y
Answers
l.a
2.b
10!
12!
c)
d)None of these
3. a
Rule 12
(0
To find the number of permutations of n things taking

all at a time when p of them are similar and of one
type, q of them are similar and are of another type, r of
them are similar and are of third type and the remaining [ - ( / ? + <? + /-)] are all different.
The required number of permutations
(ii)
p\!
If a work A can be done in m ways and another work

B can be done in n ways and C is the final work which
is done only when both A and B are done, then the
no. of ways of doing the final work C = m x n.
Illustrative E x a m p l e s
Ex. 1: Find the number of permutations of the letters of the
word "Pre-University".
Soln: There are 13 letters in the word Pre-University in which
there are two e's two i's, two r's and 7 others are
different letters.
ways.
Ex.:
Find the number of ways in which 6 different beads
can be arranged to form a necklace.
Soln: Detail Method: Since in forming a necklace clockwise
13!
.-. Required number of permutations = 2\
Ex.2: How many different words can be formed with the
letters of the word 'University'; so that all the vowels
650
Soln: Total number of letters = 10; number of vowels = 4; i
occurs twice.
Now, when 4 vowels are together, regarding the 4
vowels as one letter, we have only 6 + 1 = 7 letters.
Now these 7 letters can be arranged in 7! ways.
Since i occurs twice, therefore, four vowels can be
12! ,
.-. Required number of rearrangements = ~ ^ 7 '
-
2.b;
Hint: Total number of letters = 8;

number of vowels = 3 r occurs twice.
Total number of arrangements when there is no re8!
4!
striction
arranged among themselves in ways.
2!
When three vowels are together, regarding them as

one letter, we have only 5 + 1 = 6 letters.
4!
6!
.-. Required number = 7! * =60480
These six letters can be arranged in ways, since r
Exercise
1.
In how many ways can the letters of the word 'civilization'12!be rearranged?
13'
12!
a)
b)-TT-1
c) 1
d)Noneofthese
4!
4!
5!
occurs twice.
In how many ways can the letters of the word 'Director'

be arranged so that the three vowels are never together?
a) 1800
b) 18000
c) 16000
d)1600
Find the number of rearrangements of the letters of the
word 'Benevolent'. How many of them end in 11
3)302400,30239
b) 302399,30239
c) 302399,30240
d) None of these
How many words can be formed with the letters of the
word 'Pataliputra' without changing the relative order
of the vowels and consonants?
a) 3600
b)6300
c)3900
d)4600
How many different words can be formed with the letters of the word 'Pencil' when vowels occupy even
places.
a) 140 b) 147 c) 144 d) Can't be determined
How many different words can be formed with five given
letters of which three are vowels and two are consonants, no two vowels being together in any word?
a) 12
b) 16
c) 18
d) 10
Letters of the word DIRECTOR are arranged in such a
way that all the vowels come together. Find out the total
no. of ways for making such arrangement.
a) 4320
b)2720
c)2160
d) 1120
(SBIPO Exam 1999)
How many different letter arrangements can be made
from the letters of the word RECOVER?
a) 1210
b)5040
c) 1260
d) 1200
(SBI Associates PO 1999)
Hence number of arrangements when the three vow-
But the three vowels can be arranged among themselves in 3! ways.
2.
3.
4.
5.
6.
7.
8.
Answers
1. b; Hint: There are 12 letters in the word 'civilization' of
which four are i's and others are different letters.
.-. Total number of permutations =
But one word is civilization itself
el
els are together = * 3!
3.c;
.-. Required number

*-^x3!=-(8.7-6)=18000
2! 2!
2!
Hint: There are ten letters in the word benevolent of
which three are e's and two are n's. 10!
= 302400
.-. Total number of arrangements = 31 21
=
But one word is benevolent itself

10!
\r of re-arrangements = y j \
- 1 =302399
2nd part: When / is put in the end, number of remaining letters is 9 of which three are e's and two are n's
number of words ending in / = y
4. a;
9!
^ ; 30240
Hint: There are eleven letters in the word 'Pataliputra'

and there are two p's, two t's, three a's and four other
different letters.
Number of consonants = 6, number of vowels = 5
Since relative order of the vowels and consonants
remains unchanged, therefore, vowels will occupy
only vowel's place and consonants will occupy only
consonant's place.
Now 6 consonants can be arranged among them6!
selves in
^ 21
12!
[v there are two p's and two t's] and five vowels can
4T
.5!
be arranged among themselves in ways, since a
651
occurs thrice
6! 5!
.-. Required number = ^ T ^ ^ 7
x
5. c;
3600
Hint: There are 6 letters in the word 'pencil' and no

letter is repeated. There are two vowels e and i
Places are:
1st
2nd
3rd
4th
5th
6th
Even places are: 2nd, 4th and 6th

Now there are three even places for two vowels
.-. 3 vowels can be arranged in P = 3 != 6 ways.
3
6. a;
Four consonants can be arranged in remaining four

places in 4! = 24 ways
.-. Required number = 6 x 24 = 144
Hint: Since there is no restriction on consonants,
therefore, first of all we arrange the two consonants.
Two consonants can be arranged in 2! ways.
Now if the vowels are put at the places (including the
two ends) indicated by the
then no two vowels
will come together
X
consonant
consonant
There are three places for three vowels and hence the
three vowels can be arranged in these three places in
3
7. c;
P = 3! ways.
3
Hence number of words when no two vowels are together = 2! x 3 ! = 12

Hint: Taking all vowels (IEO) as a single letter (since
they come together) there are six letters with two 'R's.
6!
Hence no. of arrangements = 3! = 2160.
x
[3 vowels can be arranged in 3! ways among themselves, hence multiplied with 3!.]
8. c;
7!
Hint: Possible arrangements are ^ j r : = 1260
[Division by 2 times 2! is because of the repetition of
E and R]
Rule 13
To find the number of permutations, when certain
things occur together, we do not have a general formula. But
the following example will illustrate the concepts involved
in this kind of questions.
Ex.:
In how many ways can 8 Indians, 4 Americans and 4
Englishmen be seated in a row so that all persons of
the same nationality sit together.
Soln: Regarding all persons of the same nationality as one
person we have only three persons.

These three persons can be seated in a row in 3! ways.
But 8 Indians can be arranged among themselves in
8! ways, 4 Americans can be arranged among themselves in 4! ways and 4 Englishmen can be arrranged
among themselves in 4! ways.
.-. Requirednumber = 3! 8! 4! 4!
Exercise
1. There are 20 books of which 4 are single volume and the
other are books of 8, 5 and 3 volumes respectively. In
how many ways can all these books be arranged on a
shelf so that volumes of the same book are not separated.
a)7!8!5!3!
b)7!8!4!3!
c)7!6!5!3!
d) None of these
2. A library has two books each having three copies and
three other books each having two copies. In how many
ways can all these books be arranged in a shelf so that
copies of the same book are not separated.
a) 120
b) 180
c)160
d) 140
3. 4 boys and 2 girls are to be seated in a row in such a way
that two girls are always together. In how many different
ways can they be seated?
a) 120
b)720
c) 148
d)240
(BSRB Guwahati PO 1999)
4. In how many different ways can the lettes of the word
JUDGE be arranged so that the vowels always come
together?
a) 48
b)24
c)120
d)60
(SBI BankPO 2001)
Answers
1. a; Hint: [Volumes of the same book are not to be separated ie all volumes of the same book are to be kept
together.] Regarding all volumes of the same book as
one book, we have only 4 + 1 + 1 + 1 = 7 books.
These seven books can be arraned in 7! ways. Volumes of the book having 8 volumes can be arranged
among themselves in 8! ways, volumes of the book
having 5 volumes can be arranged among themselves
in 5! ways.
And volumes of the book having 3 volumes can be
arranged among themselves in 3! ways.
.-. Required number = 7! 8! 5! 3!
2. a; Hint: Regarding all copies of the same book as one
book, we have only 5 books.
These 5 books can be arranged in 5! ways. But all
copies of the same book being identical can be arranged in only one way.
.-. Required number = 5! * 1 x 1 * 1 * 1 x 1 = 120
3. d; Hint: Assume the 2 given students to be together ie
(one). Now there are 5 students.
Possible ways of arranging them are 5! = 120
652
4. a;
Now they (two girls) can arrange themselves in 2!

ways.
Hence, total ways = 120 x 2 = 240
Hint: Required number=4!2! = 48.
II. Combinations
Rule 1
Problems based on direct application of the following formulae.
Illustrative Example
Ex.:
Find the number of ways in which 5 identical balls

can be distributed among 10 identical boxes, i f no;
more than one ball can go into a box.
Soln: Number of boxes = 10 and number of balls = 5.
Now distributing 5 balls among 10 boxes, when not
more than one ball can go into a box amounts to selecting boxes from among the 10 boxes. This can be
done in C
l 0
ways.
Required number of ways

(ii) x _ , +
"c = "
r
+ 1
If C
1 5
3 f
1.
Ex.:
15
r+3
2.
,findr.
Soln: We know that i f " C = "C , then x = y

x
3.
or, x + y = n
L
3r
Answers
1. b;
Hint: Total no. of persons = 8 + 7=15

i5
No. of groups
b) 10
c)13
2. d;
3
10!
i0!
3! ( 1 0 - 3 )
3!7!
n\)
33
6l(-6)l
(-3)
6! 9!
Hint: Required number of ways =
Hint: Given " C : "~ C = 33:4

6
6!(l5-6)
6x5x4x3x2x1
d) 12
Answer
1. a;
15!
15x14x13x12x11x10
Find n, i f " C : " " C = 3 3 : 4

3
15!
Exercise
a) 11
= 252
How many groups of 6 pesons can be formed from 8 mer

and 7 women?
a) 5000
b)5005
c)5050
d) None of these
There are 10 oranges in a basket. Find the no. of ways in
which 3 oranges are chosen from the basket.
a) 125
b)140
c) 110
d) 120
There are 25 students in a class. Find the number of
ways in which a committee of 3 students is to be formed
a) 2200
b)2300
c)2400
d)3200
possible, since r is an integer.

or,3r + r + 3 = 15, which gives r = 3. Hencer = 3.
HxS
r+3
.-. either 3r = r + 3, which gives r = % which is not
1.
10!
C< =
Exercise
(iii) I f "C = "C then either x = y o r x + y = n

x
J
:
3. b;
nl
3! 33
-x =
'{n-3y&r
4
= 5005
C
10x9x8
=
3x2
120
Hint: Required no. of ways

=
2 5
25x24x23
1x2x3
= 2300
0T
o r
(w-l)(w-2)_33
'
6.5.4
4
Rule 3
Theorem: The number of triangles which can beformed bi
joining the angular points of a polygon of m sides as verti-
or, ( M - i X - 2 ) = 6.5.33= 11.3.3.2.5

or, / ? ( - l X - 2 ) = 11.(3.3).(2.5)= 11.10.9
.-. n = 11
ces are
m(m-\\m-2)
7
Rule 2
Problems based on number of combinations.
(i) In simple cases
(ii) When certain things are included or excluded.
Ex.:
Find the no. of triangles formed by joining the vences of a polygon of 12 sides.
Soln: Detail Method: A polygon of m sides will have n
vertices. A triangle will be formed by joining any thres
653
vertices of the polygon.
12x9
No. of triangles formed =
_ mx(m-l)x(m-2)x(w-3)_
Quicker Method: Applying the above rule, we have

the required no. of diagonals
!(-3)
Putting m = 12, we get

12x11x10
= 220
7
1.
2.
12x11x10
the required no. of triangles =
3.
= 220
4.
Exercise
Find the no. of triangles formed by joining the vertices
of a hexagon.
a) 15
b) 18
c)20
d)24
of a septagon.
a) 42
b)35
c)32
d)45
of a octagon.
d)49
b)64
c)42
a) 56
Answers
Answers
l.a
2.b
3. a
4. a; Hint: No. of sides of a decagon is 10.
.-. required no. of diagonals
2.b
10x(l0-3)
:
= 35.
Rule 5
If there are'm' horizontal and 'n' vertical lines, then
the no. of different rectangles formed are given by
( C x"C ).
m
l.c
= 54
2
Find the no. of diagonals of a hexagon.

a) 9
b) 18
c)12
d) 15
Find the no. of diagonals of a septagon.
a) 16
b) 14
c)12
'd)18
Find the no. of diagonals of a octagon.
a) 20
b)24
c)16
d)28
How many diagonals are there in a decagon?
a) 35
b)40
c)49
d)45
Quicker Method: Applying the above rule, we have
3.
12x9
Exercise
required no. of triangles =
12x(l2-3)
i
2
ffix(m-l)x(m-2)
6x(OT-3)
I.
= 54.
3. a
Illustrative Examples
Rule 4
Theorem: The number of diagonals which can be formed
by joining the vertices of a polygon of'm' sides are
m(m-3)
Ex. 1: In a chess board there are 9 vertical and 9 horizontal

lines. Find the no. of rectangles formed in the chess
board.
Soln: Applying the above rule, we have the total no. of
rectangles = C x C
9
= 3 6 x 3 6 = 1296.
Ex.2:
v, V , H ,
y,
H,
Ex.:
Find the no. of diagonals of a polygon of 12 sides.
Soln: Detail Method: A polygon of m sides will have tn
vertices. A diagonal or a side of the polygon will be
formed by joining any two vertices of the polygon.
No. of diagonals of the polygon + no. of sides of the
polygon (=m) =
No. of diagonals of the polygon = '"C-, -m
H,
H
H
H
4
Count the total number of rectangles in the given

figure.
Soln: Applying the above rule, we have the no. of required
rectangles _
mi
2!(m-2)
m=
-- m
2
m(m-3)
2
2
Putting m = 12, we get the reqd. no. of diagonals =
C,x C
4
= 1 5 x 6 = 90.
Exercise
1.
m{m-\)-1m
2.
10 parallel lines are intersected by 13 other parallel lines.

Find the no. of parallelograms thus formed. a)3150
b)3510
c)3610
d)3501
ABCD is a rectangle. Count the no. of rectangles in the
given figure.
654
2.
D
b) 38800
a) 37800
C
c) 38700
d) None of these
In a party every person shakes hands with every other

persons. I f there was a total of 45 handshakes in the
party, find the no. of persons who were present in the
party.
a) 9
b) 10
c) 11
d) 12
party.
a) 15
b) 14
c)16
d) 12
party.
a) 15
b) 18
c) 16
d) None of these
On the occasion of a certain meeting each member gave
shakehand to the remaining members. I f the total
shakehands were 28, how many members were present
for the meeting?
a) 14
b)7
c)9
d)8
(NABARD 1999i
3.
Answers
1. b;
Hint: Required no. of parallelograms

=
1 0
Cx
l 3
C,
10!
4.
13
-x2!(l0-2) 2!(l3-2)
_ 10x9x13x12
5.
4
2. a
Rule 6
Theorem: In a party every person shakes hands with every
other persons. If there was a total of H handshakes in the
party, the no. of persons 'n' who were present in the party
n(n-\)
Answers
1. d;
Hint: Applying the given rule, we have
can be calculatedfront the equation given as - = n .

2.b
3. a
4.c

persons. If there was a total of 210 handshakes in the
party.
Soln: Detail Method: For each selection of two persons
there will be one handshakes. So, no. of handshakes
in the party = "C , where n = no. of persons.
28
5.d
Rule 7
Ex.:
8(8-1).
required no. of handshakes
Theorem: There are'm' members in a delegation which is

to be sent abroad. The total no. of members is 'n'. The no. of
ways in which the selection can be made so that a particular 'r' members are always
(i) included, is given by {"' C _,)
r
and
(ii) excluded, is given by ("~ C )

r
Now, "C =210

(given)
= 210
or,
o r ,n
n xx ((n--l1) )= 2 x ( 2 x 3 x5 x 7 ) = 21 x20
.-. n = 21
have,
n
n\n l)
the required no. of persons = W = 210
\. n = 21.
Exercise
1.
8 men entered a lounge simultaneously. If each person

shook hands with the other then find the total no. of
handshakes.
a) 16
b)36
c)56
d)28
(BSRB Bangalore PO 2000^
Ex.:
There are 5 members in a delegation which is to be

sent abroad. The total no. of members is 10. I n n \
many ways can the selection be made so that a particular member is always (i) included (ii) excluded"?
(i) Selection of one particular member can be done n
= C, = 1 way. After the selection of the particu r
1
member, we are left with 9 members and for the de egation, we need 4 members more. So selection car
be done in C
9
ways.
.-. required no. of ways of selection = C , x C,

1
1x9x8x7x6
24
= 126.
655
.-. required no. of ways of selection = ' C , x C

9
Now 3 points can be selected out of 10 points in
= 126
24
ofthem arecolline3r=
(ii) When one particular person has to be always

excluded from the 5-member delegation, we are left
with 1 0 - 1 = 9 persons. So selection can be done in
9
ways.
.-. number of triangles formed by 10 points when no 3
1x9x8x7x6
]b
1 0
(i)
Similarly, the number of triangles formed by 4 points

when no 3 ofthem are collinear = C
4
(ii)
ways.
Now let the four points become collinear, then C
4
,-. required no. of ways = C = 126

9
Quicker Method:
(i) Applying the above theorem, we have
the required number =
1 0 - 1
C ^ , = C =126
9
triangles formed by these 4 points vanish.

.'. Required number of triangles formed
, 0
C - C = 1 2 0 - 4 = 116
3
have,
(ii) Applying the above theorem, we have,
the required number =
1 0 - 1
Exercise
There are 4 members in a delegation which is to be sent
abroad. The total no. of members is 8. In how many ways
can the selection be made so that a particular member is
always (i) included (ii) excluded?
a) 35,35
b)35,40
c)36,32
d) None of these
abroad. The total no. of members is 7. In how many ways
can the selection be made so that a particular member is
a)3,20
b)4,21
c)3,18
d)5,20

abroad. The total no. of members is 18. In how many
ways can the selection be made so that 2 members are
a)8800,4920
b) 8008,4290
c) 8008,4920
d) None of these
swers
La
2.a
, 0
C 3
C =120-4
3
= 116.
Exercise
1. There are 12 points in a plane out of which 5 are collinear. Find the number of triangles formed by the points
as vertices.
a)200
b)205
c)210
d)220
as vertices.
a) 816
b)796
c)820
d)790
as vertices.
a) 360
Answers
l.c
2.b
b)368
c)364
d) None of these
3.a
Rule 9
Theorem: There are '' points in a plane out ofwhich'm'
points are collinear. The number of straight lines formed
3.b
by joining them are given by
Rule 8
Theorem: There are 'n' points in a plane out of which'm'
paints are collinear. The number of triangles formed by the
Kbits as vertices are given by (" C 3
C ).
3
El:
the required no. of triangles =
= C =126
There are 10 points in a plane out of which 4 are collinear. Find the number of triangles formed by the
points as vertices.
Scln: Detail Method: For the time being let us suppose that
the 10 points are such that no three of them are collinear. Now a triangle will be formed by any three of
these ten points. Thus forming a triangle amounts to
selecting any three of the 10 points.
C +l).
2
Ex.:
There are 10 points in a plane out of which 4 rre collinear. Find the number of straight lines formed by
joining them.
Soln: Detail Method: For the time being let us suppose that
the 10 points are such that no three of the'm' are
collinear. Now a straight line will be formed by any
two of these 10 points. Thus forming a straight line
amounts to selecting two of the 10 points.
Now out of 10 points 2 can be selected in
1 0
C ways.
2
.-. number of straight lines formed by 10 points when
656
Now let the four points become collinear, then C
4
or, < _ _ 6 0 0 = 0
straight lines formed by them will reduce to only one

straight line.
.-. required number of lines formed
10
or, ( - 2 5 ) ( + 2 4 ) = 0
.-. n = 25,-24
But n * _24 .-. n = 25
have,
the number of students in the class
n ( n - l ) = 600
' C , +1 = 4 5 - 6 + 1 = 40

have,
the
required
number
o f straight
lines
or,
n 2
--600 =0
.-. n = 25,-24
.-. required number of students = 25.

, 0
C - C
2
+ l = 4 5 - 6 + l = 40.
Exercise
Exercise
1.
3.
1.
There are 12 points in a plane out of which 5 are collinear. Find the number of straight lines formed by joining them.
a) 56
b)57
c)47
d)46
There are 13 points in a plane out of which 4 are collinear. Find the number of straight lines formed by joining them.
a) 73
b)72
c)70
d)71
There are 8 points in a plane out of which 3 are collinear.
Find the number of straight lines formed by joining them,
a) 25
b)26
c)28
d)29
Answers
Lb
2.
3.
4.
2. a
3.b
Rule 10
Theorem: On a new year day every student of a class sends
a card to every other student. If the postman delivers 'C
cards, then the number of students
in the class can be
calculated by the following equation. n(n - I) = C.
On a new year day every student of a class sends a card

to every other student. The postman delivers 552 cards.
How many students are there in the class.
a) 23
b)24
c)22
d)33
a) 35
b)34
c)33
d)45
a) 30
b)29
c)41
d) 31
to other student. I f the total no. of students are 51 then
find how many cards did the post man deliver?
a) 2550
b)5250
c)5220
d)2530
Answers
l.b
4. a;
2. a
3.d
Hint: Required answer = 51(51 - 1) = 51 x 50 = 2550
cards.
On a new year day every student of a class sends a
card to every other student. The postman delivers
600 cards. How many students are there in the class.
Sola: Detail Method: Let n be the number of students.
Now number of ways in which two students can be
Rule 11
Ex.:
Theorem: If in an examination a minimum is to be secured

in each of 'n' subjectsfor a pass, then the number of ways a
student can fail is given by ( 2 " - 1 ) ways.
selected out of n students is " C .

2
Ex:
.-. number of pairs of students = " C
2
But for each pair of students, number of cards sent is

2 (since if there are two students A and B, A will send
a card to B and B will send a card to A).
.-. for " C pairs, number of cards sent = 2 * " C .
2
In an examination a minimum is to be secured in each

of 5 subjects for a pass. In how many ways can t
student fail?
Soln: Detail Method: The student will fail if he fails in one
or more subjects. Now, the students can fail in one or
more subjects out of 5 subjects in
C, + C + C + C + C
5
ways
According to the question, 2 * " C = 600

2
or. 2 x
n{n-l)_
2!
= 600
+ C, + C , + C , + C , + C ,
5
= 2 - 1 = 31 ways
5
[; " c + "c,+...+ c
0
=(1+1)" =2")
Pern
657
.-. Required number = 31

have,
3.
4.
required number = 2" - 1 = 2 - 1 = 31 ways.

5
Exercise
In an examination a minimum is to be secured in each of
3 subjects for a pass. In how many ways can a student
fail?
a) 8
b)9
c)7
d) Data inadequate
1 In an examination a minimum is to be secured in each of
fail?
a) 65
b)63
c)64
fail?
a) 17
b)26
c)15
d) 31
fail?
:
a)4
b)2
Answers
l.c
2. b
3.c
c)3
There are 5 questions in a question paper. In how many

ways can a student solve one or more questions?
a)31
b)32
c)33
d)30
a) 16
b)17
c)31
d) 15
Answers
l.d
2.d
3.a
Rule 13
Theorem: Front 'x' persons of a group A and 'y'persons
from group B, the number of ways in which 'n 'persons can
be chosen to include exactly 'r' persons of group A and the
rest of group B is given by ( * C x C_ ) ways.
r
Ex:
From 4 officers and 8 jawans in how many ways can 6

be chosen to include exactly one officer?
No. of officers
No. of jawans
No. of ways
1
d)5
C, x C
8
.-. Required number = C, x C = 4 x 56 = 224

4
4. c
Rule 12
If there are 'n' questions in a question paper,
then the no. of ways in which a student can solve one or
1.
There are 6 questions in a question paper. In how

many ways can a student solve one or more questions?
Soln: Detail Method: A student will solve one or more questions out of 6 questions in
2.
C , + C + C + C + C + C ways.
3.
= C + C, + C + % + C + C + C - C
6
= 2 - 1 64 - 1 =63 ways.
.-. required number = 63
have
6
=224.
Exercise
Ex:
= C,x C
the required answer = C , x C _,
more questions are given by ( 2 " - l ) ways.

have,
Theorem:
4.d
the required number = 2 - 1 = 64 - 1 = 63

6
xercise
a) 128
b)63
c)129
d) 127
ways can a student solve one or.more questions?
a) 256
b)257
c)127
d)255
From 5 officers and 7 jawans in how many ways can 4 be

chosen to include exactly 2 officers?
a)210
b)120
c)200
d) 105
be chosen to include exactly 1 officer?
a) 1290
b) 1160
c) 1260
d) None of these
be chosen to include exactly 3 officers?
a) 27720
b) 27270
c) 26620
d) None of these
Answers
l.a
2.c
3.a
Rule 14
Theorem: In a basket there are certain number of fruits.
Out of which, there are 'x'oranges, 'y'apples, 'z' mangoes
and the remaining 'n' are of different kinds. Then the number of ways a person can make a selection of fruits from
among the fruits
in the basket are given by
\x +1)(y + l)(z + l)x 2" - 1 ] ways.
Note: Here we consider all fruits of the same type are identical.

Ex.: There are 4 oranges, 5 apples and 6 mangoes in a fruit
basket. In how many ways can a person make a selection of fruits from among the fruits in the basket?
Zero or more oranges can be selected out of 4 identical oranges in 4 + 1 = 5 ways.
Zero or more apples can be selected out of 5 identical
apples in 5 + 1 = 6 ways.
Zero or more mangoes can be selected out of 6 identical mangoes in 6 + 1 = 7 ways.
.-. total number of selections when all the three types
of fruits are selected (the number of any type of fruits
may also be zero) = 5 x 6 x 7 = 210.
But in one of these selections number of each type of
fruit is zero and hence this selection must be excluded.
.-. required number = 2 1 0 - 1 = 2 0 9 .
have,
the reqd number of ways (4 + 1) (5 + 1) (6 + 1) x 2 - 1
= 5 x 6 x 7 * 1- 1 = 2 1 0 - 1 = 2 0 9 .
Exercise
1. There are 5 oranges, 6 apples and 7 mangoes in a fruit
a) 336
b)337
c)335
2. There are 2 oranges, 3 apples and 4 mangoes in a fruit
a)61
3.
c)60
d)58
Each person will get 4 things. Now first person can be

given 4 things out of 12 different things in C ways.
1 2
b)481
c)482
ing 8 things in C
8
.-. Required number =

12!
~ (4l)
Since n x m = 12 and n = 3
12
.-. m = = 4
(4?
3
Note: If "mn' different things are divided equally among ' n '
groups, then the total no of different ways of distri
,
bution are given by
(nm).
-r--r
Exercise
1. In how many ways 12 different things can be divided in
three sets each having 4 things.
12!
12!
12!
12!
(4!) x3!
(3!)S^!
W^W^In how many ways 15 different things can be divided
equally among 5 persons?
3 )
2.
b )
c )
15!
15!
15!
15!
a)7TA5
c) u,v
d)7^T
b)77^r
(3!)
0)(5\f
^(5!)
(3!)
In how many ways 18 different things can be divided
5
18!
18!
Q j
18!
18!
(6\f
W
(3lf
W
4.c
Theorem: The number of ways in which (n x m) different

things can be divided equally among 'n'persons are given
12!
b)
a )
Rule 15
C x C x C

have,
the required number
4.
3.d
1 2
12!
a) 2520
Answers
l.c
2.b
8!
4! 8! 4! 4!
d)479
d)2522
ways. And third person can be

4
3.
c)2519
given 4 things out of remaining 4 things in C ways.
In a basket, there are 4 oranges, 6 apples, 8 mangoes and

the remaining 3 are of different kinds. In how many ways
can a person make a selection of fruits from among the
fruits in the basket?
b)2521
Second person can be given 4 things out of remain-
There are 5 oranges, 7 apples and 9 mangoes in a fruit

a) 480
4.
b)59
201
a )
(4!)
20!
b)
d)
C )
(5!)
20!
C )
d)None of these
(50
Answers
1. a;
Hint: See Note. Here, n x m = 12, n = 3 .-. m = 4.
2. a
3.c
4.b
Rule 16
Ex.:
Theorem: The number of ways to distribute or divide 'n'

identical things among 'r' persons when any person may
get any number of things are given by {" "' C _, J ways.
+r
Permutations 85 Combinations
659
4.
Ex.:
In how many ways 20 apples can be divided among 5

boys.
Soln: Number of ways of dividing 'n' identical things among
V persons when any person may get any number of
things = "
+ r _ 1
C _j [From the above theorem]

r
Here, n = 20, and r = 5

required
24
Ci
24!
4! 20!
Find the no. of quadrilaterals that can be formed by joining the vertices of a polygon of 12 sides,
a) 495
b)945
c)545
d)549
Answers
l.a
2.b
3. a; Hint: A decagon has 10 sides.
4. a
Rule 18
number
Theorem: If there are n points in a plane and no points are

collinear, then the number of straight lines can be drawn
= 23x22x21 = 10626
n(n-\)
Exercise
1.
In how many ways 12 bananas can be divided among 4

girls.
using these 'n'points are given by '
a) C
, 2
2.
b)
1 3
c) C
1 5
d) Data inadequate
In how many ways 16 oranges can be divided among 8

boys.
a) C
2i
b) C
l 6
c) C
i J
d) None of these
In how many ways 13 apples can be divided among 5

students.
a)
1 7
b)
1 3
c)
, 4
d)
, 2
Ex.:
How many straight lines can be drawn with 16 points

in a plane of which no points are collinear?
Soln: Applying the above theorem, we have the
required number of straight lines
=
=
x 8 = 120.
2
MlM
Exercise
4
1.
Answers
l.c
2.c
3.a
2.
Rule 17
Theorem: The number of quadrilaterals that can beformed
by joining the vertices of a polygon of n sides are given by
3.
(H-1)(W-2)(-3)1
24
; where n>3.
How many straight lines can be drawn with 15 points in

a plane of which no points are collinear?
a) 105
b)120
c) 110
d)None ofthese
a) 150
b) 153
c) 148
a)90
b) 101
c)91
d)92
Answers
l.a
Find the no. of quadrilaterals that can be formed by

joining the vertices of an octagon.
Soln: Applying the above theorem,
an octagon has 8 sides, hence here, n = 8
.-. required number
2.b
Ex.:
8(8-1X8-2X8-3) _ 8 x 7 x 6 x 5
24
24
2.
3.
3.c
Rule 19
Theorem: If there are 'n' points in a plane and no three
points are collinear, then the number of triangles formed
n(n-\\n-l)
with 'n 'points are given by
= 70.
Exercise
1.
1 5
Find the no. of quadrilaterals that can be formed by joining the vertices of an hexagon.
a) 15
b)20
c)70
d) 16
Find the no. of quadrilaterals that can be formed by joining the vertices of an septagon.
a) 45
b)35
c)42
d)28
Find the no. of quadrilaterals that can be formed by joining the vertices of an decagon.
a)210
b)200
c)120
d)160
Ex.:
Find the no. of triangles that can be formed with 12

points in a plane of which no three points are collinear.
Soln: Applying the above theorem, we have the
required no. of triangles =
12x11x10
6
...
220.
Exercise
1.
Find the no. of triangles that can be formed with 13 points

in a plane of which no three points are collinear.
PRACTICE B O O K O N QUICKER M A T H S
660
2.
3.
a) 276
b)286
c)296
a) 346
b)364
c)384
d)464
a) 454
b)455
c)544
d)445
2.b
1.
2 matches
how many
a) 27
4 matches
how many
a) 81
5 matches
how many
a) 343
2.
3.
Answers
l.b
Exercise
3.b
Rule 20
are to be played in a chess tournament. In

ways can their results be decided?
b)9
c)8
d) None of these
b) 16
c)27
d)64
b)243
c) 128
d) None of these
Answers
Theorem: n students appear in an examination. The number of ways the result of the examination can be announced
l.b
2.a
3.b
Rule 22
are given by (2)".
Theorem: A badminton tournament consists of 'n' matches.

(i) The number of ways in which their results can be
IIlustrativeExample
Ex.:
6 students appear in an examination. In how many

ways can the result be announced?
Soln: Detail Method: Each student can either pass or fail in
the examination. So, there exists 2 possibilities for
each of the 6 students in the result.
.-. total number of ways for the result" (2) = 64
have
6
the required answer = (2) = 64 .

6
Exercise
1.
4 students appear in an examination. In how many ways

can the result be announced?
a) 15
b) 16
c)17
d) None of these
2 5 students appear in an examination. In how many ways
a) 32
b)33
c) 31
d) Data inadequate
3. 7 students appear in an examination. In how many ways
a) 126
b)127
c)129
d) 128
Answers
l.b
2.a
3.d
forecast are given by ( 2 ) " ways.

(ii) Total number of forecasts containing all correct results or all wrong results are given by 1.
Ex:
A badminton tournament consists of 3 matches.

(i) In how many ways can their results be forecast?
(ii) How many different forecasts can contain all wrong
results.
(iii) How many different forecasts can contain all correct results?
Soln: Each badminton match can be decided in only 2 ways
ie win or loss for a particular team.
.-. Total no. of ways the results of 3 matches can be
forecast = 2 = 8
3
Result of each match can be forecast wrong in only 1

way.
.-. Total no. of forecasts containing all wrong results
Similarly, result of each match can be forecast correct

in only 1 way.
Rule 21
.-. Total no. of forecasts containing all correct results
Theorem: n' matches are to be played in a chess tournament. The number of ways in which their results can be
decided are gien by (3)" ways.
= (1) =1
3
Exercise
1.
Ex:
3 matches are to be played in a chess tournament. In

how many ways can their results be decided?
Soln: The result of each of the 3 matches can be in three
ways namely win, draw or loss.
total no. of ways in which results of 3 matches can
be decided = (3^ = 27.
2.
3.
A badminton tournament consists of 4 matches. In how

many ways can there results be forecast?
a) 16
b)32
c)15
d) 31
many ways can their results be forecast?
a)32
b)31
c)33
d)64
many ways can their results be forecast?
a)64
b)70
c) 128
d) 127
Permutations 85 Combinations
661
(SBI Bank PO Exam 2001)

(i) In how many different ways can it be done so that the
committee has at least one woman?
a)210
b)225
c)195
d) 185
(ii) In how many different ways can it be done so that the
committee has at least 2 men?
a)210
b)225
c) 195
d) 185
Answers
l.a
2.a
3.c
Rule 23
Theorem: The Indian hockey team is to play 'n' matches
for the world cup.
(i) The number of differentforecasts that will contain all
correct results is ( l ) " or 1.
(ii) The number of different forecasts that will contain
all wrong results are (2)".
Ex.:
The Indian hockey team is to play 4 matches for the

world cup.
(i) How many different forecasts will contain all correct results?
(ii) How many different forecasts will contain all wrong
results?
Soln: Result of each hockey match can be decided in 3 ways
ie win, loss or draw.
(i) Only in 1 way we can correctly predict each match
ie 'forecast' and the actual result are the same.
Hence, total no. of ways to predict all 4 matches
correctly = ( l ) = 1.
Answers
l.a;
Hint: Detail Method:

No. of officers
No. ofjawans
No. of ways
4
Case I
Case I I
'C x
Caselll
'C x
Case IV
Cj x C = 224
6
C =420
C =224
C x C =28
4
.-. Required number = 224 + 420 + 224 + 28 = 896

have,
x = 4,y = 8andn = 6
(ii) For each match the prediction can go wrong in 2

ways. For example, prediction for any match is
win but the actual result is either loss or draw.
.-. total no. of forecasts containing all wrong
results = (2) = 1 6 .
4
The value of
C
x C_
= C x C_ = C x C
Now, from the above theorem,

Required answer
Exercise
= C, x C + C x C + C x C + C x C
1.
= 224 + 420 + 224 + 28 = 896
2.

world cup. How many different forecasts will contain all
correct results?
a)8
b) 16
c)l
d)32
world cup.
(i) How many different forecasts will contain all correct
results?
a) 8
b)l
c)256
d) None of these
(ii) How many different forecasts will contain all wrong
results?
a) 128
b)256
c)512
d) None of these
2. (i) c; Hint: Required no. of ways

= C , x C + ' C x C + C x C, + C
4
4x
6x5x4
4x3
6x5
4x3x2
1x2x3
1x2
1x2
1x2x3
x6 + l
= 80 + 90 + 24 + 1 = 195
(ii) d; Hint: Required no. of ways
= C x C + C x Cj + C
6
Answers
l.c
2.(i)b;(ii)b
Miscellaneous
1.
From 4 officers and 8 jawans in how many ways can be 6

chosen to include at least one officer.
a) 896
b)986
c)886
d)996
From a group of 6 men and 4 women a committee of 4
persons is to be formed.
6x5 4x3 6 x 5 x 4
6x5x4x3
-x
=
x4 + 1x2
1x2
1x2x3
1x2x3x4
= 90 + 80+ 15=185

Permutation Combination Quick Rules

Transféré par

Informations du document

Description originale:

Titre original

Copyright

Formats disponibles

Partager ce document

Partager ou intégrer le document

Options de partage

Avez-vous trouvé ce document utile ?

Ce contenu est-il inapproprié ?

Droits d'auteur :

Formats disponibles

Permutation Combination Quick Rules

Transféré par

Droits d'auteur :

Formats disponibles

Permutation & Combination

Where " P = number of permutations or arranger

Some Important Notations and F o r m u l a e

ments of n different things taken r at a time.

different things taken r at a time.

Total number of arrangements = total no. of groups or

According to the definition of Jn

Where "C,. = number of selections, or groups of n

If "C = "C then either x = y or x + y = n

Number of permutations of n things out of which P

Number of selections of r things (r < n) out of n

PRACTICE BOOK ON QUICKER MATHS

maximum no. of handshakes = 86

(c) " C = " C - =

Case 2: Total no. of handshakes among the group of 16 women

Number of ways to distribute (or divide) n identical

Problems based on direct application of the formula.

Some F u n d a m e n t a l Principles of Counting

(a) Multiplication Rule

Soln: Given "P. = 3 6 0

(b) Addition Rule

Permutations & Combinations

Hint: Given, " A = 9240

be formed with the digits 0, 1,2, 3, 4, 5 and 6; no digit

for filling up the

five digits in P ways.

remaining places with remaining digits.

.-. Required number = 3

Hint: Any number between 300 and 3000 must be of 3

.-. Required number = P = = 5 x 4 x 3 x 2 = 120

Hundreds place can be filled up by any one of the

.. Number of numbers formed in this case = 3

Thousands place can be filled up by any one of the

PRACTICE BOOK ON QUICKER

of 3 , 4 , 5 , 6 occurs at thousands' place the number will

two digits 1 and 2 in 2 ways and remaining three places

.-. Number of numbers formed in this case

.-. Required number = 60 + 120 = 180

Thousands' place can be filled up by 2 in 1 way and

[When 0 occurs at units place there is no restriction

five digits in P ways.

.-. Number of numbers formed in this case

Case I I : When anyone of 3,4,5 and 6 occurs at thousands' place:

Thousands' place can be filled up by any one of the

.-. Number o f numbers formed in this case =

places can be filled up by remining six digits in P

any one of remaining six

.-. Required number = 80 + 480 = 560

Ten thousands' place can be filled up by any one of

five digits in P ways.

.-. Number of numbers formed in this case

Units' place can be filled up by any one of the three

.-. Required number = 120 + 300 = 420

.-. Number of numbers formed in this case = 4 x p

Case I I : When number is of four digits.

Permutations & Combinations

.-. Number of numbers formed in this case = 4 x P

Case I I I : When number is of three digits?

.-. Number of numbers formed in this case = 4x P

Case IV: When number is of two digits:

.-. Number of numbers formed in this case = 4x A,

Case V: When number is of one digit: