1 PnC and Probability

JEE TRAINER
Preparing You For Both JEE MAIN and ADVANCED

PERMUTATION COMBINATION
& PROBABILITY

V Ramakrishna

Ativeer Publication
A unit of Ativeer Research and Educational Services Pvt Ltd
 Our Other Products (for JEE MAIN and ADVANCED)

Mechanics - 1 by Vikas Jain

Mechanics - 2 by Vikas Jain
Waves and Thermodynamics by Vikas Jain
Electrodynamics - 1 by Vikas Jain
Electrodynamics - 2 by Vikas Jain
Optics and Modern Physics by Vikas Jain
Algebra by Nitin Jain
Trigonometry by V Ramakrishna
Vectors and 3D by Nitin Jain
Differential Calculus by V Ramakrishna
Integral Calculus by V Ramakrishna
Co-ordinate Geometry by Nitin Jain
Mock Tests for JEE MAIN by Vikas Jain, Rajshree and Nitin Jain

Published By :
ATIVEER PUBLICATION
(A Unit of Ativeer Research and Educational Services Pvt. Ltd.)
Regd. Office : H.No. 309,
Dashmesh Nagar, Baghpat Road,
Meerut, UP

Head Office : H. No. 2-10-644,

Teacher's Colony,
Warangal, Telangana

All rights reserved

c Authors

No part of this publication (either in part or full) may be re-produced, stored in a retrieval system or distributed in any
form or by any means, electronic, mechanical, photocopying, recording, scanning or otherwise without the prior written
permission of the publisher and the authors. Ativeer Publication and its authors has collected the information contained
in this book from the sources believed to be reliable and true. However Ativeer and its associates don't take any
responsibility for the absolute accuracy of any information published and the damages or loss suffered thereupon.

Typesetting :
Ativeer DTP Unit at Warangal

Printed at :
Sunny Offset, Meerut
 Preface

I have been into teaching JEE -advanced Mathematics for more than 10 years. I have observed
that multi-conceptual questions asked are increasing drastically over the years. For ex: Maxima/
Minima problem combined with definite integrals, finding the roots of a solution for given DE
etc. So many multi-concept oriented questions have been incorporated in the book.

Attempt is made to present this book in such a manner that students/ teachers who follow the
book in proposed manner will be able to solve any kind of questions at both JEE-mains and
advanced level.

Students who refer this book are future IITians/ NITians who try to find solutions to real life
problems using their Mathematical skills. I have learnt from my students that, solving direct
problems (though very important at initial stage ) without understanding basic motto behind it
will not help in performing at IITs/ NITs and even beyond though they could do well in JEE-main
level tests. The proposed book is an attempt to bridge this gap by Make Concept Clear
questions (MC2). Order of MC2 problems is kept in a way to maximize the learning curve of the
students.

Students are advised to go through illustration problems first to strengthen their basics and
look at the hint from solutions page only when they fail to solve practice session on their own.

Was it not for the advise, support and encouragement given by my colleagues, friends, students
and family , this book would not have been materialized. I am extremely indebted to their
support in all my endeavors.

Any suggestions to improve the book are welcome. Your suggestions will go a long way in
making this book perfect in subsequent editions.

I am very much thankful to Ativeer Publications for giving me an opportunity to share my

knowledge with wide student and teacher community.

V Ramakrishna
 CONTENTS
Chapter 1 PERMUTATION AND COMBINATION 1.1 – 1.116
1.1 Fundament al Rules 1.1
1.2 Permutations for Repeat ed and Identical Objects 1.11
1.3 Circular Permutations 1.16
1.4 Combinat ion 1.18
1.5 Total Combinat ions 1.23
1.6. Combinat orial Geometry 1.28
1.7 The Inclusion - Exclusion Principle 1.34
1.8 Generating Funct ions 1.42
1.9 Fibonacci Numbers 1.49

Practice Session - 1 for JEE MAIN 1.53

Practice Session - 2 for JEE ADVANCED 1.57
Practice Session - 3 Challengers 1.69
Flashback - Previous Year Questions 1.72
Answer Key 1.75
Explanations to Mc2 1.77
Explanations to PS - 1 1.89
Explanations to PS - 2 1.94
Explanations to PS - 3 1.109
Explanations to Flashback 1.114
Chapter 2 PROBABILITY 2.1 – 2.148
2.1 Experiment & Random Experiment 2.1
2.2 Probability 2.2
2.3 Axiomatic Approach to Probability 2.14
2.4 Conditional Probability Multiplication 2.20
Rule, Independent events
2.5 Total Probability and Baye’s Theorem 2.35
2.6 Random Variables - Distribution Functions 2.45
2.7 Binomial Distribution 2.48
2.8 Geometrical Probability 2.50
Practice Session - 1 for JEE MAIN 2.54
Practice Session - 2 for JEE ADVANCED 2.61
Practice Session - 3 Challengers 2.77
Flashback - Previous Year Questions 2.80
Answer Key 2.87
Explanations to Mc 2 2.89
Explanations to PS - 1 2.100
Explanations to PS - 2 2.109
Explanations to PS - 3 2.132
Explanations to Flashback 2.138
PERMUTATION COMBINATION
& PROBABILITY

Chapter 1

PERMUTATIONS AND
COMBINATION
1.1 Fundamental Rules
1.2 Permutations for Repeated and Identical Objects
1.3 Circular Permutations
1.4 Combination
1.5 Total Combinations
1.6. Combinatorial Geometry
1.7 The Inclusion - Exclusion Principle
1.8 Generating Functions
1.9 Fibonacci Numbers
 PERMUTATION AND
COMBINATION
1.1 Fundamental Rules such that these subsets are pairwise disjoint (i.e for each
i,
j 1, 2, 3, ....., n with i  j we have A i   ) and their
There are three fundamental rules of combinatrics.
 Aj
They are the addition rule, the multiplication rule, and
the n

pigeonhole principle (or Dirichlet’s principle). These union is all of A A  Ai . Then we have
i.e. i 1
rules are very easy to state. They are useful in a
n
number of diverse and often rather complicated
situations. We usually leave
them as rules and we give less importance, but here A  A1  A2  A3  An =  Ai ...(1)
i 1
we will make abundant use of them, especially the
addition and
multiplication Rule. where | A| = n(A) = The number of elements in
A.
Addition Rule
Proof
If a work (Job or an event) x can be performed ( or can belongs
According to the hypothesis, each element a
A
happen) in m ways, another work y which is
to exactly one of the subsets Ai, i = 1, 2, 3,.n and
independent of x, can be performed in n ways then
therefore it counts exactly once on each side of
either x or y can be performed in m + n ways. equation (1).
This idea can easily be applied to more events. We can Eg : A man can leave mumbai by train in 7 ways, by air
put the addition principle into the language of sets. in 4 ways and by sea in 2 ways. The total number of
ways of his leaving mumbai is then 7 + 4 + 2 = 13
Let A1 , A2 ...., An  be a system of subsets of a finite
set A
Solved Examples
Solved Examples
1. A class consists of 10 boys and 10 girls. In how  Required number of ways
many
ways a class leader can be selected ?
Sol. Let A1  boys , A2  girls .
Leader can be a boy or a girl but not both.
2. A square with side length 4 is divided by parallel lines squares
Permutation & Combination
into 16 equal squares. What is the total number of into four sets A1, A2, A3, A4 such that the set Ai
squares in this picture ? contains all squares of side length i (i = 1, 2, 3, 4).
Sol. To answer this question, we divide the totality of Obviously
= A1  A2  10  10  20
1.1
P & C and Probability

A1 = 16,
A2 = 9, A3 = 4, A4 = 1.
Hence, the total number of squares is
= 16 + 9 + 4 + 1 = 30.
3. What is the total number of moves a knight can
make on a 8  8 chess board ?
Sol. The number of moves on a given field depends on the
location of the knight on the chessboard. Therefore,
we divide the set of all fields into 5 groups
A,B,C,D,E. From a corner field A a knight can make
two moves, from a field of type B it can make three
moves, and it can make four from a field C, six from Note
a field D and eight moves from a field of type E.
The number of all possible moves of a knight on an n x n chessboard
Hence, according to the addition rule the total
number n of moves of a knight on a chess board is
= 4  2 + 8  3 + 16(n –3) + 24(n–4) + 8(n – 4) 2
n = 4  2 + 8  3 + 20  4 + 16  6 + 16  8 = 336 = 8(n – 1) (n – 2)

The multiplication Rule
If there are m ways of doing a task and for each of
these m ways there are n ways of doing a second task,
which is independent of first task, then the total number
of ways of doing the two tasks in succession is mn.
We can also state this rule in more appropriate way as
follows :
Let A = { (x , x ) ; x  A , 1 < i < 2 } then n(A) = n(A )
1 2 i i
 n(A2).
The multiplication rule can be extended upto any finite
number of events.
If an event A1 can occur in a1 different ways and event
A2 can occur can occur in a2 different ways, , and
event, An
can occur in an different ways, then total number of ways
that event A1 followed by event A2,...., followed by event
An can occur in a1a2a3........an ways.
1

4. Five routes lead from town A to town B, and three

routes lead from B to town C. Find the total number
of routes that lead from A to C and pass through B.
Sol. An arbitrarily chosen route from A to B (5 choices)
can be “extended” by three routes from B to C. A
Hence, according to the multiplication rule, the B
number of routes in question is 5.3 = 15.
y1
A y2
B y3 C
C

i) How many different routes are there from A to C

altogether ?
or let P  x , x , x , x , x  , Q  y , y , y  ii) How many different routes are there from A to C and
1 2 3 4 5 1 2 3
back
PQ   xi, y j : x i P, y j  iii) How many different routes from A to C and back visit
B at least once ?

Q ,
( i  1 to 5, j  1 to 3 ) iv) How many different routes from A to C and back do
not use any road twice ?
PQ P . Q 15
v) How many different routes from A to C and return by a

5. In how many ways a man can wear 5 shirts and 4
pants ? 1.2
Sol. For each shirts, there are 4 paints to wear. Thus
required ways y = 5  4 = 20.
6. There are 4 different roads from city A to city B, three
different roads from city B to city C, and 2 different
roads from A to C directly.
 different route (means if atleast one road is  Total routes = 4.3 + 2 = 14
different then entire path is different) ii) As there are 14 routes from A to C (work-1)and, C to
Sol. A(work-2) also 14 routes.
i) There are 2 direct routes from A to C and via B 4.3 = Thus, total = 14  14 = 196
12
Each of the different arrangements which can be made
by taking some or all of a number of distinct objects is
iii) Without B there 4 ways from A to C and C to called a permutation. A permutation is an arrangement of
A. Subtract 4 from ans (b). objects in a definite order.
Thus, total ways = 192
iv) a) A to C(directly) there are 2
routes. C to A (by a different route)
there
1 + 12 (C to B to A) = 13 ways
b) A to C via B, there are 12 routes
Via B (2 x 3 = 6)

C to A

