PNC and Probability Permutations PDF

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 Permut at ions for Repeat ed and Ident ical Object s 1.11
1.3 Circular Permut at ions 1.16
1.4 Combinat ion 1.18
1.5 Total Combinat ions 1.23
1.6. Combinat orial Geomet ry 1.28
1.7 The Inclusion - Exclusion Principle 1.34
1.8 Generat ing 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 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 Rule, 2.20
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
Explanat ions t o Mc2 2.89
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 & Combination
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  A j   ) and their
There are three fundamental rules of combinatrics. They
are the addition rule, the multiplication rule, and the n
pigeonhole principle (or Dirichlet’s principle). These rules union is all of A i.e. A   A i . Then we have
i 1
are very easy to state. They are useful in a number of diverse
and often rather complicated situations. We usually leave n
them as rules and we give less importance, but here we will A  A1  A 2  A 3  .....  A n =  A i ...(1)
i 1
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 According to the hypothesis, each element a  A belongs
happen) in m ways, another work y which is independent
to exactly one of the subsets Ai, i = 1, 2, 3,.n and therefore
of x, can be performed in n ways then either x or y can be
it counts exactly once on each side of equation (1).
performed in m + n ways.
Eg : A man can leave mumbai by train in 7 ways, by air in 4
This idea can easily be applied to more events. We can put
ways and by sea in 2 ways. The total number of ways of his
the addition principle into the language of sets.
leaving mumbai is then 7 + 4 + 2 = 13
Let  A1 , A 2 ...., A n  be a system of subsets of a finite set A
Solved Examples
1. A class consists of 10 boys and 10 girls. In how many 2. A square with side length 4 is divided by parallel lines
ways a class leader can be selected ? into 16 equal squares. What is the total number of squares
Sol. Let A1   boys , A 2  girls . in this picture ?
Sol. To answer this question, we divide the totality of squares
Leader can be a boy or a girl but not both. into four sets A1, A2, A3, A4 such that the set Ai contains
 Required number of ways all squares of side length i (i = 1, 2, 3, 4). Obviously
= A1  A 2  10  10  20
1.1
P & C and Probability
A 1 = 16, A 2 = 9, A 3 = 4, A 4 =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 a field D and eight moves Note
from a field of type E. Hence, according to the addition
rule the total number n of moves of a knight on a chess The number of all possible moves of a knight on an
board is n x n chessboard
n = 4  2 + 8  3 + 20  4 + 16  6 + 16  8 = 336 = 4  2 + 8  3 + 16(n –3) + 24(n–4) + 8(n – 4)2
= 8(n – 1) (n – 2)
The multiplication Rule The multiplication rule can be extended upto any finite
If there are m ways of doing a task and for each of these m number of events.
ways there are n ways of doing a second task, which is If an event A1 can occur in a1 different ways and event A2
independent of first task, then the total number of ways of can occur can occur in a2 different ways, ...., and event, An
doing the two tasks in succession is mn. can occur in an different ways, then total number of ways
We can also state this rule in more appropriate way as follows : that event A1 followed by event A2, ...., followed by event
An can occur in a1a2a3 ..... an ways.
Let A = { (x1, x2) ; xi  Ai, 1 < i < 2 } then n(A) = n(A1)
 n(A2).
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 A
that lead from A to C and pass through B.
B
Sol. An arbitrarily chosen route from A to B (5 choices) can
be “extended” by three routes from B to C. Hence,
according to the multiplication rule, the number of routes
in question is 5.3 = 15.
y1 C
A y2
B C
i) How many different routes are there from A to C
y3 altogether ?
ii) How many different routes are there from A to C and
or let P  x 1 , x 2 , x 3 , x 4 , x 5  , Q  y1 , y 2 , y 3 
back
P Q   x , y  : x  P, y 
Q , iii) How many different routes from A to C and back visit B
i j i j
at least once ?
( 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 different route (means if atleast one road is different then
pants ? entire path is different)
Sol. For each shirts, there are 4 paints to wear. Thus required Sol.
ways y = 5  4 = 20. i) There are 2 direct routes from A to C and via B 4.3 = 12
6. There are 4 different roads from city A to city B, three  Total routes = 4.3 + 2 = 14
different roads from city B to city C, and 2 different roads ii) As there are 14 routes from A to C (work-1)and, C to
from A to C directly. A(work-2) also 14 routes.
Thus, total = 14  14 = 196
1.2

iii) Without B there 4 ways from A to C and C to A. written all correct answers, and no two students have
Subtract 4 from ans (b). given the same sequence of answers. What is the
Thus, total ways = 192 maximum number of students in the class, for this to be
iv) a) A to C(directly) there are 2 routes. possible (Assume student attempt all questions)
C to A (by a different route) there Sol. Since, a true/ false type questions, can be answered in 2
1 + 12 (C to B to A) = 13 ways ways either by marking it true or false.
b) A to C via B, there are 12 routes Total number of different sequences of answers = 25 =
32 out of these 32 sequences of answers there is only
Via B (2 x 3 = 6)
one sequence of answering all the five questions correctly.
But no student has written all the correct answers and
C to A
different students have given different sequences of
Directly (2 ways) answers. So,
Maximum number of students in the class
In this case there 12 (6 + 2) = 96 = number of sequences except one sequence in which
Thus, total cases = 122 all answers are correct = 32 – 1 = 31.
v) 14 13  182 12. A question paper is split into two parts - part A and part
7. In how many ways can one choose one white and black B. Part A contains 5 questions and part B has 4 questions.
field on a 8  8 chessboard ? In how many ways can this Each question in part A has an alternative question,
be done if the fields are not to be in the same row or in student has to attempt at least one question from each
the same column ? part. Find the number of ways in which the student can
Sol. A white field can be chosen in 32 ways and the same is attempt the question paper.
true for a black field. The total number of choices in the Sol. Job 1 : Answering part A
first case is therefore 32.32 = 1024. If in the second case Job 2 : Answering part B
we choose a white field (32 possibilities) then a black In part A each question can be attempted in 3 ways.
field can be chosen from those rows and column on which 1. no question is attempted
the already selected white field does not lie, that leaves 2. attempt 1st part of question
24 possibilities. 3. attempt 2nd part of question.
The total number of choices is therefore 32.24 = 768 Thus, the total number of ways of answering part A = 35
8. In how many ways one can post 4 letters in 3 post boxes? – 1 = 242.
Sol. Let the letters be li (i = 1, 2, 3, 4) post boxes be bi where In part B, each question can be attempted in 2 ways.
i = 1, 2, 3. Therefore, there are 24 – 1 = 15 ways of answering part B.
l1 can be posted in any one of three post boxes. This job Hence total no. of required ways = 242 x 15 = 3630.
can be done in 3 ways. 13. Let a = a 1a 2a 3 and b = b1b2b3 be two three digit
Similarly each other job can be done in 3 ways. numbers. How many pairs of a and b can be formed so
So, required number of ways = 3 x 3 x 3 x 3 = 34. that a can be subtracted from b without borrowing?
9. In how many ways 5 prizes can be distributed among 7 Sol. b1 b2 b3
atheletes, if each athelete is eligible for each prize ? a1 a2 a3
Sol. First prize can be given to any one of 7 atheletes, thus, When b3 = 9, a3 = 0 to 9
required number of ways = 75. b3 = 8, a3 = 0 to 8
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 ? b3= 0, a3 = 0
Sol. Each of 6 friends can receive the invitation by anyone of In total = 10 + 9 + ... +1
3 servants. Hence required number of ways = 36. = 55
similarly for (a2, b2) – 55 ways
Note Now, b1 = 9, a1 = 1 – 9
The total number of functions from set A to set B. where = 8, a1 = 1 to 8
n(A) = m, n(B) = n is nm. Because each element of set A ;
can be assigned to any one of the elements of B. = 1, a1 = 1
total = 9 + 8 + .... + 1 = 45
11. For a set of five true/ false questions, no student was
Thus, the number of required ways = 45 x (55)2
Permutation Eg: Consider the colours R,B,W. Now we want to list out all
Each of the different arrangements which can be made by possible arrangements of these 3 colours taking two at a
taking some or all of a number of distinct objects is called a time, these are
permutation. A permutation is an arrangement of objects RB, BR, RW, WR, BW, WB – 6 ways
in a definite order.
1.3

There are two types of arrangements (permutations) namely 2. The number of all bijections from a finite n-elements set
i) Linear permutation A to itself is n!
Arranging objects along a line THEOREM 2

ii) Circular permutation The number of ways of arranging n distinct objects of which
r particular objects cometogether is (n–r+1)!r!
Arranging objects around a circle.
Proof:
THEOREM 1 We wish to arrange n objects of which r particular objects
The number of all permutations of n-dissimilar objects cometogether, we take r particular objects as a single object,
therefore there are n–r+1 objects to arrange. Now these
taken r at a time is n(n–1)(n–2) ......(n–(r–1). 0  r  n , n–r+1 objects can be arranged in (n–r+1)! ways and r
nN ...(1) particular objects, among them selves can be arranged in
r! ways. Hence required number of arrangements
Proof = (n–r+1)!r!
The number of permutations of n distinct objects taken Note

‘r’ at a time, is same as (r-tuples (x1,x,..., xr) the number
The number of ways of arranging n distinct objects of r
of ways in which we can fill up r-places (boxes) when
particular objects never cometogether  n! (n  r  1)! r !
we have n different things at our disposal.
Consider r places : THEOREM 3
(Gap Method) the number of ways of arranging n distinct
.... red balls and m( n  1) distinct black balls such that no
1 2 3 r n !(n 1)
two black ball cometogether is pm
Proof:
n n-1 n-2 n(r-1)
In our arrangement no 2 black balls cometogether, that is
between every pair of black balls there must be all one
J1 J2 J3 Jr(Jobs) red. So first we arrange n red balls, it can be done in n!,
now there are n+1 gaps as shown below
Number of ways of filling up boxes with n objects
 R1  R 2  R 3  .....  R n 
= performing ‘r’ jobs, in succession can be done in
n(n–1) (n–2) ...(n–(r–1)). where Ri’s denote red balls. In the n+1 gaps, m black
balls can be arranged in n+1Pm. Hence total number of
The product n(n–1) (n–2) ...(n–(r–1)) arrangements = (n!) n+1Pm.
n  n  1 n  2 ...  n  r  1 n  r  n  r  1 ... 2.1 THEOREM 4

=
 n  r  n  r  1 ...2.1 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  r  ! we usually denote it by P(n,r) or nPr Proof:
First we arrange n red balls, it can be done in n! ways
n!
 n Pr  , 0 r  n ,  R1  R 2  R 3  .........R n 
 n  r !
where the letter P stands for permutation. If arrangement starts with red ball then it ends with black
ball and starts with black ball then it ends with red ball.
Hence, the number of permutations of n dissimilar
Therefore n black balls can be arranged in first n gaps (last
objects taken ‘r’ at a time is nPr. n gaps) in n! ways.
Note  Required number of ways = 2(n!)2
1. Let P(n) denote the number of all arrangements of an
n-element set A. Then P(n) = n(n–1)(n–2)....2.1 = n!
1.4
Solved Examples
14. How many signals can be made by 5 flags from 8 flags = 1 + (n + 1)! – 1! = (n + 1)!
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 of iv) P(n, r) = n.P (n – 1, r – 1)
different colours is 6Pr where r = 1, 2, 3, 4, 5, 6.
n!
6 Sol. i) P(n, n) = n! , 2 P(n, n–2) = 2   n!
6 2!
Hence total = 
r 1
Pr  1956
n!
16. Solve the following ii) P(n, n) = n!, P(n, n–1) = nPn 1   n!
1!
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 number
iv) If 10Pr = 5040, find r
of permutation of n distinct objects taken r at a time
v) If 9P5 + 5. 9P4 = 10Pr find r.
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   r Pr
r 1
Particular object can be placed in r ways (in any one
of the r places), and remaining r – 1 places can be
5! n! filled with n – 1 objected in n–1Pr–1ways. Hence total
Sol. i) 2. 2!  (n  4)!  n  5 = r n–1Pr–1.
Thus P(n, r) = P(n – 1, r) + r P(n – 1, r – 1)
n! n!
ii) (n  4)!  20. (n  2)!  (n  2)(n  3)  5.4  n  7 n! (n  r)!
iv) P(n, r)   n.  nP(n  1, r  1)
(n  r)!  1)  (r  1)!
(n 
5! 6! 18. Show that the number of permutations of n dissimilar
iii) (5  r)!  2. (7  r)!  (7  r)!  12(5  r)  r  3
objects taken ‘r’ at a time when s   r  particular objects
10! 7!  10.9.8 10! included is rPs. n–sPr–s.
iv) (10  r)!    r 4
720 6! Sol. s particular objects can be arranged in r places in rPs,
remaining r–s places can be filled with n–s objects in
n–sP .
9! 9! 10 10! 10 r–s
v)  5.  Pr   Pr  r  5
4! 5! 5! Hence required number of permutations = rps. n–spr–s
19. Find the number of arrangements of 15 cricketers taking
56 ! (51  r)! 11 at a time when
vi) (50  r)!   30800  56.55.(51  r)  33800
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
vii) 21  r ! : 18  r !  11 : 52 20. How many different words can be formed from the letters
   
of the word VANQUISHER
22.21 i) such that they begin with svowel and end with vowel
  21  r  20  r 19  r  : 1  11:52 ii) such that they begin with vowel and end with
consonant
 (21 – r) (20 – r) (19 – r) = 2 x 21 x 52 iii) such that neither of them begin with U nor end with
= 12 x 13 x 14  r = 7 V.
Sol. Total number of arrangements = 10!, Now there are 4
n n n
vowels A, U, I,E and 6 consonants.
viii) 1   r r Pr  1 
r 1
  r !  = 1    r  1  1 r !
r 1 r 1
1 2 9 10
i)
 n n  ....
= 1    r 1 !   r !
 r 1 r 1  1st
and 10thplaces can be filled with 4 vowels in 4P2
ways and remaining 8 places can be filled in 8! ways
1.5
Hence total number of required ways = 4P2.8! Vowels must be arranged in these places only, it can be
ii) 1st box can be filled in 4 ways. done in 4! consonants can be arranged in 6! ways.
10th 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! ways. arrangement is made, vowels must come in that order.
Total = 4  6  8! First we arrange constant (unrestricted one) in 10
places. It can be done in 10P6 ways. Now there are 4
iii) Let A  words begin with U
places vacant, in these 4 places 4 vowels can be
B  end with V arranged in 1 way.
iii) Prime places are 2,3,5,7. In these places 4 vowels can
n(A) = 9!, n(B) = 9!, n  A  B  = 8! be arranged in 4!, remaining in 6!.
iv) Places 5,6 can be filled in 4P2 ways, 4 and 7th places
n  A  B  = 2.9! – 8! = 17.8!
can be filled in 6P2, remaining in 6!
n  A C  B C  = total – n  A  B  Total = 4P2. 6P2. 6!
= 10! – 17.8! = 73.8! v) R S - 1 object .

21. How many different words can be formed from the letters The two boxes can be filled in 4P2
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 in 7!
iii) such that all vowels come together and all consonants Total = 7! x 4P2 x 2.
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. Let n
v) such that two vowel at each end. be the number of ways of arranging 5 boys and 5 girls in
Sol. i) Assume all vowels AEIU as single object. n

a row such that no two girls sit together then equals
now total no. of objects = 1 + 6 = 7. m
These 7 objects can be arranged in 7! Sol. Boys can be arranged in 5! ways
Vowel among themselves can be arranged in 4! B1  B 2  B 3  B 4  B5 
total = 7! x 4! girls can be arranged in first 5 gaps or last 5 gaps in 2.5!
Eg : V AEIU NQSHR ways
ii) We do this problem using gap method.  m  2  5! 5!
First we arrange consonants (opposite of objects which now 5 girls can be arranged in 6 gaps in 6P5 = 6! ways
no two come together). This can be done in ways.
n
xVxNxQxSxHxRx n  5! 6!  3
Now, there are 7 gaps. In these 7 gaps 4 vowels can m
be arranged in 7P4 24. Let n be the number of ways in which 5 boys and 5 girls
Hence total = 7P4 x 6! can stand in a quene. Let m be the number of ways in
which 5 boys and 5 girls can stand in a quene in such a
iii) All vowels AEIU = 1 object.
n
All consonants VNQSHR = 1 object way that exactly 4 boys stand together then equal
m
So there are two objects. They can be arranged in 2 Sol. Assume all girls as single unit then
ways Total = 2 x 4! x 6! (As in (iv)) m  6!  5!
iv) There are 5 even places. 4 vowels can be arranged in
the 5 even places in 5P4 ways, remaining in 6P6. now  G1  G2  G3  G4  G5  (4 boys) 
v) In 1,2,9,10 places, vowels can be arranged in 4! 4 boys together can be arranged in 5P4 = 5! ways
remaining 6!. now in first 5 gaps, remaining boys can be arranged in 5
22. How many different words can be formed from the letters ways.
of the word VANQUISHER n
i) Such that relative position of vowels are not disturbed.  n  6!  5!  5  5
m
ii) Such that order of vowels remain same
iii) Such that vowels occupies prime places. 25. Let n be the number of ways of arranging 5 boys and 5
iv) Such that middle places occupies by two vowels. But girls in a row such that same gender cometogether. Let
no three or four vowels come together. m be the number of ways of arranging 5 boys and 5 girls
v) Such that there will be exactly two vowels between R in row such that exactly 4 boy cometogether and exactly
and S and no other letter between R & S.
n
Sol. i) Vowels occupied in 2,5,6,9 places. (In given word). 4 girls cometogether, Then equals.
m
1.6