Directly (2 ways)
In this case there 12 (6 + 2) =
96 Thus, total cases = 122
v) 14 13 182
7. In how many ways can one choose one white and
black field on a 8  8 chessboard ? In how many
ways can this be done if the fields are not to be in
the same row or in the same column ?
Sol. A white field can be chosen in 32 ways and the same
is true for a black field. The total number of choices
in the first case is therefore 32.32 = 1024. If in the
second case we choose a white field (32
possibilities) then a black field can be chosen from
those rows and column on which the already
selected white field does not lie, that leaves 24
possibilities.
The total number of choices is therefore 32.24 = 768
8. In how many ways one can post 4 letters in 3 post
boxes?
Sol. Let the letters be li (i = 1, 2, 3, 4) post boxes be b i
where i = 1, 2, 3.
l1 can be posted in any one of three post boxes. This
job can be done in 3 ways.
Similarly each other job can be done in 3 ways.
So, required number of ways = 3 x 3 x 3 x 3 = 3 4.
9. In how many ways 5 prizes can be distributed
among 7 atheletes, if each athelete is eligible for
each prize ?
Sol. First prize can be given to any one of 7 atheletes,
thus, required number of ways = 7 5.
10. A man wants to send invitations to his 6 friends.
through his three servants. In how many ways can
the man sent the invitations among the friends ?
Sol. Each of 6 friends can receive the invitation by
anyone of 3 servants. Hence required number of
ways = 3 6.
Note
The total number of functions from set A to set B. where n(A) = m, n(B) = n is n m. Because each element of set A can be assigned to any one o

11. For a set of five true/ false questions, no student was

Permutation
 Permutation & Combination taking two at a time, these are
written all correct answers, and no two students RB, BR, RW, WR, BW, WB – 6 ways
have given the same sequence of answers. What
is the maximum number of students in the class,
for this to be possible (Assume student attempt all 1.3
questions)
Sol. Since, a true/ false type questions, can be
answered in 2 ways either by marking it true or
false.
Total number of different sequences of answers =
2 5 = 32 out of these 32 sequences of answers
there is only one sequence of answering all the five
questions correctly. But no student has written all the
correct answers and different students have given
different sequences of answers. So,
Maximum number of students in the class
= number of sequences except one sequence in
which all answers are correct = 32 – 1 = 31.
12. A question paper is split into two parts - part A and
part
B. Part A contains 5 questions and part B has 4
questions. Each question in part A has an
alternative question, student has to attempt at least
one question from each part. Find the number of
ways in which the student can attempt the question
paper.
Sol. Job 1 : Answering part
A Job 2 : Answering
part B
In part A each question can be attempted in 3 ways.
1. no question is attempted
2. attempt 1st part of question
3. attempt 2nd part of question.
Thus, the total number of ways of answering part A =
35
– 1 = 242.
In part B, each question can be attempted in 2
ways. Therefore, there are 24 – 1 = 15 ways of
answering part B. Hence total no. of required ways
= 242 x 15 = 3630.
13. Let a = a 1a2a3 and b = b 1b2b3 be two three digit
numbers. How many pairs of a and b can be
formed so that a can be subtracted from b without
borrowing?
Sol. b1 b2 b3
a1 a2
a3 When b3 =
9, a 3 = 0 to 9
b3 = 8, a 3 = 0 to 8
.
.
b3= 0, a 3 = 0
In total = 10 + 9 + ... + 1
= 55
similarly for (a2, b2) – 55
ways Now, b1 = 9, a 1 = 1 –
9
= 8, a 1 = 1 to 8
;
= 1, a 1 = 1
total = 9 + 8 + + 1 = 45
Thus, the number of required ways = 45 x (55) 2

Eg: Consider the colours R,B,W. Now we want to list

out all possible arrangements of these 3 colours
 P & C and Probability
There are two types of arrangements (permutations)
2. The number namely
of all bijections from a finite n-elements set A to itself is n!
i) Linear permutation

Arranging objects along a line

r particular objects cometogether is (n–r+ 1)!r!
ii) Circular permutation
cometogether, we take robjects
Arranging particulararound
objects aascircle.
a single object, therefore there are n–r+ 1 objects to arrange. Now these n–r+ 1 objects can be arranged in (n–r

of all permutations of n-dissimilar objects taken r at a time is n(n–1)(n–2)(n–(r–1). 0  r n ,

of permutations of n distinct objects taken ‘r’ at a time, is same as (r-tuples (x1,x,, xr) the number
hich we can fill up r-places (boxes) when
fferent things at our disposal. Consider r places :
Note
....
123r The number of ways of arranging n distinct objects of r
particular objects never cometogether  n! (n  r  1)!
r!
THEOREM 3
(Gap Method) the number of ways of arranging n
distinct red balls and m( n  1) distinct black balls
such that no
n!(n1)
two black ball cometogether is p
m
n n-1n-2 n(r-1)
Proof:
J1 J2 J3 Jr(Jobs) In our arrangement no 2 black balls cometogether,
that is between every pair of black balls there must
Number of ways of filling up boxes with n objects be all one red. So first we arrange n red balls, it can
= performing ‘r’ jobs, in succession can be done in n(n–1) (n–2) ...(n–(r–1)). be done in n!, now there are n+ 1 gaps as shown
The product n(n–1) (n–2) ...(n–(r–1)) below

R1  R 2  R3  Rn 
n  n  1  n  2  ... n  r  1  n  r  n  r  1... 2.1
= n  r  n  r  1... 2.1 where Ri’s denote red balls. In the n+ 1 gaps, m
black balls can be arranged in n+ 1 Pm. Hence total
n!
number of arrangements = (n!) n+ 1 Pm.
= n  r ! we usually denote it by P(n,r) or nPr
THEOREM 4
The number of ways of arranging n red balls and n
black balls such that red and black balls come
alternately. is 2(n!)2.
n!
 n Pr  ,0rn, Proof:
n
r!
where the letter P stands for permutation. First we arrange n red balls, it can be done in n! ways
Hence, the number of permutations of n dissimilar objects taken ‘r’ at a time is nPr. R  R  R R 
1 2 3 n

If arrangement starts with red ball then it ends with

Note black ball and starts with black ball then it ends with
red ball.
) denote the number of all arrangements of an n-element set A. Then P(n) = n(n–1)(n–2)2.1 = n!
Therefore n black balls can be arranged in first n
gaps (last n gaps) in n! ways.
 Required number of ways = 2(n!) 2

1.4
 Permutation & Combination

Solved
SolvedExamples
Examples
14. How many signals can be made by 5 flags from 8 = 1 + (n + 1)! – 1! = (n + 1)!
flags of different colours ? 17. Prove the following :
Sol. Here n = 8, r = 5, thus, required number of ways = 8P5 i) P(n, n) = 2P (n, n – 2)
15. How many different signals can be given using any ii) P(n, n) = P(n, n – 1)
number of flags from 6 flags of different colours ? iii) P(n, r) = P (n – 1, r) + r.P(n – 1, r – 1)
Sol. The total number of signals using r flags from 6 flags iv) P(n, r) = n.P (n – 1, r – 1)
of different colours is 6Pr where r = 1, 2, 3, 4, 5, 6. n!
Sol. i) P(n, n) = n! , 2 P(n, n–2) = 2  n!
Hence total 
r1
6
P  1956
2!
=
r

16. Solve the n!

following ii) P(n, n) = n!, P(n, n–1) = nPn1  1!  n!
i) If 2.P(5,3) = P(n,4) find n.
iii) P(n, r) = the number of permutations of n distinct
ii) If P(n, 4) = 20 P(n, 2) find n.
objects taken r at a time
iii) If P(5, r) = 2.P (6, r – 1) find r.
= when a particular object is excluded + the
iv) If 10Pr = 5040, find r
number of permutation of n distinct objects taken r
v) If 9P5 + 5. 9P4 = 10Pr find r.
at a time when a particular object is included.
vi) If 56 Pr + 6 : 54Pr + 3 = 33800 : 1 find r a) When a particular object is excluded :
vii) If 22Pr+ 1 : 20Pr + 2 = 11 : 52 find r
number of r - permutations = n–1Pr.
n
b) When a particular object is included :
viii) Find 1  P r
r

r 1
Particular object can be placed in r ways (in any one
5! n! of the r places), and remaining r – 1 places can be
2.   n5 filled with n – 1 objected in n–1Pr–1ways. Hence
total
Sol. i) 2! (n  4)! = r n–1Pr–1.
n!
Thus P(n, r) = P(n – 1, r) + r P(n – 1, r – 1)
ii) n!  20 .  (n  2)(n  3)  5.4  n  7 n! (n  r)!
(n  4)! (n  2)! iv) P(n, r)   n.  nP(n  1, r  1)
(n  r)! (n  1) (r 
1)!
5! 6!
iii)  2.  (7  r)! 12(5  r)  r  3 18. Show that the number of permutations of n dissimilar
(5  r)! (7  r)!
objects taken ‘r’ at a time when s   r  particular
objects
10! 7!  10.9.8 10! included is rPs. n–sPr–s.
 
 
 
iv) r 4 Sol. s particular objects can be arranged in r places in rPs,
(10  r)! 720 6! remaining r–s places can be filled with n–s objects in
9! 9! 10! 10
 5.  10P   Pr5 n–sP .


r–s
v) r
5!
r Hence required number of permutations = rps. n–spr–s
4! 5! 19. Find the number of arrangements of 15 cricketers
(51 r)!
taking
vi) 56 !   30800  56.55.(51  r)  11 at a time when
33800
(50  r)! 54 ! i) 3 particular cricketers excluded
 r  41 ii) 3 particular cricketers included
Sol. i) 3 particular cricketers excluded is 12P11.
 22  ! 20! ii) 3 particular cricketers included is 11P3 . 12P8
:  11 : 20. How many different words can be formed from the
vii)
52
 21 r    r!
! 18
letters
22.21 of the word VANQUISHER
 21 r20  r19  r: 1  11:52 i) such that they begin with svowel and end with
vowel ii) such that they begin with vowel and end
 (21 – r) (20 – r) (19 – r) = 2 x 21 x 52 with
consonant
= 12 x 13 x 14  r = 7
iii) such that neither of them begin with U nor end with
n
V.
Sol. Total number of arrangements = 10!, Now there are 4

r P 1
n n
r ! vowels A, U, I,E and 6 consonants.
r 11  r
r
viii) 1 1
r
!
= 
r 1 r1  n n 
 r1
1 2 9 10
i)
....
= 1    r 1  !  r !
 1st and 10th places can be filled with 4 vowels in 4P2
 ways and remaining 8 places can be filled in 8! ways
 r 1 r1

1.5
P & C and Probability

Hence total number of required ways = Vowels must be arranged in these places only, it can
4
P2.8! be done in 4! consonants can be arranged in 6!
ii) 1st box can be filled in 4 ways. ways.
th
10 box can be filled in 6 ways. ii) Order of vowels in given word is AUIE. Whenever
Remaining 8 boxes can be filled in 8! arrangement is made, vowels must come in that
ways. Total = 4  6  8! order. First we arrange constant (unrestricted one)
iii) Let A  words begin in 10 places. It can be done in 10P6 ways. Now
there are 4
with U B  end with V places vacant, in these 4 places 4 vowels can be
arranged in 1 way.
n(A) = 9!, n(B) = 9!, n A  B = 8!
iii)Prime places are 2,3,5,7. In these places 4 vowels
n A  B = 2.9! – 8! = 17.8! can be arranged in 4!, remaining in 6!.
iv)Places 5,6 can be filled in 4P2 ways, 4 and 7th
places can be filled in 6P2, remaining in 6!

n A B
C C
 = total – n  A  Total = 4P2. 6P2. 6!
B
= 10! – 17.8! = 73.8! v) R S - 1 object .
21. How many different words can be formed from the The two boxes can be filled in 4P2
letters of the word VANQUISHER (with 4 vowels) ways, and R,S can be inter changed
i) such that all vowels come together. in 2 ways.
ii) such that no two vowels come together. Now there are 7 objects, these 7 can be arranged
iii)such that all vowels come together and all in 7! Total = 7! x 4P2 x 2.
consonants come together. 23. Let m be the number of ways of arranging 5 boys and 5
iv)such that vowels occupies even places girls in a row such that boys and girls sit alternately.
v) such that two vowel at each end. Let n be the number of ways of arranging 5 boys and
5 girls in
AEIU
Sol. i) Assume all n
vowels as single a row such that no two girls sit together then equals
object.
now total no. of objects = 1 + 6 = 7. m
These 7 objects can be arranged in Sol. Boys can be arranged in 5! ways
7!
B1  B2  B3  B4  B5 
Vowel among themselves can be arranged in
4! total = 7! x 4! girls can be arranged in first 5 gaps or last 5 gaps in
2.5!
Eg : AEIU NQSHR ways
V
ii) We do this problem using gap method.  m  2  5! 5!
First we arrange consonants (opposite of objects
now 5 girls can be arranged in 6 gaps in = 6! ways
which 5
6
P
no two come together). This can be done in n
ways. x V x N x Q x S x H x R x n  5! 6!  3
m
Now, there are 7 gaps. In these 7 gaps 4 vowels
can
be arranged in 7P4 remaining in 6P6.
Hence total = 7P4 x 6! v) In 1,2,9,10 places, vowels can be arranged in 4!
remaining 6!.
iii) All vowels AEIU = 1 object.
22. How many different words can be formed from the
All consonants VNQSHR = 1 object letters of the word VANQUISHER
i) Such that relative position of vowels are not
So there are two objects. They can be arranged in disturbed.
2 ways Total = 2 x 4! x 6! (As in (iv)) ii) Such that order of vowels remain same
iv) There are 5 even places. 4 vowels can be iii) Such that vowels occupies prime places.
arranged in the 5 even places in 5P4 ways, iv) Such that middle places occupies by two vowels.
 But no three or four vowels come together. 24. Let n be the number of ways in which 5 boys and 5
v) Such that there will be exactly two vowels girls can stand in a quene. Let m be the number of
between R and S and no other letter between R & ways in which 5 boys and 5 girls can stand in a
S. quene in such a
Sol. i) Vowels occupied in 2,5,6,9 places. (In given word). n
way that exactly 4 boys stand together then equal
m
1.6 Sol. Assume all girls as single unit then
m  6!5!
now G1  G2  G3  G4  G5  (4 boys) 
4 boys together can be arranged in 54P = 5! ways
now in first 5 gaps, remaining boys can be arranged
in 5 ways.
n
 n  6!  5!5  5
m
25. Let n be the number of ways of arranging 5 boys and
5 girls in a row such that same gender
cometogether. Let m be the number of ways of
arranging 5 boys and 5 girls in row such that exactly
4 boy cometogether and exactly
n
4 girls cometogether, Then equals.
m
Permutation & Combination

Sol. m  2 5! 5! iv) N is divisible by 4 if a 2 a1 is divisible by 4.

Let us form such numbers : 04, 12, 24, 32, 52,20,40
Let x = 4 boys, y = 4 girls Case (i) :
The possible arrangements are When a2a1 is 04, 20, 40 a4a3 a4 a3 a2 a1
G x y B, B y x G, G B y x, B G xy, yx G B, xy B G, can be filled in 4P2
y B G x, x G B y (or x, B and y, G should come Case (ii) :
 X  B n  2  2! 2! 5P 5 P When a2a1 is 12, 24, 32, 52
alternately  4 4 )
a4a3 can be filled in 3 x 3 ( 0)
 a4
yG yG

Hence total = 3  4P2 + 4  9 = 36 + 36 = 72.

n v) Unit place must be 0 or 5.

5
n8 5  8  5!5  4 Case (i) :
P P !
4 4
m
Note 0

alls and n red balls (all are distinct) in a line so that no two black balls come together and no two red5Pballs
3
come together is 2(n!)2.
Case (ii) :

26. Find the number of 4 digit numbers using digits 0, 1,

2, 3, 4, 5, such that they 5
i) have no restriction ii) are even 5 4
iii) are divisible by 3 iv) are divisible by 4 P3 – P2
v) are divisible by 5 27. Find the number of 4 digit numbers using digits 0, 1,
2, 3, 4, 5, such that they
i) are divisible by 6 ii) are divisible by 8
Sol. i) iii) are divisible by 9 iv) are divisible by
11 where each digit being used at most once.
5 5 4 3
th
Sol. i) N is divisible by 6 if it is divisible by 2 and 3. We have
1000 place can be filled in 5 ways (without
to search even numbers in (iii)
zero) Required ways = 5  5  4  3 = 300
It is also equal to 6P4 – 5P3 with S1 : 0 ,
2
(with zero) when left most is 0 then it is a 3 digit 3! 3!–2!
number
ii) Unit place must be even. S2 : 0 , 2 or 4

Case (i) 0
3! 3!–2! 2
5
P3
 Case (ii)
S3 : 2 or 4

3! 2
4 x 4 x 3 x 2 ways
S4 :
Total = 60 + 96 = 156
iii) The number N = a nan–1an–2.....al where 3!

where S5 : As in S1
ai  0,1, 2,.., is said to divisible by 3 if
Total = (6+ 4)+ 6 + 4.2 + 6.2 + 6 + (6 + 4)= 52
9
n
ii) N is divisible by 8 if a3a2a1 is divisible by 8. These
are
 is divisible by subsets of (iv) in the previous example.
ai 3 104, 304, 504, 240, 120, 320, 520, 312, 512,
i1
Let us search 4-element subsets of S, whose sum 432,152,352. For each of first 7, 1000 place can be
is multiple of 3. filled in 3 ways
Sum of digits of S is 15 (= 0+ 1 + 2 + 3 + 4 + 5) Where as each of last 5 can be filled in 2
Now, delete 2 digits whose sum is multiple of ways Total = 7  3 + 5  2 = 31.
3. s1 ={0, 1, 2, 3}, s 2 ={0, 2, 3, 4}, s 3 = {1, 2, n

4, 5}
s4 = {0, 1, 3, 5}, s 5 = {0, 3, 4, 5} iii) N is divisible by 9 if a i is divisible by 9.
4 digit numbers with s3 = 4! = 24 and with i1

s1, s2, s4, s5 = 4! – 3! = 18 s2 and s4 are possible

each cases. Hence total = 2.18
 Total = 24 + 4 x 18 = 96. = 36.
1.7
P & C and Probability
iv) N is said to be divisible by 11 if 30. Number of natural numbers between 100 and 1000
a1 – a2 + a 3 – a4 +..........+ (–1) n an is a multiple of such that at least one of their digits is 7, is
11. For 4 digit numbers. (a1 + a 3) – (a2 + a 4) = A) 225 B) 243 C) 251 D) none
11k
Sol. (C)
 a1 + a 3 = 11m, a 2 + a 4 = 11n
Since sum of any two elements of S is < 11 Therefore the
, Total numbers between 100 and 1000 =
only possibility is a1 + a 3 = a 2 + a 4
 (a1, a3) (a2, a4) 9 10 10
i) (3, 0) (1, 2)
900 – 1 = 899
ii) (1, 3) (0, 4)
iii) (2, 3) (1, 4)
iv) (0, 5) (2, 3)
v) (5, 0) (1, 4) 8 9 9
vi) (1, 5) (2, 4) Total no. of 3 digit numbers without 7 = 81 × 8 = 648
 required number 3 digit numbers = 899 – 648 = 251
vii) (5, 2) (4, 3)
31. The number of distinct rational numbers p/q, where p,q
i) When (a1, a3) = (0, 3), (a 2, a4) = (1, 2)
the possible numbers are 3102, 3201 {1, 2, 3, 4, 5, 6} is
A) 23 B) 32 C) 36 D) 63
When (a1, a3) = (3, 0) then (a 2, a4) is (1, 2) there are
4 numbers i.e total 6 ways. Sol. (A) The given 6 digits can occupy the numerator and
Which is same for (ii), (iv) (v) for each of (iii), (vi) and 6
denominator places in P2 = 30 ways. But out of them
(vii), there are 2  2 + 2  2 = 8
123 246
Total = 4  6 + 3  8 = 48. ,, represent same ,, represent same
28. The number of numbers between 3000 and 4000 2 4 6 number. 123
which are divisible by 5, without repetition using the 36
digits 3, 4, 24
5, 6, 7, 8 is number. , represent same number. Similarly ,
A) 12 B) 24 C) 60 D) 120 3 6 2 4
Sol. (B) The required number is of the form 3 - - 5 1 2 36
The middle two places can be filled in 4P represent same , & , represent same
ways 3 6 12
2
number.
29. Find the sum of all 4 digit numbers3 that are formed 3 P – P = 48
by digits of 0, 1, 2, 3, 4, 5 without repetition. i.e. there 48 numbers whose unit place is
Sol. First we find sum of digits in unit place of numbers. 1 which is same for 2,3,4,5
 sum of digits in unit place
0 1 = 60 x 0 + 48 (1 + 2 + 3 + 4 + 5 ) = x
5
Sum of place values digits in 10th place =
P 5
 [60 x 0 + 48 ( 1 + 3 + 3 + 4 + 5)] x10= 10x number. In all above cases we have to consider only
Sum of place values digits in 100th place = 100x. one case each.
Sum of place values digits in 1000 th place
 No. of rational numbers
= (1+ 2+ 3+ 4+ 5) 5P3x103 = 30 – (2 + 2+ 1 + 1+ 1 + 1)+ 1
 Sum of all 4 digit numbers = 22 + 1 (  ‘1’ is a rational number)