iv) N is divisible by 4 if a2 a1 is divisible by 4.
Sol. m  2  5! 5!
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 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, a4a3 can be filled in 4P2
y B G x, x G B y (or x, B and y, G should come Case (ii) :
When a2a1 is 12, 24, 32, 52
B  n  2  2! 2!  5P4 5 P4 )
 X 
alternately 
yG yG
a4a3 can be filled in 3 x 3 (  a 4  0 )
Hence total = 3  4P2 + 4  9 = 36 + 36 = 72.
n v) Unit place must be 0 or 5.
 n  8  5 P4  5 P4  8  5!  5 !  4 Case (i) :
m
Note 0
The number of ways of arranging n black balls and n red 5

P3
balls (all are distinct) in a line so that no two black balls
Case (ii) :
come together and no two red balls come together is 2(n!)2.
26. Find the number of 4 digit numbers using digits 0, 1, 2,
5
3, 4, 5, such that they
i) have no restriction ii) are even 5
P3 – 4P2
iii) are divisible by 3 iv) are divisible by 4
27. Find the number of 4 digit numbers using digits 0, 1, 2,
v) are divisible by 5
3, 4, 5, such that they
i) are divisible by 6 ii) are divisible by 8
iii) are divisible by 9 iv) are divisible by 11
Sol. i) where each digit being used at most once.
5 5 4 3 Sol. i) N is divisible by 6 if it is divisible by 2 and 3. We have
1000th place can be filled in 5 ways (without zero) to search even numbers in (iii)
Required ways = 5  5  4  3 = 300
with S1 : ,
It is also equal to 6P4 – 5P3 0 2
(with zero) when left most is 0 then it is a 3 digit number 3! 3!–2!
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 : 0
Total = 60 + 96 = 156
iii) The number N = anan–1an–2.....al where 3!
S5 : As in S1
where a i  0,1, 2,...., 9 is said to divisible by 3 if
Total = (6+4)+6 + 4.2 + 6.2 + 6 + (6 + 4)=52
n ii) N is divisible by 8 if a3a2a1 is divisible by 8. These are
a
i1
i is divisible by 3 subsets of (iv) in the previous example.
104, 304, 504, 240, 120, 320, 520, 312, 512,
Let us search 4-element subsets of S, whose sum is 432,152,352. For each of first 7, 1000 place can be
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 ways
Now, delete 2 digits whose sum is multiple of 3. Total = 7  3 + 5  2 = 31.
s1={0, 1, 2, 3}, s2={0, 2, 3, 4}, s3 = {1, 2, 4, 5} n
s4 = {0, 1, 3, 5}, s5 = {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 each s2 and s4 are possible cases.

 Total = 24 + 4 x 18 = 96. Hence total = 2.18 = 36.
1.7

iv) N is said to be divisible by 11 if 30. Number of natural numbers between 100 and 1000 such
a1 – a2 + a3 – a4 + ........ + (–1)n an is a multiple of that at least one of their digits is 7, is
11. For 4 digit numbers. (a1 + a3) – (a2 + a4) = 11k A) 225 B) 243 C) 251 D) none
 a1 + a3 = 11m, a2 + a4 = 11n Sol. (C)
Since sum of any two elements of S is < 11
Therefore the only possibility is a1 + a3 = a2 + a4 , Total numbers between 100 and 1000 =
 (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
vii) (5, 2) (4, 3)  required number 3 digit numbers = 899 – 648 = 251
i) When (a1, a3) = (0, 3), (a2, a4) = (1, 2) 31. The number of distinct rational numbers p/q, where p,q
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 (a2, 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 denominator places in 6 P2 = 30 ways. But out of them
(vii), there are 2  2 + 2  2 = 8
Total = 4  6 + 3  8 = 48. 1 2 3 2 4 6
, , represent same number. , , represent same
28. The number of numbers between 3000 and 4000 which 2 4 6 1 2 3
are divisible by 5, without repetition using the digits 3, 4,
2 4 3 6
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 3 6
represent same number. , & , represent same
The middle two places can be filled in 4P2 ways 3 6 1 2
29. Find the sum of all 4 digit numbers that are formed by number. In all above cases we have to consider only one
digits of 0, 1, 2, 3, 4, 5 without repetition. case each.
Sol. First we find sum of digits in unit place of numbers.
 No. of rational numbers
= 30 – (2 + 2+ 1 + 1+ 1 + 1)+1
0 1
= 22 + 1 ( ‘1’ is a rational number)
5 = 23
P3 5
P 3–4P 2=48
i.e. there 48 numbers whose unit place is 1 Walk on a grid
which is same for 2,3,4,5
Suppose a grid of size m  n is with mn unit squares is given
 sum of digits in unit place
A person wants to walk (with shortest path) on the grid from
= 60 x 0 + 48 (1 + 2 + 3 + 4 + 5 ) = x
Sum of place values digits in 10th place = one corner to diagonally opposite corner. Now person has
[60 x 0 + 48 ( 1 + 3 + 3 + 4 + 5)] x10= 10x to move horizontally and vertically upward (down ward).
Sum of place values digits in 100th place = 100x. There are m horizontal and n vertical paths. Let H & V be
Sum of place values digits in 1000 th place respectively denote the horizontal and vertical paths.
= (1+2+3+4+5)5P3x103
 Sum of all 4 digit numbers B
= x + 10x + 100x + (1 + 2 + 3 + 4 + 5) 5P3 x 103
= (1 + 2 + 3 + 4 + 5) [48 + 5P3] (11 11)
= (1 + 2 + 3 + 4 + 5) [5P3 – 4P2] (11 11)
Note
The sum of r-digit numbers using n digits
0, 1, 2, 3, ......., 9 (with out repetition “rr  n”” A
  n 1 Pr 1  sum of n digits 111....1, when 0 is excluded

The number of shortest paths from A to B
 r times
 = The total number of arrangements of
=    n 1 
 Pr 1 111......1   n  2Pr  2 111....1   sum of n digits 
  H H H......H VV......V
r  1times     
m n
when 0 is one of the n digits
1.8
(m  n)! m  n Note
  Cn
m! n! The number of shortest paths from (x1,y1) to (x2,y2) by
one unit move either horizontally or vertically
 (x 2  x1  y 2 y1 )C x 2 x1 ,x 2  x1, y 2  y1
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
H H
A C C C
Sol. Let H,V be respectively denote horizontal & vertical A
move. Now to move from A to B, we need 5H & 4
There are 5 H & 4VS R
Sol. We have to move 5 of /direction and 5 of \ direction
9!
 Total paths   9C4 10!
4 !5! required ways 
5!  5!
Make Concepts Clear 1.1

1. a) Find the number of four letter word that can be formed 7. (a) In how many ways can four passengers be
from the letters of the word HISTORY. (each letter to be accommodate in three railway carriages, if each carriage
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 can
d) How many of them begin with a vowel? 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 A1, A2, .....
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! D) C)
2! 4!
c) How many of these are even ?
10. The number of ways in which the candidates A1, A2, ....,
d) How many of these are odd ?
A10 can be ranked if A1 is always above A2 is
e) How many of these are multiples of 5 ?
3. Find the number of 10 digit numbers using the digits 0, 10 !
A) 9! 2! B) 9! C)
D) 10!
1, 2, ....... 9 without repetition. How many of these are 2
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 word A4 .... A10 can be ranked if A1 is just above A2 then the
"MIRACLE" can be arranged if vowels always occupy number of ways are
the odd places.
5. How many car number plates can be made if each plate 10 !
A) 9! 2! B) 10! C)
D) 9!
contains 2 different letters of English alphabet, followed 2!
by 3 different digits. 12. A man starts moving from the point (3, 5) and moves to
6. Every telephone number consists of 7 digits. How many the right or vertically upwards only covering unit distance
telephone numbers are there which do not include any in each step. The number of ways he could reach the
other digits but 2 , 3 , 5 & 7 ? point (7, 11) is
1.9

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 themselves 22. Let A = { x / x is prime number and x < 30}. The number
among 5 hotels, if 4 hotels are used to accommodate of different rational numbers whose numerator and
them. denominator belong to A is
A) 24 B) 120 C) 60 D) 45 A) 10p2 B) 10p2+1 C) 10 D) None
14. Number of words which can be formed using all the letters 23. The number of ways in which 6 Telugu, 4 Hindi and 3
of the word "AKSHI", if each word begins with vowel or English books be placed in a row on a shelf so that the
books on the same subject remain together is
terminates in vowel is
A) 6! 4! 3! B) 3! 6! 4! 3!
A) 36 B) 84 C) 120 D) 12
15. In how many ways can the letters of the word "CINEMA" 13! 13!
be arranged so that the order of vowels do not change. C) D)
6 ! 4 ! 3! 6! 4 ! 3! 3!
A) 120 B) 36 C) 84 D) 6! 24. The number of ways in which we can arrange the digits
16. In a morse telegraphy there are 4 arms & each arm is 1, 2, 3....9 such that the product of five digits at any of
capable of taking 5 distinct positions including the position the five consecutive positions is divisible by 7 is
of rest. How many different signals can be made..
A) 7! B) 9 P7 C) 8! D) 5 7!
12 34R 1 2 3 4R
12
34 R
12
34
R
25. The maximum number of persons in a country in which
no two persons have an identical set of teeth assuming
B C D D
that there is no person without a tooth is
A
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 different
door is
A) 45 B) 45–1 C) 54–1 D) 54
A) 20 B) 16 C) 19 D) 21
17. From 6 different novels and 3 different dictionaries, 4
27. On a new year's day every member of a family sends a
novels and 1 dictionary are to be selected and arranged
card to every other member and the postman delivers
in row on a shelf so that the dictionary is alway in the
156 cards, the number of members of the family is
middle. Then the number of such arrangements is
A) 12 B) 11 C) 14 D) 13
A) at least 750 but less than 1000
28. Among the 8! permutations of the digits 1, 2, .....8, consider
B) at least 1000
those arrangements which have the following property. If
C) less than 500
we take any five consecutive positions, the product of digits
D) at least 500 but less than 750
in these positions is divisible by 5. Then number of such
18. The number of words that can be formed using all the
arrangements is
letters of the word REGULATIONS such that G must
A) 7! B) 2  7! C) 7C4 D) none
come after R, L must come after A and S must come
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) 11 P6 D) None
8 A) 252 B) 105 C) 510 D) 10P5
19. Number of natural numbers less than 1000 and divisible 30. In a conference 10 speakers are present. If S1 wants to
by 5 can be formed with the ten digits, each digit not speak before S2 & S2 wants to speak after S3, then the
occuring more than once in each number is number of ways all the 10 speakers can give their
A) 136 B) 154 C) 64 D) 153 speeches with the above restriction if the remaining seven
20. Number of odd integers between 1000 and 8000 which speakers have no objection to speak at any number is
have none of their digits repeated, is 10 !
A) 1014 B) 810 C) 690 D) 1736 A) 10C3 B) 10P8 C) 10P3 D)
3
Answers
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.47
7.(a) 34 ; (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
Deductions
1.2 Permutations for Repeated and
1) The number of permutations of n dissimilar objects taken
Identical Objects atmost ‘r’ at a time  r  1 when repetition of objects is
Permutations when Repetition of objects is
allowed allowed is n + n2 + n3 + .... + nr = n
n r
 1