= x + 10x + 100x + (1 + 2 + 3 + 4 + 5) 5P3 x 103 = 23
= (1 + 2 + 3 + 4 + 5) [48 + 5P3] (11 11)
= (1 + 2 + 3 + 4 + 5) [ 5P3 – 4P2] (11 11) Walk on a grid
Note Suppose a grid of size m  n is with mn unit squares is
given A person wants to walk (with shortest path) on
The sum of r-digit numbers using n digits
the grid from one corner to diagonally opposite corner.
0, 1, 2, 3,, 9 (with out repetition “r  n” Now person has to move horizontally and vertically
A
upward (down ward). There are m horizontal and n
The number of shortest paths from A to B
  n1 P r1 sumof n digits1111, when 0 is excluded vertical paths. Let H & V be respectively denote the
= The total number of arrangements of
 r times
horizontal and vertical paths.
=  n1  HHH......H VV......V
Pr1 1111  Pr2 1111 sum of n digits
n 2
 mn
 r1 times  B
when 0 is one of the n digits

1.8
 Permutation & Combination

 (m  n)!  mn C Note

n
m! n! The number of shortest paths from (x1,y1) to (x2,y2) by one unit move either horizontally o

 (x2 x1 y2 y1 )C , xx2 x121

x ,21y  y

SolvedExamples
Solved Examples
32. What is the number of shortest paths from A to B as 33. How many ways are there to spell RACHITICHCAR by
shown in figure going from one letter to the adjacent one in the figure
below
B R
A
C C C
H H
I I I
T T T
I I I

A H H
Sol. Let H,V be respectively denote horizontal & vertical C C C
move. Now to move from A to B, we need 5H & 4 A
There are 5 H & 4VS R
Sol. We have to move 5 of /direction and 5 of \ direction
9! 10!
 Total paths  4 !  9C4 required ways 
5!
5! 5!

Make Concepts Clear 1.1

1. a) Find the number of four letter word that can be 7. (a) In how many ways can four passengers be
formed from the letters of the word HISTORY. (each accommodate in three railway carriages, if each carriage
letter to be used at most once) can accommodate any number of passengers.
b) How many of them contain only consonants? (b) In how many ways four persons can be
c) How many of them begin & end in a consonant? accommodated in 3 different chairs if each person
d) How many of them begin with a vowel? can occupy at most one chair.
e) How many of them contain the letters Y? 8. A five digit number divisible by 3 is to be formed using the
f) How many of them begin with T & end in a vowel ? numbers 0, 1, 2, 3, 4 and 5, without repetition. The total
g) How many of them begin with T & also contain S? number of ways this can be done, is
h) How many of them contain both vowels ? A) 216 B) 240 C) 600 D) 3125
2. If repetitions are not permitted 9. The number of ways in which the candidates 1A , 2A , .....
a) How many 3 digit numbers can be formed from the A10 can be ranked if A1 and A2 are next to each other is
six digits 2, 3, 5, 6, 7 & 9 ? 10 ! 9!
b) How many of these are less than 400 A) 9! 2! B) 9! C) 2! D)
4!
?
c) How many of these are even 10. The number of ways in which the candidates A , A ,. ,
?
d) How many of these are odd ? 1 2
A10 can be ranked if is always above A2 is
e) How many of these are multiples of 5
A1
?
3. Find the number of 10 digit numbers using the digits 10 !
0, 1, 2, ....... 9 without repetition. How many of these A) 9! 2! B) 9! C) D) 10!
2
are
divisible by 4. 11. The number of ways in which 10 candidates A1, A2, A3,
4. Find the number of ways in which the letters of the A4..........A10 can be ranked if A1 is just above A2 then the
word "MIRACLE" can be arranged if vowels always number of ways are
occupy the odd places.
5. How many car number plates can be made if each 10 !
A) 9! 2! B) 10! C) D) 9!
plate contains 2 different letters of English alphabet, 2!
followed
by 3 different digits. 12. A man starts moving from the point (3, 5) and moves
6. Every telephone number consists of 7 digits. How to the right or vertically upwards only covering unit
many telephone numbers are there which do not distance in each step. The number of ways he could
include any other digits but 2 , 3 , 5 & 7 ? reach the point (7, 11) is
 1.9
P & C and Probability
A) C(16,6) B) C(10,6) 21. The sum of all 3 digit numbers formed by 1, 2, 3, 4,
C) C(6,4) D) C(16,10) without repetition is
13. Four visitors A, B, C & D arrive at a town which has A) 6660 B) 3330 C) 2220 D) none
5 hotels. In how many ways can they disperse 22. Let A = { x / x is prime number and x < 30}. The
themselves number of different rational numbers whose
among 5 hotels, if 4 hotels are used to accommodate numerator and denominator belong to A is
them.
A) 24 B) 120 C) 60 D) 45 A) 10p 2 B) 10p2+ 1 C) 10 D) None
14. Number of words which can be formed using all the 23. The number of ways in which 6 Telugu, 4 Hindi and 3
letters of the word "AKSHI", if each word begins with English books be placed in a row on a shelf so that
vowel or terminates in vowel is the books on the same subject remain together is
A) 36 B) 84 C) 120 D) 12 A) 6! 4! 3! B) 3! 6! 4! 3!
15. In how many ways can the letters of the word 13! 13!
"CINEMA"
be arranged so that the order of vowels do not C) D)
6 ! 4 ! 3! 6! 4 ! 3! 3!
change. A) 120 B) 36 C) 84 D) 6!
16. In a morse telegraphy there are 4 arms & each arm 24. The number of ways in which we can arrange the
digits 1, 2, 3 9 such that the product of five digits at
is capable of taking 5 distinct positions including the
any of
position of rest. How many different signals can be
the five consecutive positions is divisible by
made..
7 is A) 7! B) 9 P 7C) 8! D) 5 7!
25. The maximum number of persons in a country in
which no two persons have an identical set of teeth
assuming that there is no person without a tooth is
A) 232 B) 232 – 1 C) 32! D) 32!-1
26. There are 5 doors to a lecture hall. The number of
ways that a student can enter the hall and leave it by
A) 45 B) 45–1 C) 54–1 D) 54 a different door is
17. From 6 different novels and 3 different dictionaries, 4 A) 20 B) 16 C) 19 D) 21
novels and 1 dictionary are to be selected and 27. On a new year's day every member of a family
arranged in row on a shelf so that the dictionary is sends a card to every other member and the
alway in the middle. Then the number of such postman delivers 156 cards, the number of members
arrangements is of the family is
A) at least 750 but less than 1000 A) 12 B) 11 C) 14 D) 13
B) at least 1000 28. Among the 8! permutations of the digits 1, 2, 8, consider
C) less than 500 those arrangements which have the following
D) at least 500 but less than 750 property. If we take any five consecutive positions, the
18. The number of words that can be formed using all the product of digits in these positions is divisible by 5.
Then number of such arrangements is
letters of the word REGULATIONS such that G must
come after R, L must come after A and S must come A) 7! B) 2  7! C) 7C4 D) none
after N 29. The number of ways in which 5 different books can be
distributed among 10 people if each person can get at
11
most one book is :
A) B) 11 C) 11P6 D) None
8 A) 252 B) 105 C) 510 D) 10P5
19. Number of natural numbers less than 1000 and 30. In a conference 10 speakers are present. If S1 wants
divisible by 5 can be formed with the ten digits, each to speak before S2 & S2 wants to speak after S3, then
digit not occuring more than once in each number is the number of ways all the 10 speakers can give
A) 136 B) 154 C) 64 D) 153 their
20. Number of odd integers between 1000 and 8000 speeches with the above restriction if the remaining
which have none of their digits repeated, is seven speakers have no objection to speak at any
A) 1014 B) 810 C) 690 D) 1736 number is
10 !
10 10 10
Answers A) C 3 B) P 8 C) P3 D)
3
1.a) 840 ; b) 120 ; c) 400 ; d) 240 ; e) 480 ; f) 40 ; g) 60 ; h) 240
2. a)120 ; b)40 ; c) 40 ; d)80 ; e)20 3. 20 .8! 4.576 5. 468000 6.4 7
7.(a) 3 4 ; (b) 24 8. A 9.B 10.C 11. C
12.B 13.B 14.B 15.A 16.C 17. B 18.A
19.B 20.D 21.A 22.B 23.B 24.C 25.B
26.A 27.D 28.B 29.D 30.D
Solutions Are On Page No. 1.77
1.10
 Permutation & Combination
Deductions
1.2 Permutations for Repeated
1) Theand Identical
number Objects
of permutations of n dissimilar objects taken
atmost ‘r’ at a time  r  1 when repetition of objects is

Permutations when Repetition of objects

n
r
 1
is allowed allowed is n + n + n +.....+ n = n
2 3 r ,n1
n1
2) The number of permutations of n dissimilar objects
taken
r objects taken ‘r’ at a time where each object can be used any number of times at repetition
(i.e. least r + 1ofatobjects
a timeiswhen repetition
allowed) is nr , of objects
is allowed is nr+ 1 + n r+ 2 + + n n
 n  1
nr
= nr 1  n  1 1, n
 

Note
The number of permutations of n distinct objects taken r at a time when atleast one object is repeated = n r – nPr
Eg : The number of 5 letter words that can be formed using the letters of the word EQUATION such that at least one
1 2 3 r
...

nxnxn xn =nr

(Using multiple rule)

each box can be filled in n ways.

Solved Examples
34. Find the number of 4 digit numbers formed by arranged in 5 boxes in ways, each remaining place
5
P 3

0, 1, 2, 3, 4, 5 when repetition of digits is allowed can be filled in 7 ways (using other digits) when 3,4,5
such that occupies last 3 places and first 2 places are ‘O’ there
i) divisible by 3 its represent a 3 digit number.
ii) divisible by 6
Required number of 5 digit numbers = 5  4  3  7  7
x1 x2 x3 x4 =2940
Sol. i) divisible by 3 :
36. The sum of 3 digit numbers whose middle digit is a
5 6 6 perfect square using the digit 1 to 9 with repetition is
A) 134055 B) 270540
3k then x4  0 or 3 C) 170055 D) none of these
Now, if x1 
+ x + x 3= 3k 1 x  2 or 5 Sol. (A) Middle place 1, 4 & 9
2 4

 3k  2, x 4 1or 4
Two terminal positions 1, 2,......., 9
In each case x4 has 2 ways. Hence total numbers = 9 . 9 . 3 = 243
Hence required no. = 5.6.6.2 = 360 (Terminal digits can be filled in 9 ways and middle one
in 3 ways)
x1 x2 x3 x4 For the middle place 1, 4 & 9 will come 81 times
ii) divisible by 6 :
 sum = 81  10 (1 + 4 + 9)  A
x4 must be even and x1 + x 2 + x 3 + x 4 = 3k For units place each digit from 1 to 9 will appear 27
times
From previous  sum = 27 (1 + 2 + ...... + 9)  B
x4 ( 0 or 2 or can be filled in 1 For hundreath's place, similarly sum = 27  100
way
4). (1 + 2 + ...... + 9) ... C
Hence the required number of numbers  5  62  A + B + C gives the required sum
180
35. The number of integers from 1 to 105 which contain Note
exactly one 3, exactly one 4 and exactly one 5 must
To find sum of r-digit numbers when repetition is allowed. The sum of r-digit numbers form
be
A) less than 2000 B) more than 3000
C) 2940 D) 3270
Sol. (C) Consider 5 boxes now 3,4,5 can be 1.11
 P & C and Probability

n digits  0, 1,, 9 38. The sum of all three digited numbers that can be
formed from the digits 1 to 9 and when the middle
digit is perfect square is
nr-1 sumof ndigits 111....1 , if zero is excluded A) 1,34,055 (When repetitions are allowed)
A) 1,70,555 (When repetitions are allowed)
 r times

=  r-1  C) 8,73,74 (When repetitions are not allowed)

n 11....1- n-1 1111 sumof ndigits 
r-2
D) 93,387 (When repetitions are not allowed)
 r-1 times  Sol. (A,D) i) When repetitions are not allowed sum of digits
in unit place
if zero is included 9 9
37. Find the number of 7 digit numbers using 0 to
9
7( r  1)  7(r  4))  7(r  9)  784
r1 r1 r1
i) such that sum of digits is even
sum of digits in 100th place = 847
ii) which are palindrome
When repetition is sum of digits in 10th place 8 P2(1  4  9)  784
allowed ( when middle digit is 1, then unit digit can be 2 to 9
Sol. i) x1 x2 x3 x4 x5 x6 x7 there are 7 such numbers)
Required sum  847  784  10  847  100 = 93,387
9 10 10 1010 10 ii) when repitition is allowed sum of digits in unit place
if x1 + x 2 + x 3 + x 4 + x 5 + x 6
even, x7  0, 2, 4, 6, 8  9 
= odd, x  1, 3, 5, 7, 9
 7