,n1
n 1
THEOREM 2
2) The number of permutations of n dissimilar objects taken
The number of permutations of n dissimilar objects taken at least r + 1 at a time when repetition of objects is allowed
‘r’ at a time where each object can be used any number is nr+1 + nr+2 + .... + nn
of times (i.e. repetition of objects is allowed) is nr ,
nr
r 1  n  1
1 r  n = n  n 1  , n 1
 
Proof
Note
Consider r places (boxes)
The number of permutations of n distinct objects taken r at
1 2 3 r a time when atleast one object is repeated = nr – nPr
...
Eg : The number of 5 letter words that can be formed
n x n x n x n =n
r
using the letters of the word EQUATION such that at least
one letter is repeated is 85 – 8P5
(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 5P3 ways, each remaining place
0, 1, 2, 3, 4, 5 when repetition of digits is allowed such can be filled in 7 ways (using other digits) when 3,4,5
that occupies last 3 places and first 2 places are ‘O’ there its
i) divisible by 3 represent a 3 digit number.
ii) divisible by 6 Required number of 5 digit numbers = 5  4  3  7  7
Sol. i) divisible by 3 : x1 x2 x3 x4 =2940

36. The sum of 3 digit numbers whose middle digit is a perfect
5 6 6 square using the digit 1 to 9 with repetition is
A) 134055 B) 270540
C) 170055 D) none of these
 3k then x 4  0 or 3

Now, if x1 + x2 + x3 =  3k  1 x 4  2 or 5 Sol. (A) Middle place 1, 4 & 9
 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 + x2 + x3 + x4 = 3k For units place each digit from 1 to 9 will appear 27 times
From previous x4 can be filled in 1 way  sum = 27 (1 + 2 + ...... + 9)  B
( 0 or 2 or 4). For hundreath's place, similarly sum = 27  100
(1 + 2 + ...... + 9) ... C
Hence the required number of numbers  5  6 2  180 A + B + C gives the required sum
35. The number of integers from 1 to 105 which contain Note
exactly one 3, exactly one 4 and exactly one 5 must be
To find sum of r-digit numbers when repetition is allowed.
A) less than 2000 B) more than 3000
The sum of r-digit numbers formed by
C) 2940 D) 3270
Sol. (C) Consider 5 boxes now 3,4,5 can be
1.11
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  sum of ndigits  111....1 , if zero is excluded A) 1,34,055 (When repetitions are allowed)
 r times A) 1,70,555 (When repetitions are allowed)

 C) 8,73,74 (When repetitions are not allowed)
=  nr-1 11....1 - n-1 r-2 111....1  sum of n digits
         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 9
37. Find the number of 7 digit numbers using 0 to 9
i) such that sum of digits is even
7( r 1

r  1)  7(
r 1
 r  9)  784
r  4))  7(
r 1
ii) which are palindrome sum of digits in 100 place = 847 th
When repetition is allowed

sum of digits in 10th place 8 P2(1  4  9)  784
Sol. i) x1 x2 x3 x4 x5 x6 x7
( when middle digit is 1, then unit digit can be 2 to 9
9 10 10 10 10 10 there are 7 such numbers)
if x1 + x2 + x3 + x4 + x5 + x6 Required sum  847  784  10  847  100 =93,387
ii) when repitition is allowed sum of digits in unit place
even, x 7  0, 2, 4, 6, 8
= odd, x  1, 3, 5, 7, 9  9 
 7 27 
 
r   1215
 r 1 

 Total number of ways = 45  105
ii) A string (consisting digits, alphabets etc) is called a sum of digits in 100th place = 1093500
palindrome when read from left to right and right to left, sum of digits in 10th place = 81(1+4+9) = 1134
it remain same. For instance (1234567891987654321  Total sum = 134055
which is a prime palindrome number) 39. How many positive integers less than 105 can be 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
9 10 10 10 1 1 1 The number of 3 digit numbers is 23
Total palindromes = 9  103 = 9000 The number of 4 digit numbers is 24
The number of 5 digit numbers is 25
Total = 62
Permutations when several kinds of Proof

identical objects are involved Method-1
Suppose, we want to arrange A,A,A,B. The n–m non - identical things can be arranged in n
places in nPn–m, now in the remaining places m identical
Let us list out all possible arrangements :
things can be arranged in only 1 way.
AAAB, AABA, ABAA, BAAA
there are 4 ways. nP n!
 Required ways = 
It can also be done as follows. n  m m!
Method-2
Consider 4 places . First we arrange
Let x be the no. of permutations. Consider one of these
4 4!
non repeated objects, i.e B, it can be done in P1  ways, permutations say
3!
now 3 more vacants to be filled by 3 A’s, it can be done in a a a........a x 1 x 2 ..........x n  m
only 1 way. Hence total ways = 4 
m times
THEOREM 3
Remove m’a’ and replace m distinct objects other than
The number of permutations of n things of which xi’s, keeping arrangement of x1 x2 ......xn–m as it is, and
arranging m distinct objects, it can be done in m! ways.
m   n  things are of same kind and rest are distinct is
Thus, for each of x permutations there are m! distinct
n! permutations. Hence
m!
1.12

m! x = permutations of n distinct objects = n! Note
n! The number of permutations of (m1+m2+ .... + mk)

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

b) x E E E x G x G x I x I x R x ,  2 ENENEN or NENENE, it can be done in 2 ways.
 2!
11
P5 1 11
7
Total = 2 P5
P3  2!
2
2
In 7 gaps 3N’s can be arranged in ways
3!
41. The number of ways in which the letters of the word
6!
P 5 7 PESSIMISTIC can be arranged so that no two Ss are
Hence ,required ways = 2! 2  3   7! together, no two Is are together and letters S and I are
  3! 4
never together is
A) 86400 B) 48000 C) 2400 D) 5480
c) IN – – IN , where have to fill the gaps with E,G,N,R
Sol. (C) Arrange the remaining letters in 5! ways
6! 6! P  E  M  I  C 
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!
5! ways
iii) E,R In this case 2 
2! x 2!  Required number of arrangements= 5! 20  2400
6! 6! 42. Find the number of as many more words as possible (or
iv) G, N  2  otherwords or rearrangements) be formed using the letters
3! 3
of the word CIVILISATION without changing the relative
6! 6! order of vowels and constants.
v) G , R  2 
3! 3 Sol. Required number of ways
6! 6!
vi) R, N  2  6!
3!2! 6  (I I I A I O) 6!(C V L S T N)  1
4!
Total number of arragements = 11  5!
d) First we arrange 2I’s, 2G’s, 1R in the first five positions.  30.6!  1
1.13

43. Find the sum of all 7 digit numbers whose sum is 10, Case (iii) : 1, 1, 2, 2, 1, 3 ; The number of arrangements
using the digits 1, 2, 3. = 60.  Total = 90
Sol. We have find sum of 77 numbers 45. Find the sum of all the numbers greater than 1000 using
............ 1 ............ 2 the digits 0,1,2,2.
    
i) 6!
 30
; 6!
6
Sol. (i) When 1 is at thousand's place, total numbers formed
4! 5!
 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
+ 105x + 104x + 103x + 102+ 10x + x (ii) When 2 is at thousand's place, total numbers formed
= (1 1 1 1 1 1 1) (30 + 12 + 18) = 66666660 will be = 3! = 6
............... 1 ............... 2 (iii) When 1 is at hundred's, ten's or unit's place then
 
ii) 6!
 20
; 6!
 15
total numbers formed will be-
3! 3! 4! 2!
Thousand's place is fixed i.e. only the digit 2 will come
Sum of digits in unit places
here, remaining two places can be filled in 2! ways.
= 20  1 + 15  2 = 50
Hence sum of numbers formed by 1, 1, 1, 1, 2, 2, 2 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 arrangements can be filled in 2 ways.
6! So total numbers = 2 × 2 = 4
  15
4 ! 2! Sum = 103 (1 × 3 + 2 × 6) + 102 (1 × 2 + 2 × 4) + 101(1
Case (ii) : 1, 1, 2, 2, 2, 2 ; The number of arrangements × 2 + 2 × 4) + (1 × 2 + 2 × 4)
= 15 3 3 2
= 15 × 10 + 10 + 10 + 10 = 16110
To find rank of a word in dictionary order (lexicographical order). The position 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
46. Find the rank of the word ‘PARLOUS’ 3 020010 P(in alphabetical order)
Sol. The letters of the word in alphabetical order is 6! 5! 4! 3! 2! 1! 0! is 3(A,L,O)to the right P.
A,L,O,P,R,S,U  Rank = 3.6! + 2.4! + 1.1! + 1
The number of words begin with 47. Find the rank of the word EUPHORIA
A _ _ _ _ _ _ is 6! Sol. E U P H O R I A
L _ _ _ _ _ _ is 6! 1 6 4 1 2 2 1 0
O _ _ _ _ _ _ is 6! 7! 6! 5! 4! 3! 2! 1! 0!
PAL _ _ _ _ is 4!  Rank of the word
PAO _ _ _ _ is 4! = 7! + 6.6! + 4.5! + 1.4! + 2.3! + 2.2! + 1 +1
PARLOSU - 1 = 5382
PARLOUS - 1 48. Find the rank of the word FABLE
 Rank of the word = 3.6! + 2.4! + 1 + 1 = 2210 Sol. F A B L E
Aliter 3 0 0 1 0
PARLOUS (The no. of letters before 4! 3! 2! 1! 0!
Rank of the word = 3.4! + 1.1! + 1 = 74

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

dictionary order, as if each were an ordinary five-letter A) 5 B) 325 C) 345 D) 365
word, then last letter of the 86th word in the list is 14. The number of n digit numbers which consists of the
A) A B) H C) S D) E digits 1 & 2 only if each digit is to be used atleast once, is
4. Ten different letters of an alphabet are given. Words with equal to 510 then n is equal to:
five letters are formed from these given letters. The number A) 7 B) 8 C) 9 D) 10
of words which have at least one letter repeated, is 15. If as many more words as possible be formed out of the
A) 69760 B) 30240 letters of the word "DOGMATIC" then the number of
C) 99748 D) None of these words in which the relative positions of vowels and
5. The number of permutations of letters of word consonants remain unchanged is .
“TRIANGLE” so that neither the pattern ANT and nor A) 719 B) 720
C) 718 D) 8! – 1
“GEL” appears is
16. A shelf contains 20 different books of which 4 are in single
6. The number of permutation that can be made out of the volume and the others form sets of 8, 5 and 3 volumes
letters of the word "MATHEMATICS" respectively. Number of ways in which the books may
i) When all vowels come together is be arranged on the shelf, if the volumes of each set are
8! . 4 ! 8! . 4! 7! . 4! together and in their due order is
A) B) (2!)2 C) D) 7! 4! 20!
2! 2!
ii) When no two vowels come together is A) B) 7! C) 8! D) 7 . 8!
8 ! 5! 3!
17. Number of different words that can be formed using all
7! 8 7! .8 P4 8
P4
A) 7! 8P4 B) 2! 2! . P4 C) 3 D) 7! the letters of the word "DEEPMALA" if two vowels of
(2!) 2! same kind are together and the other two are also together
iii) When the relative positions of vowels and but separated from the first two is
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 arranged
7. The number of ways in which the letters of the word in a row which reads the same backwards and forwards,
"SUCCESSFUL" be arranged such that 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) C) 2! 2! D) 2! 2! 2! with the digits 0, 1, 4, 5, 4 is
2! A) 708854 B) 708845
ii) No two 'S's will come together is C) 808845 D) None
7! 7! 7! 8 P3 20. The number of five digit numbers formed using the digits 0,
A) 2! 2! B) 2! 2! . 8P3 C) 8P3 D) 2, 2, 4, 4, 5 which are greater than 40,000 is
2! 2! 3!
A) 84 B) 90 C) 72 D) 60
iii) The 'S's and 'U's will come together is 21. The number of different numbers greater than 1000000
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) 2! 2! 2! A) 60 B) 120 C) 360 D) 230
2!
22. The number of ways in which 6 '+' and 4 '-' signs can be
8. If all permutations of the letters of the word AGAIN are
arranged in a line such that no two '-' signs come together
arranged as in dictionary the 47th word is
is
A) N A A G I B) I N G A A
C) N A A I G D) I N A G A A) 35 B) 120 C) 720 D) 610
9. How many odd numbers of five distinct digits can be 23. The number of 6 digit even members formed by using the
formed with the digits 0,1,2,3,4 ? digits 1,2,1,0,2,2 is
10. How many 10 digit numbers can be made with odd digits A) 44 B) 40 C) 34 D) 50
so that no two consecutive digits are same. 24. Two teams are to play a series of 5 matches between
them. a match ends in a win or loss or draw for a team.
A) 5  49 B) 410 C) 510 D) 4  59 A number of people forecast the result of each match
11. There are 720 permutations of the digits 1, 2, 3, 4, 5, 6. and no two people make the same forecast for the series
Suppose these permutations are arranged from smallest of matches. The smallest group of people in which one
person forecast correctly for all the matches will contain
to largest numerical values, beginning from 1 2 3 4 5 6
‘n’ people, where n =
and ending with 6 5 4 3 2 1. A) 81 B) 243 C) 486 D) 144
(a) What number falls on the 124th position? 25. The number of ‘n’ digit numbers such that no two
(b) What is the position of the number 321546? consecutive digits are same is
12. Number of 4 digit positive integers if the product of their A) 9! B) n9 C) 9 n D) 9n
digits is divisible by 3 is 26. How many three digit numbers have at least one even
A) 2700 B) 5464 C) 6628 D) 7704 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) 248th B) 247th
1.15