27 
 r  1215

 Total number of ways = 45  105  r1 
ii) A string (consisting digits, alphabets etc) is called sum of digits in 100th place = 1093500
a palindrome when read from left to right and right to sum of digits in 10th place = 81(1+ 4+ 9) = 1134
left, it remain same. For instance  Total sum = 134055
(1234567891987654321 which is a prime
39. How many positive integers less than 105 can be
palindrome number)
written with only the digits 7 and 9 ?
a b c d c b a Sol. The number of 1 digit numbers is 2
The number of 2 digit numbers is
22 The number of 3 digit numbers
9 10 10 10 1 1 1 is 23 The number of 4 digit
Total palindromes = 9  103 = 9000 numbers is 24 The number of 5
digit numbers is 25 Total = 62

hen several identical objects Proof Method-1

are involved kinds of
o arrange A,A,A,B. Let us list out allThe n–m non
possible - identical things
arrangements : AAAB,can be arranged
AABA, in n places in nPn–m, now in the remaining places m identical thing
ABAA, BAAA

s follows.

nP  n!
 Required ways = n  m m!

Method-2
Consider 4 places . First we arrange
Let x be the no. of permutations. Consider one of these permutations say
4!
non repeated objects, i.e B, it can be done in
4
P1 
3! ways,
e vacants to be filled by 3 A’s, it can be done in only 1 way. Hence total ways = 4 a a a........ ax
12 xx nm
3     
m times
r of permutations of n things of which m  n things are of same kind and rest are distinct is
Remove m’a’ and replace m distinct objects other than
xi’s, keeping arrangement of x1 x2xn–m as it is, and
arranging m distinct objects, it can be done in m! ways.
Thus, for each of x permutations there are m! distinct permutations. Hence
m!

1.12
 Permutation & Combination

m! x = permutations of n distinct objects = n! Note

x  n! which completes the proof. The number of permutations of (m1+ m 2+ .... + m k) things where there are mi objects of ith kin

m!
(m1  m2  m3  mk )!
things) = m !12m ! ...... m k!
Solved
SolvedExamples
Examples
40. In how many ways the letters of the word
5!
ENGINEERING, can be arranged such that It can be done
a) all vowels don’t come together. 2! 2!
in
b) all E’s come together but no two N’s come 5! . 6
together. !
c) there will be two distinct letters between two ‘IN’s.
Hence total =
 2!  3!
2 2
d) none of the letters I, G,R occurs in last six
positions.
e) First we arrange 3 N’s , G, G, I, I and R
e) exactly 2 E’s come together and 3N’s come
together
f) E’s and N’s come alternately
Sol. There are 3E’s, 3N’s, 2G’s, 2I’s, 6!
1R It can be done 2!2! ways.
in
11!
Total permutations 3! 3 ! 2! 2!  NNN  G  G  I  I  R 
=
a) The number of arrangements such that all vowels In the seven gaps 2E’s, E can be arranged in 7P2
ways.
6!
 42  6! 13
7 ! 5! Hence total required ways
come together
2!3! 3! 2! =
2!2!
=
the number of arrangements such that all vowels f) First we arrange 2G’s, 2I’s and IR in 11 positions.
do
P5
11! 11
7! 5!
not come together = 3! 3! 2! 2! – its can be done in 2! 2 1! , now we have
3! 3! 2! 2!  
6! 6 vacancies, we have to fill them with sequence
b) x EEE ENENEN or NENENE, it can be done in 2 ways.
xGxGxIxIxRx, 
 2!
2

11
P5 1 11
7 P3 2
P
In 7 gaps 3N’s can be arranged in ways Total = 2
2
5

3!  
2!
41. The number of ways in which the letters of the word
6! 7
P 5 PESSIMISTIC can be arranged so that no two Ss
Hence ,required ways = 2  3   7! are together, no two Is are together and letters S
 
2! 3! and I are never together is
IN – – IN , where have to fill the gaps with A) 86400 B) 48000 C) 2400 D) 5480
c)
Sol. (C) Arrange the remaining letters in 5! ways
6! 6! P  E  M  I  C 
E,G,N,R case (i) E,G In this case 2  
2! 2 6!
ii) E,N In this 2  5! In the 6 gaps the 3 Ss and 3 Is can be arranged in
3! 3!
iii) E,R In 5! ways
this case 2  2! x 2!  Required number of arrangements= 5! 20  2400
42. Find the number of as many more words as possible
iv) G 6! 6!
2 3!  3 (or otherwords or rearrangements) be formed using the
,N  letters of the word CIVILISATION without changing
6! 6! the relative order of vowels and constants.
2 3!  3
v) G Sol. Required number of ways
,R 

vi) R, N 6 !  6!
 2 6!
 3! 2! 6  (I I I A I O) 6!(C V L S T N)
14!
Total number of arragements 11  5!
=
d) First we arrange 2I’s, 2G’s, 1R in the first five  30.6!  1
positions.

1.13
P & C and Probability
43. Find the sum of all 7 digit numbers whose sum is 10, Case (iii) : 1, 1, 2, 2, 1, 3 ; The number of
using the digits 1, 2, 3. arrangements
Sol. We have find sum of 77 numbers = 60.  Total = 90
45. Find the sum of all the numbers greater than 1000
using
.
.. ... . the digits 0,1,2,2.
   .. ... .
... . . 1    Sol. (i) When 1 is at thousand's place, total numbers formed
 ... . . 2

i) 6!
4! 30 ; 6!
5!  6

 sum of digits in unit places 3!

will be = 3
= 30 x 1 + 6 x 2 + 6 x 3 = x
2!
Hence sum of numbers formed by 1,1,1,1,1,2,3 is
106x (ii) When 2 is at thousand's place, total numbers
+ 10 5x + 10 4x + 103x + 10 2+ 10x + x
= (1 1 1 1 1 1 1) (30 + 12 + 18) = 66666660 formed will be = 3! = 6

. . (iii) When 1 is at hundred's, ten's or unit's place then

... ... ... ... ...
      total numbers formed will be-
. ... . 1 . ... . 2
    Thousand's place is fixed i.e. only the digit 2 will come
ii) 6! ; 6!
3! 3! 20 4! 2! 15
Sum of digits in unit places
here, remaining two places can be filled in 2!
= 20  1 + 15  2 = 50
Hence sum of numbers formed by 1, 1, 1, 1, 2, 2, 2 ways. So total numbers = 2!
= (1111111) (50) = 55555550 (iv) When 2 is at hundred's, ten's or unit's place then
Therefore sum of 77 numbers = 122222210. total numbers formed will be-
44. Find the number of 6 digit numbers whose sum is 10,
using the digits 1, 2, 3 only. Thousand's place has 2 options and other two places
Sol. Case (i) : 1, 1, 1, 1, 3, 3 ; The number of can be filled in 2 ways.
arrangements

6! So total numbers = 2 × 2 = 4
 4 ! 2!  15
Sum = 103 (1 × 3 + 2 × 6) + 10 2 (1 × 2 + 2 × 4) + 10 1(1
Case (ii) : 1, 1, 2, 2, 2, 2 ; The number of × 2 + 2 × 4) + (1 × 2 + 2 × 4)
arrangements
= 15 = 15 × 10 3 + 10 3 + 102 + 10 = 16110

in dictionary order (lexicographical order). The position

To find rank of a word at which x occurs is called rank of the word.
Let x be a word. When the letters of the word x are
permuted in all possible ways, and the words thus
formed are arranged Solved Examples
Solved Examples
46. Find the rank of the word ‘PARLOUS’ PARLOUS - 1
Sol. The letters of the word in alphabetical order is  Rank of the word = 3.6! + 2.4! + 1 + 1 = 2210
A,L,O,P,R,S,U Aliter
The number of words begin PARLOUS (The no. of letters before
with A______is 6!
L_________is 6!
O_________is 6!
PAL______is 4!
PAO______is 4!
PARLOSU - 1
 3 020010 P(in alphabetical  Rank of the word
order) 6! 5! 4! 3! 2! 1! 0! is 3(A,L,O)to the = 7! + 6.6! + 4.5! + 1.4! + 2.3! + 2.2! + 1 + 1
right P. = 5382
 Rank = 3.6! + 2.4! + 1.1! + 1 48. Find the rank of the word FABLE
47. Find the rank of the word EUPHORIA Sol. F A B L E
Sol. E U P H O R I A 3 0 0 1 0
1 6 4 1 2 2 1 4! 3! 2! 1! 0!
0 Rank of the word = 3.4! + 1.1! + 1 = 74
7! 6! 5! 4! 3! 2! 1! 0!

Make Concepts Clear 1.2

1. In how many ways the letters of the word
ENGINEERING, can be arranged such that
a) No two vowels come together.
b) All E’s come together and all N’s come together.
c) Same kind come together.
d) Permutation containing the word RING.
e) Vowels occupies odd positions
2. Find the number of 5 digit numbers which are formed
by 0, 1, 2, 3, 7 such that sum of digits is 5.
3. The 120 permutations of MAHES are arranged in

1.14
Permutation & Combination
dictionary order, as if each were an ordinary five- A) 5 B) 325 C) 345 D) 365
letter word, then last letter of the 86th word in the list 14. The number of n digit numbers which consists of the
is digits 1 & 2 only if each digit is to be used atleast
A) A B) H C) S D) E once, is equal to 510 then n is equal to:
4. Ten different letters of an alphabet are given. Words with A) 7 B) 8 C) 9 D) 10
five letters are formed from these given letters. The 15. If as many more words as possible be formed out of
number of words which have at least one letter repeated, is the letters of the word "DOGMATIC" then the
A) 69760 B) 30240 number of words in which the relative positions of
C) 99748 D) None of these vowels and consonants remain unchanged is .
A) 719 B) 720
5. The number of permutations of letters of word C) 718 D) 8! – 1
“TRIANGLE” so that neither the pattern ANT and nor 16. A shelf contains 20 different books of which 4 are in
“GEL” appears is single volume and the others form sets of 8, 5 and 3
6. The number of permutation that can be made out of volumes respectively. Number of ways in which the
the letters of the word "MATHEMATICS" books may be arranged on the shelf, if the volumes
i) When all vowels come together is of each set are
8!.4! 8!.4 7! . 4 ! together and in their due order is
A) B) ! C) D) 7! 4! 20!
2! 2!
(2!)2
ii) When no two vowels come together A) 8 ! 5! 3! B) 7! C) 8! D) 7 . 8!
is
4 P
8 7! . P 8 17. Number of different words that can be formed using
7! . P 8
8 4 all the letters of the word "DEEPMALA" if two vowels
A) 7! P C) of
4
B) 2! 2! 4
(2!) D) 7! same kind are together and the other two are also
3 2!
together
iii) When the relative positions of vowels but separated from the first two is
and consonants remain unaltered is A) 960 B) 1200 C) 2160 D) 1440
A) 3 . 7! B) 2 . 7! C) 7! D) 4 . 7! 18. Number of ways in which 5 A's and 6 B's can be
7. The number of ways in which the letters of the word arranged in a row which reads the same backwards
"SUCCESSFUL" be arranged such that and forwards, is
i) All the 'S's come together is A) 6 B) 8 C) 10 D) 12
19. The sum of all 5 digit odd numbers that can be made
8! 8! 8!
A) 8! B) D) with the digits 0, 1, 4, 5, 4 is
C) 2! 2! 2! 2! 2! A) 708854 B) 708845
2!
ii) No two 'S's will come together C) 808845 D) None
is
7! 20. The number of five digit numbers formed using the
B) 7! 8.
8
A)
P 3 8C) D) 7! 3 P digits 0, 2, 2, 4, 4, 5 which are greater than 40,000 is
P 3
2! 2! 2! 2! 2! 2! 3! A) 84 B) 90 C) 72 D) 60
iii) The 'S's and 'U's will come together 21. The number of different numbers greater than 1000000
is
7! 7! 7! that can be formed with the digits 2, 3, 0, 3, 4, 2, 3 is
A) 7! B) C) 2! 2! D) A) 60 B) 120 C) 360 D) 230
2! 2! 2! 2!
8. If all permutations of the letters of the word AGAIN are arranged as in dictionary the 47th word is
 A) N A A G I B) I N G A A 22. The number of ways in which 6 '+ ' and 4 '-' signs can
C) N A A I G D) I N A G A be
9. How many odd numbers of five distinct digits can be arranged in a line such that no two '-' signs come
formed with the digits 0,1,2,3,4 ? together is
10. How many 10 digit numbers can be made with odd A) 35 B) 120 C) 720 D) 610
digits so that no two consecutive digits are same. 23. The number of 6 digit even members formed by
using the digits 1,2,1,0,2,2 is
A) 5  49 B) 410 C) 510 D) 4  59 A) 44 B) 40 C) 34 D) 50
11. There are 720 permutations of the digits 1, 2, 3, 4, 5, 24. Two teams are to play a series of 5 matches
6. Suppose these permutations are arranged from between them. a match ends in a win or loss or draw
smallest to largest numerical values, beginning from for a team. A number of people forecast the result of
1 2 3 4 5 6 and ending with 6 5 4 3 2 1. each match and no two people make the same
(a) What number falls on the 124th position? forecast for the series of matches. The smallest
(b) What is the position of the number 321546? group of people in which one person forecast
correctly for all the matches will contain ‘n’ people,
where n =
A) 81 B) 243 C) 486 D) 144
25. The number of ‘n’ digit numbers such that no two
consecutive digits are same is
12. Number of 4 digit positive integers if the product of A) 9! B) n9 C) 9n D) 9n
their
digits is divisible by 3 is 26. How many three digit numbers have at least one
A) 2700 B) 5464 C) 6628 D) 7704 even digit?
13. All possible three digits even numbers which can be A) 775 B) 875 C) 450 D) 750
formed with the condition that if 5 is one of the digit, 27. Rank of the word KANGUR is
then 7 is the next digit is: A) 248
th
B) 247th
1.15
P & C and Probability
C) 246th D) 253rd eight 'dots' can be arranged, using only seven of
28. Number of 9 digits numbers divisible by nine using these 13 'dashes' & 'dots' is :
the digits from 0 to 9 if each digit is used atmost A) 1287 B) 119 C) 120 D) 1235520
once is K · 8 33. Let m denote the number of ways in which 4 different
! , then K has the value equal to books are distributed among 10 persons, each
A) 14 B) 15 C) 16 D) 17 receiving none or one only and let n denote the
29. Number of permutations of 1, 2, 3, 4, 5, 6, 7, 8 and 9 number of ways of distribution if the books are all
taken all at a time, such that the digit 1 appearing alike. Then :
somewhere to the left of 2 A) m = 4n B) n = 4m
3 appearing to the left of 4 and C) m = 24n D) 4 = 2m
5 somewhere to the left of 6, is 34. The sum of all even 3 digit palindromes, is
(e.g. 815723946 would be one such A) 22380 B) 25700 C) 22000 D) 22400
permutation) A) 9 · 7! B) 8! C) 5! · 35. The number of ways of arranging the letters of the
4! D) 8! · 4! word ENGINEERING so that exactly 2E’s come
30. There are counters available in x different colours. together is
The
counters are all alike except for the colour. The total   9! 10 !
number of arrangements consisting of y counters, A) 3  8 B) C) 4  8 D)
assuming sufficient number of counters of each (3!)(2!)2 3!(2!)2
! !
colour, if
no arrangement consists of all counters of the same 36. The number of ways of arranging the letters of the word
colour is : ENGINEERING so that exactly 2E’s cometogether
A) xy  x B) xy  y C) yx  x D) yx  y and exactly 2N’s cometogether is
31. Number of ways in which 7 green bottles and 8 blue 59
A) (15)7! B) 7!
bottles can be arranged in a row if exactly 1 pair of
4
green bottles is side by side, is (Assume all bottles to
be alike
except for the colour). 9 ! 7! 9! 3  7!
A) 84 B) 360 C) 504 D) none C) 4  2 D) 4  2
32. The number of different ways in which five 'dashes'
and

Answers
6! 7! 7! 8! 6!
1. a) ; b) e) 2. 61 3. D 4. A
2!3!2!3! ; c) 5 ; d) 3!2!
 2! 3!2!
2
 5.1416 6. i) D, ii) C , iii) A 7. i) C, ii) B , iii) B 8. D 9. 36
10. A 11. a) 213564, b) 67 th
12.D 13.D 14.C 15.A
16.C 17.D 18.C 19.A 20.B 21.C 22.A
23.C 24.B 25.C 26.A 27.A 28.D 29.A
30.A 31.C 32.C 33. C 34.C 35. A 36. B
Solutions Are On Page No. 1.78

By breaking circle at a1, we get a linear permutation Similarly, by breaking circle at a2

1.3 Circular Permutations We get r linear permutations
Hence total number of a linear permutations.
Arrangement of objects around a circle is called circular permutation.

THEOREM 4
The number of circular permutations of n dissimilar
nP

n Pr rx = nP r  xr
objects taken ‘r’ at a time is r
r
Proof
Note
x be the number of circular permutations. Consider one of these x permutations. Say

ar a2

ar–1 a3
a4
1.16

If r = n then x = (n – 1)!
Among these circular permutations half (are) clockwise and half anticlockwise.
For instance, let us arrange four persons P1, P2, P3, P4 around a circle.
 Permutation & Combination

P1 P1 P1 objects have same neighbours is

P4 1 ( we
P2 have
P3
consider
2 either
P2 clockwise
P4 3or anticlockwise
P3
permutations).
In the above example,
in 1,5P1 have same neighbours.
P3 in 2, 4P1 have sameP4 neighbours. P2
P1 P1 P1
in 3, 6P1 have same neighbours.
3) In the preparation of chains, garlands, necklace etc. clockwise and anticlockwise permutations a
i.e 1/2 of total circular permutations.
P2 4 P3P2 5 P4P3 6 P4

P4 P3 P2

Hence , the number of ways of arranging n dissimilar objects around a circle, so that in no two arrangements

Solved Examples Solved Examples

49. In how many ways can 5 persons be seated around Gentlemen can be arranged in 5! ways
circular table ? How many of these arrangements will We have 6 gaps, 3 ladies can be arranged in 6P3
two particular persons be next to each other. (linear permutation)
Sol. For 1st one answer is (5 – 1)! = 4! Hence total = 5!  6P3
For next one, considering two particular persons as ii) 6! x 3!
one person, we have 4 persons in all. They can be G1
seated around a circular table in 3!. But two 6 1
particular persons can be arranged among G6 G2 2
themselves in 2!. Hence total = 3! x 2! = 12. 5 G
50. A round table conference is to be held between 20 G5
iii)
delegates of 2 countries. In how many ways can they 3

be seated if two particular delegates are i) always 4 3

together G4
gentlemen can be arranged in 5! ways. Now ladies
ii) never together. have
Sol. i) two particular delegates can be considered as a occupied 1,3,5 positions or 2,4,6 positions.
person, then there are 18 + 1 = 19 persons, they can Hence total = 5!  2  3!
be arranged arround circle in 18! ways and particular iv) Assume two particular ladies and particular
persons can be arranged in 2! ways. Thus total gentleman as single person, then total people now
= 18!  2! are 4 + 1 + 1 = 6, they can be arranged in 6! and 2
ii) Required number of ways = 19! – 18!  2! ladies can be arranged in 2!
51. A man invites 10 friends for a dinner party. In how Total = 2!  6! ; Required number of ways
many ways they can be seated around a circular = 8! – 2!  6! = (54)6!
table so that two particular friends on either side of 53. The number of ways that 8 beads of different colours
man. be strung as a necklace is
Sol. Let M be the man and F1, F2 be two particular friends. Sol. Since, direction is immaterial number of garlands
F1MF2 considered to be a single person. We have 9
7!
in all. They can be arranged in 8! and F1, F2 can be
=
interchange in 2 ways. Total = 8! x 2 2
52. There are 6 gentlemen and 3 ladies to dine at a 54. Find the number of ways in which 8 different flowers
round table. In how many ways can they seat can be strung to form a garland so that 4 particular
themselves so that flowers are never separated.
i) No two ladies sit together. ii) All ladies sit together. Sol. Considering 4 particular flowers as one flower, we have
iii) Every gentleman have a lady on his adjacent. 4!
iv) Two particular
G1 ladies refuse to sit beside a
particular gentleman.G2
G6
five flowers which can be strung to form a garland in
2
ways. But 4 particular flowers can be arranged in 4!
G5 G3 ways.
Sol. i) 4! 576
Thus, the required no. of ways =  4!  = 288.
2 2

G4
1.17
 P & C and Probability

Make Concepts Clear 1.3

1. A gentleman invites a party of m + n (m  n) friends 2. The number of ways in which six boys and six girls can
to be
a dinner & places m at one table T 1 and n at another seated at a round table so that no two girls sit
table T2 , the table being round . If not all people together and two particular girls do not sit next to a
shall have the same neighbour in any two particular boy is
arrangement, then A) 6! 4! B) 2.5! 4! C) 2.6! 4! D) 5! 4!
the number of ways in which he can arrange the
guests, is
(m  n) !
1 (m  n) 3. All the five digit numbers in which each successive
A) 4 mn !
B) digit exceeds its predecessor are arranged in the
(m  n) 2 mn increasing order of their magnitude. The 97 th number
! in the list does not contain the digit
(m  n)!
C) 2 D) A) 4 B) 5 C) 7 D) 8
mn m! n!

Answers
1.A 2. C 3.B
Solutions Are On Page No.1.81

1.4 Combination nP
group has exactly r! arrangements. Therefore r gives
r!
Each of the different groups or selections which can be r-element subsets of n-element set, which completes the proof.
made by taking some or all of a number of things
(irrespective of order) is called a combination. A
combination is a selection of objects without regard to Notation
order (key word : select)
Let r  n and let A be a finite n-element set. In many n
Pr n!  n
situations it is convenient to consider r-element
collections  , usually it is denoted by nC or   or
r! r !n  r
r
consisting of elements from A such that each element a
r!
 A occurs atmost once and the order of the elements