C) 246th D) 253rd eight 'dots' can be arranged, using only seven of these
28. Number of 9 digits numbers divisible by nine using the 13 'dashes' & 'dots' is :
digits from 0 to 9 if each digit is used atmost once is K · 8 A) 1287 B) 119 C) 120 D) 1235520
! , then K has the value equal to 33. Let m denote the number of ways in which 4 different
A) 14 B) 15 C) 16 D) 17 books are distributed among 10 persons, each receiving
29. Number of permutations of 1, 2, 3, 4, 5, 6, 7, 8 and 9 none or one only and let n denote the number of ways
taken all at a time, such that the digit 1 appearing of distribution if the books are all 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 permutation) A) 22380 B) 25700 C) 22000 D) 22400
A) 9 · 7! B) 8! C) 5! · 4! D) 8! · 4! 35. The number of ways of arranging the letters of the word
30. There are counters available in x different colours. The ENGINEERING so that exactly 2E’s come together is
counters are all alike except for the colour. The total
  9! 10 !
number of arrangements consisting of y counters, A) 3  8! B) 2 C) 4  8! D) 3!(2!)2
assuming sufficient number of counters of each colour, if (3!)(2!)
no arrangement consists of all counters of the same colour 36. The number of ways of arranging the letters of the word
is : ENGINEERING so that exactly 2E’s cometogether and
A) xy  x B) xy  y C) yx  x D) yx  y exactly 2N’s cometogether is
31. Number of ways in which 7 green bottles and 8 blue 59
bottles can be arranged in a row if exactly 1 pair of green A) (15)7! B) 7!
4
bottles is side by side, is (Assume all bottles to be alike
except for the colour). 9 ! 7! 9! 3  7!
C)  D) 
A) 84 B) 360 C) 504 D) none 4 2 4 2
32. The number of different ways in which five 'dashes' and
Answers
6! 7! 7! 8! 6!
1. a) ; b) ; c) 5 ; d) 3 ! 2 ! e) 3 ! 2 ! 2. 61 3. D 4. A
2 ! 3! 2 ! 3!  2 !
2
5.1416 6. i) D, ii) C , iii) A 7. i) C, ii) B , iii) B 8. D 9. 36

th
10. A 11. a) 213564, b) 67 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
1.3 Circular Permutations By breaking circle at a1, we get a linear permutation

Similarly, by breaking circle at a2, a3, ...., ar
Arrangement of objects around a circle is called circular
permutation. We get r linear permutations
THEOREM 4 Hence total number of a linear permutations.

The number of circular permutations of n dissimilar n
Pr
n
Pr rx = nPr  x 
objects taken ‘r’ at a time is r
r
Proof Note
Let x be the number of circular permutations. Consider 1) If r = n then x = (n – 1)!
one of these x permutations. Say
2) Among these circular permutations half (are)
a1 clockwise and half anticlockwise.
ar a2
For instance, let us arrange four persons
ar–1 a3 P1, P2, P3, P4 around a circle.
a4
1.16
 n  1 !
P1 P1 P1 objects have same neighbours is
2
P4 1 P2 P3 2 P2 P4 3 P3
( we have consider either clockwise or anticlockwise
permutations).
P3 P4 P2 In the above example,
P1 P1 P1 in 1,5 P1 have same neighbours.

in 2, 4 P1 have same neighbours.
P2 4 P3 P2 5 P4 P3 6 P4 in 3, 6 P1 have same neighbours.
P4 P3 P2 3) In the preparation of chains, garlands, necklace etc.

clockwise and anticlockwise permutations are consider
Hence , the number of ways of arranging n dissimilar to be identical. Therefore we consider one direction only
objects around a circle, so that in no two arrangements i.e 1/2 of total circular permutations.
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 (linear
two particular persons be next to each other. permutation)
Sol. For 1st one answer is (5 – 1)! = 4! Hence total = 5!  6P3
For next one, considering two particular persons as one ii) 6! x 3!
person, we have 4 persons in all. They can be seated G1
around a circular table in 3!. But two particular persons 6 1
G6 G2
can be arranged among themselves in 2!. Hence total =
3! x 2! = 12. 5 2
50. A round table conference is to be held between 20 iii) G5 G3
delegates of 2 countries. In how many ways can they be
seated if two particular delegates are i) always together 4 3
G4
ii) never together. gentlemen can be arranged in 5! ways. Now ladies have
Sol. i) two particular delegates can be considered as a person, occupied 1,3,5 positions or 2,4,6 positions.
then there are 18 + 1 = 19 persons, they can be arranged Hence total = 5!  2  3!
arround circle in 18! ways and particular persons can be iv) Assume two particular ladies and particular gentleman
arranged in 2! ways. Thus total = 18!  2! as single person, then total people now are 4 + 1 + 1 =
ii) Required number of ways = 19! – 18!  2! 6, they can be arranged in 6! and 2 ladies can be arranged
51. A man invites 10 friends for a dinner party. In how many in 2!
ways they can be seated around a circular table so that Total = 2!  6! ; Required number of ways
two particular friends on either side of man. = 8! – 2!  6! = (54)6!
Sol. Let M be the man and F1, F2 be two particular friends. 53. The number of ways that 8 beads of different colours be
F1MF2 considered to be a single person. We have 9 in strung as a necklace is
all. They can be arranged in 8! and F 1, F 2 can be Sol. Since, direction is immaterial number of garlands
interchange in 2 ways. Total = 8! x 2
52. There are 6 gentlemen and 3 ladies to dine at a round 7!
=
table. In how many ways can they seat themselves so 2
that 54. Find the number of ways in which 8 different flowers can
i) No two ladies sit together. ii) All ladies sit together. be strung to form a garland so that 4 particular flowers
iii) Every gentleman have a lady on his adjacent. are never separated.
iv) Two particular ladies refuse to sit beside a particular Sol. Considering 4 particular flowers as one flower, we have
gentleman.
4!
G1 five flowers which can be strung to form a garland in
G2 2
G6 ways. But 4 particular flowers can be arranged in 4! ways.
4! 576
Sol. i) G Thus, the required no. of ways =  4!  = 288.
5 G3 2 2
G4
1.17

1. A gentleman invites a party of m + n (m  n) friends to 2. The number of ways in which six boys and six girls can be
a dinner & places m at one table T1 and n at another seated at a round table so that no two girls sit together
table T2 , the table being round . If not all people shall and two particular girls do not sit next to a particular boy
have the same neighbour in any two arrangement, then is
the number of ways in which he can arrange the guests, A) 6! 4! B) 2.5! 4! C) 2.6! 4! D) 5! 4!
is
(m  n) ! 1 (m  n) ! 3. All the five digit numbers in which each successive digit
A) B)
4 mn 2 mn exceeds its predecessor are arranged in the increasing
order of their magnitude. The 97th number in the list
(m  n) ! (m  n)! does not contain the digit
C) 2 D)
mn m! n! A) 4 B) 5 C) 7 D) 8
Answers
1.A 2. C 3.B
Solutions Are On Page No.1.81
n
1.4 Combination group has exactly r! arrangements. Therefore
Pr
gives
r!
Each of the different groups or selections which can be made r-element subsets of n-element set, which completes the
by taking some or all of a number of things (irrespective of proof.
order) is called a combination. A combination is a selection
of objects without regard to order (key word : select) Notation
Let r  n and let A be a finite n-element set. In many n
Pr n!
 n
 n
situations it is convenient to consider r-element collections
r! r!  n  r  ! , usually it is denoted by Cr or  r  or
consisting of elements from A such that each element a  A
C(n, r).
occurs atmost once and the order of the elements doesn’t
matter, in otherwords to consider r-element subsets of the Deductions
set A.
n
A r-element subset of the set A will be called a r-combination n
1) C r 
n 1
C r 1
from the elements of A (or in short, a r-combination from n r
elements).
2) n C r  n 1
C r  n C r 1
Thus, for example, a, b,c , a, b,d , a,c,d , b,d,c aree
(all the) 3-combinations from n n n  r 1
3) C r / C r 1 
r
A = a, b,c,d .
4) The number of ways of selecting r things from ‘n’ dissimilar
things when
THEOREM 5
i) s particular things excluded is n–sCr
The number of combinations of n-dissimilar objects
n ii) s particular things included is nCr–s, s  r
Pr
taken r at a time is
r! 5) The number of ways of selecting atleast ‘r’ things from ‘n’
dissimilar things is nCr + nCr+1 + ... + nCn
Proof
Eg. : A set A contains 12 elements.
The no. of r-permutations = nPr
i) The number of 3-element subsets of A is 12C3
we subdivide all nPr, r - permutations into groups in
such a way that each group contains exactly those ii) The number of subsets containing at least 6 elements is
12C + 12C + 12C + ... + 12C
permutations that consists of the same r elements (and 6 7 8 12
differ only in the ordering of the elements). Then each
1.18
11 1 12
particular elements.
= 2  C6
2 a) excluded is 10C5 b) included is 10C3.
iii) The number of 5-element subsets of A when two
Solved Examples
55. A father has 10 children. He takes 3 children at a time to i) committee includes all three M1, M2, W
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 M1.
ii) How often each child visit zoo park ? Hence total no. of committees
= 10C5 – 7C2 – 7C3 x 2 (ii & iii have same no.)
Sol. i) Suppose s  c1 , c 2 , c 3 ....., c10  (set of children). The
= 161
number of 3-(element) children subsets of s is 10C3, these vi) Required ways =10C5 – 6C1 (M1, M2, W1, W2 included)
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 particular game can be arranged from amongst 9 married couple if
child is included is 9C2. no husband and his wife play in the same game is equal
56. The number of distinct rational numbers n such that 0 to
< 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.
A) 15 B) 13 C) 12 D) 11
By excluding their wives from 9, we have 7 remaining.
Sol. (D) From 6 digits 2 digits can be selection 6 C 2 ways From these, two women can be selected in 7C2 ways.
and they can be arranged in only one way. Out of these If M1, M2, W1 and W2 are chosen, then a team may consist
of M1 and W1 or M1 and W2. Thus, the number of ways
1 2 3 of playing the game.
ways , , represent same number
2 4 6 = 9C2. 7C2 . 2 = 112
59. The papers of 4 students are to be checked by 7 teachers.
2 4
, represent same number Then in how many ways can the 4 papers are checked
3 6 by exactly 2 teachers.
1 2 Sol. The number of ways of choosing two teachers out of 7 is
, represent same number 7C .
3 6 2
The number of ways in which they can check 4 papers is
 No. of numbers = 15 – 4 = 11
24. But this includes two ways in which all papers will be
57. Find the number of committee of 5 members formed by
checked by a single teacher. Therefore the number of
6 men and 4 women so that
ways in which 4 papers can be checked by exactly two
i) at least two women and atleast one man
teachers is 24 – 2 = 14.
ii) two particular opposite sex always included.
Total required number of ways = 14.7C2.
iii) two particular opposite sex refuse to serve in the same
60. A man is allowed to take atmost 10 steps either forward
committee
or backward. The number of ways in which he will be
iv) Majority of women serve in the committee.
just two steps away from his initial position is
v) M 1 , M 2 & W are particular men and woman
Sol. The man will be just two steps forward from his initial
respectively, M1 refuses M2 and M2 refuses W to serve in
position (in atmost 10 steps) if his movement is as follows
the same committee.
2F or 3F ; B) or (4F : 2B) or (5F, 3B) or (6F, 4B)
vi) (M1, M2), (W1, W2) are two particular men and women
Thus, required number of ways
respectively. Whenever M1 and M2 serve in the same
= 2C0 + 4C1 + 6C2 + 8C3 + 10C4
committee, W1 and W2 do not and vice versa.
= 1 + 4 + 15 + 56 + 210 = 286
Sol. Before we attempt the question, let us analyse all possible
Also, the number of ways in which the man is just two
cases and put them in tabular form
steps backwards = 286
i) W(4) 6(M)
Total = 572
2 3 Hence total selections
61. Three ladies have each brought their one child for
3 2 = 4C2.6C3+4C3.6C2 + 4C4.5C1
admission to a school. The principal wants to interview
4 1 = 120+60+5=185
the six persons one by one subject to the condition that
ii) After including two particular opposite sex, remaining
no mother is interviewed before her child. The number
3, from 8 can be selected in 8C3 ways
of ways in which interviews can be arranged is
iii) Required number of selections = total number of
Sol. The first child C1 can be chosen in 3 ways, his/her mother
selections without restriction – number of selections
can be interviewed in 5 ways, the second child C2 can
such that particular opposite sex serve together
be choosen 2 ways and his/her mother can be interviewed
= 10C5 – 8C3
in 3 ways.
iv) Required ways =4C4 . 6C1 + 4C3.6C2 = 66
v) The following cases to be excluded from the total
1.19

Hence required number of ways = Remaining 6 people on 6 positions can be seated in 6!
3 2 ways
C1  5  C1  3  90
 Required total ways = 3C1.4C2.2!.6! = 25920
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! ways.
(2n)! Total ways = 3C1. 6C2.4!.4! = 25920
then total ways = n(2n–1)(n–1)(2n–3)....1 = . 64. A class contains 4 boys and ‘g’ girls. Every sunday five
2n
students, including at least three boys go for a picnic to
62. A van can accomodate 8 persons, 4 in the front and 4 at Zoo Park, a different group being sent every week. During,
the back. If heights of 8 persons are all different, then in the picnic, the class teacher gives each girl in the group a
how many ways they can be seated in the van so that doll. If the total number of dolls distributed was 85, then
the person who is sitting in the front is shorter than just value of ‘g’ is
at back ? A) 15 B) 12 C) 8 D) 5
Sol. (D) The number of ways of forming a group of 5 from 4
Front boys and g girls with atleast 3 boys
= 4 C 3  g C 2  4 C 4  g C1 = 4  g C 2  g
Sol. number of doll’s distributed among the girls
back = 2  4  g C 2  g = 4g 2  3g = 85
Select one seat at the back, it can be done in 1, now 4C
tallest person will occupy this seat and infront of him any  4g 2  3g  85  0  g  5
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 6
i) x < y < z iii) x  y  z
will occupy this seat and infront of him any one of 5
persons can be seated in 5C1 ways and so on. iv) x  y  z v) x  y  z
Thus, total number of required ways vi) x < y > z
Sol. i) x can not assume ‘0’, select 3 digits from 1 to 9, if can
 4 C1 7 C1 3 C1 5 C1 2 C1 3 C1  1
be done in 9C3 ways and they can be arranged in one
 28  90  2520 way such that x < y < z
Note iii) x  y  z  x  y  z or x < y < z For 1st case select
2 digits from 1 to 9, it can be done in 9C2 ways hence,
In the above problem if there are 2n persons then required
total =9C2 + 9C3 = 10C3
(2n)! iv) x  y  z  x  y  z or x = y = z
number of ways = n!  2n  1 2n  3  ...1 
2n or x < y < z or x = y = z
63. An 8 oared boat (it is designed for 8 rowers the boat who total ways = 9C2 + 9C2 + 9C3 + 9C1
propel with sweeg oars and is steered by a coxswain or = 10C2 + 10C3 = 11C3
cox) to be manned from a crew of eleven of whom 3 can v) x  y  z  x  y  z or x > y > z
only steer but can not row. 8 can row but can not steer. required ways = 10C2 + 10C3 = 11C3
In how many ways the staff can be arranged if 2 of the vi) Here middle digit is largest,
men can only row on bow side. If y = 2, x = 1; z = 0, 1  2 ways
Sol. y = 3, x = 1,2, z = 0, 1, 2  2  3 ways
Crew of 11
y  4, x  1, 2, 3, z  0,1, 2, 3  3  4 ways
3 can steer only 8 can only row

y9  8  9 ways
2 only on bow 6 any where
(say AB) 8 8 8
Total   i(i  1)   i 2   i  240
oar i 1 i 1 i 1
8 1
Stroke 7 S 2 Bow 66. The number of four digit numbers of the form xyzw such
side 6 3 side
5 4 that x < y, z > w
Sol. For x < y, when y = r  2, 3,......., 9 ,
3
position for steering can be selected in C1 ways x take r – 1 values
Two positions on the bow side can be selected in 4C2
ways and AB can be arranged in 2! ways
1.20
9  36  50  1800
These are   r  1  36
r 1
Case (ii) with ‘0’ : select a from 1 to 9 : 9C1 way
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    
67. How many 7 digit numbers can be formed using the  3! 2! 2! 3! 
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 decreasing Case (iii) All same : 9
order where as right side in increasing order. Total ways = 1944
(Eg : 3209145) b) Required ways = contains at most 2 distinct digits +
ii) the digits to the left of middle digit are in increasing exactly 3 distinct = 1944 + x
order where as right side in decreasing order case (i) when ‘0’ is excluded : select a, b, c from 1 to 9
(Eg : 1238756)
 9 C 3 ways numbers can contain 3 same, 2 distinct, 2
Sol. i) 7 digits can be selected in 10C7 ways now place the
largest digit in the middle, from remaining 6 digits select same , 2 same, 1 digit
3 digits, it can be done in 6C3 ways. In this case total ways
now on each side of middle digits, 2 groups of 3 digits
 5! 3 5! 3 