doesn’t matter, in otherwords to consider r-element C(n, r).
subsets of the set A.
Deductions
A r-element subset of the set A will be called a r- n n
1) C n1
combination from the elements of A (or in short, a r- r
r C r 1
combination from n elements). 2)
n
C  n1C  C
n

Thus, for example, a, b,c , a, b,d , a,c,d , r r r1

b,d,c are
(all the) 3-combinations n nr1
from 3) Cr / n r  r
1
C
A = a, b,c,d
4) The number of ways of selecting r things from ‘n’
.
dissimilar things when
THEOREM 5
The number of combinations of n-dissimilar objects i) s particular things excluded is n–sCr

n P ii) s particular things included is nCr–s, s r

taken r at a time is r
r! 5) The number of ways of selecting atleast ‘r’ things
from ‘n’ dissimilar things is nCr + nCr+ 1 + ... + nCn

at each group contains exactly those permutations that consists of the sameEg. : A set (and
r elements A contains 12 elements.
differ only in the ordering of the elements). Then each
i) The number of 3-element subsets of A is 12C3
ii) The number of subsets containing at least 6 elements
 12
is C6 + 12C7 + 12C8 + ... + 12C12

1.18
Permutation & Combination

1 12 particular elements.
= 2 
11
C6
2 a) excluded is 10C5 b) included is 10C3.
iii) The number of 5-element subsets of A when two
SolvedExamples
Solved Examples
55. A father has 10 children. He takes 3 children at a i) committee includes all three M1, M2, W
time to a zoo park every day. ii) committee includes M1,M2 but not W
i) How often father visits the zoo park ? iii) committee includes M2 ,W but not
ii) How often each child visit zoo park ? M1. Hence total no. of committees

Sol. i) Suppose s c1, c2, c3 ....., c10 (set of = 10C5 – 7C2 – 7C3 x 2 (ii & iii have same no.)
= 161
children). The number of 3-(element) children subsets vi) Required ways = 10C – 6C (M , M , W , W included)
of s is 10C3, these
5 1 1 2 1 2
many times father visit the zoo park. 58. The number of ways in which a mixed double tennis
ii) The number of 3-children subsets of s, when a game can be arranged from amongst 9 married
particular child is included is 9C2. couple if no husband and his wife play in the same
56. The number of distinct rational numbers n such that game is equal to
0
< n < 1 and n = p/q, where p, q  {1, 2, 3, 4, 5, 6} is Sol. We can choose two men out of 9 in 9C2 ways.
By excluding their wives from 9, we have 7 remaining.
A) 15 B) 13 C) 12 D) 11
From these, two women can be selected in 7C2 ways.
Sol. (D) From 6 digits 2 digits can be selection 6 C2 ways If M1, M2, W1 and W2 are chosen, then a team may
and they can be arranged in only one way. Out of consist of M1 and W1 or M1 and W2. Thus, the
number of ways
these
123
ways ,, represent same number of playing the game.
246 = 9C2. 7C2 . 2 = 112
59. The papers of 4 students are to be checked by 7
teachers.
2 Then in how many ways can the 4 papers are
4 , represent same number
3 6 checked by exactly 2 teachers.
Sol. The number of ways of choosing two teachers out of 7
1 represent same number is
2, 7
C2.
3 6 The
is number of ways in which they can check 4 papers
 No. of numbers = 15 – 4 = 11
24. But this includes two ways in which all papers will
57. Find the number of committee of 5 members formed
be checked by a single teacher. Therefore the
by 6 men and 4 women so that
number of ways in which 4 papers can be checked
i) at least two women and atleast one man
by exactly two teachers is 24 – 2 = 14.
ii) two particular opposite sex always included.
iii) two particular opposite sex refuse to serve in the Total required number of ways = 14. 7C2.
same committee 60. A man is allowed to take atmost 10 steps either
forward
iv) Majority of women serve in the committee.
or backward. The number of ways in which he will be
v) M 1, M 2 & W are particular men and woman
respectively, M1 refuses M2 and M2 refuses W to just two steps away from his initial position is
serve in the same committee. Sol. The man will be just two steps forward from his initial
position (in atmost 10 steps) if his movement is as
vi) (M1, M2), (W1, W2) are two particular men and
follows 2F or 3F ; B) or (4F : 2B) or (5F, 3B) or (6F,
women
4B)
Thus, required number of ways
respectively. Whenever M1 and M2 serve in the same
committee, W1 and W2 do not and vice versa. = 2C0 + 4C1 + + 8C3 + 10C
6 4
C2
Sol. Before we attempt the question, let us analyse all remaining 3, from 8 can be selected in 8C3 ways
possible cases and put them in tabular form iii) Required number of selections = total number of
i) W(4) 6(M) selections without restriction – number of
2 3 Hence total selections selections such that particular opposite sex serve
3 2 = 4C2.6C3+ 4C3.6C2 + 4C4.5C1 together
4 1 = 120+ 60+ 5= 185
ii) After including two particular opposite sex,
 = 1 + 4 + 15 + 56 + 210 = 286 interview the six persons one by one subject to the
Also, the number of ways in which the man is just condition that no mother is interviewed before her
two steps backwards = 286 child. The number of ways in which interviews can
Total = 572 be arranged is
61. Three ladies have each brought their one child for Sol. The first child C1 can be chosen in 3 ways, his/her
admission to a school. The principal wants to mother can be interviewed in 5 ways, the second
child C2 can
be choosen 2 ways and his/her mother can be
= 10C5 – 8C3 4 6 4 6 interviewed
in 3 ways.
iv) Required ways = C4 . C1 + C3. C2 = 66
v) The following cases to be excluded from the
total
1.19
P & C and Probability
Hence required number of ways = Remaining 6 people on 6 positions can be seated in 6!
3
C5 2
C1  3  90 ways
1
 Required total ways = 3C .4C .2!.6! = 25920
1 2
Note Alternatively : 2 out of 6 people can be selected in 6C2
ways. Now (6C2 + AB)
If there are n mothers and n children (in the above problem) i.e. 4 persons on bow side can be seated in 4!
= (2n)! ways. Total ways 1 = 2C . C .4!.4! = 25920
3 6

then total ways = n(2n–1)(n–1)(2n–3)1 . 64. A class contains 4 boys and ‘g’ girls. Every sunday
2n
five students, including at least three boys go for a
62. A van can accomodate 8 persons, 4 in the front and picnic to Zoo Park, a different group being sent every
4 at the back. If heights of 8 persons are all different, week. During, the picnic, the class teacher gives
then in how many ways they can be seated in the each girl in the group a doll. If the total number of
van so that the person who is sitting in the front is dolls distributed was 85, then value of ‘g’ is
shorter than just at back ? A) 15 B) 12 C) 8 D) 5
Sol. (D) The number of ways of forming a group of 5 from
Front 4 boys and g girls with atleast 3 boys
= 4 C  gC  4C  g C = 4  g C  g
3 2 4 1 2
Sol. number of doll’s distributed among the girls
back = 2  4  gC2  g = 4g2  3g = 85
Select one seat at the back, it can be done in 4C1, 2
now 
tallest person will occupy this seat and infront of him 4g  3g  85  0  g  5
any one of 7 persons can be seated in 7C1 ways.
(There are two girls in each of 4 x g C 2 groups)
Again select one seat at the back from remaining 3,
it 65. Find the number of 3 digit numbers xyz such that
can be done in 3C1 ways, now tallest person among i) x < y < z iii) x  y  z
6 will occupy this seat and infront of him any one of
5
persons can be seated in 5C1 ways and so iv) x  y  z v) x  y  z
on. Thus, total number of required ways vi) x < y > z
4 C Sol. i) x can not assume ‘0’, select 3 digits from 1 to 9, if
1 7 C13 C 15 C 12 C 13 C  1
can be done in 3
9
C ways and they can be arranged in
one
 28  90  2520 way such that x < y <
z or x < y < z For 1st case select
Note
iii) x  y  z  x  y  z
2 digits from 1 to 9, it can be done in 9C ways
In the above problem if there are 2n persons then required hence,
2
total = 9C + 9C = 10C
number of ways = n!  2n  1  2n  3...1  (2n)! 2 3 3

2n iv) x  y  z  x  y  z or x = y = z
or x < y < z or x = y = z
63. An 8 oared boat (it is designed for 8 rowers the boat total ways = 9C2+ 9C 2 + 9C 3 + 9C 1
who propel with sweeg oars and is steered by a = 10C 2+ 10C =3 11C 3
coxswain or
cox) to be manned from a crew of eleven of whom 3 v) x  y  z  x  y  z or x > y > z
can
2 3 3
only steer but can not row. 8 can row but can not required ways = 10C + 10C = 11C
steer.
In how many ways the staff can be arranged if 2 of the men can only row on bow side.
Sol. Crew of 11 vi) Here middle digit is largest,
If y = 2, x = 1; z = 0, 1  2 ways
3 can steer only 8 can only row y = 3, x = 1,2, z = 0, 1, 2  2  3 ways

y  4, x  1, 2, 3, z  0,1, 2, 3  3  4 ways

y9  8  9 ways
2 only on bow 6 any where
(say AB) 8 8 8

Total  i(i  1)  i  i  240

2

oar i1 i 1 i 1
8 S 1
Stroke 7 2 Bow 66. The number of four digit numbers of the form xyzw
side 6 3 side
5 4 such that x < y, z > w
Sol. For x < y, when y = r  2, 3,......, 9 ,
position for steering can be selected in ways x take r – 1 values
1
3
C
Two positions on the bow side can be selected in 4C 2
ways and AB can be arranged in 2! ways

1.20
 Permutation & Combination
9  36  50  1800
These are  r  1  36 Case (ii) with ‘0’ : select a from 1 to 9 : 1
way
r1 9
C a0000, aa000, aaa00, aaaa0.
When z = 9, w = 0 to 8, z = 8, w = 0 to 7 and so on Total ways in this case
these are 45 ways.
Total number of required ways = 36  45 = 1620  4 ! 4 ! 4 !
 9 1 3!  2! 2! 3! 

67. How many 7 digit numbers can be formed using the 
digits 0, 1, 2, , 9 such that middle digit is largest and = 9 [15 ] = 135
i) the digits to the left of middle digit are in Case (iii) All same :
decreasing order where as right side in 9 Total ways = 1944
increasing order. (Eg : 3209145) b) Required ways = contains at most 2 distinct digits
ii) the digits to the left of middle digit are in + exactly 3 distinct = 1944 + x
increasing order where as right side in case (i) when ‘0’ is excluded : select a, b, c from 1 to 9
decreasing order
(Eg : 1238756)
Sol. i) 7 digits can be selected in 10C ways now place the  9C3ways numbers can contain 3 same, 2 distinct, 2
7
largest digit in the middle, from remaining 6 digits same , 2 same, 1 digit
select
3 digits, it can be done in 3 ways. In this case total ways
6
C
now on each side of middle digits, 2 groups of 3  5! 5!
 3 C   12600
3
digits can be arranged in only one way (increasing 84 C 
1 2 
and decreasing order) 2! 2! 

=
Hence total 10 6  3!
Case (ii) when ‘0’ is included : select a, b : 9C ways
 C7  C3 2

= 2400 The possible cases : ab000, aab00, aaab0, ba000,

bba00,
ii) we have two cases
bbba0
case (i) : excluding ‘0’ : required number of ways
4! 4! 4! 
total = 36 2 2  2  2016
C
9
7  6C (same as  3! 2! 5! 
above)
3
= 720 x  14616
Case (ii) When ‘0’ is included : 6 digits can be
Total = 2520
selected from remaining 9 digits in 9C way now ‘0’
6
71. A set S contains n elements. A subset P is chosen
must come to the right of midle digit, select 2
from S and S is reconstructed by replacing the
digits from 5 digits (excluding largest one), it can
2
elements P. Now another subset Q is chosen from S.
be done in 5C ways.
Find the number of ways of choosing P, Q such that.
6  C
in this case, required number of ways  9C 5
i) P, Q are disjoint.
 Total = 9 C 7 6C 3 9C  56C = 1800 ii) Unordered pairs (P, Q) and P  Q  
68. The number of 7 digit numbers whose middle digit is iii) P  Q contains exactly r ( < n) elements.
largest and the digits on either side of middle digit
iv) PQS
are in increasing order.
Sol. 7 digits can be selected in 10C7 ways, largest digit is v) P  Q
placed in the middle and from remains 6, 3 digits can vi) P, Q contains same number of elements.
be selected in 6C3 ways and they can be arranged in
vii) PQ
one way on one side.
viii) P contains r more elements than elements in
Total = 10C7  6C3
Q.
69. Find the number of 3 digit numbers which contains at
most 2 distinct digits. Sol. Let S = { a 1, a2, a3, ......, an }, consider an element a1 S
Sol. Total number of 3 digit numbers = 900 . There are 4 possible cases for which
The number of 3 digit numbers which are all distinct
1) a1  P, a1  Q
 9  9  8  648
Required number of ways = 900 – 648 = 252 2) a1  P, a 2  Q
70. Find the number of 5 digit which contains at most 3) a1  P, a 2  Q
a) two distinct digits b) three distinct digits
Sol. Case (i) : Without ‘0’ : select a, b from 1 to 9 : 9C ways 4) a1  P, a2  Q
2
The numbers are of the form Total number of cases = 4 n (there are n elements in S)
aaabb, bbbaa, bbbba,
i) P Q    P, Q have no common elements,
aaaab. Total ways in this
case that is cases (2), (3), (4) are eligible.
   5! 5!  i.e., a1 has 3 choices, a2 has 3 choices and so on.
 2 2
9
C 2
 3! 4!  Thus, the number of ways such that P Q   is
3n.

1.21
P & C and Probability

ii) Unordered pairs (P, Q) means (P, Q) = (Q,

= n
Cr . nC0  nCr1  nC1  nCr  2 nC2....  nC 1. nC nr
P). Suppose P = { a 1}, Q 2= {a , n..... a } where P
 2nC
Q  
is same as P = { a 2, a1, ...., an}, Q = {a 1} nr

. 72. Find the number of 5 letter words that can be formed

 The number of unordered pairs (P, Q) such that using the letters of the word INDEPENDENCE. Also
find the number of ways of selecting 5 letters from
the given
P Q   is 3n  1 1 (P  , Q  )  3  1 .
n
word.
2  2 Sol. There are 4E’s, 3N’s, 2D’s, I, P, C
iii) Select r elements from S to put in P, Q ,this Possible cases of 5 letters :
can be
done in n i) 3 alike of one kind, 2 alike of other kind :
ways.
C r

Thus, required ways = n C . 3nr 2 5!

C  2C   40
r (2),and
iv) P  Q  S when we choose the cases (1), 1 1
3! 2!
5!
(3). Thus required ways = 3 n. ii) 3 alike of one kind, 2 different : 2 C  C 
5
 400
v) P = Q means total number of subsets of S, which 1 2
3!
is 2n.
iii) 2 alike of one kind, 2 alike of other kind, 1 different
vi) P, Q can contain 0, 1, 2, 3,...., n 5!
3 4   360
elements. : C 2  C 1 2! 2!
The number of required ways
=  n
C0 2   1
n
C  2  .....n  nC n 5!
iv) 2 alike of one kind, 3 5   1800
 n
C 2 different : 3 C C
vii) P Q
1 3
n
C 2n 2!
0
5 5!
n
C 1 2
n–1
v) 4 alike, 1 different : C1   25
n
C n–2 1 4!
2 2 vi) all different : 6 C 5  5!  720
 Required number of words
n
Cn 2 0 = 40 + 400 + 360 + 1800 + 720
= 3345
 Required The number of ways of selecting 5 letters
ways
= n C .0 2n  nC . 12n1  .....  nC . n20  34  2C  2C  2C  5C  3C  4C  3C  5C  1  5C
viii) Required ways 1 1 1 2 2 1 1 3 1
 6C
5

= 77.

1. A women has 11 close friends. Find the number of Make Concepts Clear 1.4
ways
in which she can invite 5 of them to dinner, if two 4. x1  x2  x 3  x4  x 5  x6 is
particular of them are not on speaking terms & will A) 9 C B) 10
C C) 10C D) 10 C
not
attend together. in which the passengers can be accommodated is .
A) 462 B) 84 C) 378 D) 500 (Assume all seats to be duly numbered)
2. There are 10 seats in a double decker bus, 6 in the A) (240)6! B) 4 !  6! C) 10(6!) D) 120(6!)
lower deck and 4 on the upper deck. Ten passengers
3. Two cards are drawn one at a time & without
board the bus, of them 3 refuse to go to the upper
replacement from a pack of 52 cards. Determine the
deck and 2 insist on going up. The number of ways
number of ways in which the two cards can be drawn
 3 3 6 5
in a definite order.
Information for Quetion No 4 to 6 5. x1  x2  x 3  x 4  x5  x6 is

A) 9 C3 B) 9
C4 C) 10
C3 D) 10
C

6. x1  x 2  x 3  x 4  x5  x6 is
A) 9 C4 B) 9
C3 C) 10
C4 D) 10
C
7. A question paper on mathematics consists of twelve
questions divided into three parts A, B and C, each
containing four questions. In how many ways can an
examinee answer five questions, selecting atleast
one from each part.
A) 624 B) 208
C) 1248 D) 2304
Let x1 x2 x3 x4 x5 x6 be a six digit number find the 8. Number of ways in which 7 people can occupy six
seats,
number of such numbers such 3 seats on each side in a first class railway
that compartment

1.22
Permutation & Combination

if two specified persons are to be always included A) 70 B) 71 C) 72 D) 73

and occupy adjacent seats on the same side, is 5 ! · 18. Number of 3 digit numbers in which the digit at
(k) then k has the value equal to: hundreath's place is greater than the other two digit
9. A student has to answer 10 out of 13 questions in an is A) 285 B) 281 C) 240 D) 204
examination . The number of ways in which he can 19. The number of all possible selections of one or more
answer if he must answer atleast 3 of the first five questions from 10 given questions, each equestion
questions is : having an alternative is :
A) 276 B) 267 C) 80 D) 1200 A) 310 B) 210  1 C) 310  1 D) 210
10. A box contains two white balls, three black balls and four 20. There are m copies each of n different books in a
red balls. In how many ways can three balls be drawn from university library. The number of ways in which one
the box, if at least one black ball is to be included in the or more than one book can be selected is
draw ? A) mn  1 B)  m  1n  1
11. Find the number of 4 digit numbers which contains at
most C)  m  1n  D)  m  1 n  m
mn
a) 2 distinct digits (Eg: 1122, 1112, 1000 etc) 21. In a chess tournment, where the participants were to
play one game with another. Two chess players fell
b) 3 distinct digits
ill, having played 3 games each. If the total number of
12. Find the number of 3 digit numbers xyz such that games played is 84, the number of participants at the
i) x > y > z ii) x  y  z begining was
A) 15 B) 16 C) 20 D) 21
13. A committee of 6 is chosen from 10 men and 7
women so as to contain atleast 3 men and 2 women. 22. The number of different words which can be formed
If 2 particular women refuse to serve on the same by taking 4 letters at a time out of the letters of the
committee, the number of ways of forming the word 'EXPRESSION' is
committee is A) 2090 B) 2190 C) 2454 D) 2354
A) 7800 B) 8610 C) 810 D) 8000 23. The number of times the digit '5' will be written while
14. How many different words can be formed out of the listing the integers from 1 to 1000 is
letters of the word "MORADABAD" taken 4 at a time A) 271 B) 272 C) 300 D) 285
A) 620 B) 622 C) 626 D) 624 24. The number of permutations of the letters of the
15. A forecast is to be made of the results of five cricket word 'INDEPENDENT' taken 5 at a time
matches, each of which can be a win, a draw or a A) 3302 B) 3320 C) 3230 D) 3203
loss for Indian team. Find 25. Every body in a room shake hands with every body
(i) the number of different possible forecasts else only once. If the total number of hand shakes is
(ii) the number of forecasts containing 0, 1, 2, 3, 4 66 then number of persons in the room is
and 5 errors respectively A) 11 B) 12 C) 13 D) 14
16. Rajadhani express going from Bombay to Delhi 26. A committee of 5 is to be chosen from a group of 9
stops at five intermediate stations. 10 passengers people. Number of ways in which it can be formed if
enter the train during the journey with 10 different two particular persons either serve together or not at
ticket of three classes. The number of different sets all and two other particular persons refuse to serve
of tickets they may have is with each other, is
A) 15 10 B) 25 C) 45 D) 35 C A) 41 B) 36 C) 47 D) 76
C C C
 10 10 10
17. The number of four letter words that can be formed
using the letters of the word RAMANA is
Answers
1.C 2.A 3.2652 4.A 5.B 6.C 7.A
8.C 9.A 10. 64 11.a) 576 ; b) 4464 12.i) 10
C3 ; ii) C 3– 1
12

5
13.A 14. C 15.3 = 243 ; 1, 10, 40, 80, 80, 32 16.C 17.C
18.A 19.C 20.B 21.A 22.B 23.C 24.B
25.B 26.A
Solutions Are On Page No. 1.81

1.5 Total Combinations ( each object has two ways ,selecting an object or not
selecting an object)
The total number of combinations of n distinct objects is
n
C0 + nC1 + nC2+ nC3 + ...+ nCn= 2 n ...(1) The number of ways of selecting atleast one object
from n distinct objects = 2 n–1 ...(2)

1.23
 Best Books for JEE MAIN & ADVANCED.

Theory in detail with best illustrations have been incorporated.

All Extra Topics of JEE Main have been included in detail.

No Concept in any aspect has been left untouched.

Every topic is concluded with "MAKE CONCEPT

CLEAR (Me')” This is the strongest part of the 6ook,
consisting oF set of' quest/ons 6asecf on the current
topic ancf are arrangecf in a very we// sequent/a/
orcfer. the so/ut/ons to these are given in last of fhe
chapter, but it is highly recommended that first you try
them by yoursel].

7heory is f'o//owerf dy a set of exercises t/nrfer the

name PRACTICE SESSIONS (PS). these PS’s are put
according to topic and difficulty level. At last, aftempf
the FLASHBACK - In this, previous year questions of'
JEE MAIN & ADVANCED are provided, to pive yotz the
corecf insight into the Examination Pattern.

ISBN 978-93-86847-10-2

9 789386 847102
Rs. 350/-