can be arranged in only one way (increasing and = 84   C1   C2   12600
 3! 2! 2! 
decreasing order)
Hence total  10 C7  6C 3 Case (ii) when ‘0’ is included : select a, b : 9C2 ways
= 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! 
9 6
 total = 36   2   2   2  2016
 C7  C 3 (same as above)  3! 2! 5! 
= 720 x  14616
Case (ii) When ‘0’ is included : 6 digits can be selected
Total = 2520
from remaining 9 digits in 9C6 way now ‘0’ must come
71. A set S contains n elements. A subset P is chosen from S
to the right of midle digit, select 2 digits from 5 digits
and S is reconstructed by replacing the elements P. Now
(excluding largest one), it can be done in 5C2 ways.
another subset Q is chosen from S. Find the number of
in this case, required number of ways  9C 6  5 C 2 ways of choosing P, Q such that.
9 6 9 5 i) P, Q are disjoint.
 Total = C7  C 3  C 6  C 2 = 1800
ii) Unordered pairs (P, Q) and P  Q  
68. The number of 7 digit numbers whose middle digit is
largest and the digits on either side of middle digit are in iii) P  Q contains exactly r ( < n) elements.
increasing order. iv) P  Q  S
Sol. 7 digits can be selected in 10C7 ways, largest digit is placed
in the middle and from remains 6, 3 digits can be selected v) P  Q
in 6C3 ways and they can be arranged in one way on vi) P, Q contains same number of elements.
one side. vii) P  Q
Total = 10C7  6C3 viii) P contains r more elements than elements in Q.
69. Find the number of 3 digit numbers which contains at
most 2 distinct digits. Sol. Let S = { a1, 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 : 9C2 ways 4) a1  P, a 2  Q
The numbers are of the form Total number of cases = 4n (there are n elements in S)
aaabb, bbbaa, bbbba, aaaab. i) P  Q    P, Q have no common elements, that
Total ways in this case
is cases (2), (3), (4) are eligible.
 5! 5!  i.e., a1 has 3 choices, a2 has 3 choices and so on.
 9 C 2   2   2
 3! 4 !  Thus, the number of ways such that P  Q   is 3n.
1.21

ii) Unordered pairs (P, Q) means (P, Q) = (Q, P). = n C r . nC 0  n C r 1  nC1  n C r  2 nC 2  ....  nC1 . n C n  r
Suppose P = { a1}, Q = {a2, ..... an} where P  Q  
2n
 Cn r
is same as P = { a2, a1, ...., an}, Q = {a1}
. 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
3n  1 3n  1 word.
P  Q   is  1 (P  , Q  )  .
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 can be Possible cases of 5 letters :
done in n C r ways. i) 3 alike of one kind, 2 alike of other kind :
2 5!
Thus, required ways = n C r . 3 n  r C1  2C1   40
3! 2!
iv) P  Q  S when we choose the cases (1), (2),and
2 5 5!
(3). Thus required ways = 3n. ii) 3 alike of one kind, 2 different : C1  C 2   400
v) P = Q means total number of subsets of S, which is 3!
2n. iii) 2 alike of one kind, 2 alike of other kind, 1 different
vi) P, Q can contain 0, 1, 2, 3, ...., n elements. 5!
3 4
The number of required ways : C 2  C1   360
2! 2!
2 2 2
=  n
C0    n
C1   .....   n C n   n
Cn
3 5 5!
vii) P Q iv) 2 alike of one kind, 3 different : C1  C3   1800
n
2!
C0 2n
5 5!
n
C1 2n–1 v) 4 alike, 1 different : 1  C1   25
4!
n
C2 2n–2 vi) all different : 6 C 5  5!  720
  Required number of words
n
Cn 0 = 40 + 400 + 360 + 1800 + 720
2
= 3345
 Required ways The number of ways of selecting 5 letters
= n C 0 . 2n  n C1 . 2n 1  .....  n C n . 20  3 4  2C1  2C1  2C1  5 C 2  3C 2  4 C1  3C1  5C 3  1  5C1
viii) Required ways  6C 5
= 77.

1. A women has 11 close friends. Find the number of ways 4. x1  x 2  x 3  x 4  x 5  x 6 is
in which she can invite 5 of them to dinner, if two
particular of them are not on speaking terms & will not A) 9 C 3 B) 10
C3 C) 10C6 D) 10 C 5
attend together.
5. x1  x 2  x 3  x 4  x 5  x 6 is
A) 462 B) 84 C) 378 D) 500
2. There are 10 seats in a double decker bus, 6 in the lower A) 9 C 3 B) 9 C 4 C) 10
C3 D) 10
C4
deck and 4 on the upper deck. Ten passengers board the
bus, of them 3 refuse to go to the upper deck and 2 insist 6. x1  x 2  x 3  x 4  x 5  x 6 is
on going up. The number of ways in which the
A) 9 C 4 B) 9 C 3 C) 10
C4 D) 10
C3
passengers can be accommodated is . (Assume all seats
to be duly numbered) 7. A question paper on mathematics consists of twelve
questions divided into three parts A, B and C, each
A) (240)6! B) 4 !  6! C) 10(6!) D) 120(6!)
containing four questions. In how many ways can an
3. Two cards are drawn one at a time & without replacement examinee answer five questions, selecting atleast one
from a pack of 52 cards. Determine the number of ways from each part.
in which the two cards can be drawn in a definite order. A) 624 B) 208
Information for Quetion No 4 to 6 C) 1248 D) 2304
Let x1 x 2 x 3 x 4 x 5 x 6 be a six digit number find the 8. Number of ways in which 7 people can occupy six seats,
number of such numbers such that 3 seats on each side in a first class railway compartment
1.22
if two specified persons are to be always included and A) 70 B) 71 C) 72 D) 73

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

1.5 Total Combinations selecting an object)
The total number of combinations of n distinct objects is The number of ways of selecting atleast one object from n
nC + nC + nC + nC +...+ nC = 2n ...(1)
0 1 2 3 n distinct objects = 2n–1 ...(2)
1.23

PNC and Probability Permutations PDF

Uploaded by

Copyright:

Available Formats

PNC and Probability Permutations PDF

Uploaded by

Document Information

Original Description:

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

PNC and Probability Permutations PDF

Uploaded by

Copyright:

Available Formats

What topics are covered in the book?

What topics are covered in the book?

What is the author's experience in teaching JEE?

What is the author's experience in teaching JEE?

1 PnC and Probability

Our Other Products (for JEE MAIN and ADVANCED)

Mechanics - 1 by Vikas Jain

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

All rights reserved

Practice Session - 1 for JEE MAIN 2.54

Permutation & Combination

P & C and Probability

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

Permutation & Combination

P & C and Probability

Arranging objects along a line THEOREM 2

The number of permutations of n distinct objects taken Note

n  n  1 n  2 ...  n  r  1 n  r  n  r  1 ... 2.1 THEOREM 4

Permutation & Combination

P & C and Probability

= 10! – 17.8! = 73.8! v) R S - 1 object .

Sol. i) Assume all vowels AEIU as single object. n

Permutation & Combination

The number of ways of arranging n black balls and n red 5

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

P & C and Probability

  n 1 Pr 1  sum of n digits 111....1, when 0 is excluded

Permutation & Combination

 (x 2  x1  y 2 y1 )C x 2 x1 ,x 2  x1, y 2  y1

Make Concepts Clear 1.1

P & C and Probability

Permutation & Combination

Sol. i) divisible by 3 : x1 x2 x3 x4 =2940

P & C and Probability

When repetition is allowed

Permutations when several kinds of Proof

Permutation & Combination

n! The number of permutations of (m1+m2+ .... + mk)

6! 6 vacancies, we have to fill them with sequence

P & C and Probability

 sum of digits in unit places 3!

To find rank of a word in dictionary order (lexicographical order). The position at

Make Concepts Clear 1.2

Permutation & Combination

P & C and Probability

5.1416 6. i) D, ii) C , iii) A 7. i) C, ii) B , iii) B 8. D 9. 36

1.3 Circular Permutations By breaking circle at a1, we get a linear permutation

THEOREM 4 Hence total number of a linear permutations.

ar–1 a3 P1, P2, P3, P4 around a circle.

Permutation & Combination

P1 P1 P1 in 1,5 P1 have same neighbours.

P4 P3 P2 3) In the preparation of chains, garlands, necklace etc.

P & C and Probability

Make Concepts Clear 1.3

Permutation & Combination

P & C and Probability

Permutation & Combination

P & C and Probability