ii  Theory of Counting

• Head Office : B-32, Shivalik Main Road, Malviya Nagar, New Delhi-110017

• Sales Office : B-48, Shivalik Main Road, Malviya Nagar, New Delhi-110017
Tel. : 011-26691021 / 26691713

Price : ` 280

Typeset by Disha DTP Team

DISHA PUBLICATION
All RightS Reserved

© Copyright Publisher
No part of this publication may be reproduced in any form without prior permission of the
publisher. The author and the publisher do not take any legal responsibility for any errors
or misrepresentations that might have crept in. We have tried and made our best efforts to
provide accurate up-to-date information in this book.

For further information about the books from DISHA,

Log on to www.dishapublication.com or email to info@dishapublication.com
 On the Cards  iii
PREFACE
In my teaching career, whenever I asked my students “Which part of mathematics are you afraid of?”
most of the time I got the answer “Permutation and Combination/ Probability”. In various cases, we see
decisions depend on chances, which in turn depend on various factors. In a situation when certain choices
are made to get to a final selection of a desired outcome, technically it is then where the concept of Per-
mutation & Combination and Probability comes to light.
The book “Theory of Counting” delves deep into the basics of Permutation & Combination and Probability
then advances into the IIT JEE level and ends up high with the International Maths Olympiad level.
Each chapter has been well explained and illustrated with numerous examples for the better under-
standing of the reader. To be precise most of the time students get confused between Permutation and
Combination, so I thought to make it easier by eliminating Permutation. Just concentrate on Selection/
Combination and you can solve problems easily.
Each Chapter is divided in two parts -
Part A: Basic, concept building and Board level Questions
Part B: Nightmare, IIT JEE and Maths Olympiad Questions
It is advisable to students that before attempting Part B of any Chapter please solve Part A of all the
chapters.
Quantitative problems in this book has been divided into 5 difficulty levels viz.
• Concept Applicator: Basic concept testing questions.
• Concept Builder: Concept strengthening questions.
• Concept Cracker: Challenging level questions.
• Concept Deviator: IIT JEE equivalent level questions.
• Concept Eliminator: International Maths Olympiad standard questions.
The best bet is that this book is self-sufficient in itself. For the aspirants of any competitive examina-
tion like IIT JEE Main & Advanced, RMO and also Board exams etc. their quest for an overall adaptive
book ends here. Once the reader is able to successfully complete this book, he can be rest assured of his
excellent performance on the exam day. What’s more is that this is India’s first book with video links/
QR codes.
I would like to express my sincere thanks to Mr. Deepak Agarwal, Founder-Director of Disha Publication
for consistently guiding me to bring this book as immaculate.
To understand the fact that a book is not an individual work, it incorporates the efforts of other people, I
am thankful to all my students who have helped me throughout the compiling of this book and also proof-
reading it. These include but not limited to Kushal Dey, Bhupesh Kumar Srivastava, Abhishek Gourav,
Ashish Jha, Gaurav Jain and Rahul Roy.
Last but not the least, I would like to express my sincere gratitude to my father (my only Maths teacher),
mother, siblings and have no words for my better half ‘Suvra’, who is my inspiration and partner in all
ventures. Finally, thanks to the Hero of my life, my son – ‘Sanyukt’ (meaning summation in Math). He is
the great source of inspiration for this book.
I have taken extreme care while writing the theories, compiling the questions and preparing the solu-
tions, however, some errors may have crept in, so hereby I invite all readers to bring it to our notice.
Gajendra Kumar
iv  Theory of Counting

index
1. Introduction 1 - 34

2. Selection (Combination) 35 - 70

3. Geometrical Construction 71 - 102

4. Arrangement 103 - 124

5. Circular Arrangement 125 - 144

6. Word/ Number Formation 145 - 180

7. Distribution 181 - 206

8. Number of Integral Solution 207 - 238

9. Probability Introduction 239 - 264

10. Dependent and independent Events 265 - 290

11. Conditional Probability 291 - 310

12. Binomial Probability 311 - 332

13. On the Cards 333 - 348

14. Probability Miscellaneous 349 - 370

15. Puzzles 371 - 396

 1
Introduction  1

Introduction

Topics Covered
 Factorials
 Highest power of a number in N!
 1st Non-zero, 1st two non-zero digits in N!
 Fundamental principle of counting
 Properties of nCr and nPr
 Properties of Factorials

Part A: Topic Number of Questions

Solved Example 25
Concept Applicator 20
Concept Builder 20
Concept Cracker 20
Part B: Topic Number of Questions
Concept Deviator 16
Concept Eliminator 10
Total 111
2  Theory of Counting
Part A

Concept 1 Introduction
Factorial of a natural number is defined as between largest and smallest possible
the products of all the integers from 1 to n. It value of a.
is represented as ! or ∠. Solution:  Since summation of two factorial
From the definition 1! = 1 is a three digit number hence maximum
possible value of a is 6 while minimum
2! = 1.2 = 2
possible value is 0 hence required difference
3! = 1 × 2 × 3 = 6 is 6 – 0 = 6
4! = 1 × 2 × 3 × 4 = (3!)(4) = 24
Example 2:  Find the unit digit of summation
5! = 1 × 2 × 3 × 4 × 5 = (3!)(4 × 5) = (4!)(5) = 120 of 1! + 2! + 3! + 4! + 5! + … + 10!.

6! = 1 × 2 × 3 × 4 × 5 × 6 = (4!)(5 × 6) = (5!)(6) Solution:  Since unit digit of all the factorial

= 720 from 5! is 0, hence required unit digit is given
Or N! = 1 × 2 × 3 × 4 × 5 × ..(N – 2) × (N – 1) × (N) by 1! + 2! + 3! + 4! Which is 1 + 2 + 6 + 24 and
= (N – 1)! × N unit digit of this is 3.

0! is defined as 1 and we will see the proof of Example 3:  Find the unit digit of product
this at the end of this chapter. of 1! × 2! × 3! × …. × 10!

Example 1:  If (a!) + (b!) is a three digit Solution:  Since unit digit of 5! is 0 hence
number then find the difference required unit digit of product is 0.

QR Code / Video Link

For Smart phone/ Tablet users

Video Link for Desktop/Laptops users http://dishapublication.com/video-resources


2 Highest power of a
Concept number in N!
Most of the questions in the numbers related to
factorial are of the type to find out the largest
power of a number in a factorial n (n!).
Highest power of a PRIME NUMBER
p that divides n! exactly that means
without leaving any remainder is given by
n  n   n 
 p  +  2  +  3  ……. where, [x] represents
   p   p 
greatest integer function, that means greatest
integer less than or equal to x. We will see
that with some examples.
Example 4:  Find the largest power of 5
that divides 27! Perfectly that means
without leaving any remainder.
Solution:  The required number of powers is
 27   27 
given by   +    =  5 + 1 = 6 .
 5   52 
The same question can be solved by another
method. Let we need to find highest power
of a prime number p in factorial n (n!). then
1st divide n/ p, we will get some quotient,
divide that quotient again by p and continue
the process till we get quotient less than
the p. then add all the quotients that will
give us the required number of power of p
that divide n!.
QR Code / Video Link
For Smart phone/ Tablet users
Video Link for Desktop/Laptops users http://dishapublication.com/video-resources
Introduction  3
Example 5:  Find highest power of 3 in
100!.
Solution:  The required power is given by
 100   100   100   100 
 3  +   2  +  3  +  4 
3  3  3 
= 33 + 11 + 3 + 1 = 48
Another way to represent the same concept is
described as below –
3 100
3 33 … 1st quotient
3 11 … 2nd quotient
3 3 … 3rd quotient
1 … 4th quotient
and last quotient since 1 < 3. So highest
power of 3 in 100! = 33 + 11 + 3 + 1= 48.
But above rule is valid only for prime
numbers not for composite numbers. If we
need to find the same for composite number
then 1st convert that composite number as
product of primes and then find out the
highest power of each prime numbers in
that factorial, and least of those highest
powers is the required answer. We will see
some examples –
4  Theory of Counting
Example 6:  Find highest power of 6 in 200!
Solution:  Here given number 6 is not a prime
number so 1st convert that as product of
primes,
6 = 2 × 3, so now we will find out the highest
powers of 2 and 3.
To find highest power of 2 in 200!
2 200
2 100 … 1st quotient
2 50 … 2nd quotient
2 25 … 3rd quotient
2 12 … 4th quotient
2 6 … 5th quotient
2 3 … 6th quotient
1 … last quotient
So highest power of 2 in 200! is 100 + 50 + 25
+ 12 + 6 + 3 + 1= 197
Similarly highest power of 3 in 200! is
3 200
3 66 … 1st quotient
3 22 … 2nd quotient
3 7 … 3rd quotient
2 … 4th quotient
So highest power of 3 in 200! is 66 + 22 + 7 +
2 = 97,
So 200! Contains (2)197 × (3) 97 or it contains
97 pairs of 2 and 3 hence required power is
(6)97 or directly we can say the smaller in
between the two powers is the answer.
For a composite number, convert the number
as product of primes and find the highest
power of the prime factors then highest power
of prime (or its power), lowest of these values
will give us the highest power of composite
number.
Example 7:  Find highest power of 15 in
150!
Solution:  Since 15= 3 × 5 and 5 > 3 so highest
power of 5 is same as that of 15 in 150!. So
we will find out the highest power of 5 in
100!.
5 150
5 30 … 1st quotient
5 6 … 2nd quotient
1 … 3rd quotient
So highest power of 5 or 15 in 150!
= 30 + 6 + 1= 37.
Consider a number 5 and its highest power
in N!
If 0 ≤ N < 5 highest power of 5 (or number of
zeros) is 0
If 5 ≤ N < 10 highest power of 5 (or number of
zeros) is 1
If 10 ≤ N < 15 highest power of 5 (or number
of zeros) is 2
If 15 ≤ N < 20 highest power of 5 (or number
of zeros) is 3
If 20 ≤ N < 25 highest power of 5 (or number
of zeros) is 4
If 25 ≤ N < 30 highest power of 5 (or number
of zeros) is 6
If 30 ≤ N < 35 highest power of 5 (or number
of zeros) is 7
If number is a multiple of 5 then highest
power of 5 will increase by 1,
If number is a multiple of 52 then highest
power of 5 will increase by 2,
If number is a multiple of 53 then highest
power of 5 will increase by 3,
If number is a multiple of 5k then highest
power of 5 will increase by k,
So if N is a multiple of ak and if highest
power of ‘a’ in (N – 1)! is ‘p’ then highest
power of ‘a’ in N! is ‘p + k’.

Example 8:  If highest power of 8 in N! is
19 find highest power of 8 in (N + 1)!.
Solution:  Since highest power of 8 in N! is 19
hence that of 2 in N! is 57, 58 or 59,
Since highest power of 2 in 62! and 63! is
57 and that in 64! is 63, and hence N = 62
or 63.
If N = 62 then N + 1 = 63 and highest power
of 2 is 57 and that of 8 is 19,
If N = 63 then N + 1 = 64 and highest power
of 2 is 63 and that of 8 is 21,
Number Of Zeros In A Number
Number of zeros in a number is same as the
highest power of 10 in that number, and we
know that 10 = 2 × 5 then we needs to find the
highest power of 2 & 5, and smaller in the two
is equal to highest powers of 10. Since, 5 > 2
hence we will find highest power of 5, as highest
power of 2 must be more than that of 5.
Example 9:  Find the highest power of 10
in 120! or the number of trailing zeros
in the 120!
Concept 3 1st Non-Zero Digit in N!
Consider 5! = 120 here last digit is 0 and
1stnon-zero digit is 2. Then consider 10! =
3628800 it ends with 2 zeros and then 1st
non-zero digit is 8.
If we have to find 1st non-zero digit of factorial
of big numbers then we have to find an easy
method.
Base Rule : – Unit digit of (5k + 1)(5k + 2)
(5k + 3)(5k + 4) = U[4!]
Let us understand this by some
examples.
Introduction  5
Solution:  As we discussed above the highest
power of 10 in 120! is same as that of 5. So
we will find the highest power of 5 in 120!
5 120
5 24 … 1st quotient
4 … 2nd quotient
hence highest power of 5 in 120! is
24 + 4 = 28. So highest power of 10 or
number of zeros in 120! = 28.
Example 10:  Find the highest power of
100 in 100!.
Solution:  Since 100 = 22 × 52 hence, we
will find out highest power of 2 and
that of 5, since highest power of 5
has to be less than that of 2 hence we
will calculate only highest power of 5.
Highest power of 5 in 100! is 24 hence that
of 52 is 12, so highest power of 100 in 100!
Is 12.
Example 11:  Find the 1st non-zero digit of
34!
Solution:  34! = 1 × 2 × 3 × 4 × 5 × 6 × 7 × 8 ×
9 × 10 × 11 × …….31 × 32 × 33 × 34
We will segregate it in a group of 5 then we
will get
34! = (1 × 2 × 3 × 4 × 5) × (6 × 7 × 8 × 9 × 10) ×
(11 × 12 × 13 × 14 × 15) × (16 × 17 × 18 × 19 ×
20) …. (31 × 32 × 33 × 34)
Consider 1st group 1 × 2 × 3 × 4 × 5 = 24 × 5
= 12 × (10) × (1) or 1st non-zero unit digit is
2×1
6  Theory of Counting
2nd group (6 × 7 × 8 × 9 × 10) = (3024 × 10) =
1512 × (10) × (2) or 1st non-zero unit digit is
2×2
3rd group 11 × 12 × 13 × 14 × 15 = 24024 ×
15 = 12012 × (2 × 5) × (3) or 1stnon-zero unit
digit is 2 × 3
Similarly, 2nd last group is (26 × 27 × 28 × 29
× 30) = or1stnon-zero unit digit is 2 × 6
And then last group is (31 × 32 × 33 × 34) unit
digit is that of 4!
Hence 1st non-zero digit will be given by the
product of
(2 × 1) × (2 × 2) × (2 × 3) × ….. × (2 × 6) × (4!)
= Unit digit of U[26] × U[6!] × U[4!]
= Unit digit of 4 × 2 × 4 = 2
Now lets sum up the concept by a formula
Here we need to find unit digit of N!
Divide N by 5 and let quotient is Q and
remainder is R then unit digit of N! =
U[2Q] × U[Q!] × U[R!]
Lets take one more example
Example 12:  Find the 1st non-zero digit
of 92!
Solution:  92! = 1 × 2 × 3 × 4 × 5 × 6 × 7 × 8 × 9
× 10 × 11 × … 87 × 88 × 89 × 90 × 91 × 92
We will make it in a group of 5 then we will get
92! = (1 × 2 × 3 × 4 × 5) × (6 × 7 × 8 × 9 × 10) ×
(11 × 12 × 13 × 14 × 15) × (16 × 17 × 18 × 19 ×
20) …. (85 × 86 × 87 × 88 × 90) × (91 × 92)
Consider 1st group 1 × 2 × 3 × 4 × 5 = 24 × 5
= 12 × (10) × (1) or non-zero unit digit is 2 × 1
2nd group (6 × 7 × 8 × 9 × 10) = (3024 × 10) =
1512 × (10) × (2) or non-zero unit digit is 2 × 2
3rd group 11 × 12 × 13 × 14 × 15 = 24024 × 15
= 12012 × (2 × 5) × (3) or non-zero unit digit
is 2 × 3
Similarly 2nd last group is (86 × 87 × 88 × 89 × 90)
= or non-zero unit digit is 2 × 18
And then last group is (91 × 92) unit digit is
2 or that of 2!
Hence 1st non-zero digit will be given by the
product of
(2 × 1) × (2 × 2) × (2 × 3) × … × (2 × 18) × (2!)
= Unit digit of U[218] × U[18!] × U[2!]
Now from similar concept U[18!] = U[23] ×
U[3!] × [3!] = U[8 × 6 × 6] = 8
Hence non-zero unit digit of 92! = U[218] ×
U[18!] × U[2!] = U[4 × 8 × 2] = 4
Now from formula if we divide 92/5 quotient
is Q = 18 and remainder is R = 2 then
U[92!] = U[2Q] × U[Q!] × U[R!] = U[218] ×
U[18!] × U[2!] = U[4 × 8 × 2] = 4
A New Approach to Find 1st Non-Zero Digit
Let highest power of 5 in N! is P and R1, R2,
etc are remainders when N is successively
divided by 5
U[N!] = U[2P] × U[R1!] × U[R2!] ….
We will understand this by taking one
example: –
Example 13:  Find 1st non-zero digit of 14!
Solution:  With normal method we will find
highest power of 5 in 14!
5 14
5 2 → R1 = 4
0 → R2 = 2
Hence highest power of 5 in 14! is P = 2 + 0 = 2
So U(14!) = U[22] × U[4!] × U[2!] × U[0!]
= U[4 × 4 × 2 × 1] = 2
Example 14:  Find 1stnon-zero digit of 137!
Solution:  With normal method we will find
highest power of 5 in 137!
 Introduction  7
Solution: 
5 137
5 27 → R1 = 2 5 222

5 5 → R2 = 2 5 44 → R1 = 2

5 1 → R3 = 0 5 8 → R2 = 4

0 → R4 = 1 5 1 → R3 = 3

0 → R4 = 1
Hence highest power of 5 in 137! is
Hence highest power of 5 in 222! is P = 44
P = 27 + 5 + 1 + 0 = 33
+ 8 + 1 + 0 = 53
So U(137!) = U[233] × U[2!] × U[2!] × U[0!] × Hence U[222!] = U[253] × U[2!] × U[4!] × U[3!]
U[1!] × U[0!] = U[2 × 2 × 2 × 1 × 1 × 1] = 8
× U[1!] × U[0!]
Example 15:  Find 1stnon-zero digit of 222! = U[2 × 2 × 4 × 6 × 1 × 1] = 6

1st Two Non-Zero

Concept 4 Digit in N!
Consider 5! = 120 here last digit is 0 and
1st two non-zero digit is 2. Then consider
10! = 3628800 it ends with 2 zeros and then
1st two non-zero digits is 88.
If we have to find 1sttwo
non-zero digit of
factorial of big numbers then we have to find
an easy method.
Example 16:  Find 1sttwo non-zero digit of
34!
Solution:  Consider 34!
34! = 1 × 2 × 3 × 4 × 5 × 6 × 7 × 8 × 9 × 10 ×
11 × …….31 × 32 × 33 × 34
We will make it in a group of 5 then we will get
34! = (1 × 2 × 3 × 4 × 5) × (6 × 7 × 8 × 9 × 10) ×
(11 × 12 × 13 × 14 × 15) × (16 × 17 × 18 × 19 ×
20) …. (31 × 32 × 33 × 34)
Consider 1st group 1 × 2 × 3 × 4 × 5 = 24 × 5
= 12 × (10) × (1) or 1st two non-zero unit digit
is 12 × 1
2nd group (6 × 7 × 8 × 9 × 10) = (3024 × 10)
= 1512 × (10) × (2) or 1st 2 non-zero unit digit
is 12 × 2
3rd group 11 × 12 × 13 × 14 × 15 = 24024 × 15
= 12012 × (2 × 5) × (3) or 1st 2 non-zero unit
digit is 12 × 3
4th group (16 × 17 × 18 × 19 × 20) = (93024 ×
20) = 46512 × (10) × (4) or 1st 2 non-zero unit
digit is 12 × 4
Similarly 2nd last group is 4th group (26 × 27
× 28 × 29 × 30) = (570024 × 30) = (570024 × 5
× 6) = 285012 × 10 × 6 or 1st 2 non-zero unit
digit is 12 × 6
8  Theory of Counting
And then last group is (31 × 32 × 33 × 34) and
1st 2 unit digit is 1113024 or 24.
Hence 1st 2 non-zero digit will be given by the
product of
(12 × 1) × (12 × 2) × (12 × 3) × ….. × (12 × 6) × (24)
Hence required 1st 2 non zero digit is T[126] ×
T [6!] × (24) = T[84 × 72 × 24] = 52
Divide N by 5 and let quotient is Q and remainder
is R then 1st two non-zero digit of N!
= T[12Q] × T[Q!] × T[ N × (N – 1)…R terms]
Now lets use this concept to find 1st 2 non-
zero digit of 92!
When 92 divided by 5 quotient is 18 and
remainder is 2, hence
T[92!] = T[1218] × T[18!] × T[91 × 92] = T [04
× 28 × 72] = 64
Example 17:  Find 1st two non-zero digit
of 137!
Solution:  if we divide 137/5 then quotient is
Q = 27, and remainder R = 2
Hence, T[137!] = T[1227] × T[27!] × T[136
× 137]
1st term is T[1227] = T[ {254} × {327}]
= T[{24 × 16} × {( 816)(33)}]
= T[84 × 81 × 27] = 08
2nd term is T[27!] = T[125] × T[5!]
× T [26 × 27] = T[32 × 12 × 26 × 27] = 68
3rd term is T[136 × 137] = T[36 × 37] = 32
Hence T[137!] = T[08 × 68 × 32] = 08
A new approach to find last 2
non- zero digit of N!
Let highest power of 5 in N! is P and sum of
all the remainders of [N/5] + [N/52] + .. is R1,
R2, etc then
T[N!] = T[12P] × T[Q1 × Q2…]
Here Q1, Q2, are defined as below with example
We will understand this by taking one
example:
Example 18:  Find 1st two non-zero digit
of 137!
Solution:  With normal method we will find
highest power of 5 in 137!
5 137
5 27 → R1 = 2 Q1 = T[136 × 137] = 32
5 5 → R2 = 2 Q2 = T[26 × 27] = 02
1 → R3 = 0
Hence highest power of 5 in 137! is P = 27 +
5 + 1 = 33
So T(137!) = T[1233] × T[32 × 02]
= T[72 × 64] = 08
Example 19:  Find 1st two non-zero digit
of 222!
Solution: 
5 222
5 44 → R1 = 2 Q1= T[221 × 222] = 62
5 8 → R2 = 4 Q2 = T[41×42×43×44]=24
1 → R3 = 3 Q3 = T[6 × 7 × 8] = 36
Hence highest power of 5 in 222! is P = 44 +
8 + 1 = 53
Hence, T[222!] = T[1253] × T[62 × 24 × 36]
= T[72 × 68] = 96
Example 20:  Find 1sttwo non-zero digit of
444!
Solution: 
5 444
5 88 → R1=4; Q1= T[441×442×443×444]=24
5 17 → R2=3; Q2 = T[86 × 87 × 88] = 16
3 → R3=2; Q3 = T[16 × 17] = 72
→ R4=3; Q4 = T[1 × 2 × 3] = 6
Hence highest power of 5 in 444! is P = 88 +
17 + 3 = 108
Hence, T[444!] = T[12108] × T[24 × 16 × 72 × 6]
= T[96 × 88] = 48

Fundamental
Concept 5 Principle of Counting
Fundamental principle of summation: If
a work A can be done in m ways and another
work B can be done in n ways then work A or
B can be done in m + n ways.
Consider total n works, if 1st work can be
done in a1 ways, 2nd work can be done in a2
ways, and so on nth can be done in an ways
then work a1 or a2 or …or an can be done in
a1 + a2 + … + an ways.
Example 21:  If Suvro has one sandal,
one formal shoe, one sports shoe,
in how many ways he can select his
footwear?
Solution:  Since a person can wear only one
footwear at a time, so he can wear either
sandal or formal shoe or sports shoe, that
means he has total 3 ways to select his foot
wear.
Example 22:  Trina went to a famous
restaurant for dinner, there in menu
card she saw 10 Indian and 12 Chinese
food, in how many ways she can select
QR Code / Video Link
For Smart phone/ Tablet users
Video Link for Desktop/Laptops users http://dishapublication.com/video-resources
Introduction  9
her food if she is allowed to have either
Indian or Chinese food.
Solution:  Number of ways that she can select
Indian food is 10 and number of ways that
she can select Chinese food is 12 but she
is allowed to have either Indian or Chinese
food hence number of ways that she can
select food is 10 + 12 = 22 ways.
Fundamental principle of multiplication:
If a work A can be done in m ways and another
work B can be done in n ways then work A &
B can be done in m × n ways.
Consider total n works, if 1st work can be
done in a1 ways, 2nd work can be done in a2
ways, and so on nth can be done in an ways
then work a1, a2, …,an–1, an can be done in
a1 × a2 × … × an ways.
Example 23:  If Rajesh has 4 formal shirts
and 5 formal trousers then in how
many ways he can wear his dress?
Solution:  Rajesh can select shirts in 4 ways
and trousers in 5 ways hence number of
ways he can select his dress is 4 × 5 = 20
10  Theory of Counting
Example 24:  In a hostel mess, for breakfast
4 different items, for lunch 3 different
items and for dinner 5 different items
was available, In how many different
ways a student can select food?
Solution:  Student can select breakfast in 4
ways, lunch in 3 ways and dinner in 5 ways
so required number of ways is 4 × 3 × 5 =
60 ways.

Concept 6 Properties of nCr and nPr

n!
From the definition nCr = nC + nCr = n + 1Cr
(n − r )!(r !) r–1

nC = nCy, then x = y or x + y = n
n! x
And nPr = = (r!)(nCr)
(n − r )! nC
r = nCn – r
Some other properties of binomial
coefficients (nCr)/(r + 1) = nCr + 1/(n – r)
nC + nC1 + nC2 + … + nCn nP
0 Example 25:  If 3= 1716, then find the
= (1 + 1)n = 2n value of n

nC nC + nC2 + … ( – 1)n – 1nCn

0– 1 n!
Solution:  Since, nPr =
= (1 – 1)n = 0
(n − r )!
nC + nC2 + nC4 + … n!
0 Hence, =  n (n − 1)(n − 2 ) = 1716
(n − 3)!
= nC1 + nC3 + nC5 + …. = 2n – 1
= 11 × 12 × 13 hence n = 13

1
Concept Applicator (CA)
Ideal Time
20 Min.
1. If a! + b! + c! + d! + e! is a two digit number
find the maximum value of e.
(a) 1 (b) 2
(c) 4 (d) 5
2. If unit digit of a! + b! + c! is 9 then find
the value of {(a!)(b!)(c!)}
(a) 8 (b) 5040
(c) 0 (d) 12
3. Find the unit digit of 1! + 2! + 3! + 4! + ..
+ 10!
(a) 0 (b) 1
(c) 3 (d) 7
4. If N = a! + b! + c! is a two digit prime
number then how many values of N
exist?
(a) 0 (b) 1
(c) 2 (d) 3
5. If product of factorials of n consecutive
positive integers is a single digit number
then find the maximum value of n.
(a) 0 (b) 1
(c) 2 (d) 3
6. Find the value of (10!)/(7!)
(a) 72 (b) 720
(c) 840 (d) 120
Introduction  11
Apply your concepts with easy and
conceptual questions
12!
7. Find the value of
{(8!)(4!)}
(a) 220 (b) 320
(c) 450 (d) 495
8. If sum of factorials of “K” consecutive
natural numbers is a three digit number
then find the maximum value of “K”.
(a) 3 (b) 4
(c) 5 (d) 6
9. If sum of factorials of “K” consecutive
natural numbers is a single digit number
then find the maximum value of “K”.
(a) 3 (b) 4
(c) 5 (d) 6
10. If a two digit number ‘ab’ = a! + b! then
how many such two digit number exist?
(a) 0 (b) 1
(c) 2 (d) 3
11. Find the highest power of 2 in 50!.
(a) 42 (b) 44
(c) 47 (d) 49
12. Find the highest power of 3 in 50!.
(a) 19 (b) 22
(c) 25 (d) 27
12  Theory of Counting

13. Find the highest power of 5 in 100!.
(a) 19 (b) 22
(c) 25 (d) None of these
14. Find the highest power of 7 in 77!
(a) 12 (b) 13
18. If 12Pr = 11880 then find the value of r.
(a) 3 (b) 4
(c) 5 (d) None of these
19. ICICI Bank has a vacancy for the post of
a brand manager. List of applicants are
as follows – Enrolled

(c) 11 (d) 16 IIMA – 4 applicants

IIMB – 5 applicants
15. Find the highest power of 6 in 50!. IIMC – 6 applicants
(a) 47 (b) 23 In how many ways ICICI bank can
recruit its brand manager?
(c) 22 (d) 24
(a) 120 (b) 15
16. If 20Pr = 6840 then find the value of r
(c) 14 (d) None of these
(a) 1 (b) 2
20. Amit, a final year student of B school, has
(c) 3 (d) None of these to go for job interview of PWC. He has 4
15P formal shirts and 3 formal trousers. In
17. If r = 32760 then find the value of
15C how many ways he can select his outfit
r for interview?
(a) 120 (b) 210 (a) 6 (b) 7
(c) 1365 (d) None of these (c) 12 (d) None of these

Response Grid
1. a b c d 2. a b c d 3. a b c d 4. a b c d 5. a b c d
6. a b c d 7. a b c d 8. a b c d 9. a b c d 10. a b c d
11. a b c d 12. a b c d 13. a b c d 14. a b c d 15. a b c d
16. a b c d 17. a b c d 18. a b c d 19. a b c d 20. a b c d

2
Concept Builder (CB)
Ideal Time Revise your concepts with questions
30 Min. medium difficulty level questions.
1. If (a!) + (b!) is a three digit number and
‘K’ is the difference between largest and
smallest possible value of a. Then which
one of the following is true about K.
(i) Maximum value of K is 6
(ii) Minimum value of K is 1
(iii) Maximum value of K is 5
(a) Only (i) (b) Only (ii)
(c) Only (iii) (d) Only (i) & (ii)
2. If N is product of factorials of three
consecutive positive integers then which
of the following is correct about N?
(i) N may be a single digit number
(ii) If N is a two digit number then there
exist only one value of N.
(iii) If N is a three digit number then
there exist only one value of N.
(iv) N may be a four digit number
(a) Only (i) & (ii)
(b) Only (ii) & (iii)
(c) Only (i), (ii) & (iii)
(d) Only (i) & (iv)
3. If N is sum of factorials of all the prime
numbers less than 100, find the last two
digits of N
(a) 48 (b) 58
(c) 68 (d) 78
4. Find the smallest perfect square number
divisible by 9!.
(a) 25401600 (b) 3628800
(c) 2540160 (d) 50803200
Introduction  13
c!
5. If N = ( a !)( b !) is a single digit number
then how many values of N exist?
(a) 0 (b) 1
(c) 2 (d) 3
6. If product of factorials of n consecutive
positive integers is a single digit number
then find the maximum value of n.
(a) 0 (b) 1
(c) 2 (d) 3
7. Let N = 1! + 2! + 3! + 4! + …. + 200! Which
one about N is true?
(i) N is even
(ii) N is odd
(iii) N/2 is Odd
(a) Only (i) (b) Only (ii)
(c) Only (i) & (iii) (d) Only (iii)
8. If a(b!) is completely divisible by 511
where a is a single digit no. then find the
minimum value of b.
(a) 40 (b) 45
(c) 50 (d) 46
9. A three digit no abc is such that a + b + c
= 25. Find the sum of all possible values
of a!.b!.c!
(a) 8!7! × !7 (b) 9!.8!.7!
(c) 9!8! × 2 (d) None of these
10. Find the highest power of 44 in 100!
(a) 9 (b) 18
(c) 22 (d) 31
14  Theory of Counting

11. Find the highest power of 10 in 50! + 60!
+ 70!
(a) 12 (b) 14
(c) 16 (d) 17
12. Find the highest power of 10 in 50! × 60!
× 70!
(a) 40 (b) 42 18. Find the value of
(c) 38 (d) 44
13. Find the highest power of 10 in 10! + 20!
+ 30! + 40! + 50! + 60! + 70! + 80! + 90! +
100!
(a) 140 (b) 142 choice to wear either traditional Indian
(c) 138 (d) None of these
14. Find the highest power of 10 in 10! × 20!
× 30! × 40! × 50! × 60! × 70! × 80! × 90! ×
100!
(a) 140 (b) 142
(c) 138 (d) 128
15. If highest power of 10 in N! is16 then
what could be the highest power of 10 in
(N + 1)!
(a) 16 (b) 17
16. Find the value of 10C1 + 10C2 + … + 10C10
(a) 29 (b) 210
(c) 28 (d) None of these
17. Find the value of 10C1 + 10C3 + … + 10C9
(a) 29 (b) 210
(c) 28 (d) None of these
10C
0 + 10C1 + 10C2 + …
+ 10C10
(a) 29 (b) 210
(c) 28 (d) None of these
19. Bipasha has to go to a party. She has a
dress (Saree) or modern outfit (Gown).
She has 5 Sarees and 6 Gowns in how
many ways can she select her dress?
(a) 30 (b) 11
(c) 18 (d) None of these
20. Priyanka, a friend of Bipasha also has
to go to the same party and she decided
to wear either a Saree or a skirt and top.
She has 6 sarees, 4 skirts and 6 tops. In
how many ways she can select her outfit?
(a) 16 (b) 144

(c) 18 (d) None of these (c) 30 (d) None of these

Response Grid
1. a b c d 2. a b c d 3. a b c d 4. a b c d 5. a b c d
6. a b c d 7. a b c d 8. a b c d 9. a b c d 10. a b c d
11. a b c d 12. a b c d 13. a b c d 14. a b c d 15. a b c d

16. a b c d 17. a b c d 18. a b c d 19. a b c d 20. a b c d


3
Concept Cracker (CC)
Ideal Time
40 Min.
1. Find the value of 1(1!) + 2(2!) + 3(3!) + …
20(20!)
(a) 20! – 1 (b) 21! – 1
(c) 22! – 2 (d) 21!
2. Find the value of 9(2!) + 16(3!) + 25(4!) +
36(5!) + 49(6!) + … 2601(50!)
(a) 52! – 6 (b) 52! – 5
(c) 53! – 4 (d) 55! – 7
3. Find the sum of the series till 100 terms
1 2 3 100
+ + + …. +
2! 3! 4! 101!
101! − 1 102! − 1
(a) (b) 6. Find the number of zeros at the end of
101! 101!
101! − 5 101! − 1
(c) (d)
101! 102!
Directions (Qs. 4 to 6): Consider a set
of 100 elements S = {1, 2, 3, 4,… 100},
consider 20 subsets with 5 elements e.g
S1 {1, 2, 3, 4, 5}, S2 = {6, 7, 8, 9, 10} and so on.
Lets us define Fn as sum of factorials of all the
elements of subset Sn, e.g F1 = 1! + 2! + 3! +
4! + 5!, F2 = 6! + 7! + 8! + 9! + 10! And so on.  8. If a8 and 8a is completely divisible by 50!
4. Which one of the following is true about
sum= F1 + F2 + … + F20
(i) Unit digit of summation is 3
(ii) Last two digit odd summation is 13
Introduction  15
Boost up your confidence with good
questions.
(iii) The remainder when summation is
divided by 5 is 3
(a) Only (i)
(b) Only (ii)
(c) Only (iii)
(d) All three are correct
5. Find the unit digit of summation of two
Fns taken at a time i.e ∑( Fi )( F j ) here
i, j ≤ 20 and i ≠ j,
(a) 1 (b) 0
(c) 3 (d) 7
(F1)(F2)(F3)….. (F20)
(a) 241 (b) 242
(c) 220 (d) 244
7. If N(N + 1) and (N + 1)N is divisible by
100! Then find the maximum possible
value of N
(a) 12 (b) 24
(c) 20 (d) 15
Then which one of the following is true
about ‘ highest value of a’?
(a) 10 < a < 14 (b) 14 < a < 16
(c) 16 < a < 18 (d) 18 < a < 20
16  Theory of Counting

9. Find the last two digits of (a) 3 (b) 6

1! 2! 3! 4!
+ + + ………100 terms
1 2 3 4
(a) 14 (b) 24
(c) 34 (d) 64
10. st
Find 1 non-zero digit of 85!
(a) 2 (b) 4
(c) 6 (d) 8
11. st
Find 1 non-zero digit of 100!
(a) 2 (b) 4
(c) 6 (d) 8
12. Find 1st non-zero digit of 165!
(a) 2 (b) 4
(c) 6 (d) 8
13. st
Find the 1 non-zero digit of 100! + 165!
(a) 2 (b) 4
(c) 6 (d) 8
14. st
Find the 1 non-zero digit of 100! × 165!
(a) 2 (b) 6
(c) 4 (d) 8
15. Find the 1st non-zero digit of 100! + 110!
+ 120! + 130! + 140! + 150!
(a) 4 (b) 6
(c) 2 (d) 8
16. Find the value of 1P1 + 2.2P2 + 3.3P3 + …
+ n.nPn
(a) (n + 1)! – 1! (b) (n + 1)! + 1!
(c) (n + 2)! – (n – 1)! (d) None of these
17. If 2n + 1Pn – 1 :2n – 1Pn= 3 : 5 then find the
value of nC
2
(c) 10 (d) None of these
18. Which one of the following represents
the ratio between (nCr): nCr + 1?
(a) (r + 1)/(n – r) (b) (r – 1)/(n – r)
(c) r/(n – r) (d) None of these
19. Rajesh can reach Patna from Hajipur
either by a combination of Train and
Auto or by a combination of Bus, Taxi
and Auto. If he has total options as
follows – Trains – 5, Auto – 6, Bus – 7
and Taxi – 8. In how many ways he can
reach Patna from Hajipur?
(a) 316 (b) 336
(c) 366 (d) None of these
20. Suresh, a school going boy has three
dress codes, official, formal and ethnic in
official he has to wear shirt, trousers, and
tie along with shoe, in formal dress he
has to wear jeans, Tee and sandle, while
in ethnic dress he has to wear kurta and
paijama with shoe or sandle, If he has
following items available – Shirt – 5,
Trousers – 4, Tie – 5, Shoe – 4, Jeans – 5,
Tee – 4, Sandle – 5, Kurta – 4, Paijama
– 5. If on a particular day in how many
ways he can select his dress?
(a) 316 (b) 336
(c) 366 (d) None of these

Response Grid
1. a b c d 2. a b c d 3. a b c d 4. a b c d 5. a b c d
6. a b c d 7. a b c d 8. a b c d 9. a b c d 10. a b c d
11. a b c d 12. a b c d 13. a b c d 14. a b c d 15. a b c d

16. a b c d 17. a b c d 18. a b c d 19. a b c d 20. a b c d

 Introduction  17

Solutions
Concept Applicator (CA)
1. (c) 2. (d) 3. (c) 4. (b) 5. (c) 6. (b)
7. (d) 8. (d) 9. (a) 10. (a) 11. (c) 12. (b)
13. (d) 14. (a) 15. (c) 16. (c) 17. (c) 18. (b)
19. (b) 20. (c)

1. (c) We know that 5! = 120 and 4! is 24
hence maximum value of e is 4.
2. (d) Since unit digit of all the factorials
more than 4 is 0 hence unit digit 9 is
given by either 0! + 2! + 3! or 1! + 2! +
3! In both the cases the value of {(a!)
(b!)(c!)} = 1 × 2 × 6 = 12
3. (c) Since unit digit of all the factorials
more than 4 is 0 hence required
unit digit is given by 1! + 2! + 3! + 4!
Which is 1 + 2 × 6 + 24 = 33, hence
required unit digit is 3
4. (b) Since 0! = 1, 1! = 1, 2! = 2, 3! = 6,
4! = 24
Since, a! + b! + c! is a two digit prime
number hence possible cases are –
0! + 3! + 4! = 31, 1! + 3! + 4! = 31,
hence only one number 31 exist.
5. (c) For maximum value of n we have (1!)
(2!) which is a single digit number
hence n = 2, here point to note that
0! = 1 but 0 is not a positive integers.
6. (b) Since, (10!)/(7!) = 8 × 9 × 10 = 720
7. (d) The required value is (9 × 10 × 11 ×
12) /(1 × 2 × 3 × 4) = 495
8. (d) Since, 1! + 2! + 3! + 4! + 5! + 6! = 1 +
2 + 6 + 24 + 120 + 720 = 873
9. (a) Since, 1! + 2! + 3! = 1 + 2 + 6 = 9,
hence maximum value of ‘K’ is 3.
10. (a) From the given condition a! + b! =
10a + b Since 0! = 1, 1! = 1, 2! = 2, 3! = 6
and 4! = 24 since summation is a two
digit number hence one of the number
must be 4, from trail and error method
no such two digit number exist.
11. (c) Divide successively 50 by 2 and
keep on writing the quotient and
then find the summation of all the
quotient this summation will give
us the highest power of 2 in 50!.
50
2 25
2 12
2 6
2 3
2 1
Sum of all the quotient is 25 + 12 + 6
+ 3 + 1 = 47, hence highest power of
2 in 50! is 47.
Alternately : –
Required highest power of 2 is
 50   50   50   50   50 
 1  +   2  +   3  +   4  +   5  = 25
2  2  2  2  2 
+ 12 + 6 + 3 + 1 = 47, hence highest
power of 2 in 50! is 47.
18  Theory of Counting
12. (b) Divide successively 50 by 3 and
keep on writing the quotient and
then find the summation of all the
quotient this summation will give us
the highest power of 3 in 50!.
50
3 16
3 5
3 1
Sum of all the quotient is 16 + 5 + 1
= 22, hence highest power of 3 in 50!
is 22.
Alternately:
Required highest power of 3 is
 50   50   50 
 1  +   2  +   3  = 16 + 5 + 1 = 22,
3  3  3 
hence highest power of 3 in 50! is 22.
13. (d) Divide successively 100 by 5 and
keep on writing the quotient and
then find the summation of all the
quotient this summation will give us
the highest power of 5 in 100!.
100
5 20
5 4
Sum of all the quotient is 20 + 4 =
24, hence highest power of 5 in 100!
is 24.
Alternately
Required highest power of 5 is
Concept Builder (CB)
1. (a) 2. (b) 3. (c) 4. (a) 5. (d) 6. (c)
7. (b) 8. (b) 9. (d) 10. (a) 11. (a) 12. (b)
13. (d) 14. (d) 15. (c) 16. (d) 17. (a) 18. (b)
19. (b) 20. (c)
 100   100 
 1  +   2  = 20 + 4 = 24
5  5 
hence highest power of 5 in 100! is
24.
14. (a) Same method as above highest
 77   77 
power of 7 in 77! is  1  +   2 
7  7 
= 11 + 1 = 12
15. (c) Since 6 is a composite number hence
we cant use above method.
We know that 6 = 2×3 hence we will
get 6 when we have pair of 2 and 3,
so we will find out highest power of
2 and that of 3 in 50!
Since highest power of 2 and 3 in 50!
is 47 and 22 hence highest power of
6 in 50! is 22
n! 20!
16. (c) Since, nPr =
(n − r )! Hence, (20 − r )!
= 6840 = 20 × 19 × 18 so r = 3
n! 15!
17. (c) Since nPr =
(n − r )! . Hence (15 − r )!
= 32760 = 16 × 14 × 13 × 12 so r = 4
So 15Cr = (15Pr)/(r!) = 32760/24 = 1365
18. (b) Since 12Pr = (12!)/(12 – r)! = 11880
= 12 × 11 × 10 × 9, then r = 4
19. (b) ICICI bank can select either from
IIMA, or IIMB or IIMC so total
number of ways = 4 + 5 + 6 = 15 ways
20. (c) Amit has to wear both a formal shirt
and a trouser hence number of ways
is 4 × 3 = 12

1. (a) Since summation of two factorial is a
three digit number hence maximum
possible value of a is 6 while
minimum possible value is 0 hence
required difference is 6 – 0 = 6, hence
maximum value of K is 6.
Now we have to find the minimum
value of K, for minimum value of
K, largest value of a should be the
smallest (largest possible values of a
is 5 & 6 and out of these two smallest
is 5), and smallest value of a should
be maximum ( smallest possible
value of a is 0, 1, 2, 3, 4, and 5, out of
these largest value is 5)
Hence smallest value of K is 0.
2. (b) As per the given condition N = (a!)(b!)
(c!) here a, b, and c are consecutive
integers.
If a = 1 then N = 1 × 2 × 6 = 12
If a = 2 then N = 2 × 6 × 24 = 288
If a = 3 then N = 6 × 24 × 120 = 17280
If a = 4 then N = 24 × 120 × 720 =
2073600
Hence only statement (ii) & (iii) are
correct.
3. (c) Since last two digits of all the
factorials more than 9 is 00 hence
required last two digits is given by
2! + 3! + 5! + 7! = 2 + 6 + 120 + 5040
= 5168,
Hence required last two digits is 68.
4. (a) Since, 9! =  (27 ) × (34 ) × (51 ) × (71 )
To get smallest perfect square we
have to multiply 9! With 2 × 5 × 7
hence smallest such perfect square
is (28 ) × (34 ) × (52 ) × (72 ) = 25401600
5. (d) Since, 0! = 1, 1! = 1, 2! = 2, 3! = 6,
If a = 0, or 1 then b and c can take
any value but N = 1,
If a = 2 then b = 0 or 1 then c can
take any value and N = 2
Introduction  19
If a = 3 then b = 0 or 1 then c can
take any value and N = 6
Hence three values of N exist.
6. (c) Since (1!)(2!)(3!) = 12 hence there is
no three consecutive numbers exist.
7. (b) Since all the factorials except 1!
is even number hence required
summation must be odd.
8. (b) Since 45! contains 510 if a = 5 then we
can get 5(45!) is completely divisible
by 511(50! Contains 512).
9. (d) Since, a + b + c = 25.
Hence possible values of
abc = 9,9,7& 9,8,8
There are 3 numbers with 9, 9 & 7
these numbers are 997, 979 and 799,
similarly there are 3 numbers with
9, 8 and 8.
So required summation is 3 × 9! × 9!
× 7! + 3 × 9! × 8! × 8! = 3 × 9! × 8! ×
7!(9 + 8) = 51 × 7! × 8! × 9!
10. (a) Since 44 = 22 × 11 so we just need to
find the highest power of 11 in 100!
& that will be same as the highest
power of 44 and is equal to 9.
11. (a) Since highest power of 10 in 50! is
less than that of 60! and 70! hence
required highest power of 10 is same
as that of 50! Which is equal to 12.
For further explanation–since
highest power of 10 in 50! is 12 hence
we can write 50! = P × 1012
Similarly highest power of 10 in 60!
is 14 hence we can write 60! = Q ×
1014
Similarly highest power of 10 in 70!
is 16 hence we can write 70! = R ×
1016
Hence we can write 50! + 60! + 70!
= P × 1012 + Q × 1014 + R × 1016 =
1012(P + Q × 102 + R × 104) hence
highest power of 10 is 12.
20  Theory of Counting
12. (b) Similar to above explanation – 16. (d) Since nC0 + nC1 + nC2 + … + nCn
50! × 60! × 70! = (P × 1012) = (1 + 1)n = 2n, hence 10C0 + 10C +
1
× (Q × 1014) × (R × 1016) 10C + … + 10C = 210
2 10
= (PQR) × (1042) hence highest or 10C1 + 10C2 + … + 10C10
power of 10 is 42.
= 210 – 10C0 = 210 – 1
13. (d) Since highest power of 10 in 10! is n n n n n
17. (a) C0 + C2 + C4 + … = C1 + C3 +
smallest hence required highest
nC + …. = 2n – 1
power of 10 is same as that of 10! 5

Which is equal to 2. Hence 10C1 + 10C3 + … + 10C9

14. (d) Required highest power of 10 is = 210 – 1 = 29
summation of highest power of 10 in 18. (b) Since nC0 + nC1 + nC2 + … + nCn
all the given factorial. = (1 + 1)n = 2n hence 10C + 10C +
0 1
Required highest power is 2 + 4 + 7 10C +…+ 10C 210
2 10=
+ 9 + 12 + 14 + 16 + 19 + 21 + 24
19. (b) Since Bipaha can wear either
= 128
traditional Indian dress (Saree)
15. (c) Highest power of 10 in N! is 16 hence or modern outfit (Gown). Hence
70 ≤ N < 74, number of ways is 5 + 6 = 11 ways.
If N = 70, 71, 72, 73 then (N + 1)! will 20. (c) Priyanka can select Saree in in
have highest power of 10 as 16, and 6 ways and skirt and top in 6 × 4 =
if N = 74 then N + 1 = 75 and 75! has 24 ways so total number of ways is
highest power of 10 as 18. 6 + 24 = 30

Concept Cracker (CC)

1. (b) 2. (a) 3. (a) 4. (d) 5. (b) 6. (c)
7. (d) 8. (b) 9. (a) 10. (a) 11. (b) 12. (c)
13. (b) 14. (c) 15. (a) 16. (a) 17. (b) 18. (a)
19. (c) 20. (d)

1. (b) (1!) = (2 – 1)! = 2! – 1! 2601(50!) = 51.51.50! = 51.51!

2(2!) = (3 – 1)2! = 3! – 2! = (52 – 51)51! = 52! – 51!
3(3!) = (4 – 1)3! = 4! – 3! Sum = 52! – 3! = 52! – 6
20(20!) = (21 – 1)20! = 21! – 20! 1 1
3. (a) Consider the 1st term =1
  −
Hence sum = 21! – 1 2! 2!
2. (a) 9(2!) = 3.3.2! = 3.3! = (4 – 1)3! 2 3 −1 1 1
2nd term = = –
= 4! – 3! 3! 3! 2! 3!
16(3!) = 4.4.3! = 4.4! = (5 – 1)4! 3 4 −1 1 1
3rd term = = = –
= 5! – 4! 4! 4! 3! 4!
25(4!) = 5.5.4! = 5.5! = (6 – 1)5! And so on 2nd last term
= 6! – 5!
 Introduction  21

99 100 –1  1 1 Which is equal to 0 + 1 + 2 + 3 + 4 +

= = = –
100! 100! 99! 100!
Hence last term
100 100 − 1 1 1
= = = –
101! 101! 100! 101!
When we add all these then we all
the terms get cancelled except 1st
and last hence required summation
1 101!− 1
is 1 − =
101! 101!
4. (d) Required summation is 1! + 2! + 3! +
.. + 100!
Its unit digit is given by 1! + 2! + 3! +
4! Which is 3. Hence statement (i) is
correct.
Its last two digits is given by 1! + 2! +
3! + 4! + 5! + 6! + 7! + 8! + 9! Which is
13. Hence statement (ii) is correct.
Remainder when summation is
divided by 5 is given by 1! + 2! + 3!
+ 4! Which is equal to 3, hence this
statement (iii) is also correct.
5. (b) Since unit digit of F1 is 3 and unit
digit of all others is 0 hence unit digit
of (FiFj) is always 0 hence required
unit digit is 0.
6. (c) Consider F1 = 1! + 2! + 3! + 4! + 5!
Highest power of 10 in this is 0.
F2 = 6! + 7! + 8! + 9! + 10! Highest
power of 10 in this is 1 (Same as that
of 6!)
F3 = 11! + 12! + 13! + 14! + 15! Highest
power of 10 in this is 2 (Same as that
of 11!)
F4 = 16! + 17! + 18! + 19! + 20! Highest
power of 10 in this is 3 (Same as that
of 16!)
And so on hence required highest
power of 10 is same as that of (1!)(6!)
(11!)(16!)… (91!)(96!)
6 + 7 + 8 + 9 + 10 + 12 + 13 + 14 + 15
+ 16 + 18 + 19 + 20 + 21 + 22 = 220
97 48 24 1
7. (d) Since 100! = 2 × 3 × 5 × … 97
From options we will find that
highest value of N is 15.
8. (b) Since highest power of 2 in 50! is 47
hence highest power of 8 in 50! is
[47/3] = 15
If we assume a = 15 then 158 or 38 and 58
So we have to check that whether
38 and 58 are divisible by 50! or not,
Since highest power of 3 in 50! is 22
and that of 5 is 12, hence a =15 will
satisfy the condition.
n!
9. (a) Since = (n − 1)! hence given sum is
n
1! + 1! + 2! + 3! + 4! + … 100 terms
since all the numbers after 9!
(i.e from 10! To 99!) contains at least
two zeros hence last two digit is
given by sum of last two digits from
0! To 9!
Required last two digit is same as
last two digits of 1! + 1! + 2! + 3! + 4!
+ 5! + 6! + 7! + 8! + 9!
Last two digits of 1! = 01
Last two digits of 1! = 01
Last two digits of 2! = 02
Last two digits of 3! = 06
Last two digits of 4! = 24
Last two digits of 5! = 20
Last two digits of 6! = 20
Last two digits of 7! = 40
Last two digits of 8! = 20
Last two digits of 9! = 80
Sum of all last two digits is 214
hence last two digits = 14.
22  Theory of Counting
10. (a) 13. (b) Since number of zeros in 165! is more
5 85
than that in 100! Hence required
5 17 → R1 = 0 1stnon-zero digit is given by 1st
5 3 → R2 = 2 non-zero digit of 100! Which is equal
to 4.
0 → R3 = 3
14. (c) Since 1st non-zero digit of 100! is
Hence highest power of 5 in 85! is P 4 and that of 165! is 6 hence 1st
= 17 + 3 + 0 = 20 non-zero digit of their product is
given by 4 × 6 which is 4.
Hence U[85!] = U[220] × U[0!] × U[2!]
15. (a) Since number of zeros in 100! is
× U[3!] = U[6 × 1 × 2 × 6] = 2
smallest hence 1st non-zero digit of
11. (b) With normal method we will find this summation is same as that of
highest power of 5 in 100! 100! which is 4.
16. (a) Since, n. nPn = n(n!) = (n + 1) ! – n!
5 100
Hence, 1P1 = 2! – 1!
5 20 → R1 = 0
2. 2P2 = 3! – 2!
5 4 → R2 = 0
3. 3P3 = 4! – 3!
0 → R3 = 4
………………..
Hence highest power of 5 in 100! is P …………………
= 20 + 4 = 24 n. nPn= (n + 1)! – 1!
So U(100!) = U[224] × U[0!] × U[0!] × Hence 1P1 + 2.2P2 + 3.3P3 + … + n.
nP = (n + 1)! – 1!
U[4!] = U[6 × 1 × 1 × 4] = 4 n

12. (c) With normal method we will find (2n + 1)!

17 . (b) Consider 2n + 1Pn – 1 = n + 2 !
highest power of 5 in 165! ( )
5 165 2n – 1P (2n − 1)!
n=
5 33 → R1 = 0 (n − 1)!
5 6 → R2 = 3 From the given condition
(2n + 1)! (n − 1)! 3
5 1 → R3 = 1  × = , 
(n + 2)! (2n − 1)! 5
0 → R4 = 1 (2n + 1)(2n) 3
or =
(n + 2)(n + 1)(n) 5
Hence highest power of 5 in 165! is
P = 33 + 6 + 1 + 0 = 40 On solving we will get 3n2 – 11n – 4 = 0
So U(165!) = U[240] × U[0!] × U[3!] × or n = – 1/3 or 4 but only acceptable
U[1!] × U[1!] × U[0!] = U[6 × 1 × 6 × value is n = 4.
1 × 1 × 1] = 6 So, 4C2 = 6

18. (a) From formula we know that (nCr)/(r
+ 1) = nCr + 1/(n – r), hence option (a) 5 × 4 × 5 × 4 = 400 ways
is correct.
19. (c) Number of ways for 1st combination
is 5 × 6 = 30
And number of ways for 2nd combina-
tion is 7 × 8 × 6 = 336
So total number of ways is 30 + 336
= 366
Introduction  23
20. (d) Suresh can select Official dress in
Can select formal dress in 5 × 4 × 5
= 100 ways
And ethnic dress in 4 × 5(4 + 5) = 20
× 9 = 180 ways
So total number of ways is 400 + 100
+ 180 = 680 ways
24  Theory of Counting

Part B
 Highest power of a PRIME NUMBER p that  Fundamental principle of multiplication:
divides n! exactly that means without leaving any If a work A can be done in m ways
    and another work B can be done in n
remainder is given by  n  +  n  +  n  …….
 p   p 2   p 3  ways then work A & B can be done in
m × n ways.
where, [x] represents greatest integer function,
that means greatest integer less than or equal Consider total n works, if 1st work can be
to x. done in a1 ways, 2nd work can be done in
a2 ways, and so on nth can be done in an
ways then work a1, a2, …,an–1, an can be
 Number of zeros in a number is same as the
highest power of 10 in that number, and we done in a1× a2×…×an ways.
know that 10 = 2 × 5 then we needs to find the
highest power of 2 & 5, and smaller in the two n!
 From the definition nCr = n − r ! r !
is equal to highest powers of 10. Since 5 > 2 ( )( )
hence we will find highest power of 5, as highest
power of 2 must be more than that of 5. n!
And nPr = n
(n − r )! = (r!)( Cr)
 A new approach to find 1st non-zero
digit: Let highest power of 5 in N! is P Some other properties of binomial
coefficients-
and R1, R2, etc are remainders when n is
successively divided by 5 →nC0 + nC1 + nC2 + … + nCn
U[N!] = U[2P] × U[R1!] × U[R2!] …. = (1+1)n = 2n
→nC0 –nC1 + nC2 + … (–1)n–1nCn = (1–1)n = 0
 Fundamental principle of summation:
If a work A can be done in m ways and →nC0 + nC2 + nC4 + …
another work B can be done in n ways then
= nC1 + nC3 + nC5 + …. = 2n–1
work A or B can be done in m + n ways.
→nCr–1 + nCr = n+1Cr
Consider total n works, if 1st work can be
done in a1 ways, 2nd work can be done in →nCx = nCy then x = y or x + y = n
a2 ways, and so on nth can be done in an
ways then work a1 or a2 or …or an can be →nCr = nCn–r
done in a1+a2+…+an ways. →(nCr)/(r+1) = nCr+1/(n–r)
 Introduction  25

Concept Deviator (CD)

1 Ideal Time
80 Min.
Revise your concept (IIT advance or
tougher questions) Ideal Time – 5 min
per question

1. Find the no. of zeroes in1!2!3!4!......100! 7. If a27 and 27a is divisible by 100! Then
(a) 525 (b) 825 which one of the following is true about
(c) 1124 (d) 850 ‘highest value of a’?

2. If 390 does not divide n! then find the
maximum value of n.
(a) 13 (b) 12
(c) 17 (d) 19
3. If ‘abc’ is a three digit no such that
a! + b! + c! < abc.How many 3 digit no
exist that satisfy the above condition
given that a, b & c are different digits.
(a) 40 (b) 72 9. In the previous question find
(c) 84 (d) 98
(a) 8 < a < 10 (b) 10 < a < 12
(c) 12 < a < 14 (d) 14 < a < 17
x y z
8. If 100! =  K  (2!) (5!) (7 !) . Then find the
maximum possible value of x + y + z
(a) 122 (b) 47
(c) 99 (d) None of these
the
maximum value of product x y z

4. How many two digit number ab exists
such that (a! + b!)/ab < 10.
(a) 22 (b) 30
(c) 15 (d) None of these
5. The quotient and remainder of division
(a! + b! + c!)/abc are 7 and 434 where
abc is a 3 digit no. What could be the
value of a?
(a) 5 (b) 6 (c) 97 (d) 121
(c) 7 (d) 8 or 7
6. Lets define a set S ={ Pi | set of all 3 digit
natural number that has odd number of
factors}. Find the highest power of 12 in
the product of all the elements of set S.
(a) 16 (b) 18
(c) 20 (d) None of these
(a) 1872 (b) 1728
(c) 144 (d) 2016
10. N is the product of first 100 multiple of
K. If N is divisible by 10100 then find the
minimum number of zeros at the end of
N
(a) 24 (b) 124
11. Find the number of zeros at the end of
(510)!
59 − 1 510 − 1
(a) (b)
4 4
11 8
(c) 5 − 1 (d) 5 − 1
4 4
26  Theory of Counting
12. Find the number of zeros at the end of 14. N is product of the first 100 multiples of
(1515)! 5. Find highest power of 10 in N.
 1515 − 315   515 − 1  (a) 124 (b) 107
(a)   (b)  
 4   4  (c) 97 (d) 149
 1515 − 1   1515 − 515  15. If N = 10! + 20! + 30! + ......+ 100! Then
(c)   (d)   find the highest power of 10 in NN
4   4 

(a) N (b) 2N
13. Find the number of zeros at the end of
(1000........100 times zeros)! (c) 4N (d) 124
16. In a college of 300 students, every student
 10100 − 5100   10100 − 550  read 5 newspapers and every newspaper
(a)   (b)  
 4   4  is read by 60 students. The number of
news papers is- [IIT JEE 1998]
 10100 − 2 50   10100 − 2 100 
(c)  (a) at least 30 (b) at most 20
 (d) 
4

 4    (c) exactly 25 (d) None of these

Response Grid
1. a b c d 2. a b c d 3. a b c d 4. a b c d 5. a b c d
6. a b c d 7. a b c d 8. a b c d 9. a b c d 10. a b c d
11. a b c d 12. a b c d 13. a b c d 14. a b c d 15. a b c d
16. a b c d

Concept Eliminator (CE)

2 Ideal Time
80 Min.
Revise your concept (Maths Olympiad or
tougher questions)

Direction (Qs. 1-5): Let us define noctorial
(denoted as !!) as product of ‘n’ consecutive
integers starting from ‘n’.
Hence from definition (n!!) = (n)(n + 1)
(n +2).....(2n –1)
Or 3!! = 3 × 4 × 5 = 60
4!! = 4 × 5 × 6 × 7 = 840 and so on.
1. Find the number of trailing zeros at the
end of 25!!
(a) 5 (b) 6
(c) 8 (d) 17
2. Find the highest power of 100 in 100!!
(a) 18 (b) 17
(c) 21 (d) 12

3. Find the 1st non-zero digit of 90!!
(a) 8 (b) 7
(c) 6 (d) 5
4. Find the number of trailing zeros in (1!!)
(2!!)(3!!)....(20!!)
(A) 42 (b) 48
(c) 64 (d) None of these
5. Find the minimum value of k such that
(k!!) is completely divisible by all two
digit prime numbers.
(a) 49 (b) 97  A
(c) 32 (d) 16
Introduction  27
8. Consider a two digit prime number P such
that exponent of P in number N = (300!)/
(100!)(200!) is 1. How many values of P
more than 50 satisfy above condition?
(a) 5 (b) 6
(c) 7 (d) 9
9. Let us consider three numbers A, B and
C, A is product of 1st 200 multiples of 36,
B is product of 1st 100 multiple of 6, C is
product of 1st 100 multiples of 12, How
many prime two digit numbers more
than 50 is a factor of N  =   .
 BC 

6. Find 1sttwo non-zero digits of 147! (a) 1 (b) 2

(c) 3 (d) 5
(a) 42 (b) 48
(c) 64 (d) 84 333!
10. Find 1st two non zero digit of
222!
7. Find 1sttwo non-zero digit of (222!)(333!)
(a) 24 (b) 64 (a) 24 (b) 64
(c) 84 (d) 94 (c) 04 (d) 84

Response Grid
1. a b c d 2. a b c d 3. a b c d 4. a b c d 5. a b c d
6. a b c d 7. a b c d 8. a b c d 9. a b c d 10. a b c d
28  Theory of Counting

Solutions
Concept Deviator (CD)
1. (c) 2. (b) 3. (d) 4. (d) 5. (c) 6. (b)
7. (c) 8. (d) 9. (a) 10. (b) 11. (b) 12. (a)
13. (d) 14. (c) 15. (b) 16. (c)

1.
(c) No of zeroes means highest power of From 45! To 49! all contain highest
10. power of 5 as 10
Since 10 = 2 × 5 so we need to From 50! To 54! all contain highest
find highest power of 5. Divide power of 5 as 12
the given multiplication in 4 From 55! To 59! all contain highest
parts(1!2!3!.......24!)(25!26!......49!) power of 5 as 13
(50! 51!...74!)(75!76!....99!) × 100!
From 60! To 64! all contain highest
Till 4!highest power of 5 is zero. So power of 5 as 14
we will start with 5!
From 65! To 70! all contain highest
5!→1 10!→2 15!→3 20!→4 power of 5 as 15
6!→1 11!→2 16!→3 21!→4 From 70! To 74! all contain highest
7!→1 12!→2 17!→3 : power of 5 as 16
8!→1 13!→2 18!→3 : From 75! To 79! all contain highest
9!→1 14!→2 19!→3 24!→4 power of 5 as 18
5 10 15 20 From 80! To 84! all contain highest
power of 5 as 19
So highest power of 5 in 1!2!.......24!
is 5+10+15+20 = 50 From 85! To 89!all contain highest
power of 5 as 20
Now consider the 2nd part
From 90! To 94! all contain highest
(25!26!.....49!)
power of 5 as 21
From 25! To 29! all contain highest
From 95! To 99! all contain highest
power of 5 as 6
power of 5 as 22
From 30! To 34! all contain highest
100! contain highest power of 5 as 24
power of 5 as7
Hence total power of 5
From 35! To 39! all contain highest
power of 5 as8 50 +(6 + 7 + 8 + 9 + 10)5 + (12 + 13 +
14 + 15 +16)× 5 + (18 + 19 + 20 + 21
From 40! To 44! all contain highest
+ 22) × 5 = 50 + 200 + 350 + 500 + 24
power of 5 as 9
= 1124

2. (b) Since 390 = 65 × 6 = 2 × 3 × 5 × 13
So, if n = 13 then 390 is divisible by
n!
But if n = 12 then 390 is not divisible
by 13
Hence maximum value of n = 12
3. (d) Let one of the digit is 6 then 6! = 720
hence a has to be 7 or 8 or 9 but 7!
is a four digit no so none of the digit
are 6,7,8 or 9
Let one of the digit is 5
If a = 5 then abc > 500 but a! + b! + c!
< 500
Number of numbers formed when a
= 5 then b can be any one of 0,1,2,3,4,
(5 ways) and can be chosen from
remaining 4 digits
So, if 1st digit is 5 then number of
numbers formed = 5 × 4 = 20
If b = 5 then maximum value of a! +
b! + c! = 4! + 5! + 3! = 24 + 120 + 6 =
150.
And smallest 3 digit number with b
= 5 is 153 hence all values of a & c
will satisfy the given condition. Now
we can select a in 4 ways.
1,2,3 or 4 and c also in 4 ways. So
total number of numbers formed
with b = 5 = 4 × 4 = 16
If c = 5 then it’s better to write all
numbers such that a! + b!c! < abc
125,135,205,215,235,245,305,315,
325,345,405,415,425,435 = 134 nos
Introduction  29
It is easy to note down these no as for
all the nos formed when a = 2,3,or 4
will satisfy the above condition
Now let none of a,b or c is 5 then
total no of 3 digit of no formed with
digits 1,2,3, & 4 = 4 × 4 × 3 = 48
So total nos formed
= 20 = 16 + 14 + 48 = 98 nos
4. (d) Since a! + b! < 10 (two digit no).
Hence, a! + b! < 1000, so no of the a
or b is 7, 8 or 9.
Let assume one of them is 6 then
minimum value of a! + b!/ab = 61 +
a!/6a > 10
Hence if any one of a or b is 6 then
the given ratio is > 10. Hence, we can
conclude non of a or b is equal to 6.
Remaining digits that we can use
are 0,1,2,3,4,5 then maximum value
of (a! + b!)/ab is 1! + 5!/!5 < 10
5. (c) Since a! + b! + c! = 7(abc) + 434
So maximum value of a! + b! + c!
= 7(3digit no) + 434 and value of
a! + b! + c! is a 4 digit no.
The minimum value is when a = 1
then also the value of a! + b! + c! is a
4 digit no.
To get a! + b! + c! as a 4 digit no. one
of them has to be 7 as 7! = 5040 are
none of them is equal to 8 or 9.
Now we can know that one of a,b or
c is 7.
Hence a! + b! + c!. 5040
30  Theory of Counting
If we assume minimum value of a! +
b! + c! as 5040 only then abc = 5040
–434/7 = 4606/7 > 600
So a can either 6 or 7 (it can not be 8
or 9)
Let a = 6 and one of b or c is 7 then
minimum value of a! + b! + c! = 6! +
7! + 0! = 5761,
abc = 5761 – 434/7 = 700
hence for this condition a has to be 7
so we only have one option left with
a = 7 that satisfy the given condition.
Hence a = 7
For your eagerness to know that
abc is 761.
To solve completely the question
requires a lot of time so it is
beyond the preview of syllabus.
6. (d) We know that only perfect squares
can have odd number of factors.
Hence set S can be defined as = {100,
121, 144, …., 961}
Product of all the elements is 100 ×
121 × 144 ×….× 961 = 102 × 112 × 122
× ….× 312 = (10 ×11 × 12 ×..×31)2 =
[(31!)/(9!)]2
Since, 12 = 22×31
Highest power of 2 in 31! is 26 and
that in 9! is 7 hence highest power
of 2 in (31!)/(9!) is 26 – 7 = 19 and so
highest power of 22 in (31!)/(9!) is 19.
Similarly highest power of 3 in 31! is
14 and that in 9! is 4 hence highest
power of 3 in (31!)/(9!) is 14 – 4 = 10
and so highest power of 3 in [(31!)/
(9!)]2 is 20.
Therefore, highest power of 12 is 19
7. (c) Since highest power of 3 in 100! is
48 hence that of 27 is 16 so assume
a = 16
Now 1627 = 2108 but highest power
of 2 in 100! is 97 hence a can not be
equal to 16.
Let us assume a = 15, then we have
to check 1527 or 327 and 527 since
highest power of 5 in 100! is 24 hence
a can not be equal to 15.
If a =14 then we have to check 1427
or 227 and 727 since highest power
of 7 in 100! is 16 hence a can not be
equal to 14.
If a =13 then we have to check 1327
since highest power of 13 in 100! is 7
hence a can not be equal to 13.
If a =12 then we have to check 1227
or 254 and 327 since highest power
of 2 in 100! is 97 and that of 3 is 48
hence a = 12.
8. (d) (2!)x = 2x
(5!)y= 23y, 3y, 5y
(7!)z = 24z, 32z, 5z,7z
Hence (2!)x × (5!)y × (7!)z = 2x + 3y +4z
× 3y + 2z × 5y + z × 7z
Since 100! = 297 × 348 × 524 × 716
Maximum value of z = 16
Maximum value of y + z = 24
Maximum value of z = x + 3y + 4z
= 97; hence for maximum value of
x + y + z, y = 0, z = 0 and x = 97, then
x + y + z = 97
 Introduction  31
9. (a) From the solution of the previous  1515   1515   1515 
question:   +  2  +  3  +
 5   5   5 
Maximum value of z = 16
 1515   1515 
Maximum value of y + z = 24 ……  14  +  15 
 5   5 
Maximum value of y + 2z = 48
Maximum value of x + 3y + 4z = 97 = 315[ 514 + 513 + 512 + ....... 51 + 1]
For the maximum value of x.y.z each
 15   15 15 
of them should be as close as possible. = 315  5 − 1     =        15 − 3 
 4   4 
Y = z = 12; then x = 97 – 3y – 42 = 13;
13. (d) Here given number is 10100
hence the maximum value of x.y.z =
Number of zeros is same as that of
12 × 12 × 13 = 1872.
highest power of 5. Highest power of
10. (b) From the given condition N = 5 in (1515)! is given by
K100(100!)
 10100   10100   10100   10100   10100 
Since, 100! has the highest power of 2  1  +  2   +   3  +…   .  99  +   100 
 5   5   5   5   5 
and 5 as 97 and 24, but N is divisible
by 10100 i.e. 2100 and 5100. Hence = 2100[599 + 598 + 597+..... + 51 + 50]
K must be the multiple of 2 and 5.
 5100 − 1   10100 − 2 100 
For the minimum value K = 10, = 2100     =   
 4   4 
then N = 10100(1001). Hence the
minimum number of zeros at the 14. (c) N = 5 × 10 × 15 ×......× 500
end of N is 124. = 5100 [1 × 2 × 3 ......× 100]
11. (b) Number of zeros is same as that
= 5100(100!)
of highest power of 5. Highest
power of 5 in (510)! is given by Hence, N = 5100 (100!)

 510   510   510   510  Highest power of 5 in n is 124 and

  +   2  +   3  +……
  . +  10  that of 2 in is 97.Hence the highest
 5   5   5   5 
power of 10 in N is 97
= 59 + 58 + 57 + ….. + 1
15. (b) Highest power of 10 in 10! is 2, hence
10 10
= 5 −1
− 1  =
5 −1 the required highest power is 2 N
5 4
16. (c) Required number of news papers is
12. (a) Number of zeros is same as that of
(300 × 5)/60 = 25
highest power of 5. Highest power of
5 in (1515)! is given by
32  Theory of Counting
Concept Eliminator (CE)
1. (b) 2. (d) 3. (a) 4. (d) 5. (a) 6. (d)
7. (b) 8. (a) 9. (c) 10. (c)
Solution from question number 1-5
From the definition (n!!) = (n)(n + 1)(n + 2).....
(2n – 1) =
{(2n − 1)!}
{(n − 1)!}
1. (b) Hence 25!! = (49!)/(24!)
Since, number of trailing zeros (or
highest power of 10) in 49! is 10
and that in 24! is 4 hence number
of trailing zeros in (49!)/(24!) is
10 – 4 = 6
199!
2. (d) From the definition 100!! =
99!
Highest power of 10 in 199! is 47 and
that in 99! is 22 hence highest power
199!
of 10 in is 47 – 22 = 25 and
99!
therefore required highest power of
100 in 100!! is 12.
179!
3. (a) From the definition 90!! =
89!
Since last two non-zero digits of 179!
Is 24 and it has 43 zeros at the end,
similarly last two digits of 89! Is 68
and it has 20 zeros at the end.
Hence when we divide 179! by 89!
We will have 43 – 20 = 23 zeros at
the end and then non-zero digit is
given by unit digit of 24/68 which is 8
4. (d) From the definition (n!!) = (n)(n + 1)
{(2n − 1)!}
(n + 2).....(2n – 1) =
{(n − 1)!}
Hence 1!! = (1!)
2!! = 2 × 3 = (3!)/(1!)
3!! = 3 × 4 × 5 = (5!)/(2!)
4!! = 4 × 5 × 6 × 7 = (7!)/(3!)
Hence (1!!)(2!!)(3!!)....(20!!)
 {(1!)(3!)(5!)(7!)(9!)……. (39!)}
=   
 {(0!)(1!)(2!)….(19!)} 
 {(21!)(23!)…(39!)}
=    
 {(2!)(4!)…(18!)} 
Since number of trailing zeros is
same as highest power of 10 or that
of 5.
Consider numerator–Highest power
of 5 in 21!, 23! Is 4
Highest power of 5 in 25!, 27!, and
29! is 6
Highest power of 5 in 31! and 33!
is 7
Highest power of 5 in 35!, 37!, and
39! is 8
Hence highest power of 5 in numerator
is 4 × 2 + 6 × 3 + 7 × 2 + 8 × 3 = 8 +
18 + 14 + 24 = 64
Now consider denominator – Highest
power of 5 in 2! And 4! is 0.
Highest power of 5 in 6!, and 8! is 1
Highest power of 5 in 10!, 12!, and
14! is 2
Highest power of 5 in 16!, and 18! is 3
 Introduction  33
Hence highest power of 5 in Now consider 333!
numerator is 1 × 2 + 2 × 3 + 3 × 2 = 14 5 333 R1 =3 andQ1=T[331 ×332 ×333=36
Hence required highest power of 5 5 66 R2 = 1 and Q2= T[66] = 66
or highest power of 10 or number of 5 13 R3 = 3 and Q3= T[11 × 12 ×13]=16
trailing zeros is 64 – 14 = 50 2
5. (a) Since largest two digit prime number Hence highest power of 5 in 333! is
is 97, P = 66 + 13 + 2 = 81
Consider 4!! = 4 × 5 × 6 × 7 Hence T[333!] = T[1281] × T[36 × 66
= (7!)/(3!) × 16 × 2] = T[12 × 32] = 84
Similarly, 5!! = 5 × 6 × 7 × 8 × 9 Hence require last two digit of 96 ×
= (9!)/(4!) 84 = 64

To be divisible by 97 minimum value 8. (a) Consider largest two digit prime

of k would be 49 number 97, highest power of 97
in 300!, 200!, and 100! is 3, 1 and
49!! = (97!)/(47!) and it is divisible by 97.
2 respectively hence (300!)/(200!)
6. (d) With normal method we will find
(100!) is not divisible by 97. Any
highest power of 5 in 137!
prime number more than 75 will
5 127 R1 = 2 Q1= T[146 ×147] = 62 have similar condition, now consider
5 29 R2 = 4 Q2= T[26×27×28×29] = 24 a prime number less than 75, i.e 73.
5 5 R3 = 0 Now, highest power of 73 in 300!,
1 200!, and 100! is 4, 2 and 1 hence
Hence highest power of 5 in 147! is P exponent of 73 in N is 1. This condition
= 29 + 5 + 1 = 35 is satisfied by all the prime numbers
So T(137!) = T[1235] × T[62 × 24] in the range of 66 < N < 75, these
= T[68 × 62 × 24] = 84 prime numbers are 67, 71 and 73. So
total 3 prime numbers in this range.
7. (b) Consider 222!, we will find last two
non-zero digit of 222! Any prime number more than 66 will
have similar conditions, now consider
5 222
a prime number less than 66, i.e 61.
5 44 R1 = 2 and Q1= T[221× 222] = 62
Highest power of 61 in 300!, 200!,
5 8 R2 = 4 and Q2 = T[41 × 42 ×43 ×44] =24
1 R3 = 3 and Q3 = T[6 × 7 × 8] = 36 and 100! is 4, 3 and 1 hence exponent
of 61 in N is 1.This condition is
Hence highest power of 5 in 222! is P
satisfied by all the prime numbers
= 44 + 8 + 1 = 53
in the range of 60 < N < 66, 61 is the
Hence, T[222!] = T[1253] × T[62 × 24
only prime numbers in this range.
× 36] = T[72 × 68] = 96
34  Theory of Counting
Now consider prime number in the
=  (2400 )(3400 )(200!) 
range of 50- 59, Highest power of 59  100 100 200 100

 {(2 )(3 )(100!)}{(2 )(3 )(100!)} 
in 300!, 200!, and 100! Is 5, 3 and 1
100 200
hence exponent is1. = (2 )(3 )(200!)
We can sum up this in a tabular (100!)(100!)
format. Now we have to find largest two digit
200!
Range Prime High- High- High- Expo- prime factor of N i.e of
Num- est est est nent of (100!)(100!)
bers power power power Prime since any prime number more
in in in num- than 66 will have highest power in
300! 200! 100! ber
200!, and 100! Is 2 and 1 hence its
75–99 3 2 1 0 exponent in the given number will
be 0, Now consider a prime number
66–75
67,
4 2 1 1 less than 66, i.e 61, its highest power
71, 73 in 200! and 100! Is 3 and 1 hence its
exponent in the given number will
60–65 61 4 3 1 0
be 1 and it is a factor of N.
This condition is satisfied by all
50–59 53, 59 5 3 1 1
the prime numbers in the range of
50-66, these prime numbers are 53,
Hence there are total 5 prime numbers exist. 59 and 61. So total three such prime
9. (c) From the given condition numbers exist.
10. (c) Since last two non-zero digit of 333!
A =  (36 200 )(200!) =  (2 400 )(3 400 )(200!) is 84 and that of 222! is 96,

Let us assume that required last two
And B = (6100 )(100!) = (2100 )(3100 )(100!) non-zero digit is k then last two digit
of 96 × k should be 84.
C = (12100 )(100!) = (2200 )(3100 )(100!) From the given options only 04
Hence the given number N = A/BC satisfies the condition.
 2
Selection (Combination)  35

Selection
(Combination)

Topics Covered

 Introduction of Selection/Combination

 Selection of one or more

 Selection from identical articles

 Factor Theory

Part A: Topic Number of Questions

Solved Example 10
Concept Applicator 20
Concept Builder 20
Concept Cracker 30
Part B: Topic Number of Questions
Concept Deviator 25
Concept Eliminator 7
Total 112
36  Theory of Counting
Part A
Introduction of
Concept 1 Selection/Combination
Let us assume that Mayank has 4 friends A,
B, C & D and he wants to invite 2 of them, so
he has to select 2 friend out of 4 friends, the
question is in how many ways we can select
2 friends out of 4 friends. If we list down all
the possible combination then we will get
(A, B), (A, C), (A, D), (B, C), (B, D) & (C, D). Here
selection of (A, B) is same as selection of (B, A).
In this case we had only 6 possible combination
hence we could list it down but if possibilities
are more then it is not possible for us to list
it down.
Take another example: Consider ten points
lie on a circle. If we have to find the number
of chords that can be drawn by joining these
points pair wise. The number of chords is
same as combination/selection of 2 out of 10
points.
 Number of ways of selecting ‘r’
articles from ‘n’ distinct article is
n!
nC =
r
{
(n − r )! (r !)}
Example 1:  In how many ways Mayank
can call 4 of his friends out of 10
friends?
Solution:  Here Mayank has to select 4 friends
out of 10 so he can do it in 10C4 ways = (10!)/
(6!)(4!) =(7 × 8 × 9 × 10)/(24) = 210 ways.
 Number of ways of selecting ‘r’
articles from ‘n’ distinct article if 1
article is always included is n-1Cr-1
( n − 1)!
=
{ }
(n − r − 2)! (( r − 1)!)
Example 2:  In how many ways Mayank
can call 4 of his friends out of 10
friends if one friend Rahim is always
included?
Solution:  Here Mayank has to select 4 friends
out of 10 but Rahim is always included hence
he has to select only (4 – 1) = 3 friends from
(10 – 1) = 9 friends, so he can do it in 9C3
ways = (9!)/(6!)(3!) =(7 × 8 × 9)/(6) = 84 ways.
 Number of ways of selecting ‘r’
articles from ‘n’ distinct article if ‘k’
article is always included is n–kCr–k
( n − k )!
=
{ }
(n − r − 2k )! (( r − k )!)
Example 3:  In how many ways Mayank
can call 4 of his friends out of 10
friends if friends Rahim & Salim
always included?
Solution:  Here Mayank has to select 4
friends out of 10 but Rahim and Salim
always included hence he has to select only
(4 – 2) = 2 friends from (10 – 2) = 8 friends,
so he can do it in 8C2 ways = (8!)/(6!)(2!)
= (7 × 8)/(2) = 28 ways.

Concept 2 Selection of One or More
 The total number of combinations
of ‘n’ different things taken one or
more at a time is 2n – 1
Proof: Consider the 1st thing there are two
ways we can deal with, it may be included or
excluded. Similarly there are 2 ways that we
can deal with 2nd article and so on for 3rd and
next articles.
Now from fundamental principal of multiplica-
tion total number of ways is 2 × 2 × 2 × 2 × ...
× 2 (n times) = 2n .
Now consider the number of ways in which
nothing is selected is 1 × 1 × 1 × … × 1 = 1 way.
Hence the total number of ways of selecting
one or more at a time out of ‘n’ different things
is 2n – 1.
Alternately
Total number of distinct article provided is ‘n’
and we have to select one or more from these
‘n’ article.
One article out of ‘n’ distinct article can be
selected in nC1 ways
Two articles out of ‘n’ distinct article can be
selected in nC2 ways
Three articles out of ‘n’ distinct article can be
selected in nC3 ways
QR Code / Video Link
For Smart phone/ Tablet users
Video Link for Desktop/Laptops users http://dishapublication.com/video-resources
Selection (Combination)  37
….
….. Similarly
‘n’ articles out of ‘n’ distinct article can be
selected in nCn ways
since we can select either 1 OR 2 OR 3…OR
‘n’ articles hence from fundamental principal
of summation total number of ways is nC1 +
nC + ….. + nC = 2n–1 (Property of binomial
2 n
co-efficients)
Hence the total number of ways of
selecting one or more at a time out of ‘n’
different things is 2n-1
Example 4:  Mr. Ramchandran has to
select one or more students from 10
students for a project, how many ways
he can make this selection?
Solution:  Consider how many options for
each student he has, for 1st student he has
2 option (either select or reject) similarly for
2nd student 2 ways and so on. so total number
of ways is 210 = 1024 ways, but out of these
1024 ways there is one way when he has
rejected all the students which is according
to the given condition as he has to select
some students for his project, hence required
number of ways is 210 – 1 = 1023 ways.
38  Theory of Counting
Alternately
Total number of students is ‘10’ and we have to
select one or more from these ‘10’ students.
One student out of ‘10’ students can be selected
in 10C1 ways
Two students out of ‘10’ students can be
selected in 10C2 ways
Three students out of ‘10’ students can be
selected in 10C3 ways
….
….. Similarly
10 students out of ‘10’ students can be selected
in 10C1 ways
Since we can select either 1 OR 2 OR 3…OR
10 students hence from fundamental principal
of summation total number of ways is 10C1 +
10C + ….. + 10C = 210 – 1 = 1023.
2 n

Selection from Identical

Concept 3 Articles
The total number of ways of selecting one
or more things from ‘p’ identical things
of one type, ‘q’ identical things of another
type, ‘r’ identical things of 3rd type and ‘n’
distinct things is (p + 1)(q + 1)(r + 1)2n –1
Since number of ways of selecting r things out
of n identical things = 1 for all r ≤ n.
Hence number of ways of selecting one thing
out of p identical things = 1
Number of ways of selection two things out of
p identical things = 1
Similarly number of ways of selecting p things
out of p identical things = 1
Number of ways of selecting zero thing out of
p identical things = 1
Hence number of ways of selecting zero or
more things out of p identical things = p + 1
Similarly, number of ways of selecting zero or
more things out of q identical things = q + 1
Number of ways of selecting zero or more
things out of r identical things = r + 1
Also number of ways of selecting zero or more
things out of n different things = 2 × 2 × 2 ×
… n times = 2n
Therefore, number of ways of selecting zero or
more things out of given things = ( p + 1)(q + 1)
(r + 1 ) 2n.
But number of ways of selecting zero thing
out of given things = 1 × 1 × 1 × 1n = 1.
Thus total number of ways of selecting one or
more things out of given = ( p + 1) (q + 1) (r + 1)
× 2n – 1.

QR Code / Video Link

For Smart phone/ Tablet users

Video Link for Desktop/Laptops users http://dishapublication.com/video-resources


Example 5:  In how many ways one or
more fruits can be selected from a fruit
basket that has 4 identical apples, 5
identical bananas and remaining 3 are
of different types of fruits.
Solution:  Number of ways of selecting one or
more from 4 identical apples is (4 + 1) = 5.
Number of ways of selecting one or more bananas
from 5 identical banana is (5 + 1) = 6 ways
Concept 4 Factor Theory
NUMBER OF FACTORS OF A NUMBER
To find number of factors of a composite
number write down the number in the form
of n = apbqcr…. where a, b and c are prime
numbers , and p, q and r are natural number
then number of factors of n is given by (p + 1)
(q + 1)(r + 1)….. and it includes 1 and number
itself.
Explanation of above formula:
Let us take an example of N = 233554 now 1st
observe some facts about the factors of this
number:-
(i) A factor of above number must have
prime factor either 2, 3 or 5 or none (In
case of 1)
(ii) A factor of above number is not divisible
by any prime number other than 2, 3 or 5.
QR Code / Video Link
For Smart phone/ Tablet users
Video Link for Desktop/Laptops users http://dishapublication.com/video-resources
Selection (Combination)  39
And number of ways of selecting one or more
from 3 distinct fruits is 23 ways.
Out of these there is one way where we have
not selected any fruit we have to subtract that
case from total number of case, hence required
number of ways is (4 + 1)(5 + 1)23 – 1 = 5 × 6
× 8 – 1 = 239 ways.
(iii) A factor of above number have highest
power of 2, 3 and 5 is 3, 5 and 4
respectively.
(iv) A factor of above number has power of 2 as
20 or 21 or 22 or 23 (total 3 + 1 =4 ways)
(v) A factor of above number has power of 3
as 30 or 31 or 32 or 33 or 34 or 35 (total
5 + 1 = 6 ways)
(vi) A factor of above number has power of 5 as 50
or 51 or 52 or 53 or 54 (total 4 + 1 = 5 ways)
Hence number of factors is given by (3 + 1)
(4 + 1)(5 + 1) = 4 × 5 × 6 = 120
Now alternate way we can explain the same
thing as:
A Factor of given number must have prime
factors either 2, 3, or 5
40  Theory of Counting
So a factor must be Hence a factor must be
2(0 or 1 or 3(0 or 1 or 2 5(0 or 1 or 2
2(1 or 3(0 or 1 5(0 or 1 7(0 or 1 or 2
2 or 3) × or 3 or 4 or 5) × or 3 or 4)
2 or 3) × or 2) × or 2 or 3) × or 3 or 4)
→

→

→

→

→

→

→

(3 + 1 = (5 + 1 = (4 + 1 = (3 ways) (2 + 1 = (3 + 1 = (4 + 1 =
4 ways) 6 ways) 5 ways) 3 ways) 4 ways) 5 ways)
Hence total number of factors is 4 × 6 × 5 = 120. Hence total number of factors = (3)(2 + 1)(3 + 1)
Example 6:  Find the number of factors of (4 + 1) = 180
23325374 Hence number of even factors of a number
Solution:  A factor of above number must N = 2paqbrcs is = p(q + 1)(r + 1)(s + 1)
have 2, 3, 5 or 7 as prime factors.
Example 8:  Find the number of odd
Hence a factor must be factors of 23325374
2(0 or 1 or 3(0 or 1 5(0 or 1 7(0 or 1 or 2 Solution:  From Example 6 we have seen that
2 or 3) × or 2) × or 2 or 3) × or 3 or 4)
total number of factors of N is 240 and from
→

→

→

→

example 7 total number of even factors is

180 hence number of odd factors = 240 –
(3+1= (2+1= (3 + 1 = (4 + 1 =
180 = 60
4 ways) 3 ways) 4 ways) 5 ways)
Hence number of odd factors = Total number
Hence total number of factors = (3 + 1)(2 + 1) of factors – Number of even factors
(3 + 1)(4 + 1) = 240
Alternate way:  since odd factors should
Number of factors have power of 2 as 0.
Hence a factor must be
Number of factors of number N = ap bqcrds …
is given by (p + 1)(q + 1)(r + 1)(s + 1). 2(0) × 3(0 or 1 × 5(0 or 1 × 7(0 or 1 or 2
or 2) or 2 or 3) or 3 or 4)

Different Types of Factors

→

→
→
→

Here in this section we will learn how to find
out some specific types of factors like even
factors, odd factors, factors divisible by 10, by
12 etc. We will discuss this concept with the
help of an example:-
Example 7:  Find the number of even
factors of 23325374
Solution:  In this case we have to find number
of even factors, an even factor is divisible
by 2 or smallest power of 2 is 1 and not 0 as
in the case of total number of factors.
(1 way) (2+1= (3+1= (4+1=
3 ways) 4 ways) 5 ways)
Hence total number of odd factors = (2 + 1)
(3 + 1)(4 + 1) = 60
Hence number of odd factors of a number
N = 2paqbrcs is = (q + 1)(r + 1)(s + 1).
Example 9:  Find the number of factors of
23325374 that ends with 0 (Or divisible
by 10)

Solution:  If a number is divisible by 10 then it
must have minimum power of 2 and 5 as1.
Hence a factor divisible by 10 must be
2(1 or 2 × 3(0 or 1 × 5(1 or × 7(0 or 1 or 2
or 3) or 2) 2 or 3) or 3 or 4)
→
→
→
→
(3 ways) (2+1= (3 ways) (4+1=
3 ways) 5 ways)
1
Concept Applicator (CA)
Ideal Time
20 Min.
1. In how many ways can I call 4 friends
out of my 10 friends for dinner?
(a) 210 (b) 250 6. In how many ways 11 players can be
(c) 180 (d) None of these
2. In how many ways 5+ students out of 10
students can be selected?
(a) 210 (b) 252
(c) 180 (d) None of these
3. In how many ways a team of 3 boys and
4 girls out of total 7 boys and 9 girls can
be formed?
(a) 3150 (b) 4375
(c) 4410 (d) None of these
4. A work can be completed by 3 men or
5 women in 5 days. In how many ways
workforce can be selected if work has
to be finished in 5 days and available
workforce is 10 men and 8 women? If
workforce has either only men or only
women.
(a) 210 (b) 240 40, 60 and 80 respectively while in class
(c) 180 (d) None of these
5. In how many ways 11 players can be
selected out of 20 players if Sachin is
always selected?
Selection (Combination)  41
Hence total number of factors divisible by 10
is = (3)(2 + 1)(3)(4 + 1) = 135
Example 10:  Find the number of factors
of 23325374 that are not divisible by 10.
Solution:  From example 6 total number of
factors is 240, oust of these 135 factors are
divisible by 10 hence remaining 240 – 135
= 105.
Apply your concepts with easy and
conceptual questions
(a) 20C10 (b) 18C09
19
(c) C10 (d) None of these
selected out of 20 players if Sachin and
Sourav are always selected?
(a) 20C10 (b) 18C09
19
(c) C10 (d) None of these
7. In how many ways 11 players can be
selected out of 20 players if Sachin and
Sourav are always rejected?
(a) 18C11 (b) 18C09
(c) 19C10 (d) None of these
8. In how many ways 11 players can be
selected out of 20 players if Sachin and
Sourav are always selected but Yuvi and
Dinesh always rejected?
(a) 18C11 (b) 16C09
19
(c) C10 (d) None of these
9. In class VII there are three sections A,
B and C with number of students are
VIII there are three sections A, B and
C with number of students 60, 80, and
40 respectively. In how many ways 30
students can to be selected either from
42  Theory of Counting
class VII or VIII equal from section A, B
and C.
(a) (40C10 × 60C10 × 80C10)
× (60C10 × 80C10 × 40C10)
(b) ( C30 × C30 × 80C30)
40 60
+ ( 60C30 × 80C30 × 40C30)
(c) ( C10 × C10 × 80C10)
40 60
+ ( 60C10 × 80C10 × 40C10)
(d) None of these
10. In how many ways 5 distinct alphabets
can be selected so that no vowels be
selected?
(a) 26C5 (b) 21C5
20
(c) C5 (d) None of these
11. Out of 6 apples, 5 mangoes and 4 bananas
how many selection of fruits can be made?
(a) 210 (b) 120
(c) 119 (d) None of these
12. Out of 6 apples, 5 mangoes and 4 bananas
how many selection of fruits can be made
such that at least one mango is always
included?
(a) 175 (b) 120
(c) 119 (d) None of these
13. Out of 6 apples, 5 mangoes and 4 bananas
how many selection of fruits can be made
such that at least one fruit of each type is
always included?
(a) 175 (b) 120
(c) 119 (d) None of these
14. In an examination a student has to write
6 papers and has to pass in each paper
to pass the exam. In how many ways a
student can fail in the exam?
(a) 31 (b) 64
(c) 63 (d) None of these
15. Amit appeared in his board exam, In
his maths paper he got 10 subjective
questions, what is the total number of
ways that he can answer this paper?
(a) 1024 (b) 1023
(c) 512 (d) None of these
16. In a class of 10 students 6 are boys and 4
are girls, in how many ways class teacher
can select student/s for a project?
(a) 1024 (b) 1023
(c) 512 (d) None of these
17. In a class of 10 students 6 are boys and 4
are girls, in how many ways class teacher
can select student/s for a project such that
the group has at least 1 boy and 1 girl?
(a) 1024 (b) 1023
(c) 512 (d) None of these
18. In a fruit basket 4 mangoes, 5 bananas,
and 4 different types of fruits are kept,
in how many ways one can select fruits
from this fruit basket?
(a) 480 (b) 479
(c) 240 (d) None of these
19. Find the number of factors of 1200
(a) 30 (b) 24
(c) 32 (d) 36
20. How many factors of 1800 other than 1800
are 4 digit numbers?
(a) 3 (b) 2
(c) 1 (d) 0

Response Grid
1. a b c d 2. a b c d 3. a b c d 4. a b c d 5. a b c d
6. a b c d 7. a b c d 8. a b c d 9. a b c d 10. a b c d
11. a b c d 12. a b c d 13. a b c d 14. a b c d 15. a b c d
16. a b c d 17. a b c d 18. a b c d 19. a b c d 20. a b c d

2
Concept Builder (CB)
Ideal Time Revise your concepts with questions
30 Min. medium difficulty level questions
1. In how many ways playing 11 can be
selected from 15 players if out of 15
players, 2 players can play only as wicket
keeper?
(a) 2C1 × 13C10 (b) 2C1 × 14C11
(c) 2C1 + 13C10 (d) None of these
2. A committee of 3 men and 3 women is to
be selected from 6 men and 7 women. In
how many ways this can be done?
(a) 6C3 × 7C3 (b) 6C3 × 13C3
(c) 6C3 + 7C3 (d) None of these
3. A committee of 3 men and 3 women is
to be selected from 6 men and 7 women.
In how many ways this can be done if a
particular man is always selected?
(a) 6C3 × 7C3 (b) 5C2 × 7C3
(c) 6C3 + 7C3 (d) None of these
4. A committee of 3 men and 3 women is
to be selected from 6 men and 7 women.
In how many ways this can be done if a
particular man is always selected and a
woman is always rejected?
(a) 5C2 × 6C3 (b) 5C2 × 7C3
(c) 6C3 + 7C3 (d) None of these
5. There are n stations on a railway line.
If the number of types of tickets printed
(for one way journey) is 210, then find the
number of stations on the railway line.
(a) 16 (b) 20
(c) 25 (d) None of these
6. In how many ways 10 students from a
group of 20 students can be selected
if Rajesh and Dinesh are not selected
together?
Selection (Combination)  43
(a) 20C10 – 19C9 – 18C8
(b) 20C10 – 18C8 + 1
(c) 20C10 – 18C8 – 1
(d) None of these
7. Find the number of ways of selecting
10 students from a group of 30 students
such that the oldest and the youngest
students are always included in the
group.
(a) 30C10 – 28C8 (b) 28C8 – 1
(c) 28C8 (d) None of these
8. In how many ways at least 4 students can
be selected from a group of 6 students?
(a) 21 (b) 20
(c) 22 (d) None of these
9. In how many ways a team of k students
can be selected from n students such
that r students are always selected and
p students are always rejected?
(a) (n – r – p)Ck–r
(b) (n – r – p)Ck–r –1
(c) (n – r – p)Ck–r +1 `
(d) None of these
10. In a party 10 students gave gift to each
other then find the total number of
gifts?
(a) 10C2 (b) 210C2
10
(c) ( C2)/2 (d) None of these
11. In a board exam there are two sections
each section has 5 questions. As per the
given condition a candidate has to answer
any 6 questions out of 10 questions such
that not more than 4 questions selected
44  Theory of Counting
from one section. In how many ways a teacher can select student/s for a project
student can make up his choice to answer such that the group has at least 2 boys
the question paper? and 2 girls?
(a) 100 (b) 150 (a) 1024 (b) 1023
(c) 200 (d) None of these (c) 512 (d) None of these
12. From 8 boys and 4 girls a team of 5 is to 17. In a fruit basket 4 mangoes, 5 bananas,
be formed. In how many ways can this be and 4 apples are kept, in how many
done so as to include at least 1 girl in the ways one can select fruits from this fruit
team? basket such that at least one fruit of each
12C
type is always selected?
(a) 5 – 8C5 + 1 (b) 12C
5 – 8C 5
12C
(a) 80 (b) 79
(c) 5 – 8C5 – 1 (d) None of these
(c) 150 (d) None of these
13. From 8 boys and 4 girls a team of 5 is to
18. In a fruit basket 4 mangoes, 5 bananas,
be formed. In how many ways can this be
and 4 apples are kept, in how many ways
done so as to include at least 1 girl in the
one can select fruits from this fruit basket
team and exclude at least 1 boy from the
such that at least one 1 mango, 2 bananas
team?
and 3 apples are always selected?
(a) 12C – 8C5 + 1 (b) 12C5 – 8C5
5
12C – 8C – 1 (a) 80 (b) 79
(c) (d) None of these
5 5 (c) 32 (d) None of these
14. In how many ways 5 vowels and 5
19. There are 6 questions in an examination,
consonants can be selected from 26
a student has to answer at least three
letters?
question to pass the exam, in how many
(a) 26C (b) 5C121C5
10 ways student can fail the exam?
(c) 21C
5 (d) None of these (a) 20 (b) 31
15. What is the total number of ways of (c) 22 (d) None of these
selecting fruits with at least one apple
20. Let x be the number of factors of 2000
from 4 distinct apples and 3 distinct and y be the number of factors of 3000
bananas? and z be the number of common factors
(a) 120 (b) 105 of 2000 and 3000, then find the ratio of
(c) 119 (d) None of these (x – z):(y – z).
16. In a class of 10 students 6 are boys and (a) 2:3 (b) 3:2
4 are girls, in how many ways class (c) 1:2 (d) 1:4

Response Grid
1. a b c d 2. a b c d 3. a b c d 4. a b c d 5. a b c d
6. a b c d 7. a b c d 8. a b c d 9. a b c d 10. a b c d
11. a b c d 12. a b c d 13. a b c d 14. a b c d 15. a b c d
16. a b c d 17. a b c d 18. a b c d 19. a b c d 20. a b c d

3
Concept Cracker (CC)
Ideal Time
60 Min.
1. Out of 6 boys and 4 girls a team of 5 is to
be formed such that at least one girl is
included in the team, in how many ways
such a team can be formed?
(a) 252 (b) 246
(c) 562 (d) None of these
2. In Independence Day party every student
gave a gift to every other student. If total
number of gift distributed is 240 then
how many students were present in the
party?
(a) 16 (b) 15
(c) 32 (d) None of these
3. In Independence Day party every student
gave a gift to every other student. If total
number of gift distributed is 240 then
how many gifts received by a participant
Rakesh?
(a) 16 (b) 15
(c) 32 (d) None of these
4. In a party there are 10 men and 15 women
danced such that in a particular dance
only 1 man and 1 woman participated.
Total how many dance was performed?
(a) 150 (b) 144
(c) 300 (d) None of these
5. If a bus conductor has 190 different
tickets then find the number of stoppage
that the bus has consider only one way
journey.
(a) 19 (b) 20
(c) 22 (d) None of these
6. At praxis business school Kolkata, a
committee of 5 has to be formed from 10
volunteers out of which 6 are boys and
4 are girls. The committee should have
Selection (Combination)  45
Boost up your confidence with good
questions
at least 1 girl and two girl volunteers
Mahima and Nita refuse to work
together. In how many ways committee
can be formed?
(a) 150 (b) 144
(c) 190 (d) None of these
7. For 1st stage of scholarship
6 students has to be selected such that
3 students from mathematics group and
3 students from biology group. Number
of participants in different group is as
follows-
Mathematics group: Total 7 students
– 3 boys and 4 girls
Biology group: Total 7 students – 4
boys and 3 girls.
How many ways group of 6 students
is selected if it has 3 boys and 3 girl
students?
(a) 485 (b) 440
(c) 490 (d) None of these
8. There are 8 singers who is ready to
perform in a show that is scheduled
for two timings, before lunch and after
lunch. If before lunch maximum 5 singers
can perform while after lunch maximum
4 singers can perform then in how many
different ways organizer of the event can
schedule the program?
(a) 122 (b) 126
(c) 142 (d) None of these
46  Theory of Counting
9. How many teams of 11 players can be girls is always more than the number of
made from 25 players if players Rajesh, boys?
Rajni and Riju can not be selected (a) (4C3 × 6C2) × (4C4 × 6C1)
together? [Two of them can be together]
(b) 4C3 × 6C1 + 4C4 × 6C1
(a) 25C 22C 25C 22C
11 – 8 (b) 11 – 11 (c) 4C3 × 6C2 + 4C4 × 6C1
(c) 25C 25C
11 – 8 (d) None of these (d) None of these
10. Consider a set S = { 100, 101, 102, …. 199} 14. 10 singers were selected to perform in a
a number machine has done following function, but at a time only 3 singers
operations- can perform, then total how many times
Step (i) select 2 numbers at random from performance was done if no same group
the set S of 3 students performed twice?
(a) 10C
Step (ii) Multiply the two numbers 3
selected in step (i) and the result R is the (b) 10C × 10C1 × 10C1
1
output of the machine. (c) 10C × 9C 1 × 8C 1
1
In how many ways selection can be (d) None of these
done at 1st step if the final result R is a
multiple of 3. 15. 10 singers were selected to perform in
33C
a function, but at a time only 3 singers
(a) 1 × 33C1 + 33C1 × 67C1 can perform, then how many times a
(b) 33C 67C + 32C × 66C
1× 1 1 1 particular singer performed if no same
(c) 33C × 33C1 + 33C1 × 67C1
1 group of 3 students performed twice?
(d) None of these (a) 10C (b) 9C2
2
11. In a group picnic 10 married couples (c) 9C × 8C 1 (d) None of these
1
planned to play mixed doubled game in 16. Mr. Raman has 10 friends and he wants
tennis. The condition is that no husband to invite his friends for a get together.
wife pair is present in the game. Then
At a time he can invite only 4 out of
what is the total number of game
10 friends. If a particular friend of Mr
played?
Raman, Mr. Singh came ‘p’ times and
(a) 10C × 8C2 (b) 2 × 10C2 × 8C2
2 out of those ‘p’ times Mr. Singh came ‘q’
(c) 2 × 10C2 × 6C2 (d) None of these times with Mr. Raj, another friend of Mr.
12. Playing 11 has to be selected from 15 Raman. By what percentage ‘p’ is more
players which has 5 bowlers what is the than ‘q’?
number of ways of selecting 11 players (a) 55% (b) 120%
such that at least 4 bowlers are always (c) 150% (d) None of these
selected?
17. Mr. Raman has 10 friends and he wants
(a) 5C4 × 10C7 + 5C
5 × 10C6 to invite his friends for a get together.
(b) 5C4 × 10C7 + 5C
3 × 10C6 At a time he can invite only 4 out of 10
(c) 5C
4 × 9C 7+ 5C
5 × 10C6 friends. How many times a particular
(d) None of these friend Ricky came with Susmit but not
with Soumyajyoti?
13. In a group of 10 students comprising 6
boys and 4 girls, in how many ways we (a) 18 (b) 28
can select a team of 5 so that number of (c) 21 (d) None of these
 Selection (Combination)  47
18. ICICI bank has 12 vacancies out of (a) 32 (b) 41
which 3 seats are reserved for women
(c) 36 (d) None of these
applicants if there are total 25 applicants
20 of them are gentlemen and 5 of them 23. Total 16 people participated in a picnic,
are women then in how many ways 12 6 peoples are to be selected for a work
applicants can be selected? such that exactly one from Mr. & Mrs. A
(a) 5C3 × 22C9 is selected similarly one from Mr. & Mrs.
B and Mr. & Mrs. C is selected for the
(b) 5C3 × 20C9 + 5C4 × 20C8 + 5C5 × 20C7 work. How many ways this can be done?
(c) 5C × 22C9 + 5C4 × 21C8 + 5C5 × 20C7
3 (a) 960 (b) 480
(d) None of these
(c) 120 (d) None of these
19. At an election three wards of a town are
24. Consider a universal set S with n
canvassed by 4, 5 and 8 men respectively. If
elements, set S = { a1 , a2 , … , an} what
there are 20 volunteers, in how many ways
is the number of subsets of this set which
can they be allotted to different wards?
contain odd number of elements?
(a) 20C × 16C5 × 11C8
5
(a) 2n – 1 (b) 2n – 1
(b) 20C 16C × 11C
4× 5 8
(c) 2n – 2 (d) None of these
(c) 20C 16C + 11C
4+ 5 8
25. In a class the number of students is
(d) None of these
(2n + 1), in how many ways at most n
20. Given 5 different green dyes, 4 different students can be selected from these
blue dyes and 3 different red dyes. How students?
many combinations of dyes can be chosen
(a) 2n (b) 2n + 1
taking at least one green and one blue dyes.
(a) 54 (b) 3720 (c) 2n – 1 (d) 22n
(c) 4904 (d) None of these
26. A fruit basket has ‘n’ different types of
21. Mr. Rahim has one 5 rupee, one 10 rupee, fruits and each type has ‘k’ number of
one 20 rupee and one 50 rupee note, what fruits. What is the number of ways of
is the number of different sums that can selecting one or more fruits from the
be made from these notes? basket?
(a) 16 (b) 31 (a) kn – 1 (b) (k + 1)n –1
(c) 32 (d) None of these
(c) (n + 1)k – 1 (d) None of these
22. In Praxis Business school, during an
election of mess committee there 27. How many numbers less than 10000 has
are 3 seats of mess committee and 6 only 3 factors?
contestants. A student can not vote (a) 15 (b) 50
more than 3 votes, in how many ways a
student can vote? (c) 25 (d) None of these
48  Theory of Counting
28. How many 2 digit numbers exist whose (a) 576 (b) 288
number of factors is 8 (c) 625 (d) None of these
(a) 8 (b) 10 30. Find the sum of all the factors of 7200
(c) 12 (d) 14 that ends with 5.
29. How many factors of N = 25 × 35 × 55 × (a) 403 (b) 523
75` ends with 2 zeroes. (c) 925 (d) 3053

Response Grid
1. a b c d 2. a b c d 3. a b c d 4. a b c d 5. a b c d
6. a b c d 7. a b c d 8. a b c d 9. a b c d 10. a b c d
11. a b c d 12. a b c d 13. a b c d 14. a b c d 15. a b c d
16. a b c d 17. a b c d 18. a b c d 19. a b c d 20. a b c d
21. a b c d 22. a b c d 23. a b c d 24. a b c d 25. a b c d
26. a b c d 27. a b c d 28. a b c d 29. a b c d 30. a b c d
 Selection (Combination)  49

Solutions
Concept Applicator (CA)
1. (a) 2. (b) 3. (c) 4. (d) 5. (c) 6. (b)
7. (a) 8. (b) 9. (c) 10. (b) 11. (d) 12. (a)
13. (b) 14. (c) 15. (b) 16. (b) 17. (d) 18. (b)
19. (a) 20. (d)

1. (a) Here we have to select 4 friends out Case (i): When work is completed
of 10 so it can be done in 10C4 ways, by Men then number of ways of
10! 7 × 8 × 9 × 10 selecting workforce (number of ways
10C = = =  210 of selecting 3 men out of 10 men) is
4 (6!)(4!) 1×2×3×4
10! 8 × 9 × 10
2. (b) Here we have to select 5 students out of 10C = = =1
  20
10 so it can be done in 10C5 ways, 10C5 3 (7!)(3!) 1×2×3
10! 6 × 7 × 8 × 9 × 10 Case (ii) When work is completed
= = =  252 by Women then number of ways of
( )( ) 1 × 2 × 3 × 4 × 5
5! 5!
selecting workforce (number of ways
3. (c) Here in this case we have to select of selecting 5 women out of 8 women)
3 boys and 4 girls out of total 7 boys
and 9 girls. 8! 6×7×8
is 8C5 = = =  56
Out of 7 boys, 3 boys can be selected in ( )( ) × 2 × 3
5! 3! 1
Now from fundamental principal
7C 7! 5×6×7 of addition total number of ways is
3 ways or = = = 35
(4!)(3!) 1 × 2 × 3 120 + 56 = 176
Out of 9 girls, 4 girls can be selected 5. (c) Here in this case it is given that
in 9C4 ways or total number of players is (n) =
20, since Sachin is always selected
9! 6×7×8×9
= = = 126 hence available number of player

(4!)(5!) 1 × 2 × 3 × 4 is 19 (About which selectors can
From fundamental principal of take decision) now from 19 we have
multiplication total number of ways to select only 10 (since one player
is 35 × 126 = 4410 Sachin is always selected so now
selectors have to select only 10),
4. (d) Since work can be completed by 3
hence number of ways is 19C10
men OR by 5 women [Here this OR
suggest that we have 2 cases and we 6. (b) Explanation is similar to the above
have to use fundamental principal of question option (b) 18C09 is the
summation] correct answer.
50  Theory of Counting
7. (a) Similar to question number 5, here
selectors have to select 11 out of
available 18 players and that can be
done in 18C11 ways.
8. (b) Here out of available 16 players,
selectors have to select only 9 players
and that can be done in 16C9
9. (c) Here also we have two cases,
Equal number of students means
10 students from each section.
Case (i) If students are selected from
Class VII then number of ways is
40C × 60C × 80C
10 10 10
Case (i) If students are selected from
Class VII then number of ways is
60C × 80C × 40C .
10 10 10
In this question either case(i) is
possible or case (ii) hence total
number of ways is 40C × 60C
10
80C + 60C 80C 40C
10 10 × 10 × 10
10. (b) Out of 21 consonant we have to select
5 that can be done in 21C5 ways.
11. (d) Number of ways that we can deal
with apples is (6 + 1) =7
Number of ways that we can deal
with mangoes is (5 + 1) =6
Number of ways that we can deal
with bananas is (4 + 1) =5
So number of ways of selecting fruits
is 7 × 6 × 5 = 210 out of these there is
one way when we have not selected
mangoes, bananas, or apples hence
total number of ways of selecting
one or more fruits is 210 – 1 = 219
12. (a) Number of ways that we can deal
with apples is (6 + 1) =7
Number of ways that we can deal
with mangoes is 5
Number of ways that we can deal
with bananas is (4 + 1) =5
So number of ways of selecting fruits
is 7 × 5 × 5 = 175.
13. (b) Number of ways that we can deal
with apples is 6.
Number of ways that we can deal
with mangoes is 5.
Number of ways that we can deal
with bananas is 4.
So number of ways of selecting fruits
is 6 × 5 × 4 = 120.
14. (c) Consider the total possibilities,
Let the 1st subject there are two
options either he can pass or he can
fail, similarly there are two options
for 2nd subject and so on. So total
number of ways is 2 × 2 × 2 × 2 ×
2 × 2 = 64 and out of these 64 only
one case in which he can pass the
exam so total number of ways that a
student can fail is 64 – 1 = 63.
× 15. (b) Amit can deal with a particular
10
question in 2 ways hence total
number of ways is 2 × 2 × 2 … × 2
= 210 = 1024 ways but out of these
1024 ways there is one way when he
left all the questions unanswered so
total number of ways is 1023
Alternately:
Amit can answer 1 question in 10C1
ways, 2 questions in 10C2 ways and
so on. 10 question in 10C10 ways hence
total number of ways is 10C1 + 10C2 +
…. + 10C10 = 210 – 1 = 1023 ways.
16. (b) Consider how many options for each
student he has, for 1st student he
has 2 option (either select or reject)
similarly for 2nd student 2 ways and
so on. So total number of ways is 210
= 1024 ways, but out of these 1024
ways there is one way when he has
rejected all the students which is not
according to the given condition as
he has to select some students for
his project, hence required number
of ways is 210 – 1 = 1023 ways.

Alternately:  Total number of
students is ‘10’ and teacher has to
select one or more from these ‘10’
article.
One student out of ‘10’ students can
be selected in 10C1 ways
Two students out of ‘10’ students
can be selected in 10C2 ways
Three students out of ‘10’ students
can be selected in 10C3 ways
….. Similarly
10 Student out of ‘10’ students can
be selected in 10C1 ways
Since we can select either 1 OR 2
OR 3…OR 10 students hence from
fundamental principal of summation
total number of ways is 10C1 + 10C2 +
….. + 10Cn = 210–1 = 1023.
17. (d) Number of ways of selecting one or
more boys is (26 – 1) = 63 ways.
Number of ways of selecting one or
more girls is (24 – 1) = 15 ways.
Concept Builder (CB)
1. (a) 2. (a) 3. (b) 4. (a) 5. (b) 6. (d)
7. (c) 8. (c) 9. (a) 10. (b) 11. (c) 12. (b)
13. (b) 14. (c) 15. (a) 16. (d) 17. (a) 18. (c)
19. (c) 20. (d)
1. (a) From 2 wicket keepers only 1 is
selected and this can be done in
2C ways and remaining 10 can be
1
selected from remaining 13 players
and that can be done in 13C10 so total
number of ways is 2C1 × 13C10.
2. (a) We can select 3 men from 6 men
in 6C3 ways, and 3 women from 7
women in 7C3 ways. Hence total
number of ways is 6C3 × 7C3
Selection (Combination)  51
Hence required number of ways is
63 × 15 = 945
18. (b) We know that the total number of
ways of selecting one or more things
from ‘p’ identical things of one type,
‘q’ identical things of another type,
‘r’ identical things of 3rd type and
‘n’ distinct things is (p + 1)(q + 1)
(r + 1)2n
Hence here required number of ways
is 5 × 6 × 24 = 480
But there is one way where none of
the fruits are selected and we have
to remove that case hence required
number of ways is 480 – 1 = 479
19. (a) Since 1200 = 12 × 100 = 4 × 3 × 4
× 25 = 243152 hence its number of
factors is (4 + 1)(1 + 1)(2 + 1) = 5 × 2
× 3 = 30
20. (d) The largest factor of 1800/2 = 900
hence number of four digit factor is 0.
3. (b) We can select 2 men from 5 men
in 5C2 ways, and 3 women from 7
women in 7C3 ways. Hence total
number of ways is 5C2 × 7C3
4. (a) We can select 2 men from 5 men
in 5C2 ways, and 3 women from 6
women in 6C3 ways. Hence total
number of ways is 5C2 × 6C3.
5. (b) A ticket will be between two stations
so 2 stations from n stations can be
52  Theory of Counting
selected in nC2 ways i.e n(n – 1)/2 12. (b) Without restriction we can select 5
which is given to us equal to 210 so members from 12 in 12C5 ways. Now
n(n – 1) = 210 × 2 = 420 or n = 20. with negative restriction (Means
6. (d) Without any restriction 10 students if no girl is selected in the team)
can be selected from 20 students in the number of ways is 8C5. So total
20C ways. With negative restriction number of ways with the given
10
that means when both Rajesh and restriction is 12C5 – 8C5.
Dinesh are selected the total number 13. (b) This question is exactly same as
of ways is 18C8. Hence required previous question, as at least one boy
number of ways is 20C10 – 18C8 . is always excluded from the team.
7. (c) As per the given condition from 28 14. (c) 5 vowels can be selected from 5 vowels
we have to select 8 and that can be in 5C5 = 1 way and 5 consonants can
done in 28C8 ways. be selected from 21 consonants in
21C ways.
5
8. (c) Here we have following cases- 15. (a) At least one apple from 4 distinct
Case (i) – when 4 students are apples can be selected in (24 – 1) = 15
selected then number of ways is ways and bananas can be selected in
6C = 15 ways.
4 (23 = 8 ways) hence total number of
Case (ii) – when 5 students are is 15 × 8 = 120.
selected then number of ways is 16. (d) Number of ways of selecting at least
6C = 6 ways.
5 two boys is 6C2 + 6C3 + 6C4 + 6C5 + 6C6.
Case (iii) – when 6 students are
selected then number of ways is Since we know that 6C0 + 6C1 + 6C2
6C = 1 way. + 6C3 + 6C4 + 6C5 + 6C6 = 26
6
Then total number of ways is 15 + 6 Hence 6C2 + 6C3 + 6C4 + 6C5 + 6C6
+ 1 = 22 ways. = 64 – 1 – 6 = 57 ways.
9. (a) From the given condition we have to Similarly number of ways of selecting
select (k – r) students from (n – r – p) at least two girls is 4C2 + 4C3 + 4C4
students and that can be done in Since we know that 4C0 + 4C1 + 4C2
(n – r – p)C
k – r ways. + 4C3 + 4C4 = 24
10. (b) Since total number of students is 10 Hence 4C2 + 4C3 + 4C4 = 16 – 1 – 4
so number of pairs is 10C2 and with = 11 ways.
each pair we have two gifts so total Hence total number of ways is
number of gifts is 210C2
57 × 11 = 627.
11. (c) We have these different cases- 17. (a) Mangoes can be selected in 4 ways
Section 1 Section 2 Number of ways (either 1 or 2 or 3 or 4 mangoes) similarly
Case 4 (in 5C4 2 (in 5C2 5C 5 Bananas and apples can be selected
4 × C2 = 5 × 10
(i) ways) ways) = 50 in 5 and 4 ways respectively, so total
number of ways is 4 × 5 × 4 = 80.
Case 3 (in 5C3 3 (in 5C3 5C 5
3 × C3 = 10 × 10 18. (c) Mangoes can be selected in 4 ways
(ii) ways) ways) = 100
(either 1 or 2 or 3 or 4 mangoes)
Case 2 (in 5C2 4 (in 5C4 5C × 5C2 = 5 × 10
4 similarly Bananas and apples
(iii) ways) ways) = 50 can be selected in 4 and 2 ways
Total number of ways is 50+100+50 respectively, so total number of
= 200 ways is 4 × 4 × 2 = 32.

19. (c) Student will fail the exam if he
has answered either 0, or 1, or 2
questions, this can be done in 6C0
+6C1 +6C2 = 1 + 6 + 15 = 22 ways.
20. (d) Since 2000 = 24 × 53 hence
x = 5 × 4 = 20.
Since 3000 = 23 × 31 × 53 hence
Selection (Combination)  53
y = 4 × 2 × 4 = 32.
For common factors we have to find
out HCF of 2000 and 3000, it is
1000.
Since 1000 = 23 × 53 hence z = 4 × 4 = 16.
Hence (x – z) : (y – z) = 4 : 16 = 1 : 4.

Concept Cracker (CC)

1. (b) 2. (a) 3. (b) 4. (a) 5. (b) 6. (c)
7. (a) 8. (b) 9. (a) 10. (d) 11. (b) 12. (a)
13. (c) 14. (a) 15. (b) 16. (d) 17. (c) 18. (b)
19. (b) 20. (b) 21. (d) 22. (b) 23. (a) 24. (a)
25. (d) 26. (b) 27. (c) 28. (b) 29. (a) 30. (a)

1.
(b) Total 6 boys and 4 girls and we have to
select 5 so we have following cases:
Case (i) team has 1 girl and 4 boys
the number of ways is (4C1)(6C4) = 4
× 15 = 60
Case (ii) team has 2 girls and 3 boys
the number of ways is (4C2)(6C3) = 6
× 20 = 120
Case (iii) team has 3 girls and 2
boys the number of ways is (4C3)
(6C2) = 4 × 15 = 60
Case (iv) team has 4 girls and 1 boy
the number of ways is (4C4)(6C1) = 1
×6=6
So total number of such ways is 60 +
120 + 60+6 = 246
Method 2: Total number of ways of
selecting 5 out of 10 is 10C5 = 252
Number of ways of selecting 5 out of
given 10 so that no girls in the team
(means only boys) is 6C1 = 6
But the given condition is that
at least 1 girl in the team hence
required number of ways is given
by the difference between the total
number of ways of selecting 5 without
restriction and the total number of
ways with no girl in the team i.e 252
– 6 = 246.
2. (a) Let us assume that total number of
students in the party is ‘n’
Number of ways that 2 students can
be selected from n students is nC2. In
each pair of students each student
gave gift to other hence total number
of gifts distributed is
2nC2 = 2n(n – 1)/2 = n(n – 1)
From the given condition
n(n – 1) = 240 or n = 16
Hence number of students present
in the party is 16
3. (b) From the solution of previous
question, number of students present
in the party is 16 hence a particular
student has received 15 gifts.
4. (a) In a dance we have to select one man
from 10 men in 10C1 = 10 ways, and
one woman from 15 woman in 15C1
= 15 ways, hence total number of
dance performed is 10 × 15 = 150.
54  Theory of Counting
5. (b) If bus has ‘K’ number of stoppages 6. (c) Here we will have 3 different cases
then to have a ticket we have to based on the number of girls in the
select 2 stoppages out of K and that committee.
K (K − 1)
can be done in KC2 = =1
  90
2
or K(K – 1) = 380 or K = 20.

No. of Girls No. of Boys No. of selection

Case (i) 1 4 4C × 6C4 = 4 x 15 = 60
1

Case (ii) 2 (But Mahima and Nita Cant be together) 3 (4C2 – 2C0) × 6C3 =5 x 20 = 100

Case (iii) 3 (But Mahima and Nita Cant be together) 2 (4C3 – 2C1) × 6C2 = 2 x 15 = 30

Total 190

4 girls can not be selected together as Mahima and Nita Can’t be together. So total
number of ways is 190

7. (a) We can solve this question by making different cases-

Mathemat- Biology No. of ways Hence
ics Group Group total
Girl Boy Girl Boy number
(4) (3) (3) (4) of ways
is 1+144+
Case (i) 0 3 3 0 4C 3C 3C 4C
0× 3× 3× 0 = 1×1×1×1 = 1 324+16 =
485
Case (ii) 1 2 2 1 4C 3C 3C 4C
1× 2× 2× 1 = 4×3×3×4 = 144

Case (iii) 2 1 1 2 4C 3C 3C 4C
2× 1× 1× 2 = 6×3×3×6 = 324

Case (iv) 3 0 0 3 4C 3C 3C 4C
3× 0× 0× 3 = 4×1×1×4 = 16

Total number of ways is 485 So total number of ways is 56 + 70 =

8. (b) Here we have two cases- 126.
Case (i) Before lunch 5 and after 9. (a) Without any restriction 11 players
lunch 3 then number of ways is 8C5 from 25 players can be selected
= 56 ways (We just have to select 5 in 25C11 ways and with negative
for before lunch program remaining restriction (means when the
three will automatically perform in
three mentioned players are
post lunch). 22
together) number of ways is C8
Case (ii) Before lunch 4 and after
hence required number of ways is
lunch 4 that can be done in 8C4
25C 22C
ways = 70 ways. 11– 8

10. (d) Since product of two numbers is a
multiple of three it is possible only
when at least one of them is multiple
of three so we have 2 cases:
Case (i): If both the number are
multiple of three then number of
ways is 33C2 since there are 33
numbers in the given set is multiple
of 3.
Case (ii): If only one number is
multiple of 3, then the number of ways
is 33C1 × 67C1
Hence total number of ways is
33C 33C × 67C .
2+ 1 1
11. (b) Lets select ladies 1st, so two ladies
can be selected in 10C2 ways then next
step is we have to select 2 gentlemen
from available 8 gentlemen and that
can be done in 8C2 ways. Now we
have 2 women and 2 men and they
can be pair up in two ways hence
total number of ways is 2 × 10C2 ×
8C .
2 Case (i) when 3 women and 9 men
12. (a) Here we have two cases:
Case (i) – 4 bowlers are selected- the
number of ways is 5C4 × 10C7
Case (ii) – 5 bowlers are selected- the
number of ways is 5C5 × 10C6
So total number of ways is 5C4 × 10C7
+ 5C5 × 10C6.
13. (c) Since number of girls is always more
than number of boys hence we have
following cases-
Case (i) when number of girls is 3
and that of boys is 2 then number of
ways is 4C3 × 6C2
Case (ii) when number of girls is 4
and that of boy is 1 then number of
ways is 4C4 × 6C1
Total number of ways is 4C
3×
6C
2+
4C 6 = 31 ways.
4 × C 1.
Selection (Combination)  55
14. (a) Number of singers is 10.
Number of singers selected at a time
is 3.
So out of 10 singers 3 can be selected
in 10C3 ways.
15. (b) From solution of previous question, if
a particular singer is selected always
then number of ways of selecting 2
more players out of 9 players is 9C2
16. (d) Number of times that Mr. Singh
came is 9C3 = 84 = p
And number of times Mr. Singh
came with Mr. Raj is 8C2 = 28 = q
So p is 200% more than q.
17. (c) Condition is same as Ricky and
Susmit selected but Soumyajyoti is
not selected that can be done in 7C2
ways = 21 ways.
18. (b) The question is similar to the
condition when we have to make
selection with at least 3 women so
we have following cases-
are selected then number of ways is
5C × 20C
3 9
Case (ii) when 4 women and 8 men
are selected then number of ways is
5C × 20C
4 8
Case (iii) when 5 women and 7 men
are selected then number of ways is
5C × 20C .
5 7
So total number of ways is 5C ×
3
20C + 5C × 20C + 5C × 20C
9 4 8 5 7
19. (b) 1st we will select 4 out of 20 in 20C4
ways then next 5 in 16C5 and finally
8 in 11C8 ways. Hence total number
of ways is 20C4 × 16C5× 11C8
20. (b) One or more green dyes can be
selected out of 5 different green dyes
in 5C1 +5C2 +5C3 +5C4 +5C5 = 25 – 1
56  Theory of Counting
One or more blue dyes can be selected
out of 4 different blue dyes in
4C 4C 4C 4C
1+ 2+ 3+= 24 – 1 = 15 ways.
4 hence required number of ways is
Zero or more red dyes can be selected
out of 3 different red dyes in 3C0 + 3C1
+ 3C2 +3C3 = 23 = 8 ways. Required
number = 31 × 15 × 8 = 3720
21. (d) Since there are 4 different denomi-
nations hence required summation
is 2 × 2 × 2 × 2 – 1 = 16 – 1 = 15
22. (b) A student can vote for either 1 or
2 or 3 contestants, hence required
number of ways is 6C1 + 6C2 + 6C3 =
6 + 15 + 20 = 41.
23. (a) Since out of 16 only 10 is available
for selection, out of 10, 3 can be
selected in 10C3 = 120 ways, and
three from the group of Mr & Mrs A,
B and C can be selected in 2 × 2 × 2
= 8 ways.
So total number of ways for selection
is 8 × 120 = 960 = 8(5!).
24. (a) Total number of its subset is 2n
and out of these 50% is even hence
required number is 2n – 1.
25. (d) From the given condition require
number of selection is
K = 2n + 1C0 + 2n + 1C1 + 2n + 1C2 + …
+ 2n + 1Cn
We have 2K = 2(2n +1C0 + 2n +1C1 + 2n
+ 1C + … + 2n +1Cn)
2
=(2n+1C0 + 2n +1C
2n +1) +(
2n + 1
C2n )+ … + ( 2n +1 C
n factors of 23 × 35 × 53 × 75, and it is
(  nCr = nCn – r).
Thus 2n – 1C0 + 2n + 1C1 + 2n + 1C2
+… +
2n + 1C
2n + 1
⇒  N = 22n.
26. (b) Consider the 1st type, 1 or more
fruits can be selected in (k + 1) ways
similarly for 2nd fruit and so on, so
total number of selection is (k + 1)n
but we have to select at least 1 fruit
(k + 1)n – 1 .
27. (c) Only square of a prime number has
three factors, these are 1, p and p2.
Since the number or p2 is less than
10000 that means p or prime number
is less than 100, we know that total 25
prime numbers less than 100 exist.
28. (b) Since number of factors is 8, we have
following cases-
Case (i): if we take 8 = 2 × 2 × 2 i.e
number is in the format of a1 × b1
× c1, the two digit numbers in this
format are 2 × 3 × 5 = 30, 2 × 3 × 7 =
42, 2 × 3 × 11 = 66, 2 × 3 × 13 = 78,
2 × 5 × 7 = 70 total 5 numbers in this
format.
Case (ii): If we take 8 = 2 × 4 i.e
number is in the format of a1b3, the
two digit numbers in this format 23
× 31 = 24, 23 × 51 = 40, 23 × 71 = 56,
23 × 111 = 88, 33 × 21 = 54 total 5
numbers in this format.
Case (iii): If we take 8 = 1 × 8 i.e
number is in the format of a7 but no
two digit number exist that is in this
format.
So total number of numbers is 10
29. (a) Given number is N = 25 × 35 × 55 ×
75, here we have to find the factors
divisible by 100 = 22 × 52 that means
in all the concern factors 22 × 52
2n +1C
1 + must be common. Required number
of factor is same as the number of
+ 2n + 1Cn +1)
4 × 6 × 4 × 6 = 576.
30. (a) Since 7200 = 25 × 32 × 52 its factors
will end with 5 only when it is odd
= 22n + 1 factor, or all the factors of 32 × 52 will
satisfy the condition. Hence sum of
all the factors of 32 × 52 is given by
33 − 1 53 − 1
× = 13 × 31 = 403
3 −1 5 −1
 Part B
Introduction of
Concept 1 Selection/Combination
• Number of ways of selecting ‘r’
articles from ‘n’ distinct article is
nC = n!
r
{ r )!(r !)}
(n −
• Number of ways of selecting ‘r’
articles from ‘n’ distinct article if 1
article is always included is n–1Cr–1
Concept 2 Selection of one or more
The total number of combinations of ‘n’
different things taken one or more at a
time is 2n–1
Proof: Consider the 1st thing there are two
ways we can deal with, it may be included or
excluded. Similarly, there are 2 ways that we
can deal with 2nd article and so on for 3rd and
nth articles.
Now from fundamental principal of multiplica-
tion total number of ways is 2 × 2 × 2 × 2 × ..
× 2 (n times) = 2n .
Selection (Combination)  57
( n − 1)!
=
{(n − r − 2 )! ((r − 1)!)}
• Number of ways of selecting ‘r’
articles from ‘n’ distinct article if ‘k’
article is always included is n–kCr–k
( n − k )!
=
{(n − r − 2k )! ((r − k )!)}
Now consider the number of ways in which
nothing is selected is 1 × 1 × 1 × … × 1 = 1
times
Hence the total number of ways of
selecting one or more at a time out of ‘n’
different things is 2n–1
Alternately
Total number of distinct article provided is ‘n’
and we have to select one or more from these
‘n’ article.
58  Theory of Counting
One article out of ‘n’ distinct article can be
selected in nC1 ways.
Two articles out of ‘n’ distinct article can be
selected in nC2 ways.
Three articles out of ‘n’ distinct article can be
selected in nC3 ways.
….
….. Similarly,
Concept 3 Selection from Identical Articles
The total number of ways of selecting
one or more things from ‘p’ identical
things of one type, ‘q’ identical things
of another type, ‘r’ identical things of
3rd type and ‘n’ distinct things is (p + 1)
(q + 1)(r + 1)2n
Since number of ways of selecting r things out
of n identical things = 1 for all r ≤ n.
Hence number of ways of selecting one thing
out of p identical things = 1.
Number of ways of selection two things out of
p identical things = 1.
Similarly number of ways of selecting p things
out of p identical things = 1.
Number of ways of selecting zero thing out of
p identical things = 1.
‘n’ articles out of ‘n’ distinct article can be
selected in nCn ways.
Since, we can select either 1 OR 2 OR 3…OR
‘n’ articles hence from fundamental principal
of summation total number of ways is nC1 +
nC + ….. + nC = 2n–1
2 n
Hence the total number of ways of
selecting one or more at a time out of ‘n’
different things is 2n–1
Hence number of ways of selecting zero or
more things out of p identical things = p + 1.
Similarly, number of ways of selecting zero or
more things out of q identical things = q + 1.
Number of ways of selecting zero or more
things out of r identical things = r + 1.
Also number of ways of selecting zero or more
things out of n different things = 2 × 2 × 2 ×
… n times = 2n.
Therefore, number of ways of selecting zero
or more things out of given things = (p + 1)
(q + 1)(r + 1 ) 2n.
But number of ways of selecting zero thing
out of given things = 1 × 1 × 1 × 1n = 1.
Thus total number of ways of selecting one
or more things out of given = ( p + 1) (q + 1)
(r + 1) 2n–1.

Concept 4 Factor Theory
To find number of factors of a composite
number write down the number in the form
of n = apbqcr …. where a, b and c are prime
numbers , and p, q and r are natural number
then number of factors of n is given by (p + 1)
(q + 1)(r + 1) ….. and it includes 1 and number
itself.
Explanation of above formula:
Number of factors of number N = apbqcrds…is
Selection (Combination)  59
given by (p + 1)(q + 1)(r + 1)(s + 1)
Number of even factors of a number N =
2paqbrcs is = p(q + 1)(r + 1)(s + 1).
Number of odd factors = Total number of
factors – Number of even factors
Alternate way: Number of odd factors of
a number N = 2paqbrcs is = (q + 1)(r + 1)
(s + 1)
60  Theory of Counting
1
Concept Deviator (CD)
Ideal Time Revise your concept (IIT advance or
5 Min.
Per Question
1. What is the number of ways in which
three numbers in A.P can be selected
from a set of numbers { 1, 2, 3….100}
(a) (50C2 ) × (50C2) (b) 100C
2 from marketing is more than number of
(c) 350C 2 (d) None of these
2. What is the number of ways in which
three numbers in A.P can be selected
from a set of numbers { 1, 2, 3….101}
(a) (50C2 ) + (50C2) (b) (51C2 ) + (50C2)
(c) (51C2 ) + (52C2) (d) None of these
Directions for question number 3 and 4:
Consider a set S = { 1, 2, 3, ……, n}
3. In how many ways three numbers from
the given set can be selected such that
all the three numbers are consecutive?
(a) nC3 (b) n – 2
n
(c) C3 – n (d) None of these
4. In how many ways three numbers from
the given set can be selected such that not
all the three numbers are consecutive?
(a) nC3– n + 2 (b) nC3 – n + 1
(c) nC3 – n (d) None of these
5. In Realty show of Dance Competition,
final round has 10 participants. In each
performance exactly two dancers will
perform. Mr. kartick a fan of this show
has decided to see exactly 10 dance
performance, in how many ways he can
select the performances?
(a) 45C10 (b) 55C10
(c) 1 (d) None of these
6. A delegation of 12 students has to be
selected from 18 students 6 from each
tougher questions)
Marketing, HR and Operations students
such that at least 2 students must be
selected from each marketing, HR and
Operations and number of students
students from HR which in turn is more
than number of students from operations.
In how many ways this selection can be
done?
(a) 2125 (b) 1850
(c) 2025 (d) None of these
7. In an examination the question paper
has three sections namely Physics,
Chemistry and Mathematics containing
4, 5 and 6 questions respectively. As
per the rule a students has to answer
minimum 2 questions from each section.
In how many ways a student can attempt
7 questions?
(a) 2000 (b) 2700
(c) 3200 (d) None of these
8. In an election the number of contestants
is one more than the number of seats. If
a particular voter can vote in ‘k’ different
ways then what could be the value of
k if a voter can give minimum 1 and
maximum equal to the number of seats.
(a) 1024 (b) 1023
(c) 1022 (d) None of these
9. In MERI Kolkata while voting for Co-
operative society member, number of
seats are ‘n’ and number of participants
are ‘n+1’ as per the rule a student can
vote minimum 1 and maximum ‘n’ votes.
To vote for 1 candidate a student need 1
ballot paper which one of the following
 Selection (Combination)  61
could be the total number of ballot papers answers is 2047, then what is the number
that management committee should be of questions in the test ?
ready with? (a) 11 (b) 12
(a) 899 (b) 1230 (c) 13 (d) None of these
(c) 1763 (d) 323 14. In a particular batch of Pioneer career
10. If ‘K’ is the number of ways in which Kolkata there are 4 boys and certain
three numbers in A. P. can be selected number of girls. In every mock test only
from ,1 2, 3, …, n then which one of the 5 students including at least 3 boys can
following is correct about ‘K’? appear. If different group of students
write the Mock exam every time, if
(i)
(n − 1)2
if n is odd number of times test conducted is 66
4 then find the total number of students in
n (n − 2 ) the class.
(ii) if n is even
4 (a) 10 (b) 12
(c) 8 (d) 5
(iii)
(n − 1)2
if n is even 15. Consider a set S = { 1, 2, . . . , 100 }, two
4 elements p and q are selected from this set
(a) Only (i) & (ii) (b) Only (ii) & (iii) S such that 7p + 7q is divisible by 5, How
(c) Only (i) & (iii) (d) None of these many ways this selection can be made?
11. In Praxis Business School Kolkata, roll (a) 1250 (b) 2200
number of N students are given from 1 to (c) 2500 (d) 5000
N. Three students are selected from these 16. In a class number of students is 4k. If
N students such that their roll numbers the number of ways of selecting ‘k’ boys
are not consecutive in how many ways and ‘k’ girls out of these 4k students is
this selection can be done? maximum possible then which of the
(a)
(N − 2 )(N − 3)(N + 3) following statements are correct?
6 (i) Number of boys is equal to number
(N − 2 )(N − 3)(N − 4) of girls.
(b)
6 (ii) Number of ways of selecting 4 boys is
(N − 2 )(N − 3)(N + 2 ) same as number of ways of selecting
(c) (k – 4) girls.
6
(d) None of these (iii) Number of boys can not be equal to
12. Consider infinite number of letter C, A number of girls.
and T, in how many ways we can choose (a) Only (i) & (ii) (b) Only (i) & (iii)
‘k’ letters such that word CAT can not be (c) Only (ii) & (iii) (d) None of these
formed? 17. In an election the number of contestants
(a) 4(2k – 1) (b) 2(2k – 1) is one more than the number of seats. If a
(c) 3(2k – 1) (d) None of these particular voter can vote in 126 different
ways then find the number of candidates if
13. In an Mock test at Pioneer Career
a voter can give minimum 1 and maximum
Kolkata, there are n questions. In this
equal to the number of seats.
test 2k students gave wrong answers to
at least ( n – k) questions, where k = 0, (a) 7 (b) 4
1, 2, . . . , n. If the total number of wrong (c) 8 (d) None of these
62  Theory of Counting
18. A committee of 12 is to be formed from 9
women and 8 men.
(i) In how many ways this can be done
if at least five women have to be
included in a committee?
(ii) In how many of these committees
the women are in majority?
(ii) In how many of these committees
the women are in majority?
(a) 6062, 2702, 1134 (c) 225 (d) 224
(b) 6062, 2702, 1008
(c) 6062, 2520, 1134
(d) None of these [IIT JEE 1994]
19. A student is allowed to select at most n
books from n collection of (2n + 1) books.
If the total number of ways in which he
can select at least one books is 63, find
the value of n. [IIT JEE 1987]
(a) 7 (b) 3
(c) 6 (d) None of these
20. 7 relatives of a man comprises 4 ladies
and 3 gentlemen; his wife has also 7
relatives; 3 of them are ladies and 4
gentlemen. In how many ways can they
invite a dinner party of 3 ladies and 3
gentlemen so that there are 3 of man’s
relative and 3 of the wife’s relative?
[IIT JEE 1985]
(a) 485 (b) 440
(c) 490 (d) None of these
21. Let A and B be two sets containing 2
elements and 4 elements respectively.
The number of subsets of A × B having 3
or more elements is- [IIT JEE 2013]
(a) 220 (b) 219
(c) 211 (d) 256
22. If r, s, t are prime numbers and p, q
are the positive integers such that the
LCM of p, q is r2t4s2, then the number of
ordered pair (p, q) is [IIT JEE 2006]
(a) 252 (b) 254
23. In a certain test, ai students gave wrong
answers to at least i question where
i = 1, 2, …., k No student gave more that k
wrong answers. The total number of wrong
answer given is…. [IIT JEE 1982]
n n
(a) 2 − 1 (b) 2 + 1
n+ 1
(c) 2 −1 (d) None of these
24. A box contains two white balls, three
black balls and four red balls. In how
many ways can three balls be drawn from
the box if at least one black ball is to be
included in the draw?   [IIT JEE 1986]
(a) 64 (b) 54
(c) 25 (d) 42
25. Let E = {1, 2, 3, 4} and F= {1, 2} then the
number of onto function from E to F
[IIT JEE 2001]
(a) 14 (b) 16
(c) 12 (d) 8

Response Grid
1. a b c d 2. a b c d 3. a b c d 4. a b c d 5. a b c d
6. a b c d 7. a b c d 8. a b c d 9. a b c d 10. a b c d
11. a b c d 12. a b c d 13. a b c d 14. a b c d 15. a b c d
16. a b c d 17. a b c d 18. a b c d 19. a b c d 20. a b c d
21. a b c d 22. a b c d 23. a b c d 24. a b c d 25. a b c d

2
Concept Eliminator (CE)
Ideal Time Revise your concept (Maths Olympiad
Just solve it or tougher questions)
1. 30 players from India, China and Australia
participated in world chess tournament.
Number of players from India is 3 more
than the number of players from China.
In tournament players from same country
are not allowed to play against each other.
Find the maximum number of matches
that was conducted in the tournament if
no two player plays against each other
more than once.
(a) 297 (b) 292
(c) 144 (d) None of these
2. In the previous question if number of
matches is maximum then what is the
ratio of number of players from India,
Australia?
(a) 3:4 or 4:5 (b) 1:1 or 3:4
(c) 1:1 or 4:5 (d) None of these
3. In a fruit Basket there are n identical
apples, n identical bananas and n
distinct fruits, If k is the number of ways
in which n fruits can be selected from
the fruit basket then which one of the
following is the value of k?
(a) (n + 1)2n – 1 (b) (n2)(2n – 1)
(c) (n + 2)(2n – 1) (d) None of these
4. During 1st stage of the round robin
stage of Hockey world cup each country
played against each other and scores
of Pakistan, Srilanka, Bangladesh and
China was 4, 4, 4 and 4.5 respectively
while other participants got equal points.
As per the rule of the tournament winner
gets 1 point, looser gets 0 while 0.5 points
awarded to both the teams in case of a tie,
then what is the ratio of average points
scored by other countries to the number
of countries?
Selection (Combination)  63
(a) 27:54 (b) 29:54
(c) 31:54 (d) None of these
5. In an election of Mess Committee
member at Praxis is business school,
number of vacancy was ‘n’ and number
of participants was ‘n+k’ there are two
types of voting system as explained below
Type 1: A voter can vote for minimum 1
and maximum ‘n’ candidates.
Type 2: A voter can vote for minimum 1
and maximum ‘k–1’ candidates.
If in type 1 a voter can vote in 3989
different ways while in Type 2 a voter
can vote in 105 different ways then find
the value of ‘n–k’
(a) 12 (b) 14
(c) 13 (d) None of these
6. Consider n identical toys of weight w,
when it is weighed taken k number of
toys at a time then sum of all the possible
results is 11P, and when weighed in
‘k+1’ number of toys at a time then sum
of all the possible results is 7P then find
the minimum possible value of n.
(a) 19
(b) 18
(c) 17
(d) Can not be determine
7. This question is based on Regional Maths
Olympiad -
Consider a set X = { 1, 2, 3, …, 9, 10}.
What is the number of pairs {A, B} such
that A ⊆ X and B ⊆ X also A ≠ B and
A ∩ B = { 2, 3, 5, 7 }
(a) 36 (b) 63
6
(c) C3 (d) None of these
64  Theory of Counting

Solutions
Concept Deviator (CD)
1. (d) 2. (b) 3. (b) 4. (a) 5. (a) 6. (c)
7. (b) 8. (c) 9. (b) 10. (a) 11. (c) 12. (c)
13. (a) 14. (a) 15. (c) 16. (a) 17. (a) 18. (a)
19. (b) 20. (a) 21. (b) 22. (d) 23. (a) 24. (a)
25. (a)

1. (d) Given set of numbers is { 1, 2,
3….100}
Let the 3 numbers in A.P be p, q and
r then 2q = p + r, hence p + r must
be even that means both of them are
either even or both of them are odd.
Case (i): When both of them are odd
then these 2 can be selected from
{1, 3, 5,… 97, 99} i,e 50 odd integers.
Number of ways of selecting a and c
out of 50 odd integers is 50C2 .
Case (ii): When both of them are even
then these 2 can be selected from
{2, 4, 6, …. , 98, 100} i,e 50 even
integers. Number of ways of selecting
a and c out of 50 even integers is 50C2 .
So total number of ways is
50 C2 + 50C2 = 250C2
2. (b) Given set of numbers is
{1, 2, 3….100}
Let the 3 numbers in A.P be p, q and
r then 2q = p + r hence p + r must
be even that means both of them are
either even or both of them are odd.
Case (i): When both of them are odd then
these 2 can be selected from {1, 3,
5,… 97, 99, 101} i,e 51 odd integers.
Number of ways of selecting a and c
out of 51 odd integers is 51C2 .
Case (ii): when both of them are even
then these 2 can be selected from {2,
4, 6, …. , 98, 100} i,e 50 even integers.
Number of ways of selecting a and c
out of 50 even integers is 50C2 .
So total number of ways is 51C2
+50C2
Now prove yourself:
The number of ways in which three
numbers in A. P can be selected from a set
of n integers {1, 2, 3, …..n} is given by-
Case (i) when n is odd
(n – 1)2
4
(n)(n − 2 )
Case (ii) when n is even
4
3. (b) Let us assume n numbers as a1, a2,
…an
Then possible selections are (a1,
a2,a3), (a2, a3,a4 ), … (an–2, an–1,an ),
so there are n–2 ways we can select
such three numbers.
4. (a) Without any restriction we can select
3 out of n in nC3ways , but from
previous question with restriction
we can select in n–2 ways, hence
in this case (with restriction) total
number of ways is nC3 – n + 2.
 Selection (Combination)  65
5. (a) Total number of dance performance is 10C2 = 45, so Mr. Kartick has to select 10
performances from 45 that can be done in 45C10 ways.
6. (c) From the given conditions we have following cases:

Operations HR Marketing No. of ways

Case (i) 3 (in 6C3 = 20 ways ) 4(in 6C4 = 15 ways) 5(in 6C5 = 6 ways) 20 × 15 × 6 = 1800

Case (ii) 2 (in 6C2 = 15 ways ) 4(in 6C4 = 15 ways) 6(in 6C6 = 1 way) 15 × 15 × 1 = 225

So total number of ways is 1800 + 225 = 2025

7. (b) Here in this case we have following cases:

Physics (4) Chemistry (5) Maths (6) No of ways

Case (i) 2(in 4C2 = 6 ways) 2(in 5C2 = 10 ways) 3(in 6C3 = 20 ways) 6 × 10 × 20 = 1200

Case (ii) 2(in 4C2 = 6 ways) 3(in 5C3 = 10 ways) 2(in 6C2 = 15 ways) 6 × 10 × 15 = 900

Case (iii) 3(in 4C3 = 4 ways) 2(in 5C2 = 10 ways) 2(in 6C2 = 15 ways) 4 × 10 × 15 = 600

So total number of ways is 1200 + 900 + 600 = 2700

8. (c) Let the number of contestants is ‘n’
then a particular voter can give 1 or
2 or 3 or … (n–1) votes, so number of
ways a voter can vote is nC1 + nC2 +
….. + nCn–1
Since nC0+ nC1 + nC2 + ….. + nC
n–1
+nCn = 2n
Hence nC1 + nC2 + ….. + nCn–1
= 2n – nC0 – nCn = 2n–2
So total number of ways in which a
voter can vote should be in 2n–2 form,
from the given options only 1022 is
in this format and hence the answer
9. (b) From the solution of previous
question maximum number of ways
that a student can vote is 2n – 2 if
number of students is ‘k’ then total
number of ballot papers is k(2n – 2)
From the given options 1230 = 30 ×
41 here 30 is in the format of 2n – 2
hence the correct answer.
None of the other options are in this
format.
10. (a) Given number are 1 ,2 ,3 , . . . , n
Let the three selected numbers in
A.P. be a , b , c , then a + c = 2b
From this we can say that a + c
should be an even integer. This is
possible only when both a and c are
odd or both are even.
Case I: When n is even we can assume
n = 2m.
Then number of odd numbers =
number of even numbers = m.
Then number of selections of a and c
from m odd numbers = mC2.
And number of selections of a and c
from m even numbers =mC2.
Hence total number of ways in this
case mC2 + mC2= 2.mC2 = m ( m – 1)
66  Theory of Counting
 n   n   n(n  – 2 )  ‘k’ letters which are C or T = 2k
=    – 1  =   including the case when all the ‘k’
 2  2  4
Case II. When n is odd we can assume
that n = 2m + 1
Then number of odd numbers = m +
1 and number of even numbers = m
Required number in this case
= m + 1C2 + mC2
=
( m +  1)m   +  m( m −1)  =  m2
2 2
 1
2
2
=    n −  =  ¼  ( n  −1)
 2
Hence statement (i) and (ii) is true.
11. (c) 1st consider the number of ways
when all the three are consecutive
roll numbers. N roll numbers are 1,
2, 3…. N then possible selection will
be (1, 2, 3), (2, 3,4)… (N–2, N–1, N)
Thus required number = n – 3 + 1 = n–2
Without restriction total number of
selections of 3 objects when there is
no restriction = NC3
Number of selections of 3 objects
which are consecutive = N–2
Required number = NC3–N – 2
N (N − 1)(N − 2 )
= – (N − 2 )
6
(N − 2 )(N − 3)(N + 2 )
  = 6
12. (c) The word CAT cannot be spelt if the
‘k’ selected letters do not contain at
least one of A , T and C.
Number of ways of selecting ‘k’ letters
which are A or T = 2k including the
case when all the ‘k’ letters are A or
all are T.
Similarly, number of ways of selecting
‘k’ letters which are A or C = 2k
including the case when all the ‘k’
letters are A or all are C.
And Number of ways of selecting
letters are A or all are T.
Similarly, number of ways of selecting
‘k’ letters when all are A, C and T
are 1k in each case.
Thus required number
= 2k + 2k + 2k – (1k + 1k + 1k)
= 3.2k – 3.1k = 3(2k – 1)
13. (a) From the given condition the number
of students answering at least r
questions incorrectly is 2 n–r.
Hence the number of students answering
exactly r ( 1 ≤ r ≤ n – 1)
questions incorrectly is 2n–1 – 2n– ( r + 1)
And, the number of students
answering all questions wrongly is
20 = 1.
Then,the total number of wrong
answers is 1(2n–1 – 2n–2) + 2 (2n–2
– 2n–3) + 3 (2n–3–2n–4) + … + (n–1)
(21–20) + n(20)
= 2n–1 + 2n–2 + … + 20 = 2n – 1 = 2047
⇒ n = 11.
14. (a) Let number of girls is ‘g’ then
Number of group having 4 boys and
1 girl = (4C4) × (gC1) = g
And number 4 of groups having 3 boys
and 2 girls = (4C3) × (gC2) = 2g (g – 1 )
Thus, total number of tests is
g + 2g(g – 1) = 66
or 2g2 – g – 66 = 0 only integral value
of g is 6
Hence total number of students is
4 + 6 = 10
15. (c) Since unit digit of 7k ends in 7, 9, 3
or 1 ( corresponding to k = 4x +1,
4x +2, 4x +3 and 4x respectively.)
Thus, 7p + 7q cannot end in 5 for any
values of p, q. So for 7p + 7q to be

divisible by 5, it should end in 0.
For 7p + 7q to end in 0, the forms of p
and q should be as follows:
p q
1 4x (Unit digit 1) 4y +2 (Unit digit 9)
2 4x + 1 (Unit digit 7) 4y + 3 (Unit digit 3)
3 4x + 2 (Unit digit 9) 4y (Unit digit 1)
4 4x + 3 (Unit digit 3) 4y +1 (Unit digit 7)
Thus, for a given value of m there
are just 25 values of n for which
7p + 7q ends in 0.
[For instance, if p = 4x, then q = 2, 6,
10, . . . , 98]
Selection (Combination)  67
Thus there are 100 × 25 = 2500
ordered pairs ( m, n) for which
7p + 7q is divisible by 5.
16. (a) If number of boys is b and that of
girls is g then b+g = 4k and (bCk)
(gCk) is maximum that is possible
when b = g = 2k hence statement
(i) and (ii) is true.
17. (a) Let the number of contestants is ‘n’
then a particular voter can give 1 or
2 or 3 or … (n–1) votes, so number of
ways a voter can vote is nC1 + nC2 +
….. + nCn–1
Since nC0 + nC1 + nC2 + ….. + nCn–1
+ nCn = 2n
Hence nC1 + nC2 + ….. + nCn–1
= 2n – nC0 – nCn = 2n – 2 = 126
Hence n = 7.

18. (a) We have following cases-

Cases Men Women No. of ways

Case (i) 8 4 (8C8)(9C4) = 1 × 126 = 126

Case (ii) 7 5 (8C7)(9C5) = 8 × 126 = 1008

Case (iii) 6 6 (8C6)(9C6) = 28 × 84 = 2352

Case (iv) 5 7 (8C5)(9C7) = 56 × 36 = 2016

Case (v) 4 8 (8C4)(9C8) = 70 × 9 = 630

Case (vi) 3 9 (8C3)(9C9) = 56 × 1= 56

So
(i) At least five women number of ways = 1008 + 2352 + 2016 + 630 + 56 = 6062
(ii) When women are in majority = 2016 + 630 + 56 = 2702
(iii) When men are in majority = 126 + 1008 = 1134
19.
(b) As per the given condition the number of books that the student can select is 0, 1, 2…
or n so number of ways is given by (2n+1C1) + (2n+1C2) + … (2n+1Cn–1) + (2n+1Cn) = 63
We know that (2n+1C0) + (2n+1C1) + (2n+1C2) + … (2n+1Cn) + … (2n+1C2n) + (2n+1C2n+1)
= 22n+1
So (2n+1C1)+ (2n+1C2)+ … (2n+1Cn–1)+ (2n+1Cn) = 26 – 1
Hence n = 3
68  Theory of Counting
20. (a) We can solve this question by making different cases:
Man’s Woman’s
Relative Relative
No. of ways
Ladies Male Ladies Males
(4) (3) (3) (4)
Case (i) 0 3 3 0 4C 3C × 3C 3 × 4C 0 = 1 × 1 × 1 × 1 = 1
0× 3

Case (ii) 1 2 2 1 4C 3C × 3C2 × 4C1 = 4 × 3 × 3 × 4 = 144

1× 2

Case (iii) 2 1 1 2 4C 3C × 3C1 × 4C2 = 6 × 3 × 3 × 6 = 324

2× 1

Case (iv) 3 0 0 3 4C 3C × 3C0 × 4C3 = 4 × 1 × 1 × 4 = 16

3× 0

Hence total number of ways is 1 + 144 + 324 + 16 = 485

Total number of ways is 485

21. (b) Since A × B will have 2 × 4 = 8 Total number of wrong answers

elements so required answer is
28 – 8C0 – 8C1 – 8C2 = 256 – 1 – 8 – 28
= 219
22. (d) Required number of ordered pair (p,
q) is (2 × 3 − 1) (2 × 5 −1) (2 × 3 − 1)
− 1 = 224.
= 1( 2 n − 1 – 2 n − 2  ) + 2 (2 n − 2 – 2 n − 3 )
+ …. + (n–1)  (2 1 – 2 0 ) + n 2
0
()
= 2 n − 1 +  2 n − 2 + … 2 1 +  2 0 =  2 n − 1 
24. (a) In this question we have 3 cases-

NOTE: Case (i): One black and two other then

number of ways is (3C1)(6C2) = 45
For details about this theory with variation
of questions refer to “Koncepts Of Numbers” Case (ii): One black and two other then
By Mr. Gajendra Kumar, Published by number of ways is (3C2)(6C1) = 18
Disha Publication.
Case (iii): All the three are blacks, then
23. (a) The number of students answering number of ways is (3C3) = 1
exactly k questions wrongly is Total number of ways is 45 + 18 + 1 = 64
2 n − k – 2 n − k −1 .
25. (a) Total number of function 42 = 16
The number of students answering
all the questions wrongly is 20 Number of onto function is 16 – 2 = 14
 Selection (Combination)  69

Concept Eliminator (CE)

1. (a) 2. (b) 3. (c) 4. (b) 5. (d) 6. (a)
7. (d)

1. (a) Total number of players = 30 So the number of matches is

Let number of players from China is 2
−  3 p +  51 p  +  81 and it will attain a
‘p’ then that from India is ‘p+3’ and maximum value at
number of students from Australia 51
is ‘q’ then from the given condition p= − = 17/2 = 8.5
−6
P + (p + 3) + q = 30 or 2p+q = 27 …(i) But p must be integer hence possible
From the given condition number of value of p is 8 or 9
matches are as follows At p = 8 total number of matches
Number of matches between player of −  3 p 2 +  51 p  +  81 is 297
India and China is p+3C1 × pC1 = p(p+3)
At p = 9 total number of matches
Number of matches between player −  3 p 2 +  51 p  +  81 is 297
of India and Australia is p+3C1 × qC1
Hence maximum number of matches
= q(p+3)
is 297 when p = 8 or 9.
Number of matches between player of
China and Australia is pC1 × qC1 = pq 2. (b) Here we have 2 cases:

So total number of matches is Case (i): When p = 8, then players from

India, China and Australia is 11,
p(p + 3) + q(p + 3) + pq = p(p + 3) +
8 and 11 or required ratio is 1:1.
(27 – 2p)(p + 3) + p(27 – 2p)
Case (ii): When p = 9, then players from
=  p 2 +  3 p  +27 p  +81 – 2 p 2 − 6 p  +  27 p  −2 p 2 India, China and Australia is 12, 9
and 9 or required ratio is 4:3.
= −  3 p 2 +  51 p  +  81

3. (c) Given that there are n identical apples, n identical bananas and n distinct fruits, and
we have to select n articles, we have following cases
Number of
Apples & banana Banana
ways
Number of apples & banana Number of banana is 0
Case (i) (n+1)(nC0)
is n (n+1 ways) (nC0 Ways)
Number of apples & banana Number of banana is 1
Case (ii) (n)(nC1)
is n–1 (n ways) (nC1 Ways)
Number of apples & banana Number of banana is 2
Case (iii) (n–1)(nC2)
is n–2 (n–1 ways) (nC2 Ways)
Number of apples & banana Number of banana is n
Case (n+1) (1)(nCn)
is 0 (1 ways) (nCn Ways)

Total number of ways is (n+1)(nC0) + (n)(nC1) + (n–1)(nC2) + …… + (2)(nCn–1) + (1)(nCn)

From concept of binomial expansion this is equal to (n+2)(2n–1)
70  Theory of Counting
4. (b) Let ‘n’ is the number of teams Adding equations (i) and (ii) we will
participated in the tournament get n+kC + n+kC + n+kC + …..+
1 2 3
then number of matches are n+kC n+kC n+kC
nC = n(n–1)/2. Since each match n + n+1 + n+2 + ….. +
2 n+kC
will give 1 point hence total number n+k–2 + n+kCn+k–1
of points in the 1st stage is n(n–1)/2, = 3989 + 105 = 4094
given that 4 teams got points 4, 4,
Or (2n+k) –2 = 4094 or n+k = 14
4, and 4.5 i.e 17.5 points in total.
Let other members got k points the Now 14C1 = 14 and 14C2 = 91 hence
14C + 14C = 104 so k–1 = 2 or k = 3
as per the given condition n(n–1)/2 = 1 2
(n–4)k + 17.5 or n(n–1) = 2k(n–4) + 35 hence n = 14–3 = 11 and n–k = 11–3 = 8.
Here LHS is even hence RHS should 6. (a) Total weight when ‘k’ toys are taken
also be even it is possible when 2k is is (nCk)(kw) and total weight when
odd, now from slight trial and error ‘k+1’ toys are taken is (nCk+1)(k+1)w
we can find that n = 27 and k = 14.5 From the given condition (nCk)(kw)/
Hence required ratio is 14.5 : 27 or (nCk+1)(k+1)w =
k+1 k k
× =
29 : 54 n−k k+1 n−k
5. (d) As per the given condition – = 11/7
In type 1: n+kC1 + n+kC
2 + n+kC +
3
Or 7k = 11n – 11k or 18 k = 11n so n
…..+ n+kCn = 3989 ...(i) must be a multiple of 19 and hence
In type 2: n+kC1 + n+kC + n+kC + the minimum value of n is 19.
2 3
…..+ n+kCk–1 = 105 7. (d) Since it is given that A ∩ B = { 2, 3,
But we know that n+kC + n+kC + 5, 7 } so remaining numbers {1, 4, 6,
1 2
n+kC n+kC 8, 9, 10} can be a member of either
3 + ….. + k–1
= n+kCn+k–1 +n+kCn+k–2 + n+kCn+k–3 + set A or set B or neither in set A nor
….. + n+kCn+1 = 105 in set B, so each member of set {1,
4, 6, 8, 9, 10} has 3 options so total
or we can re-write it as
number of ways/ pairs is 36 but since
n+kC + n+kCn+2 + ….. + n+kCn+k–2
n+1 A ≠ B hence required number of
+ n+kCn+k–1 = 105 ...(ii) ways is 36 – 1
 3
Geometrical Construction  71

Geometrical
Construction

Topics Covered

 Formation of geometrical figures

 Understanding of Chess Board

 Problems related to grid

Part A: Topic Number of Questions

Solved Example 10
Concept Applicator 15
Concept Builder 15
Concept Cracker 20
Part B: Topic Number of Questions
Concept Deviator 14
Concept Eliminator 9
Total 83
72  Theory of Counting
Part A
Formation on
Concept 1 Geometrical Figures
In this section we are going to learn, the number
of ways or the number of polygons that can be
formed from the given points in the plane.
Number of Straight Lines from given ‘n’
Points
Consider ‘n’ points in a plane and we need to
find the number of straight lines that can be
draw from these ‘n’ points. In order to draw a
straight line we have to select 2 points and join
them, so now question is in how many ways we
can select 2 points from ‘n’ points. In simple
line this question can not be answered unless it
is given that no three of which are collinear.
If no three of them are collinear then number
of straight lines is nC2.
Example 1:  How many straight lines can
be drawn from the 15 points in a plane
if no three points are in a straight line?
Solution:  To draw a straight line we need to
select 2 points, so total number of straight
lines is 15C2
Number of Straight Lines from given ‘n’
Points out of them Exactly ‘k’ Points are
Collinear
If no three of them are collinear then number
of straight lines is nC2 but ‘k’ lines are in
same straight lines hence we will not get kC2
straight lines hence total number of straight
lines is nC2 – kC2+1
Example 2:  How many straight lines
can be drawn from the 15 points in a
plane if only 5 out of 15 points are in a
straight line?
Solution:  To draw a straight line we need to
select 2 points, in this case total number of
straight lines is given by
15C – 5C + 1 = 105 – 10 + 1 = 96.
2 2
Number of Triangles from given ‘n’ Points if
no Three of Them are Collinear
To draw a triangles we need three non
collinear points, and from ‘n’ points 3 points
can be selected in nC3 ways.
Example 3:  How many triangles can be
drawn from the 15 points in a plane if
no three points are in a straight line?
Solution:  To draw a triangle we need to select 3
points, so total number of triangle is 15C3.
Number of Polygons (of k sides) from given
‘n’ Points if no Three of Them are Collinear
To draw a polygon (of k sides) we need ‘k’
points as vertices such that no three of them

QR Code / Video Link

For Smart phone/ Tablet users

Video Link for Desktop/Laptops users http://dishapublication.com/video-resources


are collinear points, and from ‘n’ points k
points can be selected in nCk ways.
Example 4:  How many hexagons can be
drawn from the 15 points in a plane if
no three points are in a straight line?
Solution:  To draw a hexagons we need to
select 6 points, so total number of hexagons
is 15C6.
Number of Diagonals of a Polygon of ‘n’
Sides
Since number of sides are ‘n’ hence number
of vertices is also ‘n’. To draw a diagonal we
have to select 2 points from ‘n’ points and that
can be done in nC2 ways, but out of those n
Concept 2 Chess Board
A chess board has 8 rows and 8 columns. Every
alternate square is coloured with white and
back. Figure below shows the chess board.
QR Code / Video Link
For Smart phone/ Tablet users
Video Link for Desktop/Laptops users http://dishapublication.com/video-resources
Geometrical Construction  73
straight lines are sides of polygon and that
can not be treated as diagonals hence number
n (n − 1) n (n − 3)
of diagonals is nC2 – n = –n= .
2 2
Example 5:  What is the number of
diagonals of an octagon?
Solution:  Number of sides in an octagon is
8 hence number of diagonals is given by
8 × 5/2 = 20
Example 6:  If number of diagonals of
polygon is 54 then how many sides
that polygon has?
Solution:  Since number of diagonals of a polygon
with n sides is n (n − 3) =  54 or n = 12.
2
Number of Squares in a Chess Board
To calculate the number squares in the chess
board we have to see the size of squares:
Number of squares of size 1 × 1 is 8 × 8 = 64
Number of squares of size 2 × 2 is 7 × 7 = 49
and so on
Number of squares of size 8 × 8 is 1 × 1 = 1
Hence total number of squares in a chess
board is 12 + 22 + …. + 82 = 204.
Number of Rectangles in a Chess Board
To calculate the number rectangles in the
chess board we have to select 2 straight lines
74  Theory of Counting
from 9 straight line, this can be done in 9C2
ways similarly from another set parallel line
we can select 2 straight lines from 9 straight
line, this can be done in 9C2 ways hence total
number of rectangles is 9C2 × 9C2 = 1296
In a chessboard of n × n:
Number of squares = 12 + 22 + ... + n2
n(n + 1)(2n + 1)
= Solution:  Number of rectangles in a chess
6 board of 10 × 10 is given by
Number of rectangles = n + 1C2 × n + 1C2
 n(n + 1) 
2
= 
 2

  2 
Concept 3 Grid Based Problems
Generally two types of questions can be asked
based on a grid,
Type 1: Number of rectangles, squares, etc.
Type 2: Number of shortest path from one
corner to diagonally opposite corner.
Number of Rectangles
• If the grid is 1 × 1,
there is 1 rectangle.
• If it is 2 × 1,
There are 2 + 1 = 3 rectangles (2 rectangles
of size 1 × 1, and 1 rectangle of size 1 × 2)
• If it is 3 × 1,
Example 7:  Find the number of squares
in a chess board of 10 × 10.
Solution:  Number of squares in a chess board
of 10 × 10 is given by
10 × 11 × 21
12 + 22 + … + 102 = = 385.
6
Example 8:  Find the number of rectangles
in a chess b2oard of 10 × 10.
2
10 × 11  = 552 = 3025.
 
There are 3 + 2 + 1 = 6 rectangles
(3 rectangles of size 1 × 1, 2 rectangle of
size 1 × 2 and 1 rectangle of size 1 × 3).
Similarly, if grid is n × 1: the number
of rectangles is n + (n – 1) + (n – 2) ... + 1
n(n + 1)
= .
2
Similarly consider a chessboard of n × m
with n rows and m columns:
Since in a chessboard of n × m with n rows and
m columns, number of vertical lines is (m + 1)
and number of horizontal lines is (n + 1) to
draw a rectangle we have to select 2 vertical
and 2 horizontal straight lines and that can
be done in m + 1C2 × n + 1C2 ways.
Number of rectangles = m + 1C2 × n + 1C2
m(m + 1) n(n + 1) mn(m + 1)(n + 1)
= × =
2 2 4
Number of squares in a chessboard of n × m
with n rows and m columns (m > n).
 Geometrical Construction  75
Lets consider an n × n chessboard, number of 8 × 10 × 9 × 11 = 1980
squares in this is
4
n(n + 1)(2n + 1) 2n3 + 3n2 + n
=
6 6 Number of shortest path
Now, if we add one row of squares at the
bottom, making it an n + 1 by n rectangle,
consider of the dots (or vertices) formed at the
Let there are h number of horizontal steps
corners of the little squares we have added
to make the bottom row. For every pair of and v number of vertical steps then number of
newly-added dots, we will get one new square. ways to reach from one corner to other corner
So the total number of new squares we can is h + vCh = h + vCv.
find in the larger rectangle is the number
Here in the below figure number of horizontal
of pairs of n + 1 dots (or vertices), which is
steps are h = 7 and number of vertical steps
n +1 n(n + 1)
C2 = . v = 5. Then number of ways to reach one corner
2
from the other is given by 7 + 5C7 = 7 + 5C5.
Alternately by adding a new row of n little
squares, we will get within the large rectangle The reason behind this is that if we have total
one new n × n square, two new n – 1 × n – 1 h + v steps, out of these steps if we fix all
squares, three new n – 2 × n – 2 squares, etc. horizontal steps then we have only one way to
So the number of new squares added this way select the vertical step, hence total number of
is the sum of the first n counting numbers, way is given by selecting h steps out of h = v
which is n +1n(n + 1) . steps OR by selecting v steps out of h = v steps
C2 =
2 or we can write h + vCh = h + vCv.
Now, add another row of squares at the bottom,
making it an n + 2 by n rectangle. This adds Example 10:  Consider a grid having 8
the same number of new squares,which is horizontal and 10 vertical paths what
n +1 n(n + 1) is the minimum number of ways a
C2 = .
2
person can travel from one corner to
So the total number of squares that can be
found within an m × n chessboard (m > n) is diagonally opposite corner travelling
given by this formula: minimum distance?

2n3 + 3n2 + n Solution:  Here h = 8 and v = 10, hence

+ (m − n)n + 1 C2
6 required number of ways is h + vCh = 18C8.
2n3 + 3n2 + n (m − n)(n)(n + 1)
= +
6 2
Example 9:  Find the number of rectangles
in a chess board of 8 × 10.
Solution:  Number of rectangles in a chess
board of 10 × 10 is given by
76  Theory of Counting
1
Concept Applicator (CA)
Ideal Time
15 Min.
1. How many distinct lines can be drawn
through 8 points, no three of which are
collinear?
(a) 210 (b) 240
(c) 120 (d) None of these
2. How many distinct lines can be drawn
through 8 points, exactly 4 of which are
collinear?
(a) 23 (b) 24
(c) 18 (d) None of these
3. How many distinct lines can be drawn
through 8 points, 4 of which are on a
straight line and remaining 4 are on
other straight line which is parallel to
the 1st straight line?
(a) 23 (b) 24
(c) 18 (d) None of these
4. How many distinct triangles can be
drawn with their vertices selected from
8 points, no three of which are collinear?
(a) 23 (b) 28
(c) 48 (d) None of these
5. How many distinct triangles can be
drawn with their vertices selected from 8
points, exactly 4 of which are collinear?
(a) 52 (b) 28
(c) 56 (d) None of these
6. How many distinct triangles can be
drawn with their vertices selected from 8
points, exactly 4 of which are on one line
Apply your concepts with easy and
conceptual questions
and remaining 4 are on other parallel
line?
(a) 52 (b) 28
(c) 48 (d) None of these
7. How many triangles can be formed by
joining the vertices of a polygon of 10
sides?
(a) 210 (b) 240
(c) 120 (d) None of these
8. What is the number of diagonals of a
polygon with 13 sides?
(a) 45 (b) 55
(c) 65 (d) None of these
9. What is the number of quadrilaterals
that can be formed by joining the vertices
of a polygon of side ‘K’?
(a) KC K – 2C
4 (b) 4
(c) (K – 2C )(K – 2C 2) (d) None of these
2
10. Find the number of squares which can be
formed on a chessboard.
(a) 64 (b) 204
(c) 226 (d) None of these
Consider a set of 6 non-overlapping triangles
in a plane such that no three points in the
plane is collinear.
11. If all the possible triangles are drawn
taking vertices of these triangles such
that not more than one point is selected
from a triangle then find the total number
of triangles hence drawn?

(a) 6C3 × 3C1
(b) 18C3 – 6C3 × 3C1 × 3C1 × 3C1
(c) 6C3 × 3C1 × 3C1 × 3C1
(d) None of these
12. Find the total number of new triangles
that can be drawn from this system of
triangles?
(a) 18C3 (b) 18C3 – 6C1
(c) 18C3 – 6C3 (d) None of these
13. Consider a set of two hexagons (Total 12
points on vertices), what is the maximum
number of quadrilaterals can be drawn
from these 12 points as vertices such
that at least one point is selected from
each hexagon?
Geometrical Construction  77
(a) 2 × 6C3 × 6C1 + 6C2 × 6C2
(b) 6C3 × 3C1 + 6C2 × 3C2
(c) 2 × 6C3 × 3C1 + 2 × 6C2 × 3C2
(d) None of these
14. Consider a square along with its 2
diagonals, how many triangles is form
by this system?
(a) 6 (b) 9
(c) 8 (d) None of these
15. Find the number of diagonals of a polygon
with 10 sides.
(a) 35 (b) 40
(c) 42 (d) None of these

Response Grid
1. a b c d 2. a b c d 3. a b c d 4. a b c d 5. a b c d
6. a b c d 7. a b c d 8. a b c d 9. a b c d 10. a b c d
11. a b c d 12. a b c d 13. a b c d 14. a b c d 15. a b c d

2
Concept Builder (CB)
Ideal Time Revise your concepts with questions
25 Min. medium difficulty level questions

1. Consider 2 parallel lines PQ and RS. Line
PQ has two points A and B while line RS
has 8 points. How many triangles can be
formed taking these 10 points as vertices
of triangle?
(a) 64 (b) 25
(c) 69 (d) None of these
2. Consider 2 parallel lines PQ and RS.
Line PQ has two points A and B while
line RS has 8 points. How many triangles
can be formed taking these 10 points as
vertices of triangle such that either A
or B is selected?
(a) 64 (b) 25
(c) 69 (d) None of these
3. A polygon gas 54 diagonals then find its
number of sides.
(a) 11 (b) 12
(c) 13 (d) None of these
78  Theory of Counting
4. Consider a polygon of ‘n’ sides if number (a) PC × QC2 + PC2 × RC2 + QC × RC2
2 2
of diagonals of polygon is 54 then how (b) PC × QC1 × RC1 + PC1 × QC2 × RC1
2
many triangles can be drawn from
taking vertices of polygon as vertices of + PC1 × QC1 × RC2
triangle? (c) (PC2 × QC1 × RC1 + PC1 × QC2 × RC1
(a) 144 (b) 72 + PC1 × QC1 × RC2) + ( PC2 × QC2
(c) 150 (d) None of these + PC2 × RC2 + QC2 × RC2)
5. Consider a set of ‘P’ parallel lines and (d) None of these
another set of ‘Q’ parallel lines then what Consider a set of parallel paths as shown
is the number of vertices of parallelograms in the figure below, with 6 horizontal and 8
thus form by these parallel lines? vertical paths.
(a) PC + QC2 (b) PC × QC2
2 2
(c) PQ (d) None of these
Consider three set of parallel lines having P, Q
and R points respectively and no three points
apart from the given points are collinear.
6. If K represents number of straight lines
that can pass through this system of
P + Q + R points excluding the three 9. Find the number of paths from one
original straight lines then how many of corner to diagonally opposite corner of
the following represents correct value of the network such that distance travelled
is minimum.
K?
P + Q + RC (a) 14C5 (b) 14C6
(i) – (PC2 + QC2 + RC2)
2
(c) 8C6 (d) None of these
(ii) PC1 × QC1 + PC1 × RC1 + RC1 × QC1
10. Let a new diagonal is constructed as
(iii) 2(PC1 × QC1 + PC1 × RC1 + RC1 × QC1) shown in the figure, find the number
(iv) PQ + PR + RQ of paths from one corner to diagonally
opposite corner (From A to B) of the
(a) 1 (b) 2
network such that distance travelled is
(c) 3 (d) 4 minimum.
7. What is the number of triangles that can A
be formed from the system of P + Q + R
points?
(a) P + Q + RC – (PC3 + QC3 + RC3) + 3
3
(b) P + Q + RC – 3(PC3 + QC3 + RC3)
3
(c) P + Q + RC – (PC3 + QC3 + RC3) B
3
(d) None of these (a) 12 (b) 24
8. What is the number of quadrilaterals (c) 36 (d) None of these
that can be formed from the system of Consider a square with 4 points on each side
P + Q + R points? (no points on the vertices).
 Geometrical Construction  79

11. How many straight lines can be drawn (a) 1442 (b) 1624
from these 16 points such that each line (c) 1152 (d) None of these
passes through exactly 2 of the given 14. Consider vertices of a hexagon and mid
points? points of its sides (total 12 points). How
(a) 4C2 × 4C1 × 4C1 many triangles can be drawn taking these
(b) 4C2 × 4C2 × 4C1 12 points as vertices of the triangle?
4C (a) 12C – (3C3) (b) 12C – 6(3C3)
(c) 2 × 4C 2 × 4C 2 3 3
(c) 12C + 6(3C3) (d) None of these
(d) None of these 3

12. How many triangles can be drawn from
these 16 points as vertices?
(a) 144 (b) 256
(c) 544 (d) None of these
13. How many quadrilaterals can be drawn
from these 16 points as vertices?
15. If number of triangles that can be drawn
from the given set of points as vertices is
56 then find the number of straight lines
that can be drawn from these points?
(a) 28 (b) 21
(c) 45 (d) None of these

Response Grid
1. a b c d 2. a b c d 3. a b c d 4. a b c d 5. a b c d
6. a b c d 7. a b c d 8. a b c d 9. a b c d 10. a b c d
11. a b c d 12. a b c d 13. a b c d 14. a b c d 15. a b c d

3
Concept Cracker (CC)
Ideal Time Boost up your confidence with good
40 Min. questions

1. There are 15 points in a plane out of
which 6 of them are collinear. Find the
number of quadrilaterals formed by
joining these points as vertices?
(a) 1350 (b) 1360
(c) 1372 (d) None of these
2. The sides AB, BC and CA of a triangle
ABC have, 3, 4 and 5 interior points
respectively on them. Find the number
of triangles that can be constructed using
given interior points as vertices.
(a) 215 (b) 205
(c) 219 (d) None of these
80  Theory of Counting
3. Consider 2 parallel lines PQ and RS.
Line PQ has three points A, B and C
while line RS has 7 points. How many
triangles can be formed taking these 10
points as vertices of triangle such that A
is not selected with B or C?
(a) 70 (b) 25
(c) 69 (d) None of these
4. Consider a set of ‘P’ parallel lines and
another set of ‘Q’ parallel lines then what
is the number of parallelogram thus form
by these parallel lines?
(a) PC2 + QC2 (b) PC2 × QC2
(c) PQ (d) None of these
5. Consider three set of parallel lines in a
plane containing ‘a’ , ‘b’ and ‘c’ parallel
lines respectively. What is the highest
number of parallelograms that can be
formed with these set of parallel line?
(a) 14 [ab(a – 1)(b – 1) + bc(b – 1)(c – 1)
+ ac(a – 1)(c – 1)]
(b) 14 [abc + (a – 1)(b – 1)(c – 1)]
(c) 14 [ab + bc + ca + (a – 1)(b – 1)(c – 1)]
(d) None of these
6. Let Tn denotes the number of triangles
which can be formed by using the vertices
of a regular polygon of ‘n’ sides. Which
one of the following could be the value of
Tn + 1 – Tn – 1 ?
(a) 142 (b) 144 (iii) Number of polygon with 11 sides
(c) 148 (d) one of these
7. Consider ‘n’ points in a plane, if number of
heptagon (polygon with 7 sides) is equal
to the number of Octagons (polygon with
8 sides) then find the number of triangles
that can be drawn from these n points.
(a) 142 (b) 455
(c) 289 (d) None of these
8. Find the number of non-congruent
rectangles on a chess board.
(a) 8C2 – 8C8 (b) 8C1 + 8C2
8 7
(c) C2 – C2 (d) None of these
9. A parallelogram is cut by two set of parallel
lines parallel to sides of parallelogram.
Each set has ‘m’ parallel lines. What is
the total number of parallelograms thus
formed?
{(m + 1)2 }
(a)
4
{(m + 1)2 (m + 2)2 }
(b) 4
(c) mC × m + 1C2
2
(d) None of these
10. Consider n points in a plane no three
of which are collinear and the ratio of
number of hexagon and octagon that can
be formed from these n points is 4:13
then find the value of n.
(a) 14 (b) 20
(c) 28 (d) None of these
11. Consider n points in a plane no three
of which are collinear and the number
of polygon with 15 sides and number
of polygon with 30 sides are same then
which one of the following is correct?
(i) If K is the number of a polygon with
P sides then for maximum value of K
the value of P is 23.
(ii) Number of polygon with 10 sides
and number of polygon with 25 sides
are same.
and number of polygon with 34 sides
are same.
(a) Only (i) and (ii)
(b) Only (i) and (iii)
(c) Only (ii) and (iii)
(d) None of these
12. Consider 35 points in a plane such that
no. 3 of them are collinear. A students is
told to 1st draw all the possible polygons
of same number of sides and then draw
all the possible diagonals. What is the
 Geometrical Construction  81
maximum number of such diagonals (c) 2 (d) None of these
possible? (If a particular line is diagonal 16. If ‘P’ is the maximum number of
of two polygons then count both of them.) quadrilaterals that can be drawn from
(a) 119(35C17) (b) (35C17) these nk points as vertices then how
(c) (35C17) × (35C17) (d) None of these many of the following best represents
13. Consider a set of n points in a plane, If the value of P ?
number of polygon of K sides that can be (i) nC (kC × kC1 × kC1 × kC1) + (nC3)(3 ×
4 1
formed from these n points as vertices kC × kC1 × kC1 ) + nC2 × kC2 × kC2
2
is more than that of polygon of (K – 3) nkC
sides and K + 3 sides. How many distinct (ii) 4 – n[kC4 + kC3 × k(n – 1)]
(iii) nkC – k[nC4 + kC3 × k(n – 1)]
values of n exist? [for a given set of n & K] 4

(a) 4 (b) 6 (a) 0 (b) 1

(c) 8 (d) None of these
Consider a polygon of n sides with K points on
each side (no points on the vertices).
14. How many straight lines can be drawn
from these ‘nk’ points such that each line
passes through exactly 2 of the given
points?
(a) nC2 × kC1 × kC1
(b) nC2 × kC2 × kC2 (c) 2025 (d) None of these
(c) nC2 (kC1 + kC1) 19. Find the number of rectangles in a chess
(d) None of these
15. If ‘P’ is the maximum number of triangles
that can be drawn from these nk points as
vertices then how many of the following
best represents the value of P ?
(i) (nC3 × kC1 × kC1 × kC1) + 2(nC2 )(kC2 × kC1)
(ii) nkC – n(kC3)
3
(iii) (nC3 × kC1 × kC1 × kC1) + 2(nC3 )(kC2 × kC1)
(a) 0 (b) 1
(c) 2 (d) None of these
17. Find the number of rectangles in a chess
board of 10×10 grid instead of 8×8 grid.
(a) 4225 (b) 3025
(c) 2025 (d) None of these
18. Find the number of squares in a chess
board of 10 × 12 grid instead of 8 × 8 grid.
(a) 4225 (b) 3025
board of 10 × 12 grid instead of 8 × 8 grid.
(a) 4225 (b) 3025
(c) 2025 (d) None of these
20. In how many ways can you place 2 rooks
on a chessboard such that they are not in
attacking positions, if rooks can attack
only in a same row or in a same column?
(a) 1568 (b) 784
(c) 3136 (d) None of these

Response Grid
1. a b c d 2. a b c d 3. a b c d 4. a b c d 5. a b c d
6. a b c d 7. a b c d 8. a b c d 9. a b c d 10. a b c d
11. a b c d 12. a b c d 13. a b c d 14. a b c d 15. a b c d
16. a b c d 17. a b c d 18. a b c d 19. a b c d 20. a b c d
82  Theory of Counting
Concept Applicator (CA)
1. (d) 2. (a) 3. (c) 4. (d) 5. (a) 6. (c)
7. (c) 8. (c) 9. (a) 10. (b) 11. (c) 12. (b)
13. (a) 14. (c) 15. (a)
1. (d) In order to draw a straight line we
have to select 2 points from available
8 points and that can be done in 8C2
ways or 28 ways.
2. (a) In counting we have different
process; this question can be solved
by different methods:
Method 1: Without any restriction
number of straight lines is 8C2 ways
or 28. Now the restriction is that 4
of them are collinear, since these 4
could have given us 4C2 ways or 6
straight lines but instead of 6 they
are giving us only 1 straight line
(Since these four point are collinear
so they will form 1 straight line)
so total number of straight lines is
28 – 6 + 1 = 23 straight lines.
Method 2: Number of straight lines
from 4 non-collinear points is 4C2 or
6 straight lines.
Number of straight lines from 4
collinear points is 1 straight line.
Number of straight lines if we take
one point from 4 non-collinear points
(in 4C1 or 4 ways) is 4 and one from
4 collinear points (in 4C1 or 4 ways)
is also 4, hence number of straight
lines is 4 × 4 = 16.
Total number of straight lines is
6 + 1 + 16 = 23
Solutions
3. (c) Same as previous question total
number of ways is:
(4C1)(4C1) + 2 = 16 + 2 = 18
4. (d) From 8 points we have to select 3
points and it can be done in 8C3 ways
or in 56 ways.
5. (a) 8 points could have given us 8C3
triangles if no three of them are in
a straight line, but 4 of them are
in straight line so we will get 4C3
number of triangle less so required
number of triangles is 8C3 – 4C3.
56 – 4 = 52
6. (c) Same as previous question total
number of ways is:
(4C1)(4C2) + (4C2)(4C1) = 24 + 24 = 48
7. (c) Out of 10 vertices we have to select 3
and that can be done in 10C3 ways =
120 ways.
8. (c) A polygon with ‘K’ sides has ‘K’
number of vertices. We can draw
KC number of straight lines from K
2
vertices but out of these there are ‘K’
number of sides and remaining are
diagonals.
Number of diagonals
= K C − K = K(K − 3)
2
2
Here in this case K = 13 hence
number of diagonals is 13 × 10/2 = 65

9. (a) Here we have to select 4 points
out of K point in order to draw a
quadrilateral and it can be done in
KC ways.
4
10. (b) Number of squares on a chessboard
is 12 + 22 + 32 + ... + 82 = 204.
11. (c) Total number of points in the plane
is 6 × 3 = 18 points. We have to select
3 triangles from 6 and that can be
done in 6C3 ways. Now from these
triangles we have to select one point
from each of the triangles that can
be done in 3C1 × 3C1 × 3C1.
Hence total number of triangles is
6C 3 3 3
3 × C 1 × C 1 × C 1.
12. (b) Total number of triangles can be
drawn is 18C3 but out of these 6 are
original triangles hence number
of new triangles is 18C3 – 6 or
18C – 6C .
3 1
Concept Builder (CB)
1. (a) 2. (d) 3. (b) 4. (d) 5. (c) 6. (b)
7. (c) 8. (c) 9. (b) 10. (b) 11. (a) 12. (c)
13. (b) 14. (b) 15. (a)
1. (a) We have following cases:
PQ RS
(2 Points) (8 points)
Case (i) 1 (in 2C1 2 (in 8C2 2 × 28
= 2 ways) = 28 ways) = 56
Case (ii) 2 (in 2C2 1 (in 8C1 1 × 8 = 8
= 1 ways) = 8 ways)
Total number of ways is 56 + 8 = 64.
2. (d) It is same as case (i) of previous
question, hence number of ways is 56.
3. (b) Since number of diagonals is given
by n(n – 3)/2 = 54 or n(n – 3) = 108
= 12 × 9 hence n = 12.
Geometrical Construction  83
13. (a) When 1 point selected from 1
Hexagon and 3 from another in
2 × 6C 3 × 6C 1.
And when 2 point selected from
1st Hexagon and 3 from another in
6C × 6C .
2 2
So total number of quadrilaterals
2 × 6C 3 × 6C 1 + 6C 2 × 6C 2.
14. (c) Consider the square along with two
diagonals:
Number of smaller triangles is 4 and
number of right angled triangle is
4 so total number of triangles is 8.
15. (a) Since number of diagonals is
n(n – 3)/2 = 10 × 7/2 = 35.
4. (d) From the given condition since
number of polygons is 54 hence
n(n – 3)/2 = 54 or n = 12
Number of triangles from these 12
points is 12C3 = (12 × 11 × 10)/6 = 220.
5. (c) Consider 1 line from P straight lines,
it is intersected by another set of
parallel lines at Q points hence total
number of such points is PQ.
6. (b) Without restriction we can select
2 points from P + Q + R points
in P+Q+RC2 ways but since points
are collinear hence we will not get
PC + QC + RC these straight lines
2 2 2
hence required number of straight
lines is given by:
P+Q+RC – (PC + QC + RC ).
2 2 2 2
84  Theory of Counting
If we select 1 point from P points and
one point from Q points then number
of straight lines is PC1 × QC1 = PQ.
Similarly from other two pairs we
will get PC1 × RC1 = PR and
RC × QC = RQ.
1 1
So total number of ways is PC1 × QC1
+ PC1 × RC1 + RC1 × QC1
= PQ+ PR + RQ
So only two of the given expression
is true.
7. (c) Without restriction we can select
3 points from P + Q + R points
in P+Q+RC3 ways but since points
are collinear hence we will not get
PC + QC + RC these triangles
3 3 3 from three different sides: 4C3 × 4C1
hence required number of triangles
is given by:
P+Q+RC – (PC + QC + RC ).
3 3 3 3
8. (c) In order to form a quadrilaterals
we need four points and no three of
them should be collinear so we have
to take 2 points from one straight
line and then 1 point from each of
the remaining two straight lines or 2
points from any of two straight lines-
Case (i): 2 points from one straight
line and then 1 point from each of
the remaining two straight lines:- in
this case number of quadrilateral is
PC × QC × RC + PC × QC × RC +
2 1 1 1 2 1
PC × QC × RC
1 1 2
Case (ii): When 2 points from any of
two straight lines:
PC × QC2 + PC2 × RC2 + QC2 × RC2.
2 are collinear points. Here in this
So total number of such quadri-
laterals is: (PC2 × QC1 × RC1 + PC1
× QC2 × RC1 + PC1 × QC1 × RC2) +
(PC2 × QC2 + PC2 × RC2+ QC2 × RC2)
9. (b) Here H = 6 and V = 8 so total number
of such path is H+VCH or H+VCV = 14C6.
10. (b) As we have done in previous question
number of ways is
4C × 4C = 6 × 4 = 24 ways.
2 1
11. (a) From four sides we have to select
2 sides that can be done in 4C2 = 6
ways. Now from each side we have
to select 1 point and that can be done
in 4C1 × 4C1= 4 × 4 = 16 ways.
So total number of such straight
lines is 4C2 × 4C1 × 4C1 = 96 ways.
12. (c) In order to draw a triangle we need
three non collinear points. Here in
this case we have two cases:
Case (i): If three points selected
× 4C1 × 4C1 = 4 × 4 × 4 × 4 = 256.
Case (ii): If two points are selected
from one side while 1 point is selected
from different side: (4C2)(4C2 × 4C1 +
4C × 4C ) = 6(24 + 24) = 288.
2 1
So total number of such triangles is:
256 + 288 = 544.
From 16 points without any restriction
we can get maximum 16C3 = (16!)/(13!)
(3!) = (14 × 15 × 16)/6 = 560.
From this we have to reduce the
number of triangles that we can
not get since 4 sides has 4 collinear
points each, which is equal to 4(4C3)
= 16.
So total number of such triangles is:
560 – 16 = 544
13. (b) In order to draw a quadrilateral we
need 4 points such that no 3 of them
case we have three cases:
Case (i): If 4 points selected from 4
different sides: 4C1 × 4C1 × 4C1 × 4C1
= 4 × 4 × 4 × 4 = 256.

Case (ii): If two points are selected
from one side while 1 point is selected
from two different sides:
(4C3)(3×4C2 × 4C1 × 4C1 ) = 4 (3 × 6 ×
4 × 4) = 1152.
Case (iii): If two points are selected
from one side while 2 points are
selected from different side:
4C × 4C × 4C = 6 × 6 × 6 = 216.
2 2 2
So total number of such quadrilaterals
is: 256 + 1152 + 216 = 1624.
From 16 points without any
restriction we can get maximum
16C = (16!)/(12!)(4!) = (13 × 14 × 15
4
× 16)/24 = 1820.
From this we have to reduce the
number of quadrilateral that we can
Geometrical Construction  85
not get if three points are collinear
this can happen in two cases:
Case (i): When all the four selected
points are collinear: 4 × 4C4 = 4.
Case (ii): When three points are
collinear 4C1 × 4C3 × 12 = 192.
So total number of such triangles is
1820 – 4 – 192 = 1624
14. (b) From 12 points we can draw 12C3
triangles but there are 6 groups of
3 collinear points hence we will get
6(3C3) triangles less, hence required
number of triangles is 12C3 – 6(3C3).
15. (a) From the given information
nC
3 = (n – 2)(n – 1)(n)/6 = 56 or n = 8
hence number of straight lines is 8C2=28.

Concept Cracker (CC)

1. (d) 2. (b) 3. (a) 4. (b) 5. (a) 6. (b)
7. (b) 8. (b) 9. (b) 10. (b) 11. (b) 12. (a)
13. (b) 14. (a) 15. (b) 16. (b) 17. (b) 18. (d)
19. (d) 20. (a)

1. (d) Here we have following cases-

No. of points from 6 collinear No. of points from other 9
Total no. of ways
points points

Case (i) 0 (in 6C0 = 1 way) 4 (in 9C4 = 126 ways) 1 × 126 = 126

Case (ii) 1(in 6C1 = 6 ways) 3 (in 9C3 = 84 ways) 6 × 84 = 504

Case (iii) 2 (in 6C2 = 15 way) 2 (in 9C2 = 36 way) 15 × 36 = 540

Total number of ways is 126 + 504 + 540 = 1170

2. (b) Total number of points is 3 + 4 + 5 = 12 points. If non of them are collinear then
number of triangles is 12C3 = 220. But actually we will get lesser number of triangles
as some points are collinear and this number is 3C3, 4C3 and 5C3 hence required
number of triangles is 12C3 – 3C3 – 4C3 – 5C3 = 220 – 1 – 4 – 10 = 205.
86  Theory of Counting
3. (a) We have following cases:

PQ (3 Points) RS (7 points)

Case (i) when A is selected 1 way 2 (in 7C2 = 21 ways) 1 × 21 = 21

Case (ii) when A is not selected 2 (in 2C2 = 1 ways) 1 (in 7C1 = 7 ways) 1×7=7

Case (iii) when A is not selected 1 (in 2C1 = 2 ways) 2 (in 7C2 = 21 ways) 2 × 21 = 42

Total number of ways is 42 + 7 + 21 = 70

4. (b) To get a parallelogram we need to
select 2 lines from P lines and that (n − 1)(n)(n + 1)} – {(n − 3)(n − 2)(n − 1)}
can be done in PC2 ways at the same
time 2 lines from Q lines and that
can be done in QC2 ways hence total
number of parallelograms is
PC × QC .
2 2
5. (a) Consider pair of parallel lines from
‘a’ and ‘b’ parallel line. 1st we will
select 2 lines from ‘a’ straight lines
and 2 lines from ‘b’ straight lines,
this can be done in aC2 × bC2
a(a − 1) b(b − 1) 1
= × = [ab(a − 1)(b − 1)]
2 2 4 8. (b) 1st we will count the number of
Similarly, we can select pair from ‘b’
and ‘c’ parallel lines and from ‘a’ and
‘c’ parallel lines.
So total such parallelogram is
1/4 [ab(a – 1)(b – 1) + bc(b – 1)(c – 1)
+ ac(a – 1)(c – 1)]
6. (b) From the given condition
Tn+1 = (n+1)C3
{(n + 1)!} {(n − 1)(n)(n + 1)}
= =
{(n − 2)! 3!} 6 {(m + 1)2 (m + 2)2 }
and Tn – 1 = (n – 1)C3
Then Tn + 1 – Tn – 1
= {
6 6
2
= (n – 1) hence this value must be a
perfect square, from the given options
only option (b) is a perfect square.
7. (b) Number of heptagons with n points
as vertices is nC7 and number of
octagons with n points as vertices
is nC8 from the given condition
nC = nC or (n!)/{(n – 7)! × 7!}
7 8
= (n!)/{(n – 8)! × 8!} = n – 7 = 8 or n = 15.
Hence number of triangles from 15
points is
15C = 13 × 14 × 15/6 = 455.
3
squares (since squares are also
rectangles), size of square may be
1 × 1, 2 × 2 … or 8 × 8 hence 8 such
square exist = 8C1 = 8C7.
Number of rectangles with side m
and n such that m ≠ n is 8C2.
Hence required number of rectangles
is 8C2 + 8C1.
9. (b) In the system now total (m + 2) and
another set of (m + 2) parallel lines.
From (m + 2) lines two lines can be
selected in m + 2C2 ways. So total
number of parallelogram is
m + 2C m + 2C =
2× 2 4

{(n − 1)!} {(n − 3)(n − 2)(n − 1)} 10. (b) From n points number of hexagon is
= = n!
{(n − 4)! 3!} 6 nC = .
6
{(n − 6)!}{6!}

From n points number of Octagons
n!
is nC8 = .
{(n − 8)!}{8!}
Ratio of number of hexagon to
number of octagon is
{(n − 8)!}{8!} 7×8 4 1 point and that can be done in
= =
{(n − 6)!}{6!} (n − 7)(n − 6) 13
On solving this quadratic equation
we will get n = 20
11. (b) From the given condition nC15 = nC30
then n = 15 + 30 = 45.
Hence statement (i) and (iii) are true
since if n = 45 then nC23 will have
maximum value and since
11 + 34 = 45 hence nC11 = nC34
12. (a) We know that 35Cr will have
maximum value when r = 17 so
number of polygons is 35C17 and from
one polygon we will get 17(17 – 3)/2
= 119 diagonals hence maximum
number of diagonals is 119(35C17).
13. (b) From the given condition nCk is more
than nCk–3 and nCk + 3 we know that
nC attains a maximum value if r is the
r
middle term of Binomial expansion or
Case (i) if n is odd then n = 2r + 1.
Case (ii) if n is even then n = 2r or 2(r – 1).
Consider the consecutive terms
nC n n n nC
k – 3, Ck – 2, Ck – 1, Ck, k + 1
nC and n C . nkC – n(kC ).
k+2 k+3
If n = 2k then nCk, nCk+1 are maximum
and the given conditions satisfy.
If n = 2k+1 then nCk + 1 is maximum
and the given conditions satisfy.
If n = 2k – 1 then nCk, is maximum
and the given conditions satisfy.
If n = 2k + 2 then nCk + 1, nCk + 2 are
maximum and the given conditions
satisfy.
If n = 2k – 2 then nCk – 1, nCk are
maximum and the given conditions
satisfy.
Geometrical Construction  87
Hence total 5 values of n satisfy the
given condition.
14. (a) From n sides we have to select
2 sides that can be done in nC2 ways.
Now from each side we have to select
kC × kC ways.
1 1
So total number of such straight
lines is nC2 × kC1 × kC1.
15. (b) In order to draw a triangle we need
three non collinear points. Here in
this case we have two cases-
Case (i) – if three points selected
from three different sides:
nC × kC × kC × kC .
3 1 1 1
Case (ii) – if two points are selected
from one side while 1 point is selected
from different side:
(n­C2 )(kC2 × kC1 + kC2 × kC1)
So total number of such triangles is
(nC3 × kC1 × kC1 × kC1) + 2(nC2 )(kC2
× kC1).
Alternately:
From nk points without any restriction
we can get maximum nkC3.
From this we have to reduce the
number of triangles that we can not
get form n sides has k collinear points
each, which is equal to n(kC3).
So total number of such triangles is
3 3
Statement (i) and (ii) is correct.
16. (b) In order to draw a quadrilateral we
need 4 points such that no 3 of them
are collinear points. Here in this
case we have three cases:
Case (i) – if 4 points selected from 4
different sides :
nC (kC × kC1 × kC1 × kC1)
4 1
Case (ii) – if two points are selected
from one side while 1 point is selected
from two different sides
88  Theory of Counting
(nC3)(3 × kC2 × kC1 × kC1 )
Case (iii) – if two points are selected
from one side while 2 points are
selected from different side
nC × kC2 × kC2.
2 18. (d) Since the total number of squares
So total number of such
quadrilaterals is:
nC (kC × kC1 × kC1 × kC1) + (nC3)
4 1
(3 × kC2 × kC1 × kC1) + nC2 × kC2 × kC2
Alternately:
From nk points without any
restriction we can get maximum
nkC .
4
From this we have to reduce the
number of quadrilaterals that we can
not get if three points are collinear
19. (d) Number of rectangles is 11C2 × 13C2
this can happen in two cases
20. (a) The first rook can be placed in 64
Case (i) – when all the four selected
points are collinear— n × kC4.
Case (ii) when three points are
collinear n × kC3 × k(n – 1).
So total number of such triangles is
nkC k k
4 – n[ C4 + C3 × k(n – 1)].
Statement (i) and (ii) is correct.
17. (b) In the grid we have 11 parallel
lines in one set of parallel lines and
another set of parallel lines has 11
parallel lines. To get a rectangle we
have to select 2 lines from 11 parallel
lines hence number of such rectangle
is 11C2 × 11C2 = (11 × 10/2)2 = 3025.
that can be found within an m × n
chessboard (m > n) is given by this
formula:
2n3 + 3n2 + n
+ (m − n)n + 1 C2
6
2n3 + 3n2 + n (m − n)(n)(n + 1)
= +
6 2
Here m = 12 and n = 10 hence
required number of squares is
(2 × 1000 + 300 + 10)/6+(2)(10)(11)/2
= 385 + 110 = 495.
ways, and the second rook cannot
be placed in the same row or the
same column. So, it has 7 rows and
7 columns left for it. It can be placed
in 7 × 7 = 49 ways.
But the order in which the rooks are
placed is not important. So, it will be
divided by 2!
Total number of ways
= 64 × 49/2 = 1568.
 Part B
Formation on
Concept 1 Geometrical Figures
• Number of straight lines from given
‘n’ points:- Consider ‘n’ points in a
plane and we need to find the number
of straight lines that can be draw from
these ‘n’ points. In order to draw a
straight line we have to select 2 points
and join them, so now question is in how
many ways we can select 2 points from
‘n’ points. In simple line this question
can not be answered unless it is given
that no three of which are collinear.
If no three of them are collinear then
number of straight lines is nC2.
• Number of straight lines from
given ‘n’ points out of them exactly
‘k’ points are collinear:-If no three
of them are collinear then number of
straight lines is nC2 but ‘k’ lines are in
same straight lines hence we will not get
kC straight lines hence total number of
2
straight lines is nC2 – kC2 +1
Concept 2 Chess Board
A chess board has 8 rows and 8 columns. Every
alternate square is coloured with white and
back. Figure below shows the chess board.
Geometrical Construction  89
• Number of triangles from given ‘n’
points if no three of them are collinear:-
To draw a triangles we need three non
collinear points, and from ‘n’ points 3
points can be selected in nC3ways.
• Number of polygons (of k sides)
from given ‘n’ points if no three of
them are collinear:-To draw a polygon
(of k sides)we need ‘k’ points as vertices
such that no three of them are collinear
points, and from ‘n’ points k points can
be selected in nCkways.
• Number of diagonals of a polygon
of ‘n’ sides:-Since number of sides are
‘n’ hence number of vertices is also ‘n’.
to draw a diagonal we have to select 2
points from ‘n’ points and that can be
done in nC2 ways, but out of those n
straight lines are sides of polygon and
that can not be treated as diagonals
hence number of diagonals is nC2 – n
n (n − 1) n (n − 3)
= – n=
2 2
• Number of squares in a chess board:- To
calculate the number squares in the chess
board we have to see the size of squares-
90  Theory of Counting
Number of squares of size 1 × 1 is 8 × 8 = 64
Number of squares of size 2 × 2 is 7 × 7 =
49 and so on
Number of squares of size 8 × 8 is 1 × 1 = 1
Hence total number of squares in a chess
2 2
  . +  82 = 204
board is 1 +  2 +…
Concept 3 Grid Based Problems
Generally two types of questions can be asked
based on a grid,
Type 1:- Number of rectangles, squares etc.
Type 2:- Number of shortest path from one
corner to diagonally opposite corner.
Number of rectangles
If grid is n × 1: the number of rectangles is
(n)(n + 1)
n + (n – 1) + (n – 2) ... + 1 =
2
Similarly consider a chessboard of n × m
with n rows and m columns-
• Number of rectangles in a chess
board:- To calculate the number
rectangles in the chess board we have to
select 2 straight lines from 9 straight line,
this can be done in 9C2 ways similarly
from another set parallel line we can
select 2 straight lines from 9 straight
line, this can be done in 9C2 ways hence
total number of rectangles is 9C2 × 9C2 =
1296
• In a chessboard of n×n: Number of
squares = 12 + 22 + ..+n2
n (n + 1)(2 n + 1)
=
6
Number of rectangles
2
 n (n + 1)
= n+1C2 × n+1C2=  
 2 
Since in a chessboard of n × m with n rows
and m columns, number of vertical lines is
(m+1) and number of horizontal lines is (n+1)
to draw a rectangle we have to select 2 vertical
and 2 horizontal straight lines and that can
be done in m+1C2 × n+1C2ways
Number of rectangles = m+1C2 × n+1C2
m (m + 1) n (n + 1) mn (m + 1)(n + 1)
= × =
2 2 4
Number of squares in a chessboard of
n × m with n rows and m columns (m > n)
 Geometrical Construction  91
Lets consider an n × n chessboard, number of v = 5. Then number of ways to reach one corner
squares in this is from the other is given by 7+5C7 = 7+5C5

n (n + 1)(2 n + 1) 2 n3 + 3n2 + n
= 
6 6

The total number of squares that can be found

within an m × n chessboard (m > n) is given by
2 n3 + 3n2 + n
this formula: + (m–n)
6
n+1C = 2 n + 3n + n (m − n )(n )(n + 1)
3 2
2 +
6 2
Number of Shortest Path The reason behind this is that if we have total
Let there are h number of horizontal steps h + v steps, out of these steps if we fix all
and v number of vertical steps then number of horizontal steps then we have only one way to
ways to reach from one corner to other corner select the vertical step, hence total number of
is h+vCh = h+vCv way is given by selecting h steps out of h = v
Here in the below figure number of horizontal steps OR by selecting v steps out of h = v steps
or we can write h+vC = h+vCv
steps are h = 7 and number of vertical steps h
92  Theory of Counting

1
Concept Deviator (CD)
Ideal Time Revise your concept (IIT advance or
5 Min. tougher questions)
Per Question

1. Consider a polygon of k sides. What
is the number of triangles that can be
drawn taking vertices of these polygons
as vertices of triangles and no sides of
triangles is common with any sides of
the polygon?
k (k − 1)(k − 5)
(a) chess board such they are not able to
6
k (k − 4 )(k − 5)
(b)
6 (a) 2576 (b) 3612
( k − 3) (k − 4 )(k − 5)
(c)
6 6. In how many ways two identical queens
(d) None of these
2. There are ‘P’ collinear points and another
set of ‘Q’ collinear points in a plane. All
the possible straight lines are drawn
from the given (P + Q) points. What is
the number of intersecting points of
these straight lines (excluding the points
on the two straight lines i.e excluding
original P and Q points)?
(a) P2 × Q2
(b) PC × QC2 – PQ
2 maximum length is n (an even number) units.
(c) 1 / 4 PQ (P − 1)(Q − 1)
(d) None of these
3. In how many ways two kings one black
and one white can be placed on a 8×8
chess board such they are not on adjacent
squares?
(a) 1442 (b) 3612
(c) 3422 (d) None of these
4. In how many ways two identical kings
can be placed on a 8 × 8 chess board such
they are not on adjacent squares?
(a) 1442 (b) 3612
(c) 3422 (d) None of these
5. In how many ways two queens one black
and one white can be placed on a 8×8
attack each other (Queens can attack in
the same row/column/diagonal)?
(c) 3422 (d) None of these
can be placed on a 8×8 chess board such
that they are not able to attack each
other (Queens can attack in the same
row/column/diagonal)?
(a) 2576 (b) 3612
(c) 3422 (d) None of these
Direction (Qs. 7 and 8):
The basic property of a triangle is that sum
of two sides must be more than the 3rd side.
If triangles are formed with integral sides
with minimum length of side is 1 unit and
P, Q, R and S is defined as-
P: Number of scalene triangles with one
side is 1 unit.
Q: Number of scalene triangles with one
side is 2 units.
R: Number of isosceles triangles that can be
formed
S: Number of equilateral triangles that can
be formed.

7. Find the value of |P – Q| .
(a) n (b) n – 2
(c) n + 2 (d) None of these
8. Find the value of |R – S|
n (n − 8) n (n − 4 )
(a) (b)
4 4
n (n + 4 )
(c) (d) None of these
4 triangles that can be constructed using
9. Let Tn be the number of all possible
triangles formed by joining vertices of an
n-sided regular polygon. If Tn+1 − Tn = 10,
then the value of n is [IIT JEE 2013]
(a) 5 (b) 10
(c) 8 (d) 7
10. A rectangle with sides 2m – 1 and 2n – 1
is divided into squares of unit length by
drawing parallel lines as shown in the
diagram, thenthe number of rectangles
possible with odd side lengths is
[IIT JEE 2005]
Geometrical Construction  93
(a) 4m+ n +1
(b) mn(m+1)(n+1)
(c) m2 n2
2
(d) (m + n + 1)
11. The sides AB, BC, & CA of a triangle
ABC have 3, 4 and 5 interior points
respectively on them. The number of
these interior points as vertices is-
[IIT JEE 1984]
(a) 210 (b) 205
(c) 310 (d) None of these
12. In how many ways can two squares be
chosen on a 8 × 8 chessboard such that
they have only one corner in common?
(a) 98 (b) 94
(c) 108 (d) None of these
13. There is a 36 sided regular polygon. How
many regular polygons can be formed
by joining the vertices of the regular
polygon?
(a) 32 (b) 35
(c) 37 (d) None of these
14. If K is the minimum number of straight
lines that is required to get 16 non
overlapping straight lines then find the
value of K. (Here non overlapping means
two straight lines may be co-linear
without overlapping)
(a) 8 (b) 10
(c) 19 (d) 14

Response Grid
1. a b c d 2. a b c d 3. a b c d 4. a b c d 5. a b c d
6. a b c d 7. a b c d 8. a b c d 9. a b c d 10. a b c d
11. a b c d 12. a b c d 13. a b c d 14. a b c d
94  Theory of Counting

2
Concept Eliminator (CE)
Ideal Time Revise your concept (Maths Olympiad
Just solve it or tougher questions)

Direction (Qs. 1 and 2): (a) 9901 (b) 9902

There are ‘K’ points in a plane. No three of (c) 9903 (d) None of these
which are on same straight line. All the This question is based on International
possible straight lines are made by joining
Maths Olympiad:
these ‘K’ points.
5. Consider 5 points in a plane are situated
1. What is the maximum number of point of
so that no two of the straight lines joining
intersection of these straight lines?
them are parallel, perpendicular, or co
(a) KC × KC2 (b) K(KC2 )
2 incident. From each point perpendiculars
(c) K(KC2 × KC2) (d) None of these are drawn to all the lines joining
2. Taking point of intersection of these the other four points. Determine the
straight lines as vertices of triangles maximum number of intersections that
then what is the maximum number of these perpendiculars can have?
triangles that can be formed? (a) 435 (b) 415
(a) {k(k-1)/2C }C – {k(k–1)/2}{(k-2)(k+1)/2C3}
2 3 (c) 315 (d) None of these
(b) {k(k-1)/2C }C – {k(k-1)/2}{k(k+1)/2C3}
2 3 Question number 6 and 7 is based on
(c) {k(k-1)/2C }C – {(k-2)(k+1)/2C3}
2 3 International Maths Olympiad:
(d) None of these Consider a decomposition of an 8 × 8
3. Consider ‘k’ straight lines in a plane chessboard into p non overlapping rectangles
such that no two of which are parallel with the following conditions-
and no three of which pass through same Condition (i): Number of white and number
point. How many new straight lines can
of black squares are same.
be drawn from the point of intersection
of these straight lines? Condition (ii): If ai is the number of white
squares in the ith rectangle then
k (k − 1)(k − 2 )
(a) a1< a2< a3< … <ap.
8
k (k − 1)(k − 2 )( k − 3) 6. Find the maximum possible value of P
(b)
8 (a) 2 (b) 4
k (k − 1)(k − 2 )( k − 3) (c) 8 (d) None of these
(c)
4 7. How many such different cases are
(d) None of these
possible if P is maximum?
4. 100 circles are drawn on a plane what is
the maximum number of regions made (a) 2 (b) 4
by this system of 100 circles? (c) 8 (d) None of these
 Geometrical Construction  95
This question is based on Regional This question is based on Maths Olympiad:
Maths Olympiad 9. In how many ways 2 ‘+’ and 2 ‘–’ signs are
8. Consider a 6 × 6 square which is dissected filled into 4 × 4 cell where each cell can
into 9 rectangles by lines parallel to its contain maximum 1 character such that
sides such that all the rectangles have each row and column can not contain
same sign?
integer sides. Out of 9 rectangles what
is the minimum number of congruent
rectangles?
(a) 0 (b) 1
(c) 2 (d) None of these

(a) 3960 (b) 3340

(c) 3255 (d) None of these

Response Grid
1. a b c d 2. a b c d 3. a b c d 4. a b c d 5. a b c d
6. a b c d 7. a b c d 8. a b c d 9. a b c d
96  Theory of Counting

Solutions

Concept Deviator (CD)

1. (b) 2. (c) 3. (b) 4. (d) 5. (a) 6. (d)
7. (b) 8. (a) 9. (a) 10. (c) 11. (b) 12. (a)
13. (c) 14. (b)

1.
(b) Total number of triangles formed
is kC3, now consider the following
cases-
Case (i): Number of triangles having
three sides common with the sides
of polygon is 0.
Case (ii): Number of triangles having
two sides common with the sides of
polygon is k.
Case (iii): Number of triangles having
one sides common with the sides
of polygon = number of ways of
selecting 3 points (vertices) out of
which only two are consecutive is
K(K–4C1) = K(K–4).
So number of required triangles is
kC – k – k(k–4)
3
= k(k–1)(k–2)/6 –k – k(k–4)
k (k − 4 )(k − 5)
= 2nd king can be placed in 55 ways
6 so number of ways in this case is
2. (c) To get desired point of intersection
we have to select two points from
1st straight line (i.e from P points
in PC2 ways) and two points from
2nd straight line (i.e from Q points
in QC2 ways ). Such a selection of
4 points will give us two straight
lines and which in turn will
give us 1 point of intersection.
So total number of points is
= PC2 × QC2
P (P − 1) Q (Q − 1) 1
= × = PQ (P − 1)(Q − 1)
2 2 4
3. (b) Here we have following three cases
for placing the 1st king-
Case (i): Lets place 1st king at one of the
corners (in 4 ways) then 2nd king can
be placed in 60 ways so number of
ways in this case is 4 × 60 = 240
Case (ii): If 1st king is placed at a square
on edge (in 24 ways) then 2nd king
can be placed in 58 ways so number
of ways in this case is 24 × 58 =
1392
Case (iii): If 1st king is placed at a
interior square (in 36 ways) then
36 × 55 = 1980
So total number of ways is
240+1392+1980 = 3612
4. (d) From the solution of previous
question since the two kings are
identical hence total number of ways
is 3612/2 = 1806

5.
(a) We will solve this question with
help of diagram and taking different
cases-
Case (i): When 1st queen is placed at
one of the center from four center
squares as shown in the given figure
by ‘X’ .
In this case 2nd queen can be placed
in 36 ways so total number of ways
in this case is 4 × 36 = 144
x x
x x
Case (ii): When 1st queen is placed at
one of the squares as shown in the
given figure by ‘X’ that can be done
in 12 ways.
In this case 2nd queen can be placed
in 36 ways so total number of ways
in this case is 12 × 38 = 456
x x x x
x x
x x
x x x x
Case (iii): When 1st queen is placed at
one of the squares as shown in the
given figure by ‘X’ that can be done
in 20 ways.
Geometrical Construction  97
In this case 2nd queen can be placed
in 40 ways so total number of ways
in this case is 20 × 40 = 800
x x x x x x
x x
x x
x x
x x
x x x x x x
Case (iii): When 1st queen is placed at
one of the squares as shown in the
given figure by ‘X’ that can be done
in 28 ways.
In this case 2nd queen can be placed
in 42 ways so total number of ways
in this case is 28 × 42 = 1176
x x x x x x x x
x x
x x
x x
x x
x x
x x
x x x x x x x x
Total number of ways is 144 + 456 +
800 + 1176 = 2576
6. (d) From the solution of previous
question if identical queens then
required number is 2576/2 = 1288
Solution of 7 and 8:
Let three sides of the triangle be a, b and c,
then from the property a+b> c and |a–b| < c
Let a = 1 then |b – c| ≥ 1 = a which contradicts
the basic property | b – c| < a so there exist
no such triangles so P =0
98  Theory of Counting
Now let one of the side is 2 units, since none
of the sides is of 1 unit hence side with length
2 units must be the smallest side, say a = 2,
let c > b then c – b < 2 or c < b +2, if b = 3
then c =4, if b = 4 then c = 5 and so on c can
take all the values from 4 to n hence number
of triangles is n – 3.
Q=n–2
S:- Number of equilateral triangle which is
equal to n.
R is the number of isosceles triangles:-
If unequal side is 2 then two equal sides
can take any value from 3 to n so number of
isosceles triangles is (n–2)
If unequal side is 3 then two equal sides can
take any value from 2 to n (except 3 as it will
become equilateral triangle) so number of
isosceles triangles is (n–2)
If unequal side is 4 then two equal sides can
take any value from 3 to n (except 4 as it will
become equilateral triangle) so number of
isosceles triangles is (n–3)
If unequal side is 5 then two equal sides can
take any value from 3 to n (except 5 as it will
become equilateral triangle) so number of
isosceles triangles is (n–3)
If unequal side is 6 then two equal sides can
take any value from 4 to n (except 6 as it will
become equilateral triangle) so number of
isosceles triangles is (n–4)
If unequal side is 7 then two equal sides can
take any value from 4 to n (except 7 as it will
become equilateral triangle) so number of
isosceles triangles is (n–4)
And so on, since n is even hence required
number of isosceles triangle is 2{(n–2) + (n–3)
+ … + n/2 terms} = n(n–4)/4
Or R = n(n–4)/4
7. (b) | P – Q| = n–2
n (n − 4 ) n (n − 8)
8. (a) | R – S| = – n =
4 4
9. (a) As per the given condition
n+1C – nC = 10 or nC = 10 or n = 5
3 3 2
10. (c) Required number of rectangle is
2 2
(mC ) (mC ) (nC ) (nC ) = m n
1 1 1 1
11. (b) We have following cases in this
question-
Case (i) if one point is selected from
each side then number of triangles is
3 × 4 × 5 = 60
Case (ii) If one point is selected from
one side and 2 points from another
side then number of ways is (3)
(4 + 5) + 6(3 + 5) + 10(3 + 4)
= 27 + 48 + 70 = 145
So total number of triangles is
60 + 145 = 205
12. (a) Since the given condition is that
corner of two selected squares is
common hence they must be on two
adjacent columns.
Now 1st let us assume that 2 squares
that are chosen from the first 2
columns.
When the first square is chosen
either from the top row or the bottom
row in the first square is chosen,
only one square can be chosen from
the 2nd column. Thus from the first
two columns, 2 × 1 + 6 × 2 or 14
pairs of squares can be chosen. In 8
x8 chessboards, 7 pairs of adjacent
columns can be chosen.
Therefore, the total number of ways of
choosing the squares = 7 × 14 = 98.
13. (c) Let us solve this question by dividing
on the number of sides-
Say if number of sides is 18 then we
will have 36/18 = 2 polygons
If number of sides is 12 then number
of polygons is 36/12 = 3 and so on-
 Geometrical Construction  99

No. of sides in Hence, total 12 + 9 + 6 + 4 + 3 + 2 +

No. of polygons 1 = 37
polygon
14. (b) Since 16 = 4 × 4 so we need to draw
36 1
(4 + 1) = 5 parallel straight lines and
18 2 another set of 5 parallel straight
12 3 lines so total number of straight
9 4 lines is 5 + 5 = 10
6 6
4 9
3 12

Concept Eliminator (CE)

1. (d) 2. (a) 3. (b) 4. (b) 5. (c) 6. (d)
7. (b) 8. (c) 9. (a)

1. (d) Number of straight lines that can
be drawn is kC2 = k(k–1)/2 = P (say).
Now from P straight lines for
maximum number of point of
intersection condition is , no two of
them are parallel to each other and
no three of them are concurrent. So
number of point of intersection of
these P straight lines is
Total number of triangles (assuming
that all the intersecting points
= k(k–1)/2C2 = m are non collinear ) is
given by mC3 = {k(k–1)/2C2}C3.
Now we will reduce the number of
triangles that we are not getting
because of collinear points which is
{k(k–1)/2}{(k–2)(k+1)/2C3}

PC k(k–1)/2C So required number of triangles is

2= 2
{k(k–1)/2C }C – {k(k–1)/2}{(k–2)(k+1)/2C3}
2. (a) From the solution of previous question 2 3

number of points of intersection is 3. (b) Number of intersection points is kC2

PC k(k–1)/2C = k(k–1)/2 = P (say)
2= 2 = m(say)

Out of these points some points are Number of straight lines from P
collinear, if we look at carefully then points is PC2
on each of P = kC2 = k(k–1)/2 straight
lines number of collinear points are = P (P − 1) = 1  k (k − 1)  k (k − 1) – 1 
2 2  2  2 
k (k − 1) (k − 2 )(k + 1)
P–1 =
2
– 1 =
2 =
(
k (k − 1) k 2 − k − 2 )
8
100  Theory of Counting
Since in the question we are asked
only the new lines and we also have
to note that one particular line is
intersected by (k–1) straight lines at
(k–1) points and these points will not
give us new line hence from one line
we will not get (k–1)C2 lines from one
straight line so from k lines we will
k (k − 1)(k − 2 )
not get k[(k–1)C2] =
2 perpendiculars is 6×5 = 30.
lines
Hence number of new straight lines
is
k( k − 1)( k 2 − k − 2) k( k − 1)( k − 2)
−
8 2
=
k( k − 1)( k − 2)( k − 3)
8 the following cases-
4. (b) If 1 circle is on the plane then number
of regions is 2
If 2 circles is on the plane then
number of regions is 4
If 3 circles is on the plane then
number of regions is 8
If 4 circles is on the plane then
number of regions is 14
From pattern we can say that if
number of circles is n then number
of regions is n(n–1) + 2 (We can prove
this by mathematical induction)
Hence when number of circles is 100
then maximum regions is
100(100–1) +2 = 9900 + 2 = 9902
5. (c) Lets consider 5 points A, B, C, D
and E. Consider a point A, number
of straight lines that can be drawn
through B, C, D and E is (4C2) = 6
straight lines, so from A we can
draw perpendicular to these 6
straight lines, similarly we will
get 6 perpendiculars from other
points as well so total number of
The maximum number of
intersections of these 30 straight
lines is (30C2) = 435, but these 435
points are not distinct means out of
30 straight lines not all of them are
non concurrent. We have to consider
Case (i) Consider one of the ten lines
drawn from original 5 points,
say this line AB, there are three
perpendiculars are drawn on AB
from points C, D and E, these 3
perpendiculars are parallel to each
other hence they will not intersect
each other, these three point if not
parallel could have intersected at
3 points hence we lost 3 × 10 = 30
points.
Case (ii) Since three altitudes of a
triangle intersect each other at a
point (Called Ortho center). From
the original 5 points we will have
(10C3) = 10 triangles. Consider one
of these 10 triangles, perpendicular

from vertex to opposite side (altitude)
will intersect at one point instead of
3 points, hence from each triangle
we lost 2 points so total number of
points that we have to subtract is
2 × 10 = 20 points.
Case (iii) Consider one of the original
5 points (say A) since from A we have
drawn 6 perpendiculars and these
6 perpendiculars are concurrent
hence they intersect each other at
one point instead of (6C2) = 15 points
so from one of this point we lost
Geometrical Construction  101
Case (i) 1 + 2 + 3 + 4 + 5 + 6 + 11 = 32
Case (ii) 1 + 2 + 3 + 4 + 5 + 7 + 10 = 32
Case (iii) 1 + 2 + 3 + 4 + 5 + 8 + 9 = 32
Case (iv) 1 + 2 + 3 + 4 + 6 + 7 + 9 = 32
Case (v) 1 + 2 + 3 + 5 + 6 + 7 + 8 = 32
Now case (i) is ruled out as we can
not get a rectangle with 11 white
and 11 black squares, remaining all
cases are possible.
Diagram of case (ii) is shown here
remaining you can try on your own.

15–1 = 14 points, hence total we lost

14 × 5 = 70 points.

So total number of points is 435 – 30

– 20 – 70 = 315 Points

6. (d) Since a chess board has 32 white and

32 black squares hence a1+a2+..+ap
= 32

Given condition is

a1< a2< a3< … < ap.

hence a1≥ 1, a2 ≥ 2, …ap ≥ p
Or from the given condition
32 ≥ 1+2+..+p = p(p+1)/2 or p ≤ 7
Hence maximum value of p is 7
7. (b) Now we have to see in how many
ways summation of 7 integers can
give us 32, for this we have following
cases-
8. (c) Lets start with the minimum number
of non congruent rectangles and for
that purpose with minimum area.
If area is 1 sq. unit then we will get
only 1 rectangle of 1 × 1
If area is 2 sq. unit then we will get
only 1 rectangle of 1 × 2
If area is 3 sq. unit then we will get
only 1 rectangle of 1 × 3
102  Theory of Counting
If area is 4 sq. unit then we will get 9. (a) Let us consider 1st the ‘ + ’ sign, we
only 2 rectangle of 1 × 4 or 2 × 2 can select two columns in 4C2 = 6
ways and we can place two ‘+’ signs
If area is 5 sq. unit then we will get
in (4 × 3) = 12 ways so two ‘+’ sign
only 1 rectangle of 1 × 5
can be arranged in 72 ways.
If area is 6 sq. unit then we will get
Similarly two ‘–‘ sign can be arranged
2 rectangles of 1 × 6 or 2 × 3
in 72 ways
If area is 7 sq. unit then we will get
Now we have to exclude the cases in
only 1 rectangle of 1 × 7 but it is not
which both the signs are in same cell.
possible in 6 × 6 square-
When both the ‘–‘ sign occupy the
Last rectangle will be of area 8
cell of ‘+’ sign then number of ways
square unit
is 72.
Here we have considered all the non
When one of the ‘–‘ sign occupy the
congruent rectangles and summation
cell of ‘+’ sign then number of ways
of these areas is 1 + 2 + 3 + 4 + 4 +
is 4 × 4 × 72 = 16 × 72
5 + 6 + 6 + 8 = 39 > 36 hence we
must have at least 2 congruent So required number of ways
rectangles.
= 72 × 72 – 72 – 16 × 72 = 55 × 72 = 3960.
 4 Arrangement
Arrangement  103

Topics Covered

 Methods of Arrangement

 SATA method- (Select and Then Arrange Method)

Part A: Topic Number of Questions

Solved Example 10
Concept Applicator 15
Concept Builder 15
Concept Cracker 20
Part B: Topic Number of Questions
Concept Deviator 16
Concept Eliminator 4
Total 80
QR Code / Video Link

For Smart phone/ Tablet users

Video Link for Desktop/Laptops users http://dishapublication.com/video-resources

104  Theory of Counting
Part A
Here is the main purpose of writing this
book is to eliminate the confusion between
Combination and Permutation, in order to
remove that confusion, I have decided to
eliminate Permutation. In this chapter I am
going to give you only one concept/formula –
Number of ways in which ‘n’ distinct objects
can be arranged is ‘n!’.
Example 1:  In how many ways 10 distinct
objects can be arranged in a straight
line?
Solution:  Since we have to arrange 10 distinct
objects in a straight line that can be done in
10! ways.
Example 2:  In how many ways 10 identical
objects can be arranged in a straight
line?
Solution:  Since we have to arrange 10
identical objects in a straight line that can
be done in only 1 way.
To solve questions related to Permutation
just follow one rule SATA (Select and then
Arrange) —
“1st select and then arrange”
Example 3:  In how many ways 7 students
can be arranged on 10 chairs in a
straight line?
Solution:  As per the rule SATA, selection of
7 chairs out of 10 chairs can be done in 10C7
ways and then on 7 chairs we can arrange
7 students in 7! ways. So total number of
ways is (7!)(10C7) = 10P7 ways.
Example 4:  In how many ways 7 prizes
(from 1st to 7th ) can be awarded to 10
students?
Solution:  As per the rule SATA, selection of
7 students out of 10 students can be done
in 10C7 ways and then on 7 prizes we can
be given to 7 students in 7! ways so total
number of ways is (7!)(10C7) = 10P7 ways.
Example 5:  In how many ways 20 students
can be arranged in a straight line if
two particular students A and B are
always together?
Solution:  A and B can be tied together in (2!)
ways then we will have 19 distinct elements
that can be arranged in (19!) ways hence
total number of ways is 2(19!).
Example 6:  In how many ways 20 students
can be arranged in a straight line if
two particular students A and B are
never together?
Solution:  Without restriction they can be
arranged in (20!) ways, and in previous
question we have seen that A and B are
always together in 2(19!) hence number of
ways in which they are never together is
20! – 2(19!) = (18)(19!) ways.
Example 7:  In how many ways 20 students
can be arrange in a straight line such
that three students A, B and C are
always together.
Solution:  A, B and C can be tied together
in (3!) ways then we will have 18 distinct
elements that can be arranged in (18!) ways
hence total number of ways is (3!)(18!).
Example 8:  In how many ways 20 students
can be arrange in a straight line such
that three students A, B and C are
always together and C is always ahead
of A and B.
Solution:  A, B and C can be tied together in
(3!) ways but out of these (3!) ways only in
2 ways C is ahead of A and B and then we
will have 18 distinct elements that can be
arranged in (18!) ways hence total number
of ways is . (3!)(18!) (2) = 2(18!)
(3!)

Example 9:  What is the number of
permutations of 10 distinct articles
out of 20 articles?
Solution:  As per the rule SATA, selection of
10 distinct articles out of 20 articles can
be done in 20C10 ways and then these 10
articles can be arranged in 10! ways so
1
Concept Applicator (CA)
Ideal Time
15 Min.
1. In how many ways 10 students can be
arranged in a row?
(a) 10C
1 (b) 10!
(c) 10. 10C
1 (d) None of these
2. In how many ways 10 students can be
seated on 15 seats in a row?
(a) 10C
1 (b) 10!
(c) 10! 15C10 (d) None of these
3. In how many ways batting order of 11
players can be made out of 20 players?
20C
(a) 11 (b) (20C11)(11!)
20P
(c) 10 (d) None of these
4. In how many ways batting order of 11
players can be made out of 20 players if
Sachin is always selected?
(a) 20P (19C
11 (b) 10)(11!)
(c) 19P (d) None of these
10
5. In how many ways batting order of 11
players can be made out of 20 players if
Sachin and Sourav are always rejected?
Arrangement  105
total number of ways is (10!)(20C10) = 20P10
ways.
Example 10:  How many 4 digit numbers
can be formed from the digits 2, 3, 5, 7
if repetition of digits is not allowed.
Solution:  We have to arrange 4 digits at 4
places that can be done in 4! = 24 ways.
Apply your concepts with easy and
conceptual questions
(a) (18C11)(11!) (b) (19C10)(11!)
(c) 19P (d) None of these
10
6. In how many ways batting order of 11
players can be made out of 20 players if
Sachin and Sourav are always selected
but Yuvi and Dinesh always rejected?
(a) (18C11)(11!) (b) (19C10)(11!)
(c) (16C9)(11!) (d) None of these
7. In how many ways batting order of 11
players can be made out of 15 players if 2
players can play only as wicket keeper?
(a) (11!)( 2C1 × 13C10)
(b) (11!)( 2C1 × 14C11)
(c) (11!)(2C1 + 13C10)
(d) None of these
8. In how many ways 4 distinct volumes of
English and 6 distinct volume of Maths
book can be arranged on a bookshelf ?
(a) (4!)(6!) (b) 2(4!)(6!)
(c) (10!) (d) None of these
106  Theory of Counting
9. In how many ways 4 distinct volumes of
English and 6 distinct volume of Maths
book can be arranged on a bookshelf
such that all the English books and all
the Maths books are together?
(a) (4!)(6!) (b) 2(4!)(6!)
(c) (10!) (d) None of these
10. In how many ways 4 distinct volumes of
English and 6 distinct volume of Maths
book can be arranged on a bookshelf such
that no two English books are together?
(a) (4!)(6!) (b) 2(4!)(6!)
(c) (6!)(7C4 × 4!) (d) None of these
11. In how many ways 4 distinct volumes of
English and 6 distinct volume of Maths
book can be arranged on a bookshelf such
that no two Maths books are together?
(a) (4!)(6!) (b) 2(4!)(6!)
(c) (6!)(7C 4× 4!) (d) None of these
12. In how many ways 4 distinct volumes of
English and 6 distinct volume of Maths
book can be arranged on a bookshelf such
that all the English books are together?
(a) (4!)(6!) (b) 7(4!)(6!)
(c) (6!)(7C4 × 4!) (d) None of these
13. In how many ways 4 distinct volumes of
English and 6 distinct volume of Maths
book can be arranged on a bookshelf such
that all the Maths books are together?
(a) (5)(4!)(6!) (b) 7(4!)(6!)
(c) (6!)(7C 4× 4!) (d) None of these
14. In how many ways ‘n’ boys and ‘n’ girls,
can be arranged in a straight line so that
no two boys are together?
(a) (n!)2 (b) ½ (n!)2
(c) (2n!)2 (d) None of these
15. If P is the number of ways in which 7
students can be arranged on 10 chairs
in a straight lines and Q is the number
of ways in which 7 students out of 10
students can be arranged on 7 chairs
in a straight line, then which one of the
following is correct?
(a) P > Q (b) Q < P
(c) P = Q (d) None of these

Response Grid
1. a b c d 2. a b c d 3. a b c d 4. a b c d 5. a b c d
6. a b c d 7. a b c d 8. a b c d 9. a b c d 10. a b c d
11. a b c d 12. a b c d 13. a b c d 14. a b c d 15. a b c d

2
Concept Builder (CB)
Ideal Time Revise your concepts with questions
25 Min. medium difficulty level questions
1. In how many ways 6 prizes from 1st to
6th prize can be given to a group of 6
students that includes 3 boys and 3 girls
here a student can get only 1 prize?
(a) (6!) (b) 2(3!)(3!)
(c) (3!)(3!) (d) None of these
2. In how many ways 6 prizes from 1st to
6th prize can be given to a group of 6
students that includes 3 boys and 3 girls
if total number of participants is 6 boys
and 7 girls and a student can get only 1
prize?
(a) 6C3 × 7C3 (b) (6!)(6C3 × 7C3)
(c) (6!)(6C3 +7C3) (d) None of these
3. In how many ways 5 Indians, 6 Americans
and 4 Russians be seated in a row so that
all persons of the same nationality sit
together?
(a) (3!5!6!4!) (b) (5!6!4!)
(c) (15!) (d) None of these
4. There are 15 books out of which 5 Science,
4 Literature, 3 Arts and remaining are
different language books, these books
are arranged on a bookshelf such that all
the Science, all the Literature and all the
Arts books are together , how many ways
it can be done?
(a) (5!4!3!3!) (b) (5!4!3!6!)
(c) (5!4!3!3!3!) (d) None of these
5. In how many ways 10 boys and 8 girls
can be arranged in a straight line such
that all the girls and all the boys are
together?
(a) (10!)(8!) (b) (10!)
(c) (2!)(10!)(8!) (d) None of these
Arrangement  107
6. In how many ways 10 boys and 8 girls can
be arranged in a straight line such that
two girls Seema and Reema are together?
(a) (16)(17!)(2!) (b) (16!)(17)(2!)
(c) (16!)(17!)(2!) (d) None of these
7. In how many ways 10 boys and 8 girls
can be arranged in a straight line such
that two girls Seema and Reema are not
together?
(a) (16!)(17C2 )
(b) 18! – (16!)(17!)(2!)
(c) 18! – (16!)(17)
(d) None of these
8. In how many ways 10 students of different
height can be arranged so that the tallest
and shortest are never together?
(a) 8(9!)(10!) (b) 8(9!)
(c) 8(9!)(2!) (d) None of these
9. In how many ways 5 boys and 5 girls can
be seated in a row so that boys and girls
are alternate?
(a) 2(5!)(5!) (b) (5!)(5!)
(c) 2(5! + 5!) (d) None of these
10. Mr. Ricky has 10 friends to invite for
his marriage. In how many ways can he
send invitation card to them if he has 4
servants to carry the invitation card?
(a) 104 (b) 410
(c) 10P4 (d) None of these
11. In how many ways 5 prizes can be given
to 10 boys if each boy can get any number
of prizes
(a) 105 (b) 510
(c) 10P5 (d) None of these
108  Theory of Counting
12. A telegraph on Merchant Ship MT
Cougar Ace has 4 arms and each arm is
capable of 5 distinct position including
neutral (Rest). What is the total number
of signals that can be given to engine
room from the bridge if all the arms
are at neutral then no signal can be
generated?
(a) 45 (b) 54
(c) 5P4 (d) None of these
13. The total number of ways in which 10
students can be arranged in a row such
that A is always ahead of B.
(a) 2(10!) (b) (10!)/2
(c) (10!)(8!) (d) None of these
14. In how many ways 5 identical Apples
and 4 identical bananas be arranged in a
row such that no 2 apples are together?
(a) 0 (b) (5!)(4!)
(c) (9!) – (4!)(5!) (d) None of these
15. In how many ways 5 distinct Apples and
4 distinct bananas be arranged in a row
such that no 2 apples are together?
(a) 0 (b) (5!)(4!)
(c) (9!) – (4!)(5!) (d) None of these

Response Grid
1. a b c d 2. a b c d 3. a b c d 4. a b c d 5. a b c d
6. a b c d 7. a b c d 8. a b c d 9. a b c d 10. a b c d
11. a b c d 12. a b c d 13. a b c d 14. a b c d 15. a b c d

3
Concept Cracker (CC)
Ideal Time Boost up your confidence with good
40 Min. questions

1. What is the total number of signals that
can be made by using 5 flags of different
colour when any number of them may be
used?
(a) 325 (b) 425
(c) 525 (d) None of these
2. In how many ways 10 students can be
arranged in a row such that A is ahead
of B and who in turn is ahead of C?
(a) (10!)/6 (b) (10!)/6!
(c) (10!)/3 (d) None of these
3. In how many ways 10 students can be
arranged in a row such that A is always
between B and C?
(a) (10!)/6 (b) (10!)/6!
(c) (10!)/3 (d) None of these
4. In how many ways 10 students can be
arranged in a row such that A and B are
always between C and D?
(a) (10!)/6 (b) (10!)/6!
(c) (10!)/4 (d) None of these
5. What is the total number of permutations
of 10 different things taken not more than
4 at a time? It is given that each thing may
be repeated any number of times.
(a) 11110 (b) 11111
(c) 11100 (d) None of these

6. In a photography session 10 students has
to stand in a row but out of 10 there are
three students A, B and C who want to
stand together while C and D do not want
to stand next to each other, In how many
ways they can be arranged in a row?
(a) (3!)(7!)(6!) (b) (3!)(7!)(6)
(c) (3!)(7!)(6!)(2!) (d) None of these
7. There are 100 students with roll number
1 to 100. If 10 students are selected out of
100 students and their names are listed
down according to their roll numbers in
increasing order then in how many times
rank 50 will be at 6th position?
(a) (49P5)(50P4) (b) (49C5)( 50C4)
(c) (49!)(50!) (d) None of these
8. In a U.N security council meeting 30
members representing different nations,
out of these 30 members 10 members from
permanent members of the council, these
are USA, Russia, China, UK and France,
2 representative from each nations. For
a voting purpose 10 members out of 30
has to be selected such that exactly 5
members one from each of permanent
member nations are selected. In how
many ways this can be done?
(a) 32(20P5) (b) 32(20C5)
(c) (20P5) (d) None of these
9. In how many ways 5 identical apples, 6
identical bananas and 7 identical oranges
can be arranged in a straight line such
that at least one fruit is separated from
similar fruits.
(a) 18!
(5!)(6!)(7!)
18!
(b) – (5!)(6!)(7!)
(5!)(6!)(7!)
Arrangement  109
18!
(c) –1
(5!)(6!)(7!)
(d) None of these
10. In a Annual general meeting of XYZ
company, participants are ‘2a’ number
of executives, ‘b’ number of managers,
‘c’ number of senior managers and
director of the company. The seating
arrangement is made in such a way that
all the executives are seated at the either
end (‘a’ number of executives on one
end), All the managers will be together
while Director don’t want to sit next to
an executive or a manager, in how many
ways they can be arranged in a straight
line?
(a) {(a)!}{(a)!}(b!){(c+1)!}{cP2}
(b) {(2a)!}(b!){(c+1)!}{cP2}
(c) {(2a)!}(b!){(c)!}{cP2}
(d) None of these
11. In an international convention participants
from 10 different countries were arranged in
a row such that all the participants from the
same country were together. Each country
has different number of participants with
maximum 10 participants from a country.
If K is the number of ways that they can be
arranged in a row then find the highest
power of 10 in K.
(a) 5 (b) 7
(c) 8 (d) None of these
12. In how many ways 10 students can be
arranged in a row such that A is always
before B and C is always before D?
(a) (10!) – (2!)(2!)(8!)
(b) (10!) – (2!)(2!)(7!)
(c) (10!) – (2!)(2!)(9!)
(d) None of these
110  Theory of Counting
13. There are 2 Indians, and 2 Americans,
In how many ways they can be arranged
such that no two participants from the
same country are together?
(a) 8 (b) 12
(c) 16 (d) None of these
14. There are 2 Indians, 2 Americans and 2
Russians in a conference, In how many
ways they can be arranged such that no
two participants from the same country
are together?
(a) (2)(6!)
(b) (2)(5!)
(c) (8!) – (2!)(2!)(2!)(3!)
(d) None of these
15. A delegation has 5 Indians and 4 Chinese,
In how many ways they can stand in a
line such that 2 Chinese are together and
other 2 Chinese are also together but no
three Chinese are together?
(a) (5!)(2!)(2!)(6P2)
(b) (5!)(2!)(2!)(6P2)(4C2)
(c) (5!)(2!)(2!)(6P2)(4C2)/2
(d) None of these
16. Total 7 boys and 6 girls are selected
to represent their school in science
conference. In how many ways they can
be arranged in a line such that 3 girls
are together and other three are also
together but these two group of girls are
not together?
(a) (5040)(8!) (b) (2520)(8!)
(c) (1260)(8!) (d) None of these
17. Susmit has 2M red and 2N black balls
(identical) he wants to arrange all these
(2M + 2N) balls in a straight line such
that arrangement of 1st (M + N) balls is
mirror image of last (M + N) balls, in how
many ways he can do so?
(a) 2M+2NC2M (b) ½ (2M+2NC2M)
(c) M+N CM (d) None of these
18. In how many ways ‘n’ boys and ‘n’ girls
can be arranged in line such that all
the boys and all the girls standing in
increasing order of their weight assume
that all boys and all girls are of different
weight?
(a) ½ 2nCn (b) 2nCn
(c) 2n Cn(n!) (d) None of these
19. Seven friends Ahaskar, Bhanu, Chandan,
Dripto, Esha, Fatima, and Garima are
standing in a line, in how many ways
they can stand in a line such that Amar,
Bimal, and Chandan are standing
together but never standing according to
their increasing order of height (assume
all of them are of different height) and
Esha, Fatima and Garima are standing
together but never standing according to
their increasing order of weight (assume
all of them are of different weight)?
(a) 4812 (b) 4806
(c) 4818 (d) None of these
20. Total 16 people participated in a picnic,
6 distinct work has to be assigned to 6
people such that only one from Mr. & Mrs.
A is selected similarly one from Mr. &
Mrs. B and Mr. & Mrs. C is selected for the
work. How many ways this can be done?
(a) 8(5!)(6!) (b) 4(5!)(6!)
(c) 2(5!)(6!) (d) None of these

Response Grid
1. a b c d 2. a b c d 3. a b c d 4. a b c d 5. a b c d
6. a b c d 7. a b c d 8. a b c d 9. a b c d 10. a b c d
11. a b c d 12. a b c d 13. a b c d 14. a b c d 15. a b c d
16. a b c d 17. a b c d 18. a b c d 19. a b c d 20. a b c d

Concept Applicator (CA)
1. (b) 2. (c) 3. (b) 4. (b) 5. (a) 6. (c)
7. (a) 8. (c) 9. (b) 10. (c) 11. (d) 12. (b)
13. (a) 14. (d) 15. (c)
1. (b) Since n distinct articles can be
arranged in n! ways hence 10 students
can be arranged in 10! ways.
2. (c) Out of 15 seats we will select 10 in
15C ways now 10 students can be
10
arranged on 10 seats in 10! ways.
Hence total number of ways is
10!. 15C10.
3. (b) We will solve this question by our
two step process
Step 1: Select
Step 2: Arrange
Step 1: Out of 20 players 1st we have
to select 11 that can be done in 20C11
ways
Step 2: Batting order of these 11
players can be made in 11! ways.
Hence total number of ways is (20C11)
(11!) which is also equal to 20P11.
4. (b) We will solve this question by our
two step process
Step 1: Select
Step 2: Arrange
Step 1: Out of 20 players 1st we
have to select 11 that can be done
in 19C10 ways since Sachin is always
selected.
Arrangement  111
Solutions
Step 2: Batting order of these 11
players can be made in 11! ways.
Hence total number of ways is
(19C10) (11!).
5. (a) We will solve this question by our
two step process
Step 1: Select
Step 2: Arrange
Step 1: Out of 20 players 1st we
have to select 11 that can be done in
18C ways since Sachin and Sourav
11
are always rejected.
Step 2: Batting order of these 11
players can be made in 11! ways.
Hence total number of ways is
(18C11) (11!).
6. (c) We will solve this question by our
two step process
Step 1: Select
Step 2: Arrange
Step 1: Out of 20 players 1st we have
to select 11 that can be done in 16C9
ways since Sachin and Sourav are
always selected but Yuvi and Dinesh
always rejected.
Step 2: Batting order of these 11
players can be made in 11! ways.
Hence total number of ways is
(16C9) (11!).
112  Theory of Counting
7. (a) We will solve this question by our keep the English books (Now we are
two step process using 2 step process). 4 places can be
Step 1: Select selected out of 7 in 7C4 ways. Now
at 4 English books can be arranged
Step 2: Arrange
at 4 places in 4! ways. Hence total
Step 1: From 2 wicket keepers only
number of ways is (6!)(7C4 × 4!)
1 is selected and this can be done in
which is also equal to (6!)(7P4 ).
2C ways and remaining 10 can be
1
selected from remaining 13 players 11. (d) Since number of Maths books are 6
and that can be done in 13C10 so total while that of English books are only
number of ways is 2C1 × 13C10. 4. Hence, we have no arrangement
where two maths books are not
Step 2: Batting order of these 11
together.
players can be made in 11! ways.
Hence total number of ways is 12. (b) 1st tie all the English books together,
(2C1 × 13C10)(11!). that can be done in 4! ways, then
arrange 6 Maths book and that can be
8. (c) Here we just have to arrange these
done in 6! ways, now this will create
10 distinct articles and that can be
7 places and out these 7 places select
done in 10! ways.
1 place, that can be done in 7 ways
9. (b) 1st ask a question to yourself, do we
and now put the bundle of English
need to select something? You will
books at that place.
get an answer no, we just have to
arrange in a particular fashion so here Total number of ways 7(4!)(6!).
we will not use our two step process. 13. (a) Similar to above question number of
Since all the English books are ways is (5)(4!)(6!).
together, they can be arranged in 4!
14. (d) Lets 1st person is a boy then boys
ways, similarly all the Maths book
can be arranged in (n!) ways and
can be arranged in 6! Ways and these
girls can be arranged in (n!) ways
two bundle of books can be arranged
so total number of ways is (n!)2,
in 2! ways. Hence total number of
similarly (n!)2 ways when girl is the
ways is 2!4!6!
1st person, hence the total number of
10. (c) 1st we will arrange 6 volumes of ways is 2(n!)2.
Math books in 6! Ways, this will
15. (c) Consider P it is the number of ways
create 7 spaces such that if we place
in which 7 students can be arranged
1 English book in each of the space
on 10 chairs in a straight lines hence
no English books can be together.
P = (10C7)(7!) = 10P7.
So we have now 7 places for 4
English books, so out of 7 places we Similarly,
will 1st select 4 places where we will Q = (10C7)(7!) = 10P7 so P = Q.

Concept Builder (CB)
1. (a) 2. (b) 3. (a) 4. (b) 5. (c) 6. (b)
7. (d) 8. (b) 9. (a) 10. (b) 11. (a) 12. (d)
13. (b) 14. (d) 15. (b)
1. (a) Here we have to arrange 6 distinct
articles at six places and that can be
done in 6! ways.
2. (b) Here 1st we need to select and then
arrange (two step process) selection
of 3 boys and 3 girls can be done in
6C × 7C ways, now after selecting
3 3
these 6 we have to arrange these 6
students and that can be done in 6!
ways. Hence total number of ways is
(6!)(6C3 × 7C3).
3. (a) Since 5 Indians will be together so
tie them together, that can be done
in 5! ways, similarly 6 Americans
and 4 Russians can be tied together
in 6! and 4! ways respectively. Now
these three bunch of persons can be
arranged in 3! ways, so total number
of ways is (3!5!6!4!).
4. (b) Since 5 science books can be arranged
in 5! ways, 4 Literature books can
be arranged in 4! ways, and 3 Arts
books can be arranged in 3!
Number of different language books
= 15 – 5 – 4 – 3 = 3
Now total 3 + 3 = 6 units can be
arranged in 6! ways,
Total number of ways is (5!4!3!6!)
5. (c) Similar question we have solved in
Concept applicator (CA) , all the boys
can be arranged in 10! ways, while
8 girls can be arranged in 8! ways.
Now these two bunches of boys and
girls can be arranged in 2! ways.
Total number of ways is (2!)(10!)(8!).
Arrangement  113
6. (b) Total number students is 10 + 8 = 18
out of these 18 students there is no
restriction with 18 – 2 = 16 students.
Hence 16 students can be arranged
in 16! ways, and it will create 17
spaces so Seema and Reema can be
placed in any of the 17 places in 17
ways and these two can be arranged
in 2! ways. Hence total number of
ways is (16!)(17)(2!)
7. (d) Similar to above question 16
students can be arranged in 16!
ways, and it will create 17 spaces.
So Seema and Reema can be
placed in any of the 17 places in
17C × 2! ways, total number of ways
2
is (16!)(17C2 × 2!).
Alternately: Without restriction 18
students can be arranged in 18! ways,
and from the answer of previous
question out of these 18! ways there
are (16!)(17)(2!)ways where Reema
and Seema are always together, so
the number of ways that they are
not together is 18! – (16!)(17)(2!).
8. (b) Without restriction we can arrange
10 students in 10! ways, and the
number of ways in which tallest and
shortest students are together is
2(9!), hence number of ways in which
the tallest and shortest are never
together is (10!) – 2(9!) = 8(9!).
9. (a) In this case we have total 10 seats
5 for boys and 5 for girls, so we will
have two cases,
114  Theory of Counting
Case (i) when 1st place is occupied
by a boy then situation is as shown
below
B G B G B G B G B G
Number of arrangements in this
case is (5!)(5!)
Case (ii) when 1st place is occupied
by a girl then situation is as shown
below
G B G B G B G B G B
Number of arrangements in this
case is (5!)(5!).
Total number of ways is 2(5!)(5!).
10. (b) Logic says that one servant can
carry more than one card but one
card can not be carried by more than
1 servant. So 1st card can be dealt
in 4 ways, 2nd card again in 4 ways
and so on, so total number of ways is
4 × 4 × 4 × ... × 4= 410.
Concept Cracker (CC)
1. (a) 2. (a) 3. (d) 4. (a) 5. (a) 6. (b)
7. (a) 8. (b) 9. (d) 10. (b) 11. (d) 12. (d)
13. (a) 14. (b) 15. (c) 16. (b) 17. (c) 18. (b)
19. (b) 20. (a)
1. (a) Here we have different cases:
Case 1: When one flag is used,
number of ways 1 flag is selected
is 5C1 and it can be arranged in 1!
ways. Hence number of ways in this
case is (1!)(5C1) = (5P1) = 5.
Case 2: When two flags are used,
number of ways 2 flags is selected
is 5C2 and it can be arranged in 2!
ways. Hence number of ways in this
case is (2!)(5C2) = (5P2) = 20.
Case 3: When three flags are used,
number of ways 3 flags is selected
is 5C3 and it can be arranged in 3!
11. (a) Here it is given that each boy can get
any number of prizes hence 1st prize
can be dealt in 10 ways, 2nd prize in 10
ways and so on, hence total number of
ways is 10 × 10 ... × 10 = 105.
12. (d) Required number of ways is
54 – 1 = 624.
13. (b) When there is no restriction 10
students can be arranged in 10! ways
out of these in 50% cases A is ahead
of B and in remaining 50% ways B
is ahead of A, hence number of ways
when A is ahead of B is (10!)/2.
14. (d) Here as per the given condition we
have only one way to arrange them
in this particular fashion and this is
ABABABABA. Here A denotes apple
and B denotes Banana.
15. (b) From the solution of previous
question arrangement is like
ABABABABA now since apples and
bananas are distinct so they can be
arranged in (4!)(5!).
ways. Hence number of ways in this
case is (3!)(5C3) = (5P3) = 60.
Case 4: When 4 flags are used,
number of ways 4 flags is selected
is 5C4 and it can be arranged in 4!
ways. Hence number of ways in this
case is (4!)(5C4) = (5P4) = 120.
Case 5: When 5 flags are used,
number of ways 5 flags is selected
is 5C5 and it can be arranged in 5!
ways. Hence number of ways in this
case is (5!)(5C5) = (5P5) = 120.
Total number of ways is 120 + 120 +
60 + 20 + 5 = 325.

2. (a) When there is no restriction 10
students can be arranged in 10!
ways. Out of these consider the
arrangements of A, B and C, the
possible arrangements are (A, B, C),
(A, C, B), (B, C, A), (B, A, C), (C, A,
B), (C, B, A) in total 3! or 6 ways. Out
of these 6 only one is (A, B, C) which
satisfy the given condition, hence we
can say that every 6 only one case
satisfy the given condition. Hence
total number of ways is (10!)/6.
3. (d) When there is no restriction 10 students
can be arranged in 10! ways. Out of
these consider the arrangements of A,
B and C, the possible arrangements are
(A, B, C), (A, C, B), (B, C, A), (B, A, C),
(C, A, B), (C, B, A) in total 3! or 6
ways. Out of these 6 only two are
(B, A, C) and (C, A, B) which satisfy
the given condition, hence we can say
that every 6 only two case satisfy the
given condition. Hence total number
of ways is 2(10!)/6 = (10!)/3.
4. (a) When there is no restriction 10
students can be arranged in 10!
Ways out of these consider the
arrangements of A, B C, and D can
arrange themselves in 4! = 24 ways,
out of these 24 the cases which
satisfy the condition is (C, A, B, D),
(C, B, A, D), (D, A, B, C), (D, B, A, C)
so out of every 24 only 4 cases satisfy
the given condition hence total
number of ways is
(4/24)(10!) = 10!/6.
5. (a) Here we have 4 different cases,
Case (i): When 1 item is taken at a
time then number of ways is 10.
Case (ii): When 2 items are taken
at a time then number of ways is
10 × 10 = 100.
Case (iii): When 3 items are taken
at a time then number of ways is
10 × 10 × 10 = 1000.
Arrangement  115
Case (iii): When 4 items are taken
at a time then number of ways is 10
× 10 × 10 × 10 = 10000.
So total number of ways is 10000 +
1000 + 100 + 10 = 11110.
6. (b) Since three students A, B and C want
to stand together hence number of
such arrangements is (3!)(8!). now
C and D do not want to stand next
to each other hence total number of
ways is (3!)(8!) – (3!)(2!)(7!) = (3!)(7!)(6).
7. (a) If rank 50 is at 6th position that
means 5 students are selected from
rank 1 to 49 and then they are
arranged, that can be done in (49C5)
(5!) = 49P5 ways, similarly 4 has to
selected and arranged from rank 51
to 100, that can be done in (50C4)
(4!) = 50P4 ways. Hence total number
of ways is (49P5)(50P4).
8. (b) From permanent nations 5 can be
selected in 2 × 2 × 2 × 2 × 2 = 32
ways and then remaining 5 out of 20
can be selected in 20C5 ways. Hence
total number of ways is 32(20C5).
In this question we don’t need
to arrange, it is just a selection
question or you can say it is wrong
placing of question it should be in
chapter 2. I placed this question just
to see that are u able to understand
the difference between selection and
arrangement.
9. (d) Without restriction 5 identical
apples, 6 identical bananas and 7
identical oranges can be arranged
18!
in a straight line in if
(5!)(6!)(7 !)
all the identical fruits are arranged
together then number of ways is 3!,
hence required number of ways is
18! 18!
− 3! or −6 .
(5!)(6!)(7 !) (5!)(6!)(7 !)
116  Theory of Counting
10. (b) Since ‘a’ seats from both the end is
reserved for executives, they can be
arranged in (2a!) ways. In between
we will have (b + c + 1) seats.
All the managers are together can
be arranged in (b!) ways, now out
of (c+1) seats senior managers and
director can be seated in such a way
that director has senior manager in
both the sides. i.e (SM, D, SM) this
can be done in (cC2)(2!) = cP2 ways.
Now bunch of managers, group of
director (which has three members)
and remaining (c – 2) senior managers
can be arranged in (c + 1)!.
Hence total number of ways is {(2a)!}
(b!){(c+1)!}{cP2}.
11. (d) In this case number of participants
from 10 different countries are 1, 2,
3… 10.
Number of ways that they can be
arranged in a row such that all the
participants from the same country
were together is (10!)(1!)(2!)(3!)
(4!)…. (10!).
Hence K = (10!)(1!)(2!)(3!)(4!)…. (10!)
highest power of 10 or that of 5 can
be given by only (5!)(6!)(7!)(8!)(9!)
(10!)(10!) which is 1 + 1 + 1 + 1 + 1 +
2 + 2 = 9.
12. (d) Without restriction 10 students can
be arranged in 10! Ways , now out
of these in ½ of them B is before C
and out of them ½ ways C is before
D, Hence required number of ways
is (10!)/4.
13. (a) Without restriction 4 persons can be
arranged in 4! = 24 ways.
Number of ways they can be arranged
such that 2 Indians are together is
(2!)(3!) = 12.
Number of ways they can be arranged
such that 2 American are together is
(2!)(3!) = 12.
Number of ways they can be
arranged such that 2 Indians as well
as 2 American are together is (2!)(2!)
(2!) = 8.
Hence required number of ways is
24 – { 2 × 12 – 8} = 8.
14. (b) Without restriction 6 persons can be
arranged in 6! ways.
Number of ways they can be arranged
such that 2 Indians are together is
(2!)(5!) = (10)(4!) = (40)(3!).
Number of ways they can be
arranged such that 2 American
are together is (2!)(5!) = (10)
(4!) = (40)(3!).
Number of ways they can be
arranged such that 2 Russians
are together is (2!)(5!) = (10)
(4!) = (40)(3!).
Number of ways they can be
arranged such that 2 Indians as well
as 2 American are together is (2!)(2!)
(4!) = (4)(4!) = (16)(3!).
Number of ways they can be
arranged such that 2 Indians as well
as 2 Russians are together is (2!)(2!)
(4!) = (4)(4!)= (16)(3!).
Number of ways they can be arranged
such that 2 American as well as
2 Russians are together is (2!)(2!)
(4!) = (4)(4!)= (16)(3!).
Number of ways they can be arranged
such that 2 Indians ,2 American as
well as 2 Russians are together is
(2!)(2!)(2!)(3!) = (8)(3!).
Hence required number of ways is
[6!] – (80)(3!) = 40(3!) =2(5!).
15. (c) Let two Chinese are tied together
in 2! ways. Other 2 Chinese are tied
together in 2! ways.
Now this group of two Chinese can
be made in (4C2)/2 = 3 ways.

To understand this let us assume
that the Chinese are A, B, C and D
and these can be divided in a group
of two as shown
(A, B) and (C, D)
(A, C) and (B, D)
(A, D) and (B, C)
Total 3 or (4C2)/2 = 3 ways
Next 5 Indians can be arranged in 5!
ways
Now we have 6 spaces between them
of which two places can be selected
and both bunches of Chinese can be
arranged in (6C2) × 2! = 6P2.
Hence total number of ways is (5!)
(2!)(2!)(6P2)(4C2)/2
16. (b) Since 7 boys can be arranged in (7!)
ways. Now 1st we will divide the 6
girl students into two groups of 3
students and that can be done in
(6C3)/2 ways = 10 ways. These 3 girls
can be arranged in (3!) ways among
themselves. Since 7 boys will create
8 separated space hence 1st group of
girls can be placed in 8 ways while
2nd group can be placed in 7 ways
hence total number of ways is (7!)
(8 × 7)(6C3)(3!)(3!)/2 = (8!)(7 × 10 ×
6 × 6) = 2520(8!).
17. (c) As per the given condition there
must be M red and N black balls in
1st (M + N) balls and similarly M
red and N black balls in last (M + N)
balls, in order to arrange in the given
condition we just have to arrange 1st
(M + N) balls, next (M + N) will have
only 1 way and that to image of 1st
(M + N) balls.
For 1st (M + N) balls we just have to
select M places out of (M + N) that
can be done in M+NCM ways then we
can arrange M red balls in these M
places in 1 way as all of them are
identical and remaining then in
Arrangement  117
remaining N places N black balls
can be arranged in 1 way hence total
number of ways is M+NCM.
18. (b) Let us assume that there are 2n
chairs where we have to place these
n boys and n girls. Out of 2n places
we will select n places and arrange all
the boys in increasing order of weight
(only in 1 way) then we can arrange
girls in the increasing order in 1 way,
so total number of ways is 2nCn.
19. (b) Since 7 friends can be arranged in
7! ways = 5040 ways without any
restriction.
Now consider the number of ways
when Amar, Bimal, and Chandan
are standing together and according
to their increasing order of height
this can be done in (5!) = 120 ways.
Similarly number of ways in which
Esha, Fatima and Garima are
standing together and according to
their increasing order of weight is
5! = 120 ways.
Then number of ways in which
Amar, Bimal, and Chandan are
standing together and according to
their increasing order of height and
also Esha, Fatima and Garima are
standing together and according to
their increasing order of weight is
3! = 6 ways.
Hence required number of ways is
5040 – 120 – 120 + 6 = 4806.
20. (a) Since out of 16 only 10 is available for
selection, out of 10, 3 can be selected
in 10C3 = 120 ways, and three from
the group of Mr. & Mrs. A, B and C
can be selected in 2 × 2 × 2 = 8 ways.
So total number of ways for selection
is 8 × 120 = 960 = 8(5!).
Then 6 works can be assigned to 6
persons in (6!) ways so total number
of ways is 8(5!)(6!).
118  Theory of Counting
Part B
Here is the main purpose of writing this
book is to eliminate the confusion between
Combination and Permutation, in order
to remove that confusion I have decided to
eliminate Permutation. In this chapter I am
going to give you only one concept/formula –
1
Concept Deviator (CD)
Ideal Time Revise your concept (IIT advance or
5 Min.
Per Question
1. What is the total number of ways of
arranging N persons of different age in a
straight line such that out of N persons
there are K persons always standing
according to their age (Increasing or
decreasing).
(a) 2(NPN – K) (b) 2(NCN – K)
(c) (NPN – K) (d) None of these
2. Amit a librarian has to arrange a book
shelf with 10 books for display. He has
books of 7 different subjects (Each subject
has more than 10 books), in how many
ways he can arrange book shelf such that
books from each subject is selected?
(a) (72)(10C7) (b) (73)(10C7)
(c) (7)(10C7) (d) None of these
3. In how many ways batting order of 22
players be decide if they are playing
against each other.
(a) (22P11)(11!)/2 (b) (22P11)(11!)
22
(c) (2!)( P11)(11!) (d) None of these
4. In how many ways 10 students (A,B, C,
D, …J)can be arranged in a row such
that A is always before B and C is always
before D and so on?
10! 10!
(a) (b)
32 2 (a) (4!)(19!)(24!)4 (b) (4!)(19!)4
5
(c) (10!) (d) None of these
Number of ways in which ‘n’ distinct
objects can be arranged is ‘n!’.
To solve questions related to Permutation
just follow one rule SATA (Select and then
Arrange)
“1st select and then arrange”
tougher questions)
5. In National Maths Olympiad 10
participants 2 From Bihar, 2 From
Maharashtra, and 2 from WB and
remaining 4 from 4 different states are
seated in a straight line for exam such
that no two participants from same state
are together. Find the number of ways in
which this can be done?
(a) (47)(8!) (b) (51)(8!)
(c) (89)(8!) (d) None of these
6. How many arrangements of A,B,C and D
can be made such that sequence AB, BC
or CD never occur?
(a) 14 (b) 11
(c) 16 (d) None of these
7. In MERI Kolkata 100 students are
standing in a line for an inspection.
During inspection it was found that 5th
student is also 5th in height, 25th student
is also 25th in height, similarly 50, 75th
and 100th students at 50th, 75th, and
100th position respectively according to
their height. In how many ways students
can arrange themselves if above condition
is satisfied? (Assume that all of them are
of different height)
(c) (4!)(24!)(19!) (d) None of these

Direction (Qs. 8 and 9):
Consider 26 letters of the English alphabets
they can be arranged in (26!) ways, out of
these (26!) ways letter A and B are together
in (2)(25!) ways.
8. In how many of the arrangements exactly
5 alphabets are between A and B?
(a) 36(24!) (b) 38(24!)
(c) 40(24!) (d) None of these
9. In how many of the arrangements at
most 20 alphabets are between A and
B?
(a) 360(24!) (b) 630(24!)
(c) 480(24!) (d) None of these
10. If n students are standing in a straight
line such that 1st half (i.e for 1st n/2 if
n is even or (n+1)/2 otherwise) students
are arranged according to the increasing
order of their height and 2nd half students
are arranged according to decreasing
order of height. If total number of ways
that this arrangement can be done is
a three digit number then how many
values of n exist?
(a) 0 (b) 3
(c) 4 (d) None of these
11. Let A be a set of n distinct elements. Then
the total number of distinct functions
from A to A is…(X)..and out of these …
(Y)… are onto functions, then the value
of (X, Y) is   [IIT JEE 1985]
n
(a) nn, ∑ ( −1)n−r  C(n, r )(r n )
r =1
n 16. In a class of 10 students, there are 3 girls.
(b) nn–1, ∑ ( −1)n−r  C(n, r )(r n )
r =1
n
(c) nn, ∑  C(n, r )(r n )
r =1
(d) None of these
12. Total number of ways in which six ‘+’ and
four ‘–’ signs can be arranged in a line
Arrangement  119
such that no two ‘–’ signs occur together
is… [IIT JEE 1988]
(a) 21 (b) 31
(c) 35 (d) None of these
13. Eight chairs are numbered 1 to 8. Two
women and three men wish to occupy
one chair each. First the women choose
the chairs from amongst the chairs
marked 1 to 4; and then the men select
the chairs from amongst the remaining.
The number of possible arrangements is
[IIT JEE 1982]
(a) 6C × 4C (b) 4P2 × 4P3
3 2
(c) 4C × 4P3 (d) None of these
2
14. m men and n women are to be seated
in a row so that no two women sit
together. If m > n then the number
of ways in which they can be seated is
[IIT JEE 1983]
m !(m + 1)! m!
(a) (b) (m − n + 1)!
(m − n + 1)!
(m + 1)!
(c) (d) None of these
(m − n + 1)!
15. In how many ways three girls and nine
boys can be seated in two vans each
having numbered seats, 3 in front and 4
at the back if 3 girls sit together at the
back row of a van? [IIT JEE 1996]
(a) 2(12!) (b) 4(12!)
(c) 12! (d) None of these
In how many different ways can they be
arranged in a row such that no two of the
three girls are consecutive?
[IIT JEE 1961]
(a) 49(8!) (b) 42(7!)
(c) 42(8!) (d) None of these
120  Theory of Counting

Response Grid
1. a b c d 2. a b c d 3. a b c d 4. a b c d 5. a b c d
6. a b c d 7. a b c d 8. a b c d 9. a b c d 10. a b c d
11. a b c d 12. a b c d 13. a b c d 14. a b c d 15. a b c d
16. a b c d

2
Concept Eliminator (CE)
Ideal Time Revise your concept (Maths Olympiad
Just solve it or tougher questions)

1. Based on Chinese Maths Olympiad:- 2. What is the number of ways of arranging

In how many ways 4 symbols 2 ‘+’ and the n roses in these m vases if m is an
2 ‘–’ can be placed on a chess board such even number?
that each smaller square contains at mP
(a) 2n–1 (b) m/2P
n. 2
n
most 1 symbol and each row or column n

can not contain the same symbol? (c) m/2P n–1 m/2P n–1
n–1. 3 (d) n. 2
(a) 3136 (b) 9630656 3. What is the number of ways of arranging
(c) 96336792 (d) None of these the n roses in these m vases if m is odd
DIRECTIONS (Qs. 2 to 4): Answer the and the middle vass is empty?
questions on the basis of the information (m+1)/2P n–1 (m–1)/2P n
given below. (a) n. 2 (b) n. 2

(c) (m–1)/2P n–1

There are m numbers of flower Vases are n. 2 (d) None of these
placed in a row of a flower exhibition and
4. What is the number of ways of arranging
there are n (m>2n +1) distinct roses are to be
the n roses in these m vases if m is odd
decorated with these vases.
and middle vass is occupied?
These flower vases are arranged such that
(a) (m–1)/2P n–1 (m+1)/2 Pn–1.2n
out of any two vessels located symmetrically n–1. 2 (b)
about the middle of the row, at least one vass (m–1)/2P n–1
(c) n–1.n.2 (d) None of these
is empty.

Response Grid
1. a b c d 2. a b c d 3. a b c d 4. a b c d
 Arrangement  121

Solutions
Concept Deviator (CD)

1. (a) 2. (a) 3. (a) 4. (a) 5. (c) 6. (b)

7. (d) 8. (c) 9. (b) 10. (c) 11. (a) 12. (c)
13. (d) 14. (a) 15. (c) 16. (c)

1. (a) Without restriction N persons can
be arranged in N! ways, while K
persons can be arranged in K! ways
but instead they are arranging
themselves in only 2 ways, increasing
or decreasing hence number of ways
2(N!)
is = 2(NPN–K) ways
K!
2. (a) Here we have to arrange 10 books
from 7 subjects such that book from
each subject is selected, the required
cases are as follows-
Case (1) 1 book from each of 6 distinct
subjects and 4 books from remaining
subject, the selection can be made
in (7C1 = 7 ways) and they can be
arranged in (10!)/(4!), hence total
(7)(10!)
number of ways is
4!
Case (2) 1 book from each of 5 distinct
subjects and 3 books from remaining
one subject and 2 books from
remaining subject , the selection can
be made in (7C2 = 42 ways) while the
subjects can be allotted to them in 2!
Ways, and they can be arranged in
(10!)/(3!)(2!) , hence total number of
(42 )(10!)(2!) = (10!)(21)
ways is
(3!)(2!)(2!) 3!
Case (3) 1 book from each of 4 distinct
subjects and 2 books from remaining
each subject , the selection can be
made in (7C3 = 35 ways) while the
subjects can be allotted to them in
only 1 way as each from 2 subjects,
and they can be arranged in
10!
, hence total number of
(2!)(2!)(2!)
(35)(10!) = (10!)(105)
ways is
(2!)(2!)(2!) (3!)(4)
So total number of ways is
(10!)(105)
(7 )(10!) +  (10!)(21) +
(3!)(4)
4! 3!
105  (10!)(7 )
2
10!  7
= +  
2 1 
+ =
3!  4 4  3!
= (72)(10C7)
3. (a) 22 players can be divided into 2
teams of 11 players in (22C11)/2 ways
and then batting order of each team
can be done in (11!) ways. Hence
total number of ways is (22C11)(11!)
(11!)/2 = (22P11)(11!)/2.
4. (a) Since 10 students can be arranged
in (10!) ways out of this (10!) ways
in 50% case A is before B, hence
122  Theory of Counting
number of ways that A is before B
10!
is , similarly the number of ways
2!
that A is always before B and C is
10!
always before D is ways,
(2!)(2!)
similarly for all the pairs and the
10! 10!
number of ways is = .
5
(2!) 32
5. (c) Without restriction 10 participants
can be arranged in 10! ways.
Number of ways that 2 participants
from each of the three states are
together is (2!)(2!)(2!)(7!) = 8!
Number of ways that 2 participants
from each of the two states are
together is (2!)(2!)(8!) = (4)(8!)
Number of ways that exactly 2
participants from each of the two
states are together is (4)(8!) – (8!)
= (3)(8!)
Number of ways that 2 participants
from one of the state are together is
(2!)(9!) = (18)(8!)
Then Total number of ways in
which at least from one state two
participants are together is 3{(18)
(8!)} – {(3)(8!)+ (3)(8!) + (3)(8!)}
– 2{(8!)} = 43(8!)
Hence required number of ways is 10!
– 43(8!) = (90)(8!) – (43)(8!) = (47)(8!)
6. (b) Total number of ways that A, B, C
and D can be arranged is 4! = 24,
Number of arrangements that AB
(or BC and CD) are together in the
given sequence is 3! = 6
Number of arrangements in which AB
and BC (i.e ABC) together is 2! = 2
Number of ways that AB, BC and
CD are together (i.e ABCD) is 1
So required number of ways is
24 – 3 × 6 + 3 × 2 –1 = 11
7. (d) Since 1st 4 students at 1st 4 places
(According to height) they can be
arranged in 4! Ways, similarly
from position number 6th to 24th
are taken by all the students from
6th highest height to 24th highest
height, they can be arrange in (19!)
ways similarly next each groups can
be arranged in (24!) ways, so total
number of ways is 4(19!)(24!)3.
8. (c) Since there are 5 alphabets between
A and B.
One number from A or B can be
selected in 2 ways.
1st letter can be placed at 1st, 2nd , or
at 20th position so in 20 ways,
Then remaining 24 letters can be
arranged in (24!) ways.
So total number of ways is (2)(20)
(24!) = 40(24!)
9. (b) From the solution of previous
question
0 letters between A and B then
number of ways is
2(25)(24!) = 50(24!)
1 letter between A and B then
number of ways is
  2(24)(24!) = 48(24!)
2 letters between A and B then
number of ways is
  2(23)(24!) = 46(24!)
And so on 20 letters between A and
B then number of ways is
  2(5)(24!) = 10(24!)
So total number of ways is
(24!)(50 + 48 + 46 + ….. + 10) = 630(24!)
10. (c) As per the given condition we have
two cases-
Case (i) If n is even say 2k then a1< a2<…
ak-1<ak and ak> ak+1> ak+2> … > a2k

Case (ii) If n is odd say 2k+1 then a1< a2<…
ak<ak+1 and ak+1> ak+2> ak+3>…> a2k
In case (i) we have to just select k–1
out of 2k–1 i.e., in 2k–1Ck–1 ways.
In case (ii) we have to just select k
out of 2k–1 i.e., in 2k–1Ck ways
So we have following results
If n = 9 or k = 4 then number of ways
is 8C4 ways = 70
If n = 10 or k = 5 then number of
ways is 9C4 ways = 126
If n = 11 or k = 5 then number of
ways is 10C5 ways = 252
If n = 12 or k = 6 then number of
ways is 11C5 ways = 462
If n = 13 or k = 6 then number of
ways is 12C6 ways = 924
If n = 14 or k = 7 then number of
ways is 13C6 ways = 1716
So n may be equal to 10, 11, 12, 13
11. (a) The value of X = nn
And the value of Y
n arranged in (7!) ways now this will
   = ∑ ( −1)n−r  C(n, r )(r n )
r =1
12. (c) Total number of characters are
6 + 4 = 10
6 signs of ‘+’ can be arranged in 1
way (They are identical) then they
Arrangement  123
will create 7 gaps and we have to
select 4 gaps out of these 7 gaps that
can be done in 7C4 ways = 35 ways.
13. (d) 2 women select the chairs amongst 1
to 4 is 4P2
From the remaining 6 chairs 3 men
can be arranged in 6P3 ways
Total number of ways is (4P2)(6P3)
14. (a) First we will arrange m men and
that can be done in (m!) ways, this
will create (m+1) places for n women
{(m !)(m + 1)!}
in m+1Pn =
{(m + 1 − n)!}
15. (c) 3 girls can be seated at the back row
in 2 × 2(3!) ways, and remaining 9
boys can be arranged on remaining
11 seats in (11P9) ways so total
number of ways is 2 × 2(3!) (11P9)
= 12!
16. (c) Since number of girls is 3 and that of
boys is 7.
As per the given condition no two
girls are together so 7 boys can be
create 8 separated places where girls
can be arranged , and the number
of ways for this is 8P3 or 8 × 7 × 6
ways.
So total number of ways is (6 × 7 × 8)
(7!) = 42(8!).
124  Theory of Counting
Concept Eliminator (CE)
1. (b) 2. (b) 3. (b) 4. (c)
1. (b) 1st consider ‘+’ sign the two ‘+’ signs
can be placed in 64 × 49 ways,
similarly 2 ‘–’ signs can be placed in
64 × 49 ways.
So total number of ways is 64 × 49 ×
64 × 49, but out of these there are 64
× 49 ways where both the ‘+’ and both
the ‘–’ signs are in the same square
and 64 × (64 × 49) ways where one of
the ‘+’ sign and one of the ‘–’ sign are
in same square.
Required number of ways is
(64 × 49)2 – (64 × 49) – 64(64 × 49)
= 64 × 49(64 × 49 – 1 – 64)
= 3136 × 3071 = 9630656
2. (b) As per the given condition m is even,
consider the right half of the vases in
the row, m/2 vases. Now we arrange
the n roses only in these m/2 vases
or we have to arrange n articles
at m/2 places, this can be done in
(m/2) P ways.
n
For each flower there are two ways
it can be arranged. Hence n flowers
can be arranged in 2n ways
Hence a total of m/2Pn. 2n ways.
3. (b) If m is odd, then there will be a
middle vass. If the vass is left
vacant. Similar to above question
required number of ways is
    (m–1)/2Pn. 2n
4. (c) The solution to this question is
similar to the previous question
except that one rose is in the middle
vass. The flower to be assigned the
middle chair can be selected out of
n boys in nC1 ways = n ways. Now
the remaining n–1 roses have to be
arranged in m–1 vases satisfies the
given condition. That is (m–1)/2Pn–1.
2n–1 ways .as, selection of rose and
arrangement of rest n–1 roses are
independent events. Therefore, total
number of ways = n. (m–1)/2Pn–1 2n–1
 5
Circular Arrangement  125

Circular Arrangement

Topics Covered

 Circular Arrangement

 Formation of Garland

 Formation of Necklace/Bracelet

(Polya Counting/Burnside Lemma)

Part A: Topic Number of Questions

Solved Example 5
Concept Applicator 15
Concept Builder 15
Concept Cracker 15
Part B: Topic Number of Questions
Concept Deviator 6
Concept Eliminator 4
Total 60
126  Theory of Counting
Part A

Concept 1 Circular Arrangement

The main difference between a linear arrange- Hence, we can say that ‘n’ articles can be
ment and a circular arrangement is the point arranged in a straight line in n! ways.
of reference. To understand this let us take an And ‘n’ articles can be arranged in a circle in
example of three persons A, B and C, for linear (n – 1)! ways.
arrangement we have 3! = 6 ways and these 6
ways are ABC, ACB, BCA, BAC, CAB, CBA. Let us see the reason behind this. If we have
Now consider circular arrangement for this to arrange 10 students on 10 chairs in a
we have following case: straight line then how we will proceed, Lets
A call 1st student how many different seats are
A
available for him the answer is 10 as each
and every seat is distinguishable (Means we
can name each and every seat as 1st from
right end, 7th from left etc.) Similarly for 2nd
student 9 distinguishable seats are available
B C C B and so on. So total number of ways is 10 × 9 ×
8 × … × 2 × 1 = 10!.
Now consider 4 persons A, B, C and D they can
be arranged in a straight line in 4! = 24 ways Now consider the case when we have to
but when we have to arrange them around a arrange 10 students on 10 chairs around a
circle then we have following 6 cases: circle, again lets call 1st student now how
A A A many different seats are available the answer
is 1 as each seat is equivalent and they are not
distinguishable now for 2nd student there are
B D D B C D
9 options as taking the 1st student as reference
point 9 seats are distinct and distinguishable
C C B
then next student has 8 options and so on so
A A A total number of ways is 1 × 9 × 8 × ... × 2 × 1 = 9!
So the main difference is for the 1st person in
D C B C C B linear arrangement for 1st person we have ‘n’
seats while in a circular arrangement it is only 1.
B D D
QR Code / Video Link

For Smart phone/ Tablet users

Video Link for Desktop/Laptops users http://dishapublication.com/video-resources


Example 1:  In how many ways 20 students
can be seated around a circular table
having 20 seats?
Solution:  Since number of students is 20
hence number of ways is 19!.
Example 2:  In how many ways 20 students
can be seated around a circular table
having 20 seats such that two students
A and B are always together?
Solution:  To make this arrangement just
assume that A and B are tied together,
it can be done in (2!) ways, now we have
Circular Arrangement  127
19 distinct elements that can be arranged
around a circle in (18!) ways hence total
number of ways is (2!)(18!).
Example 3:  In how many ways 20 students
can be seated around a circular table
having 20 seats such that two students
A and B are never together?
(a) (9!) – (2!)(8!) (b) (2!)(8!)
(c) 2(9!) (d) None of these
Solution:  From the solution of previous two
questions required answer is (19!) – (2!)
(18!)

Concept 2 Formation of Garland

Consider 4 beads and we have to make a Now, if we look at carefully then figures (i)
necklace from those 4 beads, at 1st glance it and (iv) represents same necklace, if we
looks that we have to arrange A, B, C and D in turn figure (i) then we will get figure (iv) so
a circle and that can be done in 3! = 6 ways, and figure (i) and (iv) represents same necklace
these 6 arrangements are as shown below, similarly figure (ii) and figure (v) represents
A A A same necklace and figure (iii) and figure (vi)
represents same necklace so total number of
B D D C C B necklace is 6/2 = 3.
When clockwise and anticlockwise arrange-
C B D ments are not different i.e when observation
Fig. (i) Fig. (ii) Fig. (iii) can be made from both sides, then number of
circular arrangements of n different things is
(n – 1)!/2.
A A A
Example 4:  Find the number of ways in
D B C D B C which 20 different coloured beads can
be arranged to form a necklace.
C B D Solution:  Since number of beads is 20 hence
Fig. (iv) Fig. (v) Fig. (vi) number of necklace is 19!/2.

QR Code / Video Link

For Smart phone/ Tablet users

Video Link for Desktop/Laptops users http://dishapublication.com/video-resources

128  Theory of Counting
Example 5:  If number of garlands that
can be formed from n distinct flowers
is 60 then find the value of n.
1
Concept Applicator (CA)
Ideal Time
15 Min.
1. In how many ways 10 students can be
seated round a circular table having 10
seats?
(a) (10!) – (9!) (b) 9!
(c) 2(9!) (d) None of these
2. In how many ways 10 students can be
seated around a circular table having 10
seats such that two students A and B are
always together?
(a) (9!) – (2!)(8!) (b) (2!)(8!)
(c) 2(9!) (d) None of these
3. In how many ways 10 students can be
seated around a circular table having 10
seats such that two students A and B are
never together?
(a) (9!) – (2!)(8!) (b) (2!)(8!)
(c) 2(9!) (d) None of these
4. In how many ways 7 boys and 8 girls can
be seated around a circular table?
(a) (7!) × (8!) (b) 14!
(c) 2(14!) (d) None of these
5. In how many ways 7 boys and 8 girls can
be seated around a circular table if all
the boys sit together?
(a) (7!) × (8!) (b) 14!(7!)
(c) (7!) × (9!) (d) None of these
6. In how many ways 7 boys and 8 girls can
be seated around a circular table if all
the girls sit together?
(a) (7!) × (8!) (b) 14!(7!)
(c) (7!) × (9!) (d) None of these
Solution:  As per the given condition
(n – 1)!/2 = 60 or (n – 1)! = 120 or n – 1 = 5
or n = 6.
Apply your concepts with easy and
conceptual questions
7. In how many ways 7 boys and 8 girls can
be seated around a circular table if all
the boys do not sit together?
(a) (7!) × (8!) (b) 14!(7!)
(c) (14!) – (7!)(8!) (d) None of these
8. In how many ways 7 boys and 8 girls can
be seated around a circular table such
that no two boys sit together?
(a) (7!) × (8!) (b) (9!)(7!)
(c) (14!) – (7!)(8!) (d) None of these
9. In how many ways 7 boys and 8 girls can
be seated around a circular table such
that no two girls sit together?
(a) (7!) × (8!) (b) (9!)(7!)
(c) (14!) – (7!)(8!) (d) None of these
10. In how many ways 7 boys and 8 girls can
be seated around a circular table having
15 chairs numbered from 1 to 15?
(a) (7!) × (8!) (b) (9!)(7!)
(c) (14!)(15) (d) None of these
11. In how many ways 7 boys and 8 girls can
be seated around a circular table having
15 chairs, 1 wooden and 14 fiber chairs?
(a) (7!) × (8!) (b) (9!)(7!)
(c) (14!)(15) (d) None of these
12. A round table conference is to be held
between 20 delegates of 20 countries. In
how many ways they can be seated if 2
particular delegates always sit together.
(a) (18!) (b) (2!)(18!)
(c) (19!)/(2) (d) None of these

13. A round table conference is to be held
between 20 delegates of 20 countries. In
how many ways they can be seated if 2
particular delegates never sit together.
(a) (18!) (b) (2!)(18!)
(c) (18!)(17) (d) None of these
14. Find the number of ways in which 15 dif-
ferent coloured beads can be arranged to
form a necklace.
Circular Arrangement  129
(a) (14!) (b) (14!)/2
(c) (15!)/2 (d) None of these
15. Find the number of ways in which 15
same coloured identical beads can be ar-
ranged to form a necklace.
(a) (14!) (b) (14!)/2
(c) (15!)/2 (d) None of these

Response Grid
1. a b c d 2. a b c d 3. a b c d 4. a b c d 5. a b c d
6. a b c d 7. a b c d 8. a b c d 9. a b c d 10. a b c d
11. a b c d 12. a b c d 13. a b c d 14. a b c d 15. a b c d

2
Concept Builder (CB)
Ideal Time Revise your concepts with questions
25 Min. medium difficulty level questions

1. In how many ways 20 students can be
seated around a circle so that 2 particu-
lar students are always together?
(a) (2!)(18!) (b) (2!)(19!)
(c) (2!)(2!)(8!) (d) None of these
2. In how many ways 20 students can be
seated around a circle so that 3 students
A, B, C are always together?
(a) (3!)(18!) (b) (2!)(19!)
(c) (3!)(17!) (d) None of these
3. In how many ways 20 students can be
seated around a circle so that 3 students
A, B, C are always together and B is be-
tween A and C?
(a) (3!)(18!) (b) (2!)(17!)
(c) (3!)(17!) (d) None of these
4. If the ratio of number of arrangements
when n students are arranged in a
straight lines to the number of arrange-
ments when n students are arranged in
a circle is 9 then which one of the follow-
ing is the value of n?
(a) 8 (b) 9
(c) 10 (d) None of these
5. In how many ways 16 students can be
arranged around a square table having 4
seats on each side.
(a) (2)(15!) (b) (4)(15!)
(c) (15!)/2 (d) None of these
130  Theory of Counting
6. In how many ways 20 students can be
arranged around a square table having 5
seats on each side?
(a) (5)(19!) (b) (4)(19!)
(c) (19!)/2 (d) None of these
7. In how many ways 15 students can be ar-
ranged around an equilateral triangular
table having 5 seats on each side.
(a) (5)(14!) (b) (4)(14!)
(c) (15!)/2 (d) None of these
8. In how many ways 12 students can be
arranged around a isosceles triangular
table having 5 seats on each of the equal
sides and 2 seats on 3rd side.
(a) (2)(11!) (b) (5)(11!)
(c) (12!) (d) None of these
9. In  an  international  convention,  5  par-
ticipants from each of USA, China and
Russia were arranged around a circle. In
how many ways this arrangement can be
made if participants from the same coun-
try are always together?
(a) (3!)(5!)(5!)(5!) (b) (2!)(5!)(5!)(5!)
(c) (3!)(5!)(5!)(5!) (d) None of these
10. In  an  international  convention,  5  par-
ticipants from each of USA, China and
Russia were arranged around a circle.
In how many ways this arrangement can
be made if no two participants from USA
are together?
(a) (9!)(10P (9!)(10C
5) (b) 5)
(c) (3!)(5!)(5!)(5!) (d) None of these
11. The ratio of number of arrangements
when all the boys arranged in a circle to
Response Grid
1. a b c d 2. a b c d 3. a b c d 4. a b c d 5. a b c d
6. a b c d 7. a b c d 8. a b c d 9. a b c d 10. a b c d
11. a b c d 12. a b c d 13. a b c d 14. a b c d 15. a b c d
the number of arrangements when all
the girls arranged in a circle is 56:1 then
find the number of ways of arranging all
of them in a circle?
(a) 15! (b) 16!
(c) 17! (d) None of these
12. Which one of the following could be
the ratio of number of arrangements of
a group of students around a circular
table when all the boys are together to
the number of arrangements when all
the girls together?
(a) 56 : 1 (b) 120 : 1
(c) 1 : 12 (d) None of these
13. Which one of the following could be
the ratio of number of arrangements of
a group of students around a circular
table when no two boys are together to
the number of arrangements when no
two girls together?
(a) 0 (b) 120 : 1
(c) 1 : 12 (d) None of these
14. In a family gathering 4 couples were to
sit around a circular table such that no
two males as well as no couple is togeth-
er, in how many ways this arrangement
can be made?
(a) 6 (b) 12
(c) 18 (d) None of these
15. In how many ways 2 identical red flow-
ers and 2 identical yellow flowers can be
used to make a garland?
(a) 6 (b) 5
(c) 4 (d) None of these

3
Concept Cracker (CC)
Ideal Time
30 Min.
Directions for questions number 1 to 6
The participants of an annual general meeting
are 25 executives, 2 managers and a director.
The meeting is conducted around a circular
table.
1. In how many ways this arrangement can
be made?
(a) (2!)(26!) (b) (2!)(25!)
(c) (27!) (d) None of these
2. In how many ways this arrangement can
be made if the director has 2 managers
on his both sides?
(a) (2!)(26!) (b) (2!)(25!)
(c) (26!) (d) None of these
3. In how many ways this arrangement can
be made if the director has a particular
manager Mr.Dhingchak next to him?
(a) (26!) (b) (2!)(25!)
(c) (2!)(26!) (d) None of these
4. In how many ways this arrangement
can be made if the director has at least 1
manager next to him?
(a) (22!)(26!) (b) (102)(25!)
(c) (22!)(25!) (d) None of these
5. In how many ways this arrangement
can be made if the director has exactly 1
manager next to him?
(a) (100!)(26!) (b) (102!)(25!)
(c) (22!)(25!) (d) None of these
6. In an annual general meeting of a
company 25 executives, 2 managers and
a director are sitting around a circular
table such that director has no manag-
Circular Arrangement  131
Boost up your confidence with good
questions
er next to him. In how many ways this
arrangement can be made?
(a) (2!)(26!) (b) (2!)(25!)
(c) (2!)(26!) (d) None of these
7. In how many ways 20 students can be
arranged around two circular tables
having 10 seats each?
(a) (20C10)(9!) (b) (20C10)(9!)(9!)
(c) 2(20C10)(9!)(9!) (d) None of these
8. A group of students comprising 3 girls
and 5 boys went for a picnic. During a
game they arranged in a circle such that
each boy has one girl on at least one
side?
(a) 120 (b) 360
(c) 720 (d) None of these
9. Rishita has 5 distinct red and 5 distinct
white flowers how many distinct gar-
lands she can make if flowers no flowers
of same colour are together?
(a) 12(5!) (b) (4!)(5!)
(c) (5!)(5!) (d) None of these
10. In the above question, how many gar-
lands she can make if all the flowers of
the same colour are together?
(a) 12(5!) (b) 2(5!)(5!)
(c) (5!)(5!) (d) None of these
11. In Praxis Business school during a meet-
ing professors from different department
were to sit around a circular table. If
number of professors from Marketing,
Finance, Operations, and HR are 4, 5, 6
and 7 in any order. In how many ways
they can be seated around the table if
132  Theory of Counting
all the professors from the same depart-
ment are together?
(a) (2!)(4!)(5!)(6!)(7!)
(b) (3!)(4!)(5!)(6!)(7!)
(c) (4!)(5!)(6!)(7!)
(d) None of these
12. In Praxis Business school during a meet-
ing professors from different department
were to sit around a circular table. If
number of professors from Marketing,
Finance, Operations, and HR are 5 each.
In how many ways they can be seated
around the table if all the professors
from the same department are together
and HOD of any department is exactly
between the professors of that depart-
ment?
(a) (3!)(4!)4 (b) (4!)4
4
(c) (4)(4!) (d) None of these
13. In an annual general meeting of a
company XYZ limited, President and
Chairman have fixed seats opposite
to each other. There are 2n number of
participants in the meeting other than
President and Chairman. In how many
ways seating arrangements be made if
two participants Mr. Susmit and Mr.
Hasan do not sit next to each other?
(a) (4n2 – 6n + 4)(2n – 2)!
(b) (4n2 – 6n – 4)(2n – 2)!
(c) (4n2 + 6n + 4)(2n – 2)!
(d) None of these
14. There are 40 distinct pearl, out of which
20 are of blue coloured and remaining 20
are of red coloured. How many different
necklace can be formed such that no two
beads of same colour are together?
(a) (40!) – 2(19!)(20!)
(b) (39!) – 2(19!)(20!)
(c) 1/2 (19!)(20!)
(d) None of these
15. In how many ways 32 students can be ar-
ranged around two square tables having
16 seats each (4 seats on each side of the
table)?
(a) (32C16)(4)(15!)
(b) (32C16)(4)(15!)(4)(15!)
(c) (32C16)(15!)(15!)
(d) None of these

Response Grid
1. a b c d 2. a b c d 3. a b c d 4. a b c d 5. a b c d
6. a b c d 7. a b c d 8. a b c d 9. a b c d 10. a b c d
11. a b c d 12. a b c d 13. a b c d 14. a b c d 15. a b c d

Concept Applicator (CA)
1. (b) 2. (b) 3. (a) 4. (b) 5. (a) 6. (a)
7. (c) 8. (a) 9. (d) 10. (c) 11. (c) 12. (b)
13. (c) 14. (b) 15. (d)
1. (b) Since n distinct articles can be
arranged around a circle in (n – 1)!
Hence 10 students can be arranged
in 9! ways.
2. (b) To make this arrangement just
assume that A and B are tied
together, it can be done in (2!) ways,
now we have 9 distinct elements
that can be arranged around a circle
in (8!) ways hence total number of
ways is (2!)(8!).
3. (a) From the solution of previous
two questions required answer is
(9!) – (2!)(8!).
4. (b) Here we have total 7 + 8 = 15 distinct
elements that can be arranged in
14! ways.
5. (a) Since boys sit together so tie all
the boys together it can be done in
(7!) ways, now we can treat them
as one unit then we have total
8 + 1 = 9 distinct units and that can
be arranged in a circle in 8! ways.
Hence total number of ways is (7!)(8!).
6. (a) Similar to the previous question
total number of ways is (7!)(8!).
7. (c) From question number 4 without
restriction they can be arranged
in (14!) ways, and from question
Circular Arrangement  133
Solutions
number 5 the number of ways such
that all the boys are together is (7!)
(8!) hence required number of ways
is (14!) – (7!)(8!).
8. (a) Restriction is on boys so 1st we will
arrange 8 girls and that can be done
in (7!) ways. Now this will create 8
spaces between them in which 7 boys
can be seated in (8!) ways, hence
required number of ways is (7!)(8!).
9. (d) If we place boys 1st then it will create
only 7 places so it is not possible
that no two girls sit together. Total
number of ways is 0.
10. (c) Since each of the seat is numbered
and hence distinguishable so it is
equivalent to linear arrangement
and number of ways is 15! or (14!)
(15) as given in option (c).
11. (c) Taking wooden chair as reference
point, 1st person can be arranged in
15 ways and so on hence number of
ways is 15!.
12. (b) Since 2 delegates are always together
so we can tie them in (2!) ways now
19 elements can be arranged in (18!)
ways hence required number of ways
is (2!)(18!)
134  Theory of Counting
13. (c) Without restriction they can be
arranged in (19!) ways and with
restriction in (2!)(18!) ways hence
in this case number of ways is
(19!) – (2!)(18!) = (17)(18!).
Concept Builder (CB)
1. (a) 2. (c) 3. (b) 4. (b) 5. (b) 6. (a)
7. (a) 8. (c) 9. (b) 10. (a) 11. (a) 12. (d)
13. (a) 14. (b) 15. (d)
1. (a) If two students are together then
they can be arranged in 2! ways and
remaining 19 units can be arranged
in (18!) ways, hence total number of
ways is (2!)(18!).
2. (c) If three students are together then
they can be arranged in 3! ways and
remaining 18 units can be arranged
in (17!) ways, hence total number of
ways is (3!)(17!).
3. (b) If three students are together then
they can be arranged in 2 ways as per
the given condition and remaining
18 units can be arranged in (17!)
ways, hence total number of ways is
(2!)(17!).
4. (b) Required ratio is (n!)/(n–1)! = n,
hence n = 9.
5. (b) For 1st student total number of
ways is 4 [extreme right of a side,
one from extreme side, two from
extreme right, extreme left] then for
next student number of ways is 15
and so on. So total number of ways
is (4)(15!).
6. (a) For 1st student total number of ways
is 5 [extreme right of a side, one from
extreme side, middle one, three from
extreme right, extreme left], then for
next student number of ways is 19
and so on. So total number of ways
is (5)(19!).
14. (b) Here in this case number of ways is
(14!)/2.
15. (d) Since beads are identical so total
number of ways is 1.
7. (a) For 1st student total number of ways
is 5 [extreme right of a side, one from
extreme side, middle one, three from
extreme right, extreme left] then for
next student number of ways is 14
and so on. So total number of ways
is (5)(14!).
8. (c) For 1st student total number of
ways is 12 as each and every seat is
distinguishable, hence this case is
similar to linear arrangement, and
so number of ways is (12!).
9. (b) As a 1st step tie all the participants
from same nation this can be done in
(5!) for each country, now we have 3
units that can be arranged in a circle
in (2!) ways hence total number of
ways is (2!)(5!)(5!)(5!).
10. (a) Since, there is no restriction with
participants from China and Russia
hence these 10 members can be
arranged around circle in (9!)
ways, this will create 10 spaces, so
now 5 participants from USA can
be arranged in these 10 places in
(10C5×5!) = (10P5), hence total number
of ways is (9!)(10P5).
11. (a) From the given condition (b – 1)!
/(g – 1)! = 56 = 7 × 8, hence b = 9 and
g = 7, so total number is 7 + 9 = 16 and
required number of ways is (15!)
 Circular Arrangement  135
12. (d) Let the number of boys is b 14. (b) Let 1st arrange 4 females that can
and number of girls is g then in be done in (3!) ways now this will
both the condition the number create 4 places in which males can
of arrangements is (b!)(g!), and be arranged in 2 ways hence total
required ratio is 1. number of ways is 2 × 3! = 12 ways.
13. (a) Exactly one of the two 15. (d) Two red flowers can be arranged in
arrangements must be zero. 1 way, and then 2 yellow flowers can
Refer questions number 8 and 9 of be arranged in 2 ways.
Concept Applicator. (Ratio becomes 1 Hence total number of ways is 2.
when b = g)

Concept Cracker (CC)

1. (c) 2. (b) 3. (c) 4. (b) 5. (d) 6. (d)
7. (b) 8. (c) 9. (a) 10. (c) 11. (b) 12. (a)
13. (a) 14. (c) 15. (b)

1. (c) This is a general case, since total managers are next to the Director
number of units is 25 + 2 + 1 = 28 That we have calculated in question
and these can be arranged around a number 2 and is equal to 2(25!).
circular table in (27!) ways.
Hence required number of ways is
2. (b) The director and two managers can 4(26!) – 2(25!) = 102(25!).
be arranged in (2!) ways and let they
are tied together then we have total For better understanding see the
26 units that can be arranged in (25!) Venn Diagram below:
ways hence total number of ways is
Total = (27!)
(2!)(25!).
3. (c) Manger Mr. Dhingchak and the M1 M2
52(25!) 52(25!)
director can be arranged in 2 ways.
If we tie this manager and director
then we can treat them as a unit then
50(25!) 2(25!) 50(25!)
we will have 27 units and that can be
arranged in a circle in (26!) ways. So
total number of ways is (2)(26!).
4. (b) A manager can be selected in 2 ways
now this manager and the director
can be arranged in 2 ways. If we tie 5. (d) From solution of previous questions
this manager and director, then we required number of ways is
can treat them as a unit then we   102(25!) – 2(25!) = 100(25!).
will have 27 units and that can be
arranged in a circle in (26!) ways. So 6. (d) Without restriction they can be
total number of ways is (4)(26!). arranged in (27!) ways, and the
number of ways in which at least
But this case also includes the
one manager is next to director is
number of ways in which both the
102(25!) [from question number 4].
136  Theory of Counting
So required number of ways is
(27!) – 102(25!) = 26 × 27(25!) – 102(25!)
= 600(25!)
Alternately: In this case the
Director has two executives next
to him, these two executives can
be selected in 25C2 ways and these
two can be arranged in (2!) ways.
Now treat these two executives and
director as one unit then we have 26
distinct units which can be arranged
in (25!) ways. Hence total number of
ways is (25C2)(2!)(25!) = 600(25!).
7. (b) 1st we will select 10 out of 20 that
can be done in (20C10) ways, now
we have two groups of 10 students
each group can be arranged around
a circular table in (9!) ways hence
total number of ways is (20C10)(9!)
(9!) ways.
8. (c) Since, 5 boys can be arranged in a
circle in (5 – 1)! = (4!) = 24 ways,
Now girls can be arranged 5 × 3 × 2
= 30 ways.
Hence total number of ways is
24 × 30 = 720.
9. (a) Since, 5 red and 5 white flowers can
be arranged in a circle in (4!)(5!) if no
flowers of same colour are together
hence in case of garland it will be
(4!)(5!)/2 = 12(5!).
10. (c) If they have to arrange in a circle
then number of ways is (2!)(5!)(5!),
so number of garlands is (2!)(5!)(5!)/2
= (5!)(5!).
11. (b) If we treat each department as one
unit then we have 4 units and that
can be arranged in a circle in (3!)
ways, and these faculties themselves
can be arranged in (4!), (5!), (6!) and
(7!) ways.
Hence total number of ways is (3!)
(4!)(5!)(6!)(7!).
12. (a) If we treat each department as one
unit then we have 4 units and that
can be arranged in a circle in (3!)
ways, and these faculties with their
HOD at center can arranged in (4!)
ways for each department.
Hence total number of ways is
(3!)(4!)(4!)(4!)(4!) = (3!) (4!)4.
13. (a) Here we have two cases:
Case (i): If Mr. Susmit is next to
President or Chairman, then he can
select his seat in 4 ways.
In this case Mr. Hasan can select his
seat in (2n – 2) ways and remaining
(2n – 2) participants can be arranged
in (2n – 2)! ways.
So total number of ways in this case
is 4(2n – 2)(2n – 2)!
Case (ii): If Mr. Susmit do not sit next
to President or Chairman, then he can
select his seat in (2n – 4) ways.
In this case Mr. Hasan can select his
seat in (2n – 3) ways and remaining
(2n – 2) participants can be arranged
in (2n – 2)! ways.
So total number of ways in this case
is (2n – 4)(2n – 3)(2n – 2)!
So total number of ways is 4(2n – 2)
(2n – 2)! + (2n – 4)(2n – 3)(2n – 2)!
= (4n2 – 6n + 4)(2n – 2)!
14. (c) Let us fix 1st a particular colour,
20 beads of same colour (But beads
are distinct) can be arranged for
necklace in (20 – 1)!/2 = (19)!/2 ways.
There are 20 separated space in which
we can put beads of different colour,
this can be done in (20!) ways.
Hence total number of such necklace
is 1/2 (19!)(20!).
15. (b) 1st we will select 16 out of 32 that
can be done in (32C16) ways, now
we have two groups of 16 students
each group can be arranged around
a square table in (4)(15!) ways hence
total number of ways is (32C16)(4)
(15!)(4)(15!) ways.
 Part B Circular Arrangement  137

Circular
Concept 1 Arrangement
The main difference between a linear arrange- but when we have to arrange them around a
ment and a circular arrangement is the point circle, then we have following 6 cases:
of reference. To understand this let us take an A A A
example of three persons A, B and C, for linear
arrangement we have 3! = 6 ways and these 6 B D D B C D
ways are ABC, ACB, BCA, BAC, CAB, CBA.
Now consider circular arrangement for this C C B
we have following case:
A A A A
A
D C B C C B

B D D
Hence we can say that ‘n’ articles can be
B C C B
arranged in a straight line in n! ways.

And ‘n’ articles can be arranged in a

Now consider 4 persons A, B, C and D they can
circle in (n – 1)! ways
be arranged in a straight line in 4! = 24 ways

Concept 2 Formation of Garland

A A A
Consider 4 beads and we have to make a
necklace from those 4 beads, at 1st glance it
B D D C C B
looks that we have to arrange A, B, C and D in
a circle and that can be done in 3! = 6 ways, and C B D
these 6 arrangements are as shown below: Fig. (i) Fig. (ii) Fig. (iii)
138  Theory of Counting
A A A (ii) and figure (v) represents same necklace
and figure (iii) and figure (vi) represents same
D B C D B C
necklace so total number of necklace is 6/2 = 3.
When clockwise and anti-clockwise arrange-
C B D
ments are not different i.e., when observation
Fig. (iv) Fig. (v) Fig. (vi)
can be made from both sides, then number of
Now, if we look at carefully then figures (i) and circular arrangements of n different things
(iv) represents same necklace, if we turn figure
(n – 1)!
(i) then we will get figure (iv) so figure (i) and is .
2
(iv) represents same necklace similarly figure

Concept 3 Formation of Necklace/Bracelet

(Polya Counting/Burnside Lemma)

Consider a regular hexagon, how many ways Case (iii): If both rotations and reflections
we can colour the six vertices of this with the are equivalent then number of
two available colour black and white. There are ways is 13.
mainly three ways in which it can be answered Case (i) is obvious but have a look at case
(i) “There are 64 ways of colouring the (ii) all the 14 arrangements are shown below:
hexagon.”
(ii) “There are 14 ways of colouring the
hexagon.”
(iii) “There are 13 ways of colouring the
hexagon.”
All the three answers are all valid, since the
question was not clear. Consider each sections Fig. 1 Fig. 2
separately
Case (i): If rotations and reflections are
considered to be distinct, then
number of ways is 26 = 64
Case (ii): If rotations are considered to be
equivalent, but reflections are
distinct, then number of ways is 14. Fig. 3 Fig. 4
 Circular Arrangement  139
7 and Fig number 8 will represents the same
arrangement hence in this case total number
of cases is 14 – 1 = 13.

Burnside Lemma
The number of distinct objects is equal to the
mean number of objects fixed by each symmetry.
Fig. 5 Fig. 6 The counting we have done in case (ii) whose
diagram is shown by 14 figures are called
necklace and the counting we have done in
case (iii) is called bracelet.
The difference between a necklace and bracelet
is in bracelet reflections are equivalent.
The conclusion from the Burnside Lemma and
Polya Enumeration Theorem we can conclude
Fig. 7 Fig. 8 in simple terms that number of Necklace that
can be formed by n beads of k colours is:
1 n gcd(n, i )
(n, k) = ∑k
n i=1
Special case is when n = a prime number p
then
1
(p, k) = {(p − 1)k +  k p }
Fig. 9 Fig. 10 p
Example 1:  Number of necklace that can
be formed by 3 beads of 3 colours is
1 1 1 3 1
(3, 3) = (3 +  3 +  3 ) = (3 + 3 + 27) =  11
3 3
Example 2:  Number of necklace that can
be formed by 6 beads of 4 colours is

Fig. 11 Fig. 12 1 1 2 3 2 1 6
(6, 4 )  (4   4   4   4   4   4 )
6
1
 (4 1  6   64 1
  6   4   4096)
6
1
 (4200)   700
6
As in case (iii) both rotations and reflections are
equivalent (We call it as bracelet): number of bracelet
Fig. 13 Fig. 14 when n = p a prime number with k colour is
p+ 1
For case (iii), since both rotations and 1  p 2

reflections are equivalent hence Fig number b(p, k ) =  k +  p × k +  (p − 1)k 
2p  
140  Theory of Counting

Number of Necklace
Colour (k) → 1 2 3 4 5 6 7 8 9 10
Beads (n) ↓
1 1 2 3 4 5 6 7 8 9 10
2 1 3 6 10 15 21 28 36 45 55
3 1 4 11 24 45 76 119 176 249 340
4 1 6 24 70 165 336 616 1044 1665 2530
5 1 8 51 208 629 1560 3367 6560 11817 20008
6 1 14 130 700 7826 19684 19684 43800 88725
7 1 20 315 2344 11165 39996
8 1 36 834 8230 48915
9 1 60 2195 29144
10 1 108 5934
Larger values are omitted from the table

Number of Bracelets

Colour (k) → 1 2 3 4 5 6 7 8 9 10
Beads (n) ↓
1 1 2 3 4 5 6 7 8 9 10
2 1 3 6 10 15 21 28 36 45 55
3 1 4 10 20 35 56 84 120 165 220
4 1 6 21 55 120 231 406 666 1035 1540
5 1 8 39 136 377 888 1855 3536 6273 10504
6 1 13 92 430 1505 4291 10528 23052
7 1 18 198 1300 5895 20646
8 1 30 498 4435 25395
9 1 46 1219 15084
10 1 78 3210
Larger values are omitted from the table
 Circular Arrangement  141

1
Concept Deviator (CD)
Ideal Time Revise your concept (IIT advance or
5 Min. tougher questions)
Per Question

1. How many ways we can pick 4 non-adja-
cent balls from 20 different balls if they
are arranged in a circle.
(a) 17C 16C
3 (b) 3
(c) 17C
3–
15C
2 (d) None of these
2. How many necklace of 5 beads can be
formed from the infinite number of iden-
tical red and infinite number of identical
green beads?
(a) 12 (b) 8
(c) 15 (d) None of these
3. Eighteen guests have to be seated half
on each side of a long table. Four particu-
lar guests desire to sit on one particular
side and three other on the other side.
Determine the number of ways in which
the sitting arrangements can be made?
[IIT JEE 1991]
(a) (11!)(9P 4 )(9P 3) (b) (9!)(9P4)(9P3)
(c) (11!)(9C 4 )(9C 3) (d) None of these
4. A round table conference is to be held
between 20 delegates of 20 countries. In
how many ways can they be seated if two
particulars delegates are always to sit
together? [IIT JEE 1970]
(a) 3(18!) (b) 2(18!)
(c) 18! (d) None of these
5. In how many ways vertices of a square
can be coloured with 4 distinct colour if
rotations are considered to be equivalent,
but reflections are distinct?
(a) 65 (b) 70
(c) 71 (d) None of these
6. In how many ways vertices of a square
can be coloured with 4 distinct colour if
both rotations and reflections are equiv-
alent?
(a) 65 (b) 70
(c) 71 (d) None of these

Response Grid
1. a b c d 2. a b c d 3. a b c d 4. a b c d 5. a b c d
6. a b c d
142  Theory of Counting

2
Concept Eliminator (CE)
Ideal Time Revise your concept (Maths Olympiad
Just Solve It or tougher questions)

1. If ‘K’ balls are arranged in circular order, of the same colour are assigned a num-
then what is the number ofways of se- ber 0. What is the greatest possible sum
lecting four of the balls such that no two of all the numbers assigned to the arcs?
of which are consecutive? (a) 100 (b) 120
k(k − 7)(k − 6)(k − 5) (c) 150 (d) None of these
(a)
4! 3. In how many rotationally distinct ways
k(k − 7)(k − 6)(k − 5)(k − 4) can the vertices of a cube be coloured
(b)
4! with black or white colour?
k(k − 7)(k − 6)
(c) (a) 18 (b) 20
4!
(d) None of these (c) 23 (d) None of these
2. This question is based on Maths Olympiad: 4. In how many ways can a strip of cloth
with 5 stripes on it be colored with
Sixty points, of which thirty are coloured
3 different colours? Assume that the strip
red, twenty are coloured blue, and ten
of cloth can be flipped over i.e do not count
are coloured green, are marked on a
as different patterns that are equivalent
circle. These points divide the circle into
if the cloth is turned around. As example
sixty arcs. Each of these arcs is assigned
following two strips are same
a number according to the colours of its
endpoints: an arc between a red and a R W G R W
green point is assigned a number 1, an
arc between a red and a blue point is as- W R G W R
signed a number 2, and an arc between (a) 135 (b) 270
a blue and a green point is assigned a
(c) 105 (d) None of these
number 3. The arcs between two points

Response Grid
1. a b c d 2. a b c d 3. a b c d 4. a b c d

Solutions
Concept Deviator (CD)
1. (d) 2. (b) 3. (a) 4. (b) 5. (b) 6. (d)
 Circular Arrangement  143
1. (d) 1st ball (say A) can be selected in We can also solve this question by
20 ways, then remaining three (say applying Burnside Lemma.
B, C, and D) are selected such that 3. (a) As per the given condition 9 seats
number of balls between them is a,
are on each side, 4 persons can be
b, c and d, from the given condition
arranged on one side in (9P4) ways,
a, b, c, d > 0
and 3 persons on other side in (9P3)
And a + b + c + d = 20 – 4 = 16, but ways remaining 11 can be arranged
since all of them are more than 0 hence
in (11!) ways, So total number of
number of ways is (From partitioning
ways is (11!)(9P4)(9P3).
theory) is (16 – 1)C4 – 1 = 15C3.
But 1st one in 20 ways and there is a 4. (b) If we tie two delegates together then
repetition of 4 (since these four balls this can be done in (2!) ways, now we
can be selected when we start with have 19 distinct identities and that
B or C or D so we have to divide the can be arranged around a circle in
final answer by 4) hence final answer (18!) ways.
is (20 × 15C3)/4 = 20 × 13 × 14 × 15/4 So total number of ways is 2(18!).
× (3!) = 2275.
5. (b) Here in this case condition is
2. (b) We have following cases similar to formation of necklace i.e.,
Cases Red Green No. of 1 n gcd(n , i )
Beads Beads ways (n, k) = ∑k
n i=1
Case (i) 5 0 1
We can use this formula or from the
Case (ii) 4 1 1 table (you shouldn’t memorize it)
Case (iii) 3 2 2 required number of ways is 70.
Case (iv) 2 3 2 6. (d) This case is similar to the formation
Case (v) 1 4 1 of bracelet so from the formula or
Case (vi) 0 5 1 table b(4,4) = 55.
So total number of ways is 8

Concept Eliminator (CE)

1. (a) 2. (a) 3. (c) 4. (a)

1. (a) 1st ball (say A) can be selected in
K ways, then remaining three (say
B, C, and D) are selected such that
number of balls between them is a,
b, c and d, from the given condition
a, b, c, d > 0.
And a + b + c + d = K – 4, but since
all of them are more than 0, hence
number of ways is (from partitioning
theory) is (k – 5)C4 – 1 = (k – 5)C3.
But 1st one in K ways and there is a
repetition of 4 (since these four balls
can be selected when we start with B
or C or D so we have to divide the final
answer by 4) hence final answer is
k(k − 7)(k − 6)(k − 5)
(k/4)[(k – 5)C3] =
4!
2. (a) Number of red coloured card–30
Number of blue coloured card-20
Number of green coloured card-10
144  Theory of Counting
Point between red and green is 1
Point between red and blue is 2
Point between blue and green is 3
Point between same colour is 0
For maximum point, we will keep all
the 30 red coloured points alternately
and fill up with blue and green colour
in the vacant place, so total points is
2 × 20 × 2 + 2 × 10 × 1 = 100.
3. (c) Each vertex can be coloured in 2 ways,
so there are 28 = 256 ways (when
vertices are fixed under the action of
the trivial symmetry) now consider
symmetry under different rotations.
There are 22 = 4 (out of 256) that
are fixed under a 90 degree rotation
about the axis joining the mid-points
of two opposite faces.
There are 24 = 16 (out of 256) that
are fixed under a 120o rotation about
the axis joining two diametrically
opposite corners. (In this case
rotation splits up the 8 vertices as
1 + 3 + 3 + 1 = 8).
There are 24 = 16 (Out of 256) that
are fixed under a 180o rotation about
the axis joining the mid-points of
two opposite faces. (In this case
rotation splits up the 8 vertices as
2 + 2 + 2 + 2 = 8).
There are 24 = 16 (out of 256) that
are fixed under a 180o rotation about
the axis joining the mid-points of
two opposite edges. (In this case
rotation splits up the 8 vertices as
2 + 2 + 2 + 2 = 8).
The number of ways in which we can make a strip with n strip and k colour is given by:
 n+ 1 
 
n
k + k 2 
2
here {x} is the greatest integer function.
Hence the number of orbits is
1
(1 × 256 +  6 × 4 +  8 × 16 +  3 × 16 +  6 × 16)
24
= 23.
4. (a) If we did not consider strips to be the
same when turned around or flipped
over, then each of the 5 stripes can
be filled with any of 3 colors, or total
number of ways is 53 making a grand
total of kn possible strips.
But the answer must be lesser than
125, because when turn the strip
around, it matches with one that has
the opposite coloring as explained in
the question itself.
The answer is given by adding the
number of symmetric cases to the
number of non-symmetric cases
divided by 2, so we have to find
the number of symmetric and non-
symmetric cases:
If we look out carefully then a
symmetric strip has the similar
pattern on the right as on the left, so
once we know what’s on the left, the
pattern on the right is determined.
There’s a different case with odd and
even sized strips. For an even number
of stripes, say when n = 2k, there are
km different symmetric possibilities
and if n is odd, n = 2k + 1, there are
km+1 symmetric possibilities.
In this case n = 5, so number of
symmetric possibilities are 33 = 27
So required number of ways is
  (35 + 33)/2 = 135.
 6
Word/Number Formation  145

Word/Number Formation

Topics Covered
 Formation of word

 Formation of number

 Rank of a word in Dictionary

 Sum of all the numbers formed

 Number of palindrome numbers

Part A: Topic Number of Questions

Solved Example 10
Concept Applicator 15
Concept Builder 20
Concept Cracker 28
Part B: Topic Number of Questions
Concept Deviator 17
Concept Eliminator 11
Total 101
146  Theory of Counting
Part A

Concept 1 Formation of Word

Word/number formation question is one of the
most important type of questions. To solve
these type of questions we have to understand
the arrangement of identical articles.
The number of arrangements of n articles
taken all at a time when p of them are
identical and are of one type, q of them are
identical and of second type, r of them are
identical and of third type, and remaining are
n!
all of different is . Example 2:  How many words can be
{( p !)(q !)(r !)}
To understand this let us assume that
required number of permutations is x. Since
p different things can be arranged among
themselves in (p!), hence if we replace p
identical articles by p distinct articles then
the number of permutations will become (p!)
(x). Similarly, if we replace q identical article
by q distinct articles then the number of
permutations will become (p!)(q!)(x) and if we
replace r identical article by r distinct articles
then the number of permutations will become
(p!)(q!)(r!)(x) which is equal to (n!)
Hence, (p!)(q!)(r!)(x) = n!
n!
or x =
{( p !)(q !)(r !)}
Example 1:  How many words can be
formed from the letters of the word
HINDUSTAN?
Solution:  Number of letters in the word
HINDUSTAN is 9, out of these 9 letters N
is repeated twice, hence number of distinct
words that can be formed (9!)/2.
formed from the letters of the word
PERMUTATION?
Solution:  Number of letters in the word
PERMUTATION is 11, out of these 11
letters T is repeated twice, hence number of
distinct words that can be formed (11!)/2.
Example 3:  How many words that
starts with T and end with T can be
formed from the letters of the word
PERMUTATION?
Solution:  Number of letters in the word
PERMUTATION is 11, out of these 11
letters T is repeated twice, since 1st and last

QR Code / Video Link

For Smart phone/ Tablet users

Video Link for Desktop/Laptops users http://dishapublication.com/video-resources


place is fixed for letter ‘T’ hence number of
distinct words that can be formed (9!).
Example 4:  How many words that
starts with E and end with N can be
formed from the letters of the word
PERMUTATION?
Concept 2 Formation of number
Number formation is very much similar to
word formation and the only difference is that
at 1st place we can not put ‘0’ as example if it
is given that we have to form a 4 digit number
‘abcd’ then the digit ‘a’ can not be 0. Variation
in the question may occur if some property
of number is given as example divisible by
2 or 5 etc. To understand this just revise the
divisibility rule-
 2 – All even number is divisible by 2, or
the numbers end with an even number or
zero is divisible by 2,
 3- A number is divisible by 3 if sum of its
digits is divisible by 3.
 4 – A number is divisible by if 4 if the
number formed by the last two digits of
the number is divisible by 4, or last two
digits are 0’s.
QR Code / Video Link
For Smart phone/ Tablet users
Video Link for Desktop/Laptops users http://dishapublication.com/video-resources
Word/Number Formation  147
Solution:  Number of letters in the word
PERMUTATION is 11, out of these 11
letters T is repeated twice, since 1st and
last place is fixed for letters ‘E’ and ‘N’
respectively hence number of distinct words
that can be formed (9!)/2.
 5 – All numbers that end with 0 or 5 are
divisible by 5.
 6 – A number that is divisible by 2 and 3
both are divisible by 6.
 8 – A number divisible by 8 if number
formed by last three digits of the number
is divisible by 8 or last three digits are
zeroes.
 9 – A number is divisible by 9 if sum of its
digits is divisible by 9.
 11 – A number is divisible by 11 if the
difference between the sum of the digits
in the odd and the sum of the digits in the
even places is either 0 or multiple of 11.
 Ex: Is 245718 divisible by 11?
 Sol: Here sum of the digits at odd places
is 2 + 5 + 1 = 8, and sum of the digits
148  Theory of Counting
at even places is 4 + 7 + 8 = 19 and the
difference between these two is 19 – 8 = 11
that is divisible by 11 hence the given
number is divisible by 11.
 12 – A number is divisible by 12 when it
is divisible by 3 and 4 both.
 16 – A number is divisible by 16 when
number formed by last 4 digits of the
given number is divisible by 16 or last 4
digits are zeroes.
 7 and 13 – A number is divisible by 7 or 13
if and only if the difference of the number
of its thousands and the remainder of its
division by 1000 is divisible by 7 or 13.
Ex: Is 13153 divisible by 7.
Sol: Here number of thousands = 13 and
the remainder when it is divided by 1000
is 153 and difference 153 – 13 = 140 is
divisible by 7 hence the number 13153 is
divisible by 7.
Example 5:  How many four digit numbers
can be formed from the digits 0, 1, 2,
3, 4 and 5 if repetition of digits is not
allowed?
Solution:  Number of digits is 4 so 1stdigit
(i.e., thousandth digit) can not be zero
1st place can be filled up in 5 ways i.e., by
1, 2, 3, 4 or 5 then for remaining 3 places
we can select any 3 from remaining 5 digits
in 5C3 ways and can arrange them in 3! =
6 ways.
So total number of numbers formed is
5(5C3)(3!) = 5 × 10 × 6 = 300
Example 6:  Find the number of 4 digit
numbers.
Solution:  Since 1st place can be filled up
in 9 ways and remaining 3 places can be
filled up in 10 ways each so total number of
numbers is 3 × 10 × 10 × 10 = 3000
Example 7:  Find the number of 5 digit
numbers that can be formed from the
digits 2, 2, 3, 3, 3.
Solution:  Total number of given digits is 5
out of which there are 2 two’s and 3 three’s
hence number of ways we can arrange it is
(5!)/(2!)(3!) = 10
Example 8:  Find the number of 5 digit
numbers that can be formed from the
digits 2, 2, 3, 3, 3 such that the number
is divisible by 4 .
Solution:  Total number of given digits is 5
out of which there are 2 two’s and 3 three’s.
Since number is divisible by 4 hence last
two digits must be 32, then remaining 2,
2, 3 can be arranged in (3!)/(2!)(1!) ways
= 3 ways.
 Word/Number Formation  149

Rank of a word in Dictionary

Concept 3
Rank of a word is the position of that word,
when we arrange the words formed by
alphabets of that given word in dictionary
order. Lets see an example.
To understand this type of problem just
assume that we have only 3 letters A, B and C
in the English alphabets then the dictionary
will have total meaning full or meaning less
3! = 6 words and their order is
ABC → 1st word
ACB→ 2nd Word
BAC → 3rd Word
BCA → 4th Word
CAB → 5th Word
CBA → 6th Word
So, if I ask you what is the rank of word CAB
the answer is 5th.
Example 9:  If all the letters of the word
MOTHER is arranged in dictionary
format then find the rank/position of
the word MOTHER.
Solution:  We will solve this question stepwise
(i) Arrange all the alphabets of the word
MOTHER in alphabetical order like
(E, H, M, O, R, T).
(ii) Now in dictionary words will appear in
alphabetical order, so first words will
appear starting alphabet “E”. If E is fixed
at first position, rest 5 alphabets can be
arranged in 5! = 120 ways so there are
120 words in that dictionary that starts
with ‘E’
(iii) Next alphabet is “H” and similar to ‘E’
there will be 5! = 120 words starting with
“H”.
(iv) Now starting with “M”, just hold on,
given word MOTHER also starts with ‘M’
so now we will consider the 2nd letter.
(v) Next alphabet as “E” we will have 4! = 24
words that starts with ‘ME’.
(vi) Similarly starting with “M”, and next
alphabet as “H” we will have 4! = 24
words that start with ‘MH’.

QR Code / Video Link

For Smart phone/ Tablet users

Video Link for Desktop/Laptops users http://dishapublication.com/video-resources

150  Theory of Counting
(vii) Next will be starting with “M”, and next
alphabet as “O” and that combination is
in the given word MOTHER.
(viii) Next as “E” we’ll have 3! = 6 words that
starts with MOE.
(ix) Similarly starting with “MOH”, and
“MOR” we’ll have 3! = 6 words.
(x) Next will be starting with “MOTE”, we’ll
have 2! = 2 words.
(xi) Next will be starting with “M”, and next
alphabet as “O” and next as “T” and next
as “H” will have 2! = 2 words but the first
word will be M > O > T > H > E > R which
is the desired word.
So the rank of word MOTHER in
dictionary will be 5! + 5! + 4! +4! + 3! + 3!
+ 3! + 2! +1 which equals 309.
Alternately
(i) Arrange all the alphabets of the word
MOTHER in alphabetical order like
(E, H, M, O, R, T).
Now strike off the first letter M from
(E, H, M, O, R, T).
Then count the number of letters before
M, and it is equal to 2,which is the
Sum of All The
Concept 4 Numbers Formed
Consider three digits 1, 2 and 3, from these
three digits we can form 3! = 6 three digit
coefficient of 5!
Then strike off the next letter
O (E, H, M, O, R, T)
Then count the number of letters before
O and it is equal to 2 which is coefficient
of 4!
Then strike off the next letter
T (E, H, M, O, R, T)
Then count the number of letters before
T and it is equal to 3 which is coefficient
of 3!
Then strike off the next letter
H (E, H, M, O, R, T)
Then count the number of letters before
H and it is equal to 1 which is coefficient
of 2!
Then strike off the next letter
E (E, H, M, O, R, T)
Then count the number of letters before
E and it is equal to 0 which is coefficient
of 1!
Then the next word is MOTHER.
So rank of the word MOTHER is 2(5!) +
2(4!) +3(3!) + 1(2!)+ 0(1!) + 1 = 240 + 48 +
18 + 2 + 1 = 309.
Hence rank of word MOTHER is 309.
numbers and these numbers are : 123, 132,
213, 231, 312, 321. If we need to find the sum
of all these 6 numbers then

123 = 1 × 100 + 2 × 10 + 3 × 1
132 = 1 × 100 + 3 × 10 + 2 × 1
213 = 2 × 100 + 1 × 10 + 3 × 1
231 = 2 × 100 + 3 × 10 + 1 × 1
312 = 3 × 100 + 1 × 10 + 2 × 1
321 = 3 × 100 + 2 × 10 + 1 × 1
Sum = 12 × 100 + 12 × 10 + 12 × 1
= 1332
Alternately
Here sum of the digits at units place = 12
Sum of the digits at tens place = 12
Sum of the digits at hundreds place = 12
Sum of the numbers formed
= 12 × 1 + 12 × 10 + 12 × 100 = 1332
Thus in order to find the sum of the numbers
formed we must find the sum of the digits at
units, tens, hundreds places.
1
Concept Applicator (CA)
Ideal Time
15 Min.
1. How many distinct words can be formed
from all the letters of the word SOCIETY?
(a) 2(7!) (b) (7!)
(c) 3(7!) (d) None of these
2. How many distinct words can be
formed from the letters of the word
CREATIVITY?
(a) (10!)/(2!)(2!) (b) (10!)/(2!) (a) (10!)/(2!)(2!) (b) (9!)/(2!)(2!)
(c) (10!)/(4!) (d) None of these
Word/Number Formation  151
Then the sum of numbers formed
= sum of the digits at units place × 1
+ sum of the digits at tens place × 10
+ sum of the digits at hundreds place × 100
+………………………......……………………….
+……………………………………………………
or to summarize this sum of the numbers of
n digits formed with n different digits
(Number of numbers formed ) ×
=
(Sum of the digits)(1111…11 n times)
n
Example 10:  Find the sum of all the four
digit numbers formed by the digits 1,
2, 3 and 4
Solution:  Required summation is given by
(Number of numbers formed ) ×
=
(Sum of the digits)(1111…11 n times)
n
(4!)(1 + 2 + 3 + 4 )(1111) = 24 × 1 0  × 1 111 =  66660
=
4 4
Apply your concepts with easy and
conceptual questions
3. How many distinct words can be
formed from the letters of the word
ARRANGEMENT?
(a) (11!)/(2!)(2!) (b) (11!)/(2!)
(c) (11!)/(8) (d) None of these
4. How many distinct words can be formed
from the letters of the word CREATIVITY
that starts with C?
(c) (9!)/(2!)(2!)(2!) (d) None of these
152  Theory of Counting
5. How many distinct words can be formed 11. How many three digit numbers more
from the letters of the word CREATIVITY than 300 can be formed from the digits 1,
that starts with C and ends with Y? 2, 3, 4, 5 and 0?
[Repetition of digit is not allowed]
(a) (9!)/(2!)(2!)
(b) (8!)/(2!)(2!) (a) 60 (b) 120
(c) (8!)/(2!)(2!)(2!) (c) 80 (d) None of these
(d) None of these 12. How many numbers between 500 and
6. How many distinct words can be formed 5000 can be formed from the digits 0, 1, 3,
from the letters of the word CREATIVITY 5, 7, 9? [Repetition of digit is not allowed]
if all the vowels are together? (a) 600 (b) 180
(a) 12(7!) (b) 6(7!) (c) 160 (d) None of these
(c) (4!)(7!) (d) None of these
13. How many 4 digit even number can
7. How many distinct words can be formed
from the letters of the word CREATIVITY be formed from 0, 2, 3, 4, 5, 6 and 7?
if all the vowels are not together? [Repetition of digit is not allowed]
(a) 12(7!) (b) 6(7!) (a) 600 (b) 240
(c) (4!)(7!) (d) None of these (c) 440 (d) None of these
8. How many other words can be formed
from the letters of the word PATNA if 14. How many 4 digit odd number can
letter T is always at the middle? be formed from 0, 2, 3, 4, 5, 6 and 7?
(a) 12 (b) 11 [Repetition of digit is not allowed]
(c) 24 (d) None of these
(a) 300 (b) 220
9. How many 5 digit numbers can be
formed from the digits, 1, 2, 3, 4 and 5 if (c) 400 (d) None of these
repetition of digit is not allowed? 15. How many 4 digit numbers more than
(a) 112 (b) 120 2500 can be formed from 0, 1, 2, 3, 4, 5,
(c) 240 (d) None of these
and 6?
10. How many 4 digit numbers can be
formed from the digits, 1, 2, 3, 4 and 5 if [Repetition of digit is not allowed]
repetition of digit is not allowed?
(a) 600 (b) 520
(a) 120 (b) 121
(c) 240 (d) None of these (c) 400 (d) None of these

Response Grid
1. a b c d 2. a b c d 3. a b c d 4. a b c d 5. a b c d
6. a b c d 7. a b c d 8. a b c d 9. a b c d 10. a b c d
11. a b c d 12. a b c d 13. a b c d 14. a b c d 15. a b c d
154  Theory of Counting
12. How many numbers greater than 1000 17. How many numbers more than 4000 can
but not greater than 4000 can be formed be formed from the digits 0, 2, 4, and 6 if
with the digits 0, 1, 2, 3 and 4 if repetition repetition of digits is not allowed?
of digits being allowed? (a) 18 (b) 12
(a) 375 (b) 376 (c) 15 (d) None of these
(c) 360 (d) None of these 18. How many numbers less than 1000
13. How many 5 digit even numbers can be can be formed if repetition of digits is
formed from the digits 1, 2, 3, 4, and 5? not allowed and the number formed is
(a) 48 (b) 60 divisible by 5?
(c) 72 (d) None of these (Number should not be single digit)
14. How many 4 digit numbers are not (a) 168 (b) 162
divisible by 5? (c) 144 (d) None of these
(a) 4000 (b) 7200 19. How many 5 digit even number divisible
(c) 1800 (d) None of these by 5 can be formed from the digits 1, 2, 3,
15. How many 5 digit numbers greater than 4, 5, 6, 7, and 8
12345 can be formed from the digits 1, 2, (a) 1684 (b) 162
3, 4 and 5? (c) 1152 (d) None of these
(a) 59 (b) 71 20. Consider a set S = {0, 1, 2, 3, 4, 5},
(c) 95 (d) None of these positive integers are formed by taking
16. What is the number of 5 digit numbers not any number of digits from elements of
multiple of 5 formed only by the odd digits? set S. Total how many positive integers
[Repetition of digit is not allowed] can be formed?

(a) 59 (b) 96 (a) 1684 (b) 1612

(c) 95 (d) None of these (c) 1630 (d) None of these

Response Grid
1. a b c d 2. a b c d 3. a b c d 4. a b c d 5. a b c d
6. a b c d 7. a b c d 8. a b c d 9. a b c d 10. a b c d
11. a b c d 12. a b c d 13. a b c d 14. a b c d 15. a b c d
16. a b c d 17. a b c d 18. a b c d 19. a b c d 20. a b c d
154  Theory of Counting
10. How many 5 digit number divisible by (a) 59 (b) 71
125 can be formed from the digits 0, 1, 2, (c) 95 (d) None of these
3, 4, 5, 6 and 7? 16. What is the number of 5 digit numbers not
[Repetition of digit is not allowed] multiple of 5 formed only by the odd digits?
[Repetition of digit is not allowed]
(a) 72 (b) 84 (a) 59 (b) 96
(c) 88 (d) None of these (c) 95 (d) None of these
11. How many 5 digit number divisible by 25 17. How many numbers more than 4000 can
but not by 125 can be formed from the be formed from the digits 0, 2, 4, and 6 if
digits 0, 1, 2, 3, 4, 5, 6 and 7? repetition of digits is not allowed?
[Repetition of digit is not allowed] (a) 18 (b) 12
(c) 15 (d) None of these
(a) 232 (b) 244 18. How many numbers less than 1000
(c) 248 (d) None of these can be formed if repetition of digits is
12. How many numbers greater than 1000 not allowed and the number formed is
but not greater than 4000 can be formed divisible by 5?
with the digits 0, 1, 2, 3 and 4 if repetition (Number should not be single digit)
of digits being allowed? (a) 168 (b) 162
(a) 375 (b) 376 (c) 144 (d) None of these
(c) 360 (d) None of these 19. How many 5 digit even number divisible
by 5 can be formed from the digits 1, 2, 3,
13. How many 5 digit even numbers can be 4, 5, 6, 7, and 8
formed from the digits 1, 2, 3, 4, and 5? (a) 1684 (b) 162
(a) 48 (b) 60 (c) 1152 (d) None of these
(c) 72 (d) None of these 20. Consider a set S = {0, 1, 2, 3, 4, 5},
14. How many 4 digit numbers are not positive integers are formed by taking
divisible by 5? any number of digits from elements of
(a) 4000 (b) 7200 set S. Total how many positive integers
(c) 1800 (d) None of these can be formed?
15. How many 5 digit numbers greater than (a) 1684 (b) 1612
12345 can be formed from the digits 1, 2, (c) 1630 (d) None of these
3, 4 and 5?
 Word/Number Formation  155

3
Concept Cracker (CC)
Ideal Time Boost up your confidence with good
60 Min. questions

1. Letters of the word MATHEMATICS are (c) (11!)/(2!)(2!)(2!)(3!)

arranged in all the possible ways, in how (d) None of these
many words letter C is between S and 5. Letters of the word MATHEMATICS are
H (these three letters are not necessary arranged in all the possible ways, in how
together)?
many words both the 1st and the last
(a) (11!)/(2!)(2!)(2!) letter is a vowel?
(b) (11!)/(3!)(2!)(2!) (a) (9!)/(2!)(2!)(3!)(3!)
(c) (11!)/(3!)(3!)(2!) (b) (9!)/(2!)(2!)(2!)
(d) None of these
(c) (9!)/(2!)(2!)(2!)(3!)
2. Letters of the word MATHEMATICS are (d) None of these
arranged in all the possible ways, in how 6. How many 4 letters word containing
many words letter C is exactly between S 2 vowels and 2 consonants can be
and H ? formed from the letters of the word
(a) (9!)/(3!)(2!)(2!) DEVASTATION?
(b) (9!)/(2!)(2!)(2!) (a) 1638 (b) 1635
(c) (9!)/(3!)(3!)(2!) (c) 1644 (d) None of these
(d) None of these 7. How many words can be formed from the
3. Letters of the word MATHEMATICS are letters of the word ACCIDENT without
arranged in all the possible ways, in how changing the relative order of vowels?
many words letter C is exactly between (a) 1680 (b) 3360
two M’s? (c) 2440 (d) None of these
(a) (9!)/(2!)(2!) 8. How many words can be formed from the
(b) (9!)/(3!)(2!)(2!) letters of the word ACCIDENT keeping
(c) (9!)/(3!)(3!)(2!) the position of each vowel fixed?
(d) None of these (a) 180 (b) 60
4. Letters of the word MATHEMATICS are (c) 120 (d) None of these
arranged in all the possible ways, in how 9. How many words can be formed from the
many words both the A’s are before both letters of the word ACCIDENT without
the M’s? changing the relative order of vowels/
(a) (11!)/(2!)(2!)(3!)(3!) consonants?
(b) (11!)/(2!)(2!)(2!) [A vowel can occupies only vowel place]
156  Theory of Counting
(a) 180 (b) 160 the 1st slot which can not be 0. One fine
(c) 360 (d) None of these day Rajesh forgot his answer key and
10. How many words can be formed from the only he remember is that no more than
letters of the word CINEMA such that it 2 distinct digits are used to lock the key.
neither starts with C nor ends with A? How many attempts he has to make to
(a) 504 (b) 696 certainly open the lock?
(c) 360 (d) None of these (a) 444 (b) 216
11. How many words can be formed from the (c) 576 (d) None of these
letters of the word CINEMA such that it 17. What is the number of 3 digit numbers
neither starts with C nor end with A and with distinct digits in which digits are in
E is not at the 3rd position? A.P?
(a) 504 (b) 426 (a) 112 (b) 121
(c) 480 (d) None of these (c) 111 (d) None of these
12. How many words can be formed from the 18. Find the sum of all the four digit numbers
letter of the word PROGRAMMING such formed by digits 1, 2, 3 and 4.
that it neither starts with M nor end with (a) 111600 (b) 666600
M? (c) 66660 (d) None of these
(a) (10)(9!)/2 (b) 8(9!) 19. Find the number of 5 digit numbers
(c) 9(9!) (d) None of these formed with 1, 2, 3, 4, and 5 such that at
13 If letters of the word CIRCLE are least 2 digits are identical.
arranged as in dictionary format, then (a) 3025 (b) 3005
what is the rank of the word CIRCLE? (c) 3115 (d) None of these
(a) 67 (b) 68 20. If P represents the number of 7 digit
(c) 66 (d) None of these numbers in which no two consecutive
14. What is the total number of nine digit digits are identical and Q represents the
numbers that can be formed if repetition number of 5 digit numbers in which no
of digits is not allowed? two consecutive digits are identical then
(a) 17(9!) (b) 9(9!) find the difference between P and Q.
(c) 8(9!) (d) None of these (a) 80(95) (b) 81(95)
(c) 82(95) (d) None of these
15. All the possible 5 digit numbers are
formed from the digits 0, 1, 2, 3, 4, 7 and 8 21. What is the sum of all the four digit
what percentage of this number is divisible number that can be formed with the
by 3 if repetition of digits is not allowed? digits 0, 1, 2, and 3.
(a) 41.45 (b) 34.44 (a) 38664 (b) 38564
(c) 33.333 (d) None of these (c) 38554 (d) None of these
16. Rajesh has a numeric lock that has 4 slots 22. What is the sum of all the four digit
and each slots can take any digit except number that can be formed with the
digits 1, 1, 2, and 3.
 Word/Number Formation  157
(a) 23341 (b) 23331 (c) 32.77 (d) None of these
(c) 233331 (d) None of these 26. How many 5 digit numbers exist such
23. Find the number of +ve even numbers that its 3rd digit is the highest digit and
that can be formed from the digits 0, 3, no digit is repeated?
6, 8 and 9 if repetition of digits is not (a) (4!)(10C5) – (3!)(9C4)
allowed? (b) (5!)(10C5) – (4!)(9C4)
(a) 164 (b) 182 (c) (5!)(10C5) – (3!)(9C4)
(c) 162 (d) None of these (d) None of these
24. How many 7 digit numbers divisible by 9 27. What is the number of natural numbers
can be formed such that no digit is 0 and which are less than 200000000 and can
no digit is repeated? be formed by using digits 1 and 2?
(a) 4(9!) (b) 4(7!) (a) 225 (b) 510
(c) 9! – 7! (d) None of these (c) 766 (d) None of these
25. Susmit is arranging all the letters of 28. How many four digit number ‘abcd’ can
the word MATHEMATICS. In what be formed such that the digits are in
percentage of the total words he will get decreasing order?
either both A’s or both T’s together?
(a) 150 (b) 210
(a) 31.77 (b) 31.83
(c) 240 (d) None of these

Response Grid
1. a b c d 2. a b c d 3. a b c d 4. a b c d 5. a b c d
6. a b c d 7. a b c d 8. a b c d 9. a b c d 10. a b c d
11. a b c d 12. a b c d 13. a b c d 14. a b c d 15. a b c d
16. a b c d 17. a b c d 18. a b c d 19. a b c d 20. a b c d
21. a b c d 22. a b c d 23. a b c d 24. a b c d 25. a b c d
26. a b c d 27. a b c d 28. a b c d
158  Theory of Counting
Concept Applicator (CA)
1. (b) 2. (a) 3. (d) 4. (b) 5. (b) 6. (b)
7. (d) 8. (b) 9. (b) 10. (a) 11. (a) 12. (b)
13. (d) 14. (a) 15. (b)
1. (b) The given word is SOCIETY, the
number of letters is 7 and these 7
letters can be arranged in 7! ways.
2. (a) The given word is CREATIVITY, the
number of letters is 10. Out of these
there are 2T’s, and 2I’s so these 10
letters can be arranged in (10!)/(2!)
(2!) ways.
3. (d) The given word is ARRANGEMENT,
the number of letters is 11. Out of
these there are 2A’s, 2R’s 2 N’s,
and 2E’s and these 11 letters can
be arranged in (11!)/(2!)(2!)(2!)(2!)
ways.
4. (b) The given word is CREATIVITY, the
number of letters is 10 out of these
there are 2T’s, and 2I’s since 1st
letter is C then remaining 9 letters
can be arranged in (9!)/(2!)(2!)
ways.
5. (b) The given word is CREATIVITY, the
number of letters is 10 out of these
there are 2T’s, and 2I’s since 1st
letter is C and last letter is Y then
remaining 8 letters can be arranged
in (8!)/(2!)(2!) ways.
Solutions
6. (b) The given word is CREATIVITY,
the number of letters is 10 out of
these there are 2T’s, and 2I’s and
other vowels are E, and A. Now tie
all the vowels together then it can
be arranged in (4!)/(2!) ways. If we
treat vowels as 1 unit then we will
have 7 units out of them there are 2
T’s which can be arranged in (7!)/(2)
ways, so total number of ways is (4!)
(7!)/(2!)(2!) = 6(7!)
7. (d) Total number of words that can
be formed without restriction is
(10!)/(2!)(2!) from question number 4.
Now if all the vowels are together
then number of words formed is
6(7!).
So number of ways that all the
vowels are not together is (10!)/(2!)
(2!) – 6(7!) = 180(7!) – 6(7!) = 174(7!)
8. (b) Since letter T is at middle so
remaining 4 letters can be arranged
at 4 places in (4!)/(2!) ways = 12 ways
out of these 1 word is PATNA itself
so 11 other words can be formed.
9. (b) Given number of digits is 5, we
can arrange them in 5! ways = 120
ways.

10. (a) From 5 digits we can select 4 in 5C4
ways, and then we can arrange them
in (4!) hence total number of such
number is (5C4)(4!) = 5 × 4 × 3 × 2
= 120
11. (a) Since number is more than 300
hence Hundred’s digit can be filled
up from 3, 4, and 5 i.e, in 3 ways.
Then remaining 2 places can be
filled up in 5 and 4 ways hence total
number numbers is 3 × 4 × 5 = 60.
12. (b) Here we have two cases-
Case (i) :- When 3 digit number is
formed- Hundred’s place can be
filled up in 3 ways(5, 7 and 9) then
remaining 2 places can be filled up
in 5 and 4 ways respectively, so
number of ways is 3 × 5 × 4 = 60.
Number of number in this case
is 60.
Case (ii) :- When 4 digit number is
formed- Thousand’s place can be
filled up in 2 ways (either 1 or 3)
then remaining 3 places can be filled
up in 5, 4 and 3 ways respectively,
so number of ways is 2 × 5 × 4 × 3
= 120. Number of number in this
case is 120.
Total number of such numbers is
60 + 120 = 180
13. (d) Case (i) For an even number
unit digit must be either 0, 2,
4, or 6, Now we have two cases-
Case (i) When unit digit is 0, then
thousand’s, hundred’s and ten’s place
Word/Number Formation  159
can be filled up in 6, 5 and 4 ways
respectively, so number of numbers
in this case is 6 × 5 × 4 = 120.
Case (ii) When unit’s digit is not 0,
then it can be filled up in 3 ways
(either 2, 4 or 6) and thousand’s,
hundred’s and ten’s place can be filled
up in 5, 5 and 4 ways respectively,
so number of numbers in this case is
3 × 5 × 5 × 4 = 300
Hence total number of such numbers
is 120 + 300 = 420
14. (a) For an odd number unit digit must
be either 3, 5, or 7,
Unit digit can be filled up in 3 ways
(3, 5 or 7), then thousand’s, hundred’s
and ten’s place can be filled up in 5, 5
and 4 ways respectively, so number
of numbers in this case is
  3 × 5 × 5 × 4 = 300.
15. (b) Here we have two cases-
Case (i) If 2 is at thousand place then
hundred’s place can have either 5 or
6 (2 ways) and remaining 2 places
can be filled up in 5 and 4 ways, so
total number of numbers in this case
is 2 × 5 × 4 = 40
Case (ii) If 3, 4, 5 or 6 (in 4 ways) is
at thousand place then remaining 3
places can be filled up in 6, 5 and 4
ways, so total number of numbers in
this case is 4 × 6 × 5 × 4 = 480
So total number of numbers is
480 + 40 = 520
160  Theory of Counting
Concept Builder (CB)
1. (a) 2. (d) 3. (a) 4. (d) 5. (c) 6. (b)
7. (d) 8. (c) 9. (b) 10. (c) 11. (a) 12. (b)
13. (a) 14. (b) 15. (d) 16. (b) 17. (b) 18. (c)
19. (d) 20. (c)
1. (a) Given word is PERMUTATION it
has 11 letters out of them 5 vowels
and 6 consonants out of which there
are 2T’s.
Since Vowels can take only vowels
place. Hence 5 vowels can be arranged
in (5!) ways, and 6 consonants
can be arranged in (6!)/(2!) ways.
Total number of such words is
(5!)(6!)/2.
2. (d) The given word is ALGEBRA in this
we have 7 letters comprising 3 vowels
that includes 2 A’s and 4 distinct
consonants. Vowels can occupy only
even place means only at 2nd, 4th
and 6th place this can be done in
(3!)/(2!) = 3 ways and 4 consonants
can be arranged in (4!) ways.
So total number of such words is
3(4!) = 72.
3. (a) The word NINETEEN has 3N’s,
3 E’s, 1 I and 1T.
We can arrange 3 E’s, 1 I and 1T in
(5!)/(3!) = 20 ways that will create 6
spaces out of which 3 can be selected
in 6C3 = 20 ways.
So total number of words is 20 × 20 = 400.
4. (d) The word NINETEEN has 3N’s, 3
E’s, 1 I and 1T.
There are 4 consonants and four
vowels. 4 consonants can be
arranged in (4!)/(3!) = 4ways. This
will create 5 places in which we
have to place 4 vowels. 4 places
can be selected out of 5 in 5C4 = 5
ways, and then 4 vowels can be
arranged in (4!)/(3!) = 4 ways.
Hence total number of ways is
4 × 5 × 4 = 80 ways.
5. (c) The word NINETEEN has 3N’s, 3 E’s,
1 I and 1T. There are 4 consonants
and four vowels.
We have two cases-
Case (i) – When word starts with
vowels then vowels will take odd
places and consonants will take even
places and they can be arranged in
(4!)/(3!) × (4!)/(3!) = 4 × 4 = 16 ways.
Case (ii) – When word starts with
consonants then consonants will take
odd places and vowels will take even
places and they can be arranged in
(4!)/(3!) × (4!)/(3!) = 4 × 4 = 16 ways.
So total number of ways is
16 +16 = 32
6. (b) Without restriction total number of
words formed is (8!)/(3!)(3!)
= (4 × 5 × 6 × 7 × 8)/(6) = 1120
Number of words when all the vowels
and consonants are together is
(2!)(4!)(4!)/(3!)(3!) = 32
So required number of ways is
1120 – 32 = 1088
7. (d) The word NINETEEN has 3N’s,
3 E’s, 1 I and 1T
Without restriction total number of
words formed is
(8!)/(3!)(3!) = (4 × 5 × 6 × 7 × 8)/(6) = 1120
Number of words when all the vowels
are together is {(4!)/(3!)}{(5!)/(3!)}
= 4 × 20 = 80

Number of words when all the
consonants are together is {(4!)/(3!)}
{(5!)/(3!)} = 4 × 20 = 80
Number of words when all the vowels
and consonants are together is (2!)
(4!)(4!)/(3!)(3!) = 32
So total number of words such that
either all the consonants or all the
vowels or both all the consonants
and all the vowels are together is
80 + 80 – 32 = 128
So required number of ways is
1120 – 128 = 992
8. (c) The word INTERMEDIATE has
2 I’s, 3 E’s 2 T’s and remaining are
single letters.
As per the given condition all the
consonants are together, We can
arrange all the consonants in
(6!)/(2!) ways, now we will treat
these consonants as one letter then
the number of words is [(6!)/(2!)][(7!)/
(2!)(3!)] = (6!)(7!)/(2!)(2!)(3!) = (5!)(7!)/
(2!)(2!)
9. (b) A number is divisible by 25 if last
two digit is divisible by 25, hence
last two digit must be either 25, 50,
or 75 we will divide it in two cases:
Case (i) – If last two digits are 25
or 75 then remaining three places
can be filled up in 5, 5 and 4 ways
so number of ways is 2 × 5 × 5 × 4
= 200.
Case (ii) – If last two digits are 50
then remaining three places can
be filled up in 6, 5 and 4 ways so
number of ways is 6 × 5 × 4 = 120.
So total number of numbers is
200 + 120 = 320
10. (c) A number is divisible by 125 if last
three digit is divisible by 125, hence
last three digit must be either 125,
250, 375, 625, or 750, we will divide
it in two cases-
Word/Number Formation  161
Case (i) – If last three digits are
125 or 375, 625 then remaining two
places can be filled up in 4 and 4
ways so number of ways is 3 × 4 × 4
= 48
Case (ii) – If last three digits are 250
or 650 then remaining two places
can be filled up in 5 and 4 ways so
number of ways is 2 × 5 × 4 = 40.
So total number of numbers is
48 + 40 = 88
11. (a) From solution of last two questions
is 320 – 88 = 232
12. (b) Here thousandth place can be filled
up in 3 ways (1 or 2 or 3) then
remaining 3 places can be filled up
in 5 ways each, so total number of
numbers is 3 × 5 × 5 × 5 = 375
Here number 4000 is also included
so total number of numbers is 375 +
1 = 376
13. (a) Unit digit can be either 2 or 4, then
remaining 4 digits can be arranged
in (4!) = 24 ways, so total number of
number is 2 × 24 = 48
14. (b) Total number of 4 digit number is
9000, now we have to remove the
numbers that are multiple of 5.
Since number of 4 digit number
multiple of 5 is 1800
So number of 4 digit numbers not
multiple of 5 is 9000 – 1800 = 7200
15. (d) Total number of numbers formed
is (5!) = 120 out of 120 smallest
number is 12345, hence remaining
119 numbers are more than 12345.
16. (b) Number of such numbers is
4 × 4 × 3 × 2 = 96
st
17. (b) 1 place can be filled up in 2 ways
then remaining 3 places can be filled
up in 3! = 6 ways.
Hence required number of ways
is 12.
162  Theory of Counting
18. (c) We have two cases
Case (i) If unit digit is 0 then
remaining two places can be filled
up in 9 × 8 = 72 ways.
Case (i) If unit digit is 5 then
remaining two places can be filled
up in 9 × 8 = 72 ways.
So total number of numbers is
72 + 72 = 144
19. (d) If a number is even and also divisible
by 5 then it must be divisible by 10
or unit digit must be 0, so from the
given digits we can not form any
such number.
20. (c) We have 5 cases here-
Case (i) if number formed is 1 digit
number then number of such number
is 5.
Case (ii) if number formed is 2
digit number then number of such
numbers is 5 × 5 = 25
Case (iii) if number formed is 3
digit number then number of such
numbers is 5 × 5 × 4 = 100
Case (iv) if number formed is 4
digit number then number of such
numbers is 5 × 5 × 4 × 3 = 300
Case (v) if number formed is 5
digit number then number of such
numbers is 5 × 5 × 4 × 3 × 2 = 600.
Case (vi) Number of 6 digit number
5 × 5 × 4 × 3 × 2 = 600.
Hence total number of numbers is
600 + 600 + 300 + 100 + 25 + 5 = 1630

Concept Cracker (CC)

1. (b) 2. (d) 3. (a) 4. (c) 5. (d) 6. (a)
7. (b) 8. (b) 9. (c) 10. (a) 11. (b) 12. (c)
13. (b) 14. (b) 15. (b) 16. (c) 17. (a) 18. (c)
19. (b) 20. (a) 21. (a) 22. (b) 23. (c) 24. (b)
25. (c) 26. (a) 27. (c) 28. (b)

1.
(b) Letters of the word MATHEMATICS
are 2 M’s, 2 Ts, 2 A’s and one each H,
C, S, E, & I total number of words
that can be formed is
(11!)/(2!)(2!)(2!)
Now consider the letters C, S and H
they can be arranged in (3!) = 6 ways
out of these 6 only in two ways C is
between S and H.
So required number of ways is [(11!)/
(2!)(2!)(2!)][(2!)/(3!)] = (11!)/(3!)(2!)(2!)
2. (d) Lets the letters C, S and H together,
then out of (3!) = 6 ways only in two
ways C is between S and H. then we
will treat C, S and H as one unit,
now total number of arrangements
is [(9!)/(2!)(2!)(2!)][(2!)] = [(9!)/(2!)(2!)]
3. (a) Lets the letters C, and 2 M’s together,
then they can be arranged in only 1
way. Now we will treat C, and 2M’s
as one unit, now total number of
arrangements is
[(9!)/(2!)(2!)] = [(9!)/(2!)(2!)]
4. (c) Letters of the word MATHEMATICS
are 2 M’s, 2 Ts, 2 A’s and one each H,
C, S, E, & I total number of words that
can be formed is (11!)/(2!)(2!)(2!)
Now consider 2 M’s and 2 A’s these
four letters can be arranged in
(4!)/(2!)(2!) ways = 6 ways, out of these
6 ways there is only one way where
both the A’s are before both the M’s, so
required number of ways is [(11!)/(2!)
(2!)(2!)][1/6] = (11!)/(2!)(2!)(2!)(3!)
 Word/Number Formation  163
5. (d) Case (i)- Letters of the word 7. (b) Given word ACCIDENT has 3
MATHEMATICS are 2 M’s, 2 Ts, distinct vowels, and 5 consonant
2 A’s and one each H, C, S, E, & I, where only C is twice.
out of these vowels are 2 A’s, one Total number of arrangements of
E and one I. Here we have 3 cases- these 8 letters is (8!)/(2!) Now consider
Case (i) – when both 1st and last vowels they can be arranged in
letter is A then remaining 9 letters 3! = 6 ways and out of these 6 ways
can be arranged in (9!)/(2!)(2!) ways. there is only one way where they
Case (ii)- When one of the letter is A will be in the given order hence total
and one letter is either E or I, then number of such words is
they can be arranged in (2!) ways and = 1/6 × (8!)/(2!) = 3360
remaining 9 letters can be arranged
in (9!)/(2!)(2!) ways. 8. (b) If position of vowels is fixed then
5 consonants can be arranged in
Hence total number of ways is (9!)/(2!).
(5!)/(2!) ways = 60 ways.
Case (iii) When neither 1st nor last
9. (c) Since Consonants can be arranged
letter is A then 1st or last letter can
in (5!)/2 = 60 ways while vowels
be E or I and they can be arrange in
can be arranged in 3! = 6 ways, so
(2!) ways, then remaining 9 letters
total number of ways is 6 × 60 = 360
can be arranged in (9!)/(2!)(2!)(2!)
ways.
ways hence total number of ways is
(9!)/(2!)(2!) 10. (a) Number of letters in the word
Total number of ways CINEMA is 6, without any restriction
we can form (6!) = 720 number of words.
(9!)/(2!)(2!) + (9!)/(2!) + (9!)/(2!)(2!) Number of words that starts with
= (9!)/(2!)(2!) [ 1 + 2+1] = (9!) C is (5!) = 120 Number of words
6. (a) The word DEVASTATION has 2 T’s, that ends with A is (5!) = 120
2 A’s and remaining 1 letters, total Number of words that starts with C
number of letters is 11. We have as well as end with A is (4!) = 24
following cases- Number of words that either starts
with C or end with A is
Case 2 T’s (1 way) 2 A’s (1 (4!)/(2!)(2!)
(i) way) =6 120 + 120 – 24 = 216
Case 2 T’s ( 1 way) 2 distinct 6 × (4!)/(2!) Number of words that neither starts
(ii) vowels = 72 with C nor end with A is 720 – 216
(4 C 2 = 6 = 504
ways) 11. (b) Number of letters in the word
Case 2 distinct 2 A’s (1 10 × (4!)/(2!) CINEMA is 6, without any restriction
(iii) consonants way) = 120 we can form (6!) = 720 number of
(5C2 = 10 words. Number of words that starts
ways) with C is (5!) = 120. Number of words
that ends with A is (5!) = 120
Case 2 distinct 2 distinct (10×6)(4!)
Number of words that has E
(iv) consonants vowels = 1440
at the 3rd position is (5!) = 120
(5C2 = 10 (4 C 2 = 6
Number of words that starts with C
ways) ways)
as well as end with A is (4!) = 24
Total 1638
Number of words that starts with
number
C as well as E at the 3rd position is
of ways
(4!) = 24
164  Theory of Counting
Number of words that ends with A
as well as E at the 3rd position is
(4!) = 24
Number of words that starts with C,
E at the 3rd position and end with A
is (3!) = 6
Number of words that either starts
with C or E at the middle or end
with A is
120+120 + 120 – 24 – 24 – 24 + 6 = 294
Number of words that neither starts
with C nor end with A is
720 – 294 = 426
12. (c) Given word is PROGRAMMING it
has 2 R’s, 2G’s 2 M’s and remaining
distinct letters, total number of
letters is 11.
Total number of words formed is
(11!)/(2!)(2!)(2!)
Number of words that starts with M
is (10!)/(2!)(2!)
Number of words that ends with M
is (10!)/(2!)(2!)
Number of words that starts with M
and end with M is (9!)/(2!)(2!)
So number of words that neither
starts with M nor end with M is
(11!)/(2!)(2!)(2!) – [(10!)/(2!)(2!) +
(10!)/(2!)(2!) – (9!)/(2!)(2!)]
= (9!)/(2!)(2!) [10 × 11/2 – 10 – 10 + 1]
= (36)(9!)/(2!)(2!) = 9(9!)
13. (b) In dictionary the 1st word will start
with CC, and the number of words
that starts with CC is 4! = 24, then
number of words that starts with CE
is 4! = 24.
Then we will get CIC and number of
words is 3! = 6, similarly number of
words that starts with CIE is 3! = 6,
number of words that starts with
CIL is 3! = 6.
Then next word will be CIRCEL and
finally we will get CIRCLE.
Hence rank of CIRCLE is 68.
14. (b) At 1st place we can not place 0 hence
it can be filled up in 9 ways then for
remaining 8 places we have to select
8 digits from available 9 digits that
can be done in 9C8 ways or in 9 ways
, now these 8 digits can be arranged
in (8!) ways, hence total number of
such numbers is (9)(9)(8!) = (9)(9!)
15. (b) Number of 5 digit numbers formed
by the given digits is
6 × 6 × 5 × 4 × 3 = 2160
Now we have to find the number of
5 digit number divisible by 3 and
for that 1st we have to select the
required digits.
Case (i) if digit 0 is included then we
have 4 such combinations and these
are (0, 1, 2, 7, 8), (0, 1, 2, 4, 8), (0, 2,
4, 7,8) and (0, 1, 3, 7, 8) and in each
case we will get 4 × 4 × 3 × 2 = 96
numbers so total number of numbers
in this case is 4 × 96 = 384.
Case (ii) if digit 0 is not included then
we have 3 such combinations and these
are (2, 3, 4, 7, 8), (1, 2, 3, 7, 8), (1, 2, 3, 4, 8)
and in each case we will get 5 × 4 × 3
× 2 = 120 numbers so total number
of numbers in this case is
3 × 120 = 360.
Total number of such numbers is
360 + 384= 744
Required percentage is
744 × 100/2160 = 34.44 %
16. (c) Here we will take two cases-
Case (i) If 0 is one of the digit and
used only once then possible numbers
in the form of (aaa0, aa0a, a0aa) and
a can take 9 values hence number of
numbers in this case is 3 × 9 = 27.
Case(ii) If 0 is one of the digit and
used twice then possible numbers in
the form of (aa00, a00a, a0a0) and a
can take 9 values hence number of
numbers in this case is 3 × 9 = 27.

Case(iii) If 0 is one of the digit and
used thrice then possible numbers
in the form of (a000) and a can take
9 values hence number of numbers
in this case is 9.
Case(iv) if only one digit is used then
number of numbers is 9.
Case (v) if two digits a and b are
used then possible numbers are
(aaab, aaba, abaa, baaa) number of
numbers in this case is
(9C2)(2!)(4) = 36 × 2 × 4 = 288
Case (vi) if two digits a and b are
used then possible numbers are
(aabb, abba, abab, bbaa, baab, baba)
number of numbers in this case is
(9C2)(6) = 36 × 6 = 216
So total number of numbers is
27 + 27 + 9 + 9 + 288 + 216 = 576
17. (a) Let d be the common difference of the
A.P then we have following cases-
Case (i) if d = 1 then possible pair of
digits are (1, 2,3), (2, 3, 4), (3, 4, 5) and
so on till (7, 8, 9) total 7 such sets.
Case (ii) if d = 2 then possible set of
digits are (1, 3, 5), (2, 4, 6) (3, 5, 7),
(4, 6, 8), (5, 7, 9) total 5 such sets
Case (iii) if d = 3 then possible set of
digits are (1, 4, 7). (2, 5, 8), (3, 6, 9)
total 3 such sets.
Case (iv) if d = 4 the only possible set
is (1, 5, 9)
So total possible sets is 7+5+3+1
= 16 and in each set we have
(3!) = 6 numbers hence total number
of numbers is 16 × 6 = 96.
Now consider if 0 is one of the
number then possible sets are
(0, 1, 2), (0, 2, 4), (0, 3, 6), (0, 4, 8) and
from each set we can form 4 numbers
hence number of numbers is 4 × 4 = 16
So total number of 3 digit numbers
is 96 + 16 = 112
Word/Number Formation  165
18. (c) Number of numbers formed is
(4!) = 24
Sum of digits = 1+2+3+4 = 10
So required summation is
(24 × 10)(1111)/4 = 66660
19. (b) Total number of 5 digit numbers
from the given condition is 55 = 3125,
out of these the numbers number of
5 digit numbers in which no digit is
similar is 5!, hence required number
of number is 3125 – 120 = 3005
20. (a) Consider P it is the number of 7 digit
numbers in which no two consecutive
digits are identical hence 1st place
can be filled up in 9 ways (as 0 can
not be the 1st digit) then next place
can filled up in 9 ways and so on
hence P = 97
Similarly Q = 95 and
7 5 5 5
P – Q =  9 – 9 =  (81 − 1)9 =  80(9 )
21. (a) Number of numbers that can be
formed with the digits is (4!) = 24
[ here 0 can be at 1st place]
Then
Sum of numbers =
(Number of numbers formed) ×
(Sum of digits)(1111..n times)
Number of digits
= (24 × 6 × 1111)/4
Now sum of all the numbers that can
be formed by the digits 1, 2 and 3 is
(6)(6 × 111)
3
Required summation is
24 × 6 × 1111 (6)(6 × 111)
– = 38664
4 3
22. (b) Number of numbers that can be
formed with the digits is (4!)/2 = 12
Then
166  Theory of Counting
Sum of numbers = So total number of words is
(Number of Numbers formed) × 11!
.
(Sum of digits) × (1111..n times) ( )(2!)(2!)
2!
Number of digits Now, we have to find the number of
12 × 7 × 1111 words in which either both A or both
= T are together,
4
Number of words in which both the
= 23331
10!
23. (c) We have 5 cases here- A’s are together is
Case (i) if number formed is 1 digit (2!)(2!)
number then number of such number Number of words in which both the
is 2. 10!
T’s are together is
Case (ii) if number formed is 2 (2!)(2!)
digit number then number of such Number of words in which both the
numbers is 4 + 6 = 10. A’s are together and both the T’s are
Case (iii) if number formed is 3 9!
together is
digit number then number of such 2!
numbers is 12 + 18 = 30. Hence Number of words in which
Case (iii) if number formed is 4 either both A’s or both T’s are together
digit number then number of such 10! 10! 9! 9 (9!)
+ – =
numbers is 24 + 36 = 60. (2!)(2!) (2!)(2!) 2! 2
Case (iii) if number formed is 5
Required percentage is
digit number then number of such
numbers is 24 + 36 = 60.  9 (9!)
 
Hence total number of numbers is  2 
100 = 360/11= 32.77%
2 + 10 + 30 + 60 + 60 = 162.  11! 
24. (b) Since number is divisible by 9, hence  
 (2!)(2!)(2!)
sum of digits should be divisible
by 9 26. (a) Number of ways of selecting 5 digits
Sum of 1 + 2 + 3 +…8 + 9 = 45 so we is 10C5
have to remove two digits from these We have to form a 5 digit number
9 digits whose summation is 9. The whose 3rd digit is the highest, hence
pair of numbers that are left is (1, 8), out of 5 selected digits the place of
(2, 7), (3, 6) and (4, 5) highest digit is fixed so remaining
And remaining 7 digits we can form 4 can be arranged in (4!) ways so
(7!) numbers hence total number of number of ways is (4!)(10C5).
numbers is 4(7!) But in this case we have to subtract
25. (c) Total number of letters in the word the number of numbers when 1st
MATHEMATICS is 1 1 and out of digit is 0 (as it will be a 4 digit
these 11 – number).
M – 2 , T – 2, A – 2, H – 1, I – 1, C – 1 So number of ways of forming a
and S – 1 number with its 1st digit as 0 and
 Word/Number Formation  167
with the given condition is (3!)(9C4) Case (viii) :- Consider a eight digit
So required number of numbers is number:- Each place can be filled up
(4!)(10C5) – (3!)(9C4) with two choices (either 1 or 2) so
number of numbers formed is 28.
27. (c) We have following cases-
Case (ix):- Consider a nine digit
Case (i) :- Consider a single digit
number:- except the 1st place (which
number:- 1, and 2 so only 2 numbers
is occupied with 2) remaining each
in this case.
place can be filled up with two
Case (ii) :- Consider a two digit choices (either 1 or 2) so number of
number:- 11, 12, 21 and 22 so only 4 numbers formed is 28.
= 22 numbers in this case.
So total number of numbers formed
Case (iii) :- Consider a three digit is 2 + 22 + 23 +…+ 28 + 28 = 766
number:- Each place can be filled up
28. (b) Out of 10 digits 4 digits can be
with two choices (either 1 or 2) so
selected in 10C4 = 210 ways.
number of numbers formed is 23.
Similarly
168  Theory of Counting
Part B
Concept 1 Formation of Word
Word/number formation question is one of the
most important type of questions. To solve
these type of questions we have to understand
the arrangement of identical articles.
The number of arrangements of n articles
taken all at a time when p of them are
identical and are of one type, q of them are
identical and of second type, r of them are
identical and of third type, and remaining are
n!
all of different is .
{ }
(p!)(q!)(r!)
To understand this let us assume that required
number of permutations is x, Since p different
things can be arranged among themselves in
Concept 2 Formation of Number
word formation the only difference is that at
1st place we can not put ‘0’ as example if it is
given that we have to form a 4 digit number
‘abcd’ then the digit ‘a’ can not be 0. Variation
in the question may occur if some property
of number is given as example divisible by
2 or 5 etc. To understand this just revise the
divisibility rule-
(p!) hence if we replace p identical articles
by p distinct articles then the number of
permutations will become (p!)(x). Similarly
if we replace q identical article by q distinct
articles then the number of permutations will
become (p!)(q!)(x) and if we replace r identical
article by r distinct articles then the number
of permutations will become (p!)(q!)(r!)(x)
which is equal to (n!)
Hence (p!)(q!)(r!)(x) = n! or x =
n!
{ }
(p!)(q!)(r!)
Number formation is very much similar to
2- All even number is divisible by 2, or the
numbers end with and even number or zero is
divisible by 2,
3- A number is divisible by 3 if sum of its digits
is divisible by 3.
4- A number is divisible by if 4 if the number
formed by the last two digits of the number is
divisible by 4, or last two digits are 0’s.
5- All numbers that end with 0 or 5 are
divisible by 5.
 Word/Number Formation  169

6- A number that is divisible by 2 and 3 both 12- A number is divisible by 12 when it is

are divisible by 6.
8- A number divisible by 8 if number formed
by three digits of the number is divisible by 8
or last three digits are zeroes.
9- A number is divisible by 9 if sum of its digits
is divisible by 9.
11- A number is divisible by 11 if the difference
between the sum of the digits in the odd and
the sum of the digits in the even places is
either 0 or multiple of 11.
divisible by 3 and 4 both.
16- A number is divisible by 16 when number
formed by last 4 digits of the given number is
divisible by 16 or last 4 digits are zeroes.
7 and 13- A number is divisible by 7 or 13 if
and only if the difference of the number of its
thousands and the remainder of its division
by 1000 is divisible by 7 or 13.

Concept 3 Rank of a Word in Dictionary

Rank of a word is the position of that word, ABC → 1ST word

when we arrange the words formed by ACB→ 2nd Word
alphabets of that given word in dictionary
BAC → 3rd Word
order. Lets see an example.
BCA → 4th Word
To understand this type of problem just
assume that we have only 3 letters A, B and C CAB → 5th Word
in the English alphabets then the dictionary CBA → 6th Word
will have total meaning full or meaning less So if I ask you what is the rank of word CAB
3! = 6 words and their order is- the answer is 5th.

Concept 4 Sum of all the Numbers Formed

Sum of the numbers of n digits formed with n ( Number  of  numbers  formed ) ×
different digits (Sum  of  the  digits )(1111…11 ntimes
  )
=
n
170  Theory of Counting

Concept 5 Number of Palindrome Number

A palindromic number is a number that is the The numbers of palindromic numbers less
same when written forwards or backwards, i.e., than 1000 = 103 is 108
The numbers of palindromic numbers less
of the form aba etc. The first few palindromic
than 10000 = 104 is 198
numbers are as follows- 0, 1, 2, 3, 4, 5, 6, 7, 8,
9, 11, 22, 33, 44, 55, 66, 77, 88, 99, 101, 111, Number of palindromic numbers less than
121, 131, ... . 10n is
The numbers of palindromic numbers less  n 
2  10 2 – 1 if n is even
than 10- is 9  
The numbers of palindromic numbers less n −1
than 100 = 102 is 18 11 × 10 2 – 2 if n is odd

1
Concept Deviator (CD)
Ideal Time Revise your concept (IIT advance or
5 Min. tougher questions)
Per Question

Direction (Qs. 1 and 2): 3. Consider two n digit numbers P and Q

All the 7 digit numbers that are not divisible such that P > Q, If ‘K’ represents the
by 5 are formed from the digits 1, 2, 3, 4, 5, number of pairs of P and Q such that
6, and 7, then these numbers are arranged in Q can be subtracted from P without
the increasing order. borrowing. Then how many of the
following statements are correct?
1. Total how many digits are written in this
process? (i) Highest power of 5 in K is n–1
(a) 8(7!) (b) 7(7!) (ii) Highest power of 3 in K is 2n
(c) 6(7!) (d) None of these (iii) Unit digit of K is 5
2. What will be the 14000th digit? (a) Only (i) & (ii) (b) Only (ii) & (iii)
(a) 3 (b) 6 (c) All three (d) None of these
(c) 7 (d) None of these

4. How many 9 digit number can be formed
from the digits 1 to 9 without repetition
of digits such that pattern ‘123’, ‘456’ or
‘789’ do not appear ?
(a) 348120 (b) 348114
(c) 348234 (d) None of these
5. How many words of six letters can be
formed from the three letters of the word
HINDUSTAN if each letter is used at
least once?
(a) 15120 (b) 30296
(c) 30240 (d) None of these
6. How many 5 digit numbers can be formed
with repetition of digits is allowed and
digits are in non increasing order from
left to right it is given that non of the
digits is 0?
(a) 59 (b) 13C
5
(c) 59 – 49 (d) None of these
7. Find the sum of all the three digit
numbers that has only odd digits.
(a) 29875 (b) 489375
(c) 69375 (d) None of these
8. Find the sum of all the three digit
numbers that has only even digits (0, 2,
4, 6 and 8).
(a) 54440 (b) 54000
(c) 54400 (d) None of these
9. An n- digit number is a positive with
exactly n digits. Nine hundred distinct n-
digit numbers are to be formed using only
the three digits 2,5 and 7. The smallest
value of n for which this is possible, is
equal to- [IIT JEE 1998]
(a) 6 (b) 7
(c) 8 (d) 9
10. How many different nine digits numbers
can be formed the number 223355888 by
rearranging its digits so that the odd digits
occupy even positions?   [IIT JEE 2000]
Word/Number Formation  171
(a) 16 (b) 36
(c) 60 (d) 180
11. The number of arrangements of the letters
of the word BANANA in which the two
N’s do not appear adjacently is:
[IIT JEE 2002]
(a) 40 (b) 60
(c) 80 (d) 100
12. The letters of the word COCHIN are
permuted and all the permutations are
arranged in an alphabetical order as
in an English dictionary. The number
of words that appear before the word
COCHIN is [IIT JEE 2007]
(a) 360 (b) 192
(c) 96 (d) 48
13. Ten different letters of an alphabet are
given. Words with five letters are formed
from the given letters. Then the number
of words which have at least one letter
repeated as: [IIT JEE 1980]
(a) 69760 (b) 30240
(c) 99748 (d) None of these
14. A five digit number divisible by 3 is to be
formed using the numbers 0,1,2,3, 4 and
5, without repetition. The total number of
ways this can be done is: [IIT JEE 1989]
(a) 216 (b) 240
(c) 600 (d) 3125
15. Consider all possible permutations of the
letters of the word ENDEANOEL
Match the following:
A- The number of (p) 5!
permutations con-
taining word EN-
DEA is
B- The number of (q) 2 × 5!
permutations in
which the letter E
occurs in which the
letter E occurs in the
1st and the last posi-
tion is
172  Theory of Counting

C- The number of
permutations in
which D, L and N
occurs in the last 5
positions is
D- The number of
permutations in
which the letters A,
E, O occur only in
odd position
[IIT JEE 2008]
(a) A-p; B- q; C-r; D-s
(b) A-p; B- r; C-q; D-s
(c) A-p; B- q; C-s; D-r
(d) None of these
(r)7 × 5! 16. The number of seven digit integers, with
sum of the digits equal to 10 and formed
by using the digits 1, 2 and 3 only is
[IIT JEE 2009]
(a) 55 (b) 66
(s) 21× 5!
(c) 77 (d) 88
17. How many numbers greater than 1000 but
not greater than 4000 can be formed with
the digits 0, 1, 2, 3 and 4 if repetition of
digits being allowed?   [IIT JEE 1965]
(a) 375 (b) 400
(c) 425 (d) None of these

Response Grid
1. a b c d 2. a b c d 3. a b c d 4. a b c d 5. a b c d
6. a b c d 7. a b c d 8. a b c d 9. a b c d 10. a b c d
11. a b c d 12. a b c d 13. a b c d 14. a b c d 15. a b c d
16. a b c d 17. a b c d

2
Concept Eliminator (CE)
Ideal Time Revise your concept (Maths Olympiad
Just solve it or tougher questions)

1. This question is based on Chinese Maths
Olympiad:
Consider a 101 digit number N =
pa1a2a3…a99a100 where p is a prime digit
and ai is any digit. How many numbers
N can be formed such that digit 9 is used
odd number of times?
(a) 2(10100 – 8100) (b) 1/2(10100–8100)
(c) (10100 – 8100) (d) None of these
2. This question is based on Maths
Olympiad:
How many 7 digit numbers can be
formed by using only the digits 5 and 7
such that number formed is divisible by
both 5 and 7?
(a) 24 (b) 9
(c) 48 (d) None of these
3. This question is based on Maths
Olympiad:
All possible 6 digit numbers, in each of
which the digits occur in non increasing
order (From left to right e.g 877550)

are written as a sequence in increasing
order. Find the 2005th number in this
sequence.
(a) 864110 (b) 864000
(c) 864100 (d) None of these
4. This question is based on Regional Maths
Olympiad:
Find the number of all 5-digit numbers
each of which contains the block 15 and
is divisible by 15? (Example of such
number is 31545, 34515 etc)
(a) 479 (b) 487
(c) 480 (d) None of these
5. This question is based on Regional Maths
Olympiad:-
Find the number of all 6-digit numbers
that satisfy the following conditions-
The digits of each number are all from
the set { 1, 2, 3, 4, 5}
Any digit that appears in the number
appears at least twice (eg- 225252 is
acceptable but 222133 is not)
(a) 1405 (b) 1400
(c) 1200 (d) None of these
6. This question is based on Regional Maths
Olympiad:-
Find the sum of all the 3 digit natural
numbers which contain at least one odd
digit and one even digit.
(a) 494550 (b) 370775
(c) 69375 (d) None of these
7. This question is based on Maths
Olympiad:-
In a lottery, tickets are given nine –
digit numbers using only the digits
1, 2, 3. They are also coloured red,
blue or green in such a way that two
tickets whose numbers differ in all
Response Grid
1. a b c d 2. a b c d 3. a b c d 4. a b c d 5. a b c d
6. a b c d 7. a b c d 8. a b c d 9. a b c d 10. a b c d
11. a b c d
Word/Number Formation  173
the nine places get different colours.
Suppose the ticket bearing the number
1222222222 is red and that bearing the
number 222222222 is green. Determine,
the colour of of the ticket bearing the
number 123123123.
(a) Green (b) Red
(c) Blue (d) None of these
8. This question is based on Regional Maths
Olympiad:-
Find the number of 4 digit numbers
having non – zero digits and which are
divisible by 4 but not by 8.
(a) 729 (b) 209
(c) 734 (d) None of these
9. Find the number of 6 digit palindrome
number.
(a) 10998 (b) 1998
(c) 9898 (d) None of these
10. Fifteen coupons are numbered 1, 2, 3,. .
. . 15. In how many ways seven coupons
are selected such that the largest number
appearing on the selected coupon is 9?
(a) 97 – 87 (b) 107 – 87
(c) 87 – 77 (d) None of these
11. This question is based on Regional Maths
Olympiad:-
Find the number of 6 digit natural
numbers such that sum of their digits is
10 and digits 0, 1, 2 and 3 occur at least
once in them.
(a) 190 (b) 490
(c) 240 (d) None of these
174  Theory of Counting

Solutions
Concept Deviator (CD)
1. (c) 2. (d) 3. (d) 4. (b) 5. (c) 6. (b)
7. (c) 8. (c) 9. (b) 10. (c) 11. (a) 12. (c)
13. (a) 14. (a) 15. (d) 16. (c) 17. (a)

1. (c) Total number of numbers formed is 4315267, 4315276, 4315627, 4315672

6(6!) and in each number we have 7
digits hence total number of digits is
6(7!)
2. (d) Since one number has 7 digits so we
have to find out 14000/7 = 2000th
number
Number of numbers that starts with
1 is 5(5!) = 600
Number of numbers that starts with
2 is 5(5!) = 600
Number of numbers that starts with
3 is 5(5!) = 600
Till now we have formed 600
+ 600 + 600 = 1800 numbers
Number of numbers that starts with
41 is 4(4!) = 96
Number of numbers that starts with
42 is 4(4!) = 96
Till now we have formed 600 + 600
+ 600 + 96 + 96 = 1992 numbers,
now we need only 8 numbers.
Number of numbers that starts with
4312 is 4. Till now we have formed
1992 + 4 = 1996 numbers, now we
need only 4 numbers and these
numbers starts with 4315 hence
these numbers are-
Hence 14000th digit is 2
3. (d) As per the given condition each
digit of P is more than or equal to
corresponding digit of Q.
Consider the 1st digit, let 1st digit of
P is p1 and that of Q is q1 as per the
given condition p1 ≥ q1
If p1 = 9 then q1 can take any value
from 1 to 9 so 9 ways
If p1 = 8 then q1 can take any value
from 1 to 8 so 8 ways and so on-
If p1 = 2 then q1 can take any value
from 1 to 2 so 2 ways
If p1 = 1 then q1 is 1 so 1 way.
Total number of ways is 1+2+…
+8+9 = 45 [or else 10C2 = 45 ways]
Similarly from 2nd to nth digit for
each place we have 1+2+3+…+9+10
= 55 ways (as 0 is included)
[11C2 = 55 ways].
So total number of ways is K = (45)
(55)n–1
Highest power of 5 in K is n and that
of 3 is 2.
4. (b) Total number of numbers that can
be formed without restriction is 9!
Number of numbers that contain
pattern ‘123’ is 7!

Number of numbers that contain
pattern ‘456’ is 7!
Number of numbers that contain
pattern ‘789 is 7!
Number of numbers that contain
pattern ‘123’ and ‘456’ is 5!
Number of numbers that contain
pattern ‘123’ and ‘789, is 5!
Number of numbers that contain
pattern ‘456’ and ‘789’ is 5!
Number of numbers that contain
pattern ‘123’ ‘456’ and ‘789’ is 3!
So required number of numbers is 9!
– 3(7!) + 3(5!) – 3! = 362880 – 15120
+ 360 – 6 = 348114
5. (c) The given word is HINDUSTAN
which has H – 1, I – 1, N – 2, D – 1,
U – 1, S – 1, T – 1, A – 1,
This word has 8 distinct letters so
three letters can be selected in 8C3
ways let three selected letters is H, I
and N
Total number of words that can be
formed without restriction is 36
Total number of words when H is
not present is 26 similarly number
of words when I and N is not present
is 26 for both.
Number of words when H & I is
absent, when H & N is absent and
when I & N is absent is 16 = 1 for
all.
Number of words when H I and N is
absent is 0.
Number of words when H I and N is
used at least once is
36 – 3(26) + 3(16) – 0 = 540
Total number of ways is
(8C3)(540) = 30240
6. (b) Number of ways of writing r digit
number from n digits with repetition
Word/Number Formation  175
of digits is allowed and digits are in
non increasing order is n+r–1Cr
Number of 5 digit numbers that can
be formed is 5+9–1C5 = 13C5
7. (c) The digits are from the set {1, 3, 5, 7, 9}.
Suppose the digit in unit’s place
is 1. Then we have 5 ways for
each of ten’s and hundred place.
So there are 25 numbers that has
unit digit 1. Similarly, there are
25 numbers whose unit digit 3, 5,
7 and 9 respectively. Thus the sum
of the digits in unit’s place of all the
numbers is
25(1 + 3 + 5 + 7 + 9) = 25 × 25 = 625.
similarly the sum of digits in ten’s
place of all the numbers is 625 and
that in hundred’s place is also 625.
Thus the sum of all the numbers is
625(100 + 10 + 1) = 625 × 111 = 69375.
Alternately :
We can use the formula directly-
(Number of numbers formed )×
Sum of all
the numbers =
(Sum of digits)(111..1ntimes)
Number of digits
Required summation is
(125)(1 + 3 + 5 + 7 + 9)(111) = (125)(25)(111)
5 5
= 69375
8. (c) In this case the digit in hundred’s
place is never 0. Suppose the digit
in unit’s place is 0. There are 4 ×
5 = 20 such numbers. Similarly,
20 numbers each having digits 2, 4,
6, 8 in their unit’s place. Thus the
sum of the digits in unit’s place of all
the numbers is
20(0 + 2 + 4 + 6 + 8) = 20 × 20 = 400.
176  Theory of Counting
Similarly the sum of the digits in
ten’s place is 400, but the sum of the
digits in hundred’s place of all the
numbers is 25 × 20 = 500. Thus the
sum of all the numbers is
500 × 100 + 400 × 10 + 400 = 54400.
9. (b) Number of ‘n’ digit numbers formed
by digits 2, 5 and 7 is 3n as per the
given condition 3n > 900 so least
value of n is 7
10. (c) The given digits are 223355888,
odd digits are 3, 5, 5 and 5, as per
the given condition these odd digits
should occupy even positions i.e 2nd,
4th, 6th and 8th position,
So odd digits can arranged in
4!
=  6
(2!)(2!) ways
And even digits can arranged in
5!
=  10 ways
( )(2!)
3!
Total number of ways is 6 × 10 = 60
11. (a) Total numbers of words formed is
(6!)/(3!)(2!) = 60
Number of words in which both the
N’s are together is (5!)/(3!) = 20
So required number is 60-20 =40
Alternately the number must be less
than 60 and only one option is less
than 60 i.e 40 is the answer.
12. (c) The given word is COCHIN, if we
arrange them in alphabetical order
then C, C, H, I N, O
Number of words starts with CC is
4! = 24
Number of words starts with CH is
4! = 24
Number of words starts with CI is 4!
= 24
Number of words starts with CN is
4! = 24
Next word is the given word COCHIN
So required number is 24 × 4 = 96
13. (a) Without restriction number of 5
letter words is 105 = 100000
Number of 5 letters word with no
repetition is (10C5)(5!) = (10P5)
= 10 × 9 × 8 × 7 × 6 = 30240
So required number of numbers is
100000 – 30240 = 69760
14. (a) Here we have two cases-
Case (i) If digits are 1, 2, 3, 4 and 5 so
number of 5 digit numbers formed is
5! = 120
Case (ii) if digits are 0, 1, 2, 4 and 5 so
number of 5 digit numbers formed is
4(4!) = 96
So total number of numbers is
120+96 = 216
15. (d) The given word is ENDEANOEL
now consider each case separately-
The number of permutations
containing word ENDEA is 5! Since
the word ENDEA is treated as
one character and then remaining
4 letters along with this can be
arranged in 5! Ways.
The number of permutations in
which the letter E occurs in the 1st
and the last position is- 21 × 5! Since
the required value is 2 × 5!
The number of permutations in
which D, L and N occurs in the last
5 positions is {(6!)/(2!)}(2!)}
The number of permutations in
which the letters A, E, O occur only
 5!   4! 
in odd position is     =  2 ×  5 !
 3!   2! 

16. (c) Let number of 1’s 2’s and 3’s are used
is a, b and c then a + 2b + 3c = 10
And a + b + c = 7
We have following cases-
Case (i) (a,b,c) = (5,1,1) then number of
7 digit number is (7!)/(5!) = 42
Case (ii) (a,b,c) = (4,3,0) then number of
Concept Eliminator (CE)
1. (a) 2. (b) 3. (a) 4. (a) 5. (a) 6. (b)
7. (b) 8. (a) 9. (d) 10. (a) 11. (b)
1. (a) P can be selected in 4 ways
Number of numbers when 9 is used
once is 4(100C1)(999)
Number of numbers when 9 is used
thrice is 4(100C3)(997)
Similarly number of numbers when
9 is used 99 times is 4(100C99)(9)
So total number of numbers formed
is 4[ (100C1)(999) + (100C3)(997)+…+
(100C99)(9)]
We know that 10100 = (9+1)100
=(100C0)(9100)+ (100C1)(999) + (100C3)
(997)+…+ (100C99)(9) + (100C100)(1)]
And 8100 = (9-1)100 =(100C0)(9100)
- (100C1)(999) + (100C3)(997)+…-
( C99)(9) + (100C100)(1)]
100
Hence 10100 – 8100 = 2[(100C1)(999) +
(100C3)(997)+…+ (100C99)(9)]
So required number of numbers is
4[1/2(10100 – 8100) = 2(10100 – 8100)
2.
(b) A number is divisible by 5 if its unit
digit is 0 or 5, in this case unit digit
is 5.
Now consider a 7 digit number
7777777 it is divisible by 7, in this
Word/Number Formation  177
7 digit number is (7!)/(4!)(3!) = 35
So total number of numbers is 42+35
= 77
17. (a) 1st place can be filled up by either 1,
2, or 3 i.e, in 3 ways and remaining
places can be filled up in 5 ways
hence total number of numbers is
3 × 5 × 5 × 5 = 375
we have to replace 7 by 5 and then
new number should be divisible by 7.
When 5 divided by 7 remainder is 5
When 50 divided by 7 remainder is 1
When 500 divided by 7 remainder is 3
When 5000 divided by 7 remainder
is 2
When 500000 divided by 7 remainder
is 6
When 5000000 divided by 7
remainder is 4
Number is divisible by 7 if sum of 2
or more of the remainders above is
divisible by 7.
Since 5+2 = 7, so we can replace
7 and 7000 by 5 and 5000 and the
new number is 7775775, applying
the similar logic we have following
numbers that satisfy above
condition-
7775775, 7757575, 5577775,
7575575, 5777555, 7755755,
5755575, 5557755, 7555555
So total 9 such numbers exist.
3. (a) Since number of ways of writing
r digit number from n digits with
repetition of digits and digits are in
non increasing order is n+r-1Cr
178  Theory of Counting

Number Number of
Digits that can be
starting n r numbers is Total
used n+r–1C
with r
1 1, 0 2 5 6C =6 6
5
2 2, 1, 0 3 5 7C = 21 27
5
3 3,2,1,0 4 5 8C = 56 83
5
4 4,3,2,1,0 5 5 9C = 126 209
5
5 5,4,3,2,1,0 6 5 10C = 252 461
5
6 6,5,4,3,2,1,0 7 5 11C = 462 923
5
7 7, 6,5,4,3,2,1,0 8 12C
5 = 792 1715
From 800000 10C
5,4,3,2,1,0 6 5 = 252 1967
to 855555 5

From 860000 7C
3210 4 4 = 35 2002
to 863333 4

Next 2003rd number is 864000, a, b such that a+b gives remainder 1

2004th number is 864100,
2005th number is 864110
4. (a)
If a number is divisible by 15 then
it must be divisible by 3 and 5 so we
have following cases-
Case (i) Number is in the form of abc15,
here a ≠ 0, so we have to find number
of 3 digit number ‘abc’ divisible by 3
which is 300.
Case (ii) Number is in the form of ab150
here a ≠ 0, so we have to find number
of 2 digit number ‘ab’ divisible by 3
which is 30
Case (iii) Number is in the form of ab155
here a ≠ 0, so we have to find number
of 2 digit number ‘ab’ divisible by 3
which is 30
Case (iv) Number is in the form of a15b0
here a ≠ 0, so we have to find pair a ,
b such that a+b is divisible by 3 or in
other words number of 2 digit number
‘ab’ divisible by 3 which is 30
Case (v) Number is in the form of a15b5
here a ≠ 0, so we have to find pair
when divided by 3 or else number of
2 digit number ‘ab’ gives remainder
1 when divided by 3 which is 30, but
out of these 30 numbers consider
numbers 31515, 61515 and 91515
we have already counted in case (i)
so actual number of numbers in this
case is 30 – 3 = 27.
Case (vi) Number is in the form of 15ab0
so we have to find pair a , b such that
a+b is divisible by 3 which is 34 but
out of these 34 numbers consider
numbers 15015, 15315, 15615 and
15915 we have already counted in
case (i) so actual number of numbers
in this case is 34 – 4 = 30
Case (vii) Number is in the form of
15ab5, so we have to find pair a , b
such that a+b is gives remainder 1
when divided by 3 which is 33, but
out of these 34 numbers consider
numbers 15155 we have already
counted in case (iii) so actual number
of numbers in this case is 33 – 1 = 32
So total number of numbers is 300 +
30 + 30 + 30 + 27 + 30 + 32 = 479

5. (a) We have following cases-
Case (i) If number is made up with three
digits occurring twice. Three digits
can be selected in 5C3 = 10 ways and
these numbers can be arranged in
(6!)/(2!)(2!)(2!) = 90 ways, so number
of numbers in this case is
90 × 10 = 900.
Case (ii) If number is made up with two
digits occurring thrice. Two digits
can be selected in 5C2 = 10 ways and
these numbers can be arranged in
(6!)/(3!)(3!) = 20 ways, so number of
numbers in this case is
20 × 10 = 200.
Case (iii) If number is made up with two
digits, one digit occurs 4 times while
other occurs 2 times. Two digits
can be selected in 5C2 = 10 ways
then there are two ways they can
7. (b) The following sequence can be inferred –
Number Ticket No
1 122222222 Red
2 222222222 Green
3 313113113 blue
4 231331331 Green
5 331331331 Blue
6 123123123 Red
Hence required colour is Red.
Word/Number Formation  179
interchange and these numbers can
be arranged in (6!)/(4!)(2!) = 15 ways,
so number of numbers in this case is
2×15×10 = 300.
Case (iv) When all the digits are same:-
we will get 5 such numbers.
Total number of numbers is
900 + 200 + 300 + 5 = 1405
6. (b) To find the summation of the given
situation refer to question number 7
and 8 of Concept Deviator (CD)
Required summation is the sum of
all the 3 digit numbers minus the
answers of question number 7 and 8
of Concept Deviator (CD)
Sum of all the three digit numbers is
999 × 1000 99 × 100
– =  494550
2 2
So required summation is
494550 – 69375 – 54400 = 370775
Colour Reason
Given
Given
Each digit is different from 1st & 2nd
Each digit is different from 1st & 3rd
Each digit is different from 1st & 2nd
Each digit is different from 4th & 5th
180  Theory of Counting
8.
(a) We have following 4 cases –
Case (i): Assume that number ends
with 8, then number must be in
the form of ab28, ab48, ab68, ab88
for numbers ab28 and ab48, b must
be one of the following (2, 4, 6 & 8)
while for numbers ab68 and ab88 b
must be one of the following (1, 3, 5,
7, 9) hence the number of numbers
in this case is (9 × 4 × 2)+(9 × 5 × 2)
= 72+90 = 162
Case (ii): Assume that number ends
with 6, then number must be in the
form of ab16, ab36, ab56, ab76, and
ab96 for numbers ab36 and ab76, b
must be one of the following (2, 4, 6 &
8) while for numbers ab16, ab56 and
ab76, b must be one of the following
(1, 3, 5, 7, 9) hence the number of
numbers in this case is (9 × 4 × 2)+(9
× 5 × 3) = 72+135 = 207
Case (iii): Assume that number ends
with 4, then number must be in the
form of ab24, ab44, ab64, and ab84,
for numbers ab24 and ab64, b must
be one of the following (1, 3, 5, 7, 9)
while for numbers ab44, and ab84, b
must be one of the following (2, 4, 6
& 8) hence the number of numbers
in this case is (9 × 5 × 2)+(9 × 4 × 2)
= 90+72 = 162
Case (iv): Assume that number ends
with 2, then number must be in the
form of ab12, ab32, ab52, ab72, and
ab92 for numbers ab32 and ab72,
b must be one of the following (1,
3, 5, 7, 9) while for numbers ab12,
ab52 and ab72, b must be one of the
following (2, 4, 6 & 8) hence the
number of numbers in this case is (9
× 5 × 2)+(9 × 4 × 3) = 90+108 = 207
So total number of numbers
formed is 162+207+162+198 = 729
Option (a)
9. (d) Number of palindromic numbers
less than 10n is
 n 
2  10 2 – 1 if n is even
 
n −1
11 × 10 2 – 2 if n is odd
Number of palindromic number less
than 107 is 11 × 1000 – 2 = 10998
Number of palindromic number less
than 106 is 2 × 999 = 1998
So required number is 10998 – 1998
= 9000
10. (a) Since 7 coupons numbered from 1 to
9 so that ‘9’ is selected at least once.
Thus total number of favourable
ways are, 97– 87
⇒ Required probability = 97 – 87
11. (b) Since sum of the digits is 10 and
0+1+2+3 = 6 so sum of the remaining
two digits must be 4 and possible
combination for this is (0, 4), (1, 3)
and (2,2)
So we have following three cases-
Case (i): If digits {0, 0, 1,2,3,4} so number
of numbers in this case is 4×(5!)/2 = 240
Case (ii): If digits {0, 1, 1, 2, 3, 3} so
number of numbers in this case is
(5!)/(2!)(2!) + 2(5!)/2! = 150
When 1st digit is 2 then number of
numbers is (5!)/(2!)(2!) and when 1st digit
is either 1 or 3 then number of numbers
is 2(5!)/2!
Case (iii): If digits {0, 1,2, 2, 2,3} so
number of numbers in this case is
2(5!)/(3!) +(5!)/2 = 40+60= 100
So total number of numbers is
240 + 150 + 100= 490
 7
Distribution  181

Distribution

Topics Covered
 Partitioning Theory.

 Distribution of Distinct Articles.

 Distribution in Groups.

 Stanly’s 12 fold of distribution.

Part A: Topic Number of Questions

Solved Example 26
Concept Applicator 10
Concept Builder 10
Concept Cracker 30
Part B: Topic Number of Questions
Concept Deviator 4
Concept Eliminator 5
Total 85
182  Theory of Counting
Part A
Concept 1 Partitioning Theory
Distribution of ‘n’ articles into ‘r’ groups:
In this type of questions we have different
cases that depends on whether ‘n’ articles are
identical or distinct, similarly ‘r’ groups are
identical or distinct. We will discuss each and
every case separately:-
Case (i) [Partitioning Theory]: Number of
ways of dividing ‘n’ identical things among
‘r’ distinct groups or ‘r’ persons when each
group can get any number of things ≤ n is
(n+r-1)C
r-1
Proof: Let us assume that we have to
distribute 10 identical chocolates among
three students, to understand this condition
just assume that these 10 Chocolates are kept
on a table
C C C C C C C C C C
Here ‘C’ denotes the chocolates, to divide
it in three parts we have to do only two
partition, Let us assume position of
partition is as shown below (for one case)
C C C P C C C P C C C C
Here ‘P’ denotes the point from where we have
done partitioning. In this case 1st student gets
3, 2nd gets 3 and 3rd student gets 4 chocolates.
In order to understand this lets see few more
cases-
P C C C C C C C P C C C
QR Code / Video Link
For Smart phone/ Tablet users
Video Link for Desktop/Laptops users http://dishapublication.com/video-resources
In this case 1st student gets 0, 2nd gets 7 and
3rd student gets 7 chocolates.
C C C C P P C C C C C C
In this case 1st student gets 4, 2nd gets 0 and
3rd student gets 6 chocolates.
In this way we have many more cases but
the question is how many cases? If we look at
carefully then actually we are arranging 10
identical C’s and 2 identical P’s in a straight line
and that can be done in (10 + 2)! = 10+3 –1C3 –1
(10!)(2!)
Now lets generalize it when we have
‘n’ identical chocolates and we have to
distribute it to ‘r’ students.
Again arrange ‘n’ chocolates in a straight line-
C C C C C C C C ……………C C
In order to divide it to ‘r’ students we have
to put (r – 1) Ps so the situation is similar to
arrange ‘n’ identical Cs and (r – 1) identical
(n + r − 1)!
Ps, this can be done in (r − 1)!(n)! = n+r–1Cr–1
Example 1:  In how many ways 10 identical
chocolates can be distributed among 4
students?
Solution:  Here we have n = 10 and r = 4 hence
required number of ways is
(10+4–1)C 13C ways.
4–1 = 3

Example 2:  In how many ways 10 identical
chocolates can be distributed among 4
students if each student should get at
least 1 chocolate?
Solution:  As per the given condition each
student should get at least 1 chocolate so
Concept 2 Distribution of Distinct Article
Distribution of ‘n’ distinct articles to
‘r’ distinct groups: The number of ways of
distributing ‘n’ distinct articles to ‘r’ distinct
group is rn.
1st article can be dealt in r ways, 2nd article
can be dealt in r ways and so on each article
can be dealt in r ways.
Hence number of ways is rn
Example 3:  In how many ways 10 distinct
rings can be send to 5 distinct boxes?
Solution:  1string can be dealt in 5 ways,
2ndring again in 5 ways and so on hence
total number of ways is 5×5×5…×5 = 510
In general students used to get confuse that
whether 510or 105 is the correct answer, to
get rid of this confusion we can remember 1
simple formula (where)(What).
In this case ‘Where’ we are sending the
articles? It is boxes and number of boxes is 5,
QR Code / Video Link
For Smart phone/ Tablet users
Video Link for Desktop/Laptops users http://dishapublication.com/video-resources
Distribution  183
1st we will give 1 chocolate to each student
then we will have 6 remaining chocolates
now we have n = 6 and r = 4.
Hence required number of ways is
(6+4–1)C4–1 = 9C3 ways.
then next is what we are sending? It is rings
and the number of rings is 10 hence from
(Where)(What) formula required number of
ways is 510
Arrangements in groups
• The number of ways in which n different
things can be arranged into r different
group (when a particular group may be
empty) is r(r+1)(r+2)…(r+n–1)
(r + n –1)!
=
(r -1)!
• The number of ways in which n different
things can be arranged into r different
group (when no group is empty) is n – 1Cr – 1
• The number of ways in which n different
things can be distributed into r different
groups (when no group is empty) is
rn – rC1(r–1)n +….. + (–1)r – 1(rCr – 1)
184  Theory of Counting
Example 4:  In how many ways 10 distinct
rings can be worn on 5 fingers?
Solution:  Consider 1string it can go in any
of the five fingers, so it has 5 ways to deal
with. 2nd ring can go in any of the five
fingers but it has six ways.
Let us assume that 1st ring is worn on 4th
finger then for 2nd ring there are two places
on 4th finger one before 1st ring and one
after 1st ring.
Similarly 3rd ring has 7 ways and so on-
So, the total number of way of distribution
of rings is = 5 × 6 × 7 × ... × 14 = (14!)/(4!)
Alternately:
Since arrangements of ‘n’ distinct articles to
‘r; distinct groups when order in a group is
(n+r – 1)!
important:
(r – 1)!
In this case n = 10 and r = 5.
So required number of ways is (14!)/(4!)

Concept 3 Distribution in Groups

Type 1: Number of ways of dividing (m+n) Solution:  From the above formula the
distinct articles in two groups containing m 12!
and n articles respectively (m ≠ n) is (m+nCn) required number of ways is
(6!)(6!)(2)
{(m + n)!} Type 3: Number of ways of dividing 2m
(mCm) = (m+nCm)(nCn) = {(m !)(n !)}
distinct articles between two persons such
Example 5:  In how many ways 12 distinct {(2m)!}
that each of them get m articles is .
cricket balls can be distributed in two {(m !)(m !)}
groups having 5 and 7 cricket balls? Example 7:  In how many ways 12 distinct
Solution:  From the above
formula the cricket balls can be distributed
12! between two friends Rishita and
required number of ways is Sinjini such that each of them getting
(5!)(7!)
6 cricket balls?

Type 2: Number of ways of dividing 2m Solution:  From the above

formula the
distinct articles in two groups containing m 12!
{(2m)!} required number of ways is
(6!)(6!)
articles in each group
{(m !)(m !)(2!)} Type 4: Number of ways of dividing 3m
Example 6:  In how many ways 12 distinct distinct articles in three groups containing m
cricket balls can be distributed in two {(3m)!}
articles in each group
groups each having 6 cricket balls? {(m !)(m !)(m !)(3!)}
 Distribution  185
Example 8:  In how many ways 12 distinct Example 11:  In how many ways 20 distinct
cricket balls can be distributed in three cricket balls can be distributed in 5
groups each having 4 cricket balls? groups such that the groups has 2, 3, 4,
5 and 6 cricket balls?
Solution:  From the above
formula the Solution:  From the above formula the required
12! 20!
required number of ways is number of ways is
(4!)(4!)(4!)(3!) (2!)(3!)(4!)(5!)(6!)
Type 5: Number of ways of dividing 3m distinct Type 8: Number of ways in which n distinct
articles among three persons such that each objects can be distributed among r persons
{(3m)!} such that some person get a1 objects, another
of them get m articles is . person get a2 objects ......... and similarly
{(m !)(m !)(m !)} someone gets ar objects
Example 9:  In how many ways 12 distinct n n − a1
C a2 ) × ( n − a1 − a2 C aa ) × ...…
= ( C a1 ) × (
cricket balls can be distributed among 3

three friends Rishita, Trina and (n!)(r!)

=
Sinjini such that each of them getting (a1!)(a2!)(a3!)…(ar!)
4 cricket balls? Here a1 + a2 + a3 + ...... + ar = n.
Solution:  From the above
formula the Example 12:  In how many ways 20 distinct
12! cricket balls can be distributed in
required number of ways is among 5 students such that they get 2,
(4!)(4!)(4!)
3, 4, 5 and 6 cricket balls?
Type 6: Number of ways of dividing (m+n+p) Solution:  From the above formula the required
distinct articles in three groups containing m, (20!)(5!)
{(m + n + p)!} number of ways is
n, p articles in three groups is (2!)(3!)(4!)(5!)(6!)
{(m !)(n !)( p !)} Type 9: Number of ways in which m × n
distinct objects can be divided equally into n
Example 10:  In how many ways 12 distinct
(mn)!
cricket balls can be distributed in groups (unmarked) = .
three groups such that the groups has (m !)n (n !)
3, 4 and 5 cricket balls? Example 13:  In how many ways 20 distinct
Solution:  From the above formula the required cricket balls can be distributed in 4
12! groups such that each group has 5
number of ways is cricket balls?
(3!)(4!)(5!)
Solution:  From the above formula the
Type 7: Number of ways, in which n distinct required number of ways is
objects can be divided into r unequal groups
(20!) (20!)
containing a1, a2, a3, ......,ar things (ai ≠ aj) =
n − a1
(5!)(5!)(5!)(5!)(4!) (5!)4 (4!)
n
= ( C a1 ) × ( C a2 ) × ( n − a1 − a2 C aa ) × ...
3 Type 10: Number of ways in which m × n
n! different object can be distributed equally
=
a1! a2! a3! … ar! among n persons (or numbered groups)  =
Here a1 + a2 + a3 + ...... + ar = n. (number of ways of dividing) × (number of
groups)! = (mn)!n!/(m!)n n! = (mn)!/(m!)n
186  Theory of Counting
Stanley’s “12-fold way” for Distribution
Consider a question: How many ways can r pieces of Chocolates be distributed among nboxes?
Answer of this question depends on following factors-
1. Chocolates are Identical or Distinct.
2. Boxes are identical or distinct.
3. Is there any restriction on number of chocolates in a box?
Answer of all these can be given by following tables-

Number of Number of
Chocolates
Boxes (n) No restriction Chocolates in a Chocolates in a
(r)
bag ≤ 1 bag ≥ 1

nr n! (n!) S(r, n)
Distinct Distinct (n – r)!
Case (i) Case (ii) Case (iii)
nC r–1C
n+r–1C r n–1
Identical r–1
Distinct
Case (iv) Case (v) Case (vi)
n 1 if r ≤ n
S(r, n)
∑ S(r, k) 0 if r >n
Distinct Identical k =1
Case (vii) Case (viii) Case (ix)
n 1 if r ≤ n
Pn(r)
Identical Identical
∑ Pk(x) 0 if r >n
k =1
Case (x) Case (xi) Case (xii)
Here S(r, n) is sterling number and is defined as-
1 r
S(n, r) = [ C0 (rn) – rC1 (r – 1)n + rC2(r – 2)n – …. + (–1)r–1(rCr–1)(1n)]
r!
And S(n, 1) = 1,
S(n, 2) = 2n–1 – 1 , S(n, n–1) = nC2, S(n, n) = 1
Pn(r) represents the number of ways r identical chocolates can be placed into 4
identical bags such that no bag is empty.
Since there is only 1 way to express the number n as the sum of 1 number
(namely, n = n), so P1(n) = 1.
Similarly, there is only 1 way to express the number n as the sum of n numbers (namely,
n = 1 + 1 + 1 + … + 1), so Pn(n) = 1.
Consider, Pn – 1(n) = 1, since there will be 1 bag with 2 Chocolates and the rest of the bags will
have 1 chocolates each.
n – 1
In general, when n is even, P2(n) = n/2, and when n is odd, P2(n) = .
2
P2(8) = 4, and P2(11) = 5.

Example 14:  In how many ways 20 distinct
cricket balls can be distributed among
4 students such that each student get
5 cricket balls?
Solution:  From the above formula the required
(20!) (20!)
number of ways is = such that each bag gets at most chocolates,
(5!)(5!)(5!)(5!) (5!)4
Example 15:  In how many ways a pack
of 52 cards be divided into 4 sets such
that each set has 13 cards?
Solution:  Required number of ways is
52!
(13!)4 (4!)
Example 16:  In how many ways 5 distinct
chocolates can be distributed to 10
distinct bags with no restrictions?
Solution:  This case is similar to distributing r
distinct articles to n distinct groups without
any restriction, this is explain in column 3
and row 2 (Case i) of ‘12-fold way” table.
So total number of ways is nr = 105 = 100000
ways.
Example 17:  In how many ways 5 distinct
chocolates can be distributed to 10 distinct
bags such that each bag gets at most 1
chocolates ? (Refer Stanley’s Table)
Solution:  This case is similar to distributing
r distinct articles to n distinct groups
such that each bag gets less than or equal
to 1 chocolates, this is explain in column 4
and row 2 (Case ii) of ‘12-fold way” table.
10! 10!
So total number of ways is = Number of ways is nCr = 10C5
(10 − 5)! 5!
= 10 × 9 × 8 × 7 × 6 = 30240 ways.
Another explanation of this can be given as
since one bag can have maximum 1 chocolates
hence we have to select just 5 bags out of 10
bags and then we will put 1 chocolate in those
5 bags, this can be done in (10C5)(5!)
10! 10!
= (10P5) = = =
(10 − 5)! 5!
= 10 × 9 × 8 × 7 × 6 = 30240 ways.
Distribution  187
Example 18:  In how many ways 5 distinct
chocolates can be distributed to 10
distinct bags such that each bag gets
at least 1 chocolates ?
Solution:  This case is similar to distributing
r distinct articles to n distinct groups
this is explain in column 5 and row 2 (Case
iii) of ‘12-fold way” table.
Since number of chocolates are less than
the number of bags hence number of ways
is zero.
Example 19:  In how many ways 5 identical
chocolates can be distributed to 10
distinct bags if there is no restriction?
Solution:  This case is similar to distributing
r identicalarticles to n distinct groups this
is explain in column 3 and row 3 (Case iv)
of ‘12-fold way” table, that can be done in
n+r–1C 10+5–1C
r–1 = 10–1
14 14! 14 × 13 × 12 × 11 × 10
= C9 = =
(9!)(5!) 1×2×3×4×5
= 2002 ways.
Example 20:  In how many ways 5 identical
chocolates can be distributed to 10
distinct bags if a bag can not have
more than 1 chocolate?
Solution:  This case is similar to distributing
r identical articles to n distinct groups
such that if a bag can not have more than
1 chocolate this is explain in column 3 and
row 4 (Case v) of ‘12-fold way” table,
10! 10 × 9 × 8 × 7 × 6
= = = 252 ways
(5!)(5!) 1 × 2 × 3 × 4 × 5
Alternate way to solve is that select 5 bag out
of 10 and that can be done in 10C5 ways and
since chocolates are identical hence we don’t
have to arrange it, so number of ways is 10C5
10! 10 × 9 × 8 × 7 × 6
= = 252 ways
(5!)(5!) 1 × 2 × 3 × 4 × 5
188  Theory of Counting
Example 21:  In how many ways 5 identical
chocolates can be distributed to 10
distinct bags if a bag must have at
least 1 chocolate?
Solution:  This case is similar to distributing
r identical articles to n distinct groups
such that if a bag can not have more than
1 chocolate this is explain in column 4 and
row 4 (Case vi) of ‘12-fold way” table,
Number of ways is 0 since number of
chocolates is less than number of bags.
Example 22:  In how many ways 5 distinct
chocolates can be distributed to 10
identical bags?
Solution:  This case is similar to distributing
r distinct articles to n identical groups this
is explain in column 4 and row 4 (Case vii)
of ‘12-fold way” table,
Number of ways is S(5,1) + S(5, 2) + S(5, 3)
+ … + S(5, 9) + S(5,10)
1 r
Since S(n, r) = [ C0 (rn) – rC1(r – 1)n +
r!
rC (r – 2)n – …. + (–1)r–1(rC )(1n)]
2 r–1
And S(n, 1) = 1, S(n, 2) = 2n – 1 – 1 , S(n, n – 1)
= nC2, S(n, n) = 1
Here in this case required number of ways
is S(5,1) + S(5,2) + S(5,3) + S(5,4) + S(5,5)
Since S(5,1) = 1, S(5,2) = 24 – 1 = 15, S(5, 4)
= 5C2 = 10 and S(5,5) = 1 so only we need to
find is S(5,3)
From the formula S(5,3)=1/3!
243 −96 +  3
[3C0(35) – 3C1(25)+3C2(15)] = = 25
6 identical bags if each bag gets at least
So required number of ways is 1+15 + 25 +
10 + 1 = 52
Example 23:  In how many ways 5 distinct
chocolates can be distributed to 10
identical bags if each bag gets at most
1 chocolate?
Solution:  This case is similar to distributing
r distinct articles to n identical groups
this is explain in column 4 and row 4 (Case
viii) of ‘12-fold way” table,
Since number of chocolates is less than the
number of bags hence number of ways is 1.
Example 24:  In how many ways 5 distinct
chocolates can be distributed to 10
identical bags if each bag gets at least
1 chocolate?
Solution:  This case is similar to distributing
r distinct articles to n identical groups this
is explain in column 4 and row 4 (Case ix) of
‘12-fold way” table,
From the table required number of ways is
S(5, 10) = 0
Since number of chocolates is less than the
number of bags hence number of ways is zero.
Example 25:  In how many ways 5 identical
chocolates can be distributed to 10
identical bags?
Solution:  This case is similar to distributing
r distinct articles to n identical groups this
is explain in column 4 and row 4 (Case x) of
‘12-fold way” table,
Since Pn(r) represents the number of ways
r identical chocolates can be placed into
4 identical bags such that no bags is empty.
P1(5) = 1, P2(5) = 2,
P3(5) = 2 ways as can be seen (1, 1, 3) (1, 2, 2)
P4(5) = 1 ways as can be seen (1, 1, 1,2)
P5(5) = 1 ways as can be seen (1, 1, 1, 1, 1)
Total number of ways is 1+2+2+1+1 = 7
Example 26:  In how many ways 5 identical
chocolates can be distributed to 10
1 chocolate?
Solution:  This case is similar to distributing
r distinct articles to n identical groups this
is explain in column 4 and row 4 (Case xii)
of ‘12-fold way” table,
From the table required number of ways is
P10(5) = 0
Since number of chocolates is less than the
number of bags hence number of ways is zero.

1
Concept Applicator (CA)
Ideal Time
10 Min.
1. In how many ways 20 identical chocolates
be distributed among 5 students?
(a) 24C5 (b) 24C4
25
(c) C4 (d) None of these
2. In how many ways 20 identical chocolates
be distributed among 5 students such
that a particular student Rohan receive
at least 1 chocolate?
(a) 24C5 (b) 24C4
(c) 25C
4 (d) None of these
3. In how many ways 20 identical chocolates
be distributed among 5 students such that
each student receive at least 1 chocolate?
24C 19C
(a) 5 (b) 4
25C
(c) 4 (d) None of these
4. In how many ways 20 identical chocolates
be distributed among 5 students such
that each student receive at least 2
chocolates?
(a) 14C4 (b) 19C4
(c) 19C
5 (d) None of these
5. In how many ways 20 identical chocolates
be distributed among 5 students such
that each student receive at least 3
chocolates?
(a) 19C 19C
5 (b) 4
(c) 9C
4 (d) None of these
Response Grid
1. a b c d 2. a b c d 3. a b c d 4. a b c d 5. a b c d
6. a b c d 7. a b c d 8. a b c d 9. a b c d 10. a b c d
Distribution  189
Apply your concepts with easy and
conceptual questions
6. In how many ways 20 distinct chocolates
be distributed among 5 students?
(a) 520 (b) 24C
4
(c) 205 (d) None of these
7. In how many ways 20 distinct chocolates
be distributed among 5 students such
that a particular student Rohan receive
at least 1 chocolate?
(a) 5(2019) (b) 20(519)
23C
(c) 4 (d) None of these
8. In how many ways 20 students can be
send to 4 class rooms?
(a) 420 (b) 23C3
(c) 204 (d) None of these
9. Ricky has 10 friends to invite, in how
many ways can he send the invitation
cards to them if there are three different
courier services are available?
(a) 103 (b) 13C3
10
(c) 3 (d) None of these
10. In how many ways 15 different articles
can be distributed equally among 3
persons?
15! 15!
(a) (3)(5!)3 (b) (5!)3
15!
(c) (3!)(5!)3 (d) None of these
190  Theory of Counting

2
Concept Builder (CB)
Ideal Time Revise your concepts with questions
15 Min. medium difficulty level questions
1. In how many ways 50 grapes can be 52!
distributed to 5 students? (c) (3!)(17!)3 (d) None of these
(a) 54C5 (b) 54C4
24
(c) 5 (d) None of these
7. In how many ways 225 distinct choco-
2. In how many ways 50 grapes can be lates can be distributed equally to 15
distributed to 5 students such that each
students?
of them receives at least 5 grapes?
(a) 49C5 (b) 29C4 225! 225!
29
(a) (b)
(c) C5 (d) None of these (15!)2! (15!)15
3. In how many ways 50 grapes can be 225!
distributed to 5 students such that 1st (c) (d) None of these
student get at least 1, 2nd student get at (15!)14!
least 2 and so on 5th student get at least 8. In how many ways 50 distinct chocolates
5 grapes? can be distributed equally among 10
(a) 39C4 (b) 29C4 identical boxes?
(c) 29C5 (d) None of these 50! 50!
(a) (b)
4. In how many ways 50 grapes can be 5
{(10!) }(5!) {(10!)5 }
distributed to 6 students such that each
of them receives at least 8 grapes? 50!
(c) (d) None of these
(a) 7C6 (b) 9C4 {10!}(5!)
(c) 7C5 (d) None of these 9. In how many ways 50 distinct chocolates

5. In how many ways a pack of 52 cards can can be distributed equally among 10
students?
be distributed equally to 4 students?
50! 50!
52! 52! (a) (b)
5
(a) (13!)
4 (b) (4)(13!)4 {(10!) }(5!) {(10!)5 }
50!
4(52!) (c) (d) None of these
(c) (13!)4 (d) None of these {10!}(5!)

10. What is the number of ways in which
6. In how many ways a pack of 52 cards
a mixed double game can be arranged
can be distributed to 4 sets such that
amongst 10 married couples if no husband
3 of them having 17 cards each and
and wife play in the same game?
remaining 1 with 1 card?
(a) (10C2)(8C2)(2) (b) (10C2)(8C2)/(2)
52! 51!
(a) (b) (c) (10C2)(8C2) (d) None of these
(17!)3 (3!)(17!)3
Response Grid
1. a b c d 2. a b c d 3. a b c d 4. a b c d 5. a b c d
6. a b c d 7. a b c d 8. a b c d 9. a b c d 10. a b c d

3
Concept Cracker (CC)
Ideal Time
60 Min.
1. How many cricket matches can be
conducted from 22 players if a team has
11 players?
(a) (22C11) (b) (22C11)/2
22
(c) ( C11)(2) (d) None of these
2. In how many ways m distinct books can
be distributed to n students?
(a) mn (b) (n!)(m!)
(c) mPn (d) None of these
3. In how many ways 2n persons can be
divided into n pairs?
(2n)!
(a) 2nC
n (b) get at least 1 ball?
2n
(c) (2n)(2nC
n) (d) None of these
4. In how many ways 15 different articles
can be distributed equally in 3 sets?
15! 15!
(a) (b)
(3)(5!)3 (5!)3
15!
(c) (d) None of these
(3!)(5!)3
5. Total number of fruits with Ram is 10
Mangoes, 5 Oranges and 5 Apples, in
how many ways he can distribute it
among his three friends such that any
friend may receive any number of fruit
Assume that fruits of the same species
are all alike?
(a) 29106 (b) 1386
(c) 87318 (d) None of these
6. Total number of fruits with Gunjan is
10 Mangoes, 10 Oranges and 10 Apples,
in how many ways he can distribute it
among his three friends such that each
Distribution  191
Boost up your confidence with good
questions
friend receive at least 1 fruit of each
type?
(a) 44656 (b) 46616
(c) 46656 (d) None of these
7. If 5 dice are rolled then what is the
number of possible outcome in which at
least 1 die will show a 6?
(a) 4651 (b) 4620
(c) 4629 (d) None of these
8. What is the number of ways in which 5
balls of distinct colors can be distributed
to three persons if each person should
(a) 120 (b) 150
(c) 180 (d) None of these
9. Find the number of ways in which we
can distribute 10 distinct balls to 8 boxes
such that at most 6 of them are empty?
(a) 810 – 8 (b) 108 – 8
(c) 108 – 10 (d) None of these
10. In how many ways 26 distinct fruits can
be distributed among 4 persons, A, B, C
and D such that the number of chocolates
received by them (in the given order) is
in AP with common difference 1?
26!
(a)
( )( )(7!)(8!)
5! 6!
26!
(b)
(5!)(6!)(7!)(8!)(4!)
26!
(c)
(5!)(6!)(7!)(8!)(4)
(d) None of these
192  Theory of Counting
11. In how many ways six faces of a cube can
be painted with 1 colour ?
(a) 66 (b) 6!
6
(c) C6 (d) None of these
12. In how many ways 10 distinct chocolates
can be distributed to 5 distinct bags with
no restrictions?
(a) 510 (b) 105
(c) 10P5 (d) None of these
13. In how many ways 10 distinct chocolates
can be distributed to 5 distinct bags such
that each bag gets at most 1 chocolates ?
(a) 510 (b) 105
(c) 10P5 (d) None of these
14. In how many ways 10 distinct chocolates
can be distributed to 5 distinct bags such
that each bag gets at least 1 chocolates ?
(a) 510 (b) 105
10
(c) P5 (d) None of these
15. In how many ways 10 identical
chocolates can be distributed to 5
distinct bags if there is no restriction?
(a) 510 (b) 14C4
14
(c) C9 (d) None of these
16. In how many ways 10 identical
chocolates can be distributed to 5
distinct bags if a bag can not have more
than 1 chocolate?
(a) 510 (b) 14C4
(c) 0 (d) None of these
17. In how many ways 10 identical
chocolates can be distributed to 5
distinct bags if a bag must have at least
1 chocolate?
(a) 510 (b) 9C4
(c) 14C9 (d) None of these
18. In how many ways 10 distinct chocolates
can be distributed to 5 identical bags?
(a) 42525 (b) 86472
(c) 86582 (d) None of these
19. In how many ways 10 distinct chocolates
can be distributed to 5 identical bags if
each bag gets at most 1 chocolate ?
(a) 510 (b) 14C
4
(c) 0 (d) None of these
20. In how many ways 10 distinct chocolates
can be distributed to 5 identical bags if
each bag gets at least 1 chocolate?
(a) 42525 (b) 86472
(c) 86582 (d) None of these
21. In how many ways 10 identical
chocolates can be distributed to 5
identical bags?
(a) 7 (b) 30
(c) 25 (d) None of these
22. In how many ways 10 identical
chocolates can be distributed to 5
identical bags if each bag gets at most 1
chocolate?
(a) 7 (b) 30
(c) 0 (d) None of these
23. In how many ways 10 identical
chocolates can be distributed to 5
identical bags if each bag gets at least 1
chocolate?
(a) 7 (b) 30
(c) 25 (d) None of these
24. What is the number of ways in which 8
distinct chocolates can be packed in two
boxes such that no box remains empty?
(a) 256 (b) 128
(c) 510 (d) None of these
25. There are 10 lamps in a room, if room
can be illuminated by any lamp then the
total number of ways in which room can
be illuminated is
(a) 1024 (b) 1023
(c) 511 (d) None of these

26. In how many ways n identical chocolates
can be distributed to 3n students such
that no student receive more than one
chocolate?
(a) 3nCn (b) 2nCn
(c) 3nCn – 2nCn (d) None of these
27. In a class of 10 students if two prizes (1st
and 2nd ) has to be given in three subjects
Physics, Chemistry & Mathematics then
in how many ways this can be done?
(a) 34300 (b) 72900
(c) 24300 (d) None of these
28. In how many ways 7 people can be
divided into 3 identical groups?
(a) 34323 (b) 520
(c) 61642 (d) None of these
Distribution  193
Direction Qs. 29 and 30: At a famous ice
cream parlor “The cold way” total 15 flavors
are available.
29. Niyati went to purchase an ice-cream
cone that can have three scoops how
many different ways she can order if
flavors can not be repeated ? (It is known
that order of flavor is not important.
(a) 17C3 (b) 17C2
(c) 15C3 (d) None of these
30. Niyati went to purchase an ice-cream
cone that can have at most three scoops
how many different ways she can order if
flavors can not be repeated ? (It is known
that order of flavor is not important).
(a) 17C3 (b) 17C2
(c) 15C3 (d) None of these

Response Grid
1. a b c d 2. a b c d 3. a b c d 4. a b c d 5. a b c d
6. a b c d 7. a b c d 8. a b c d 9. a b c d 10. a b c d
11. a b c d 12. a b c d 13. a b c d 14. a b c d 15. a b c d
16. a b c d 17. a b c d 18. a b c d 19. a b c d 20. a b c d
21. a b c d 22. a b c d 23. a b c d 24. a b c d 25. a b c d
26. a b c d 27. a b c d 28. a b c d 29. a b c d 30. a b c d

Solutions
Concept Applicator (CA)
1. (b) 2. (d) 3. (b) 4. (a) 5. (c) 6. (a)
7. (b) 8. (a) 9. (c) 10. (b)
194  Theory of Counting
1. (b) Here we are distributing identical
articles so we have to use partitioning
theory, in this case n = 20 and r = 5
hence required number of ways is
20 + 5 – 1C 24C
5–1= 4
2. (d) Here we are distributing identical
articles so we have to use partitioning
theory, in this case n = 20 and r = 5
but restriction is a particular student
Rohan receive at least 1 chocolate,
so to remove this restriction 1st give
him 1 chocolate now we left with 19
chocolates or n = 19. Hence required
number of ways is 19+5–1C5–1 = 23C4
3. (b) Here we are distributing identical
articles so we have to use partitioning
theory, in this case n = 20 and r = 5
but restriction is that each student
receive at least 1 chocolate, so to
remove this restriction 1st give them
1 chocolate each now we left with 15
chocolates or n =15. Hence required
number of ways is 15+5–1C5–1 = 19C4
4. (a) Here we are distributing identical
articles so we have to use partitioning
theory, in this case n = 20 and r = 5
but restriction is that each student
receive at least 2 chocolates, so to
remove this restriction 1st give them
2 chocolates each now we left with 10
chocolates or n =10 hence required
number of ways is 10+5–1C5–1 = 14C4
5. (c) Similar to the above question n = 5,
and r = 5. Hence required number of
ways is 5+5–1C5–1 = 9C4
6. (a) The main difference between
question number 1 and 6 is that the
things we are going to distribute
(Chocolate in this case) is identical
in question number 1 but distinct in
Concept Builder (CB)
1. (b) 2. (b) 3. (a) 4. (c) 5. (a) 6. (c)
7. (b) 8. (a) 9. (b) 10. (a)
question number 6. Since chocolates
are distinct, so 1st chocolate can
be distributed in 5 ways, 2nd in 5
ways and so on, so total number of
ways is 5 × 5 × 5 × 5 × ... × 5 = 520.
We can also use the formula.
(Where)(What), where we are sending
the articles answer is to students
and number of students is 5, what
we are sending answer is chocolate
and number is 20 hence required
number of ways is 520.
7. (b) Here also the articles are distinct, so
1st we will give a chocolate to Rohan
and that can be done in 20 ways then
remaining 19 distinct chocolates can
be distributed among 5 students in
519 ways. Hence total number of
ways is 20(519).
8. (a) Here students must be distinct.
Hence required number of ways is
420
9. (c) 1st invitation card can be dealt in 3
ways similarly 2nd and 4rd and so on
so total number of ways is 310.
We can also use the formula
(Where) Where we are sending the
invitation card answer is to courier
company and how many of them the
answer is 3 hence base is 3, next
what we are sending the answer is
invitation cards, and how many of
them the answer is 10 so exponent
must be 10, hence total number of
ways is 310.
10. (b) In this case each person will get 5
articles, so required number of ways
15! 15!
is =
(5!)(5!)(5!) (5!)3

1. (b) Here although it is not given that
grapes are identical or distinct, but
if nothing is given then we will apply
our logic, can we distinguish these
50 grapes the answer is no so we will
assume that they are identical, then
n = 50 and r = 5. Hence required
number of ways is 50+5–1C5–1 = 54C4
2. (b) Here we are distributing identical
articles so we have to use partitioning
theory, in this case n = 50 and r = 5
but restriction is that each student
receive at least 5 grapes, so to remove
this restriction 1st give them 5 grapes
each now we left with 25 grapes or
n = 25. Hence required number of
ways is 25 + 5 – 1C5 – 1 = 29C4
3. (a) Here we are distributing identical
articles so we have to use partitioning
theory, in this case n = 50 and r = 5
but restriction is that 1st student get
at least 1, 2nd student get at least 2
and so on 5th student get at least 5
grapes, so to remove this restriction
1st give them required number of
grapes i.e 1+2+3+4+5 =15 grapes
now we left with 35 grapes or n = 35.
Hence required number of ways is
35+5–1C 39C
5–1 = 4
4. (c) Here we are distributing identical
articles so we have to use partitioning
theory, in this case n = 50 and r = 6
but restriction is that each student
receive at least 8 grapes, so to
remove this restriction 1st give them
8 grapes each now we left with 2
grapes or n = 2.
Hence required number of ways is
2+6–1C 7
6–1 = C5
5. (a) We know that : Number of ways in
which m × n different object can be
distributed equally among n persons
(or numbered groups)  = (number of
ways of dividing) × (number of groups)!
= (mn)!n!/(m!)n n! = (mn)!/(m!)n
Distribution  195
Hence required number of ways is
52!
(13!)4
6.
(c) We know that number of ways of
dividing 3m distinct articles in three
groups containing m articles in each
{(3m)!}
group
{(m !)(m !)(m !)(3!)}
th
Here 4 student can be given 1 card
in 52 ways, then remaining 51 cards
now we have to distribute equally
among 3 students and that can be
51!
done in
(3!)(17!)(17!)(17!)
Hence required number of ways
(52)(51!) 52!
=
(3!)(17!)(17!)(17!) (3!)(17!)3
7. (b) Since we know from Type 10:-
Number of ways in which m × n
different object can be distributed
equally among n persons (or
numbered groups) = (number of ways
of dividing) × (number of groups)! =
(mn)!n!/(m!)n n! = (mn)!/(m!)n
Hence required number of ways is
225!
(15!)15
8. (a) From the condition given in
Type 9:-Number of ways in which
m × n distinct objects can be divided
equally into n groups (unmarked) =
(mn)!/(m!)n n!.
Hence required number of ways is
50!
{(10!)5 }(5!)
9. (b) From solution of previous question
the required number of ways is
50! 50!
5
 ×  (5!) =
{(10!) } (5!) (10!) 5
196  Theory of Counting
10. (a) Two males can be selected out of selected women are W3 and W4 then
10 in 10C2 ways, then two females number of games can be (M1W3) with
can be selected out of 8 remaining (M2W4) and (M1W4) with (M2W3)
couples in 8C2 ways, Let us assume hence in two ways,
that selected males are M1, M2 and So total number of ways is (10C2)
(8C2)(2)
Concept Cracker (CC)
1. (b) 2. (d) 3. (b) 4. (c) 5. (a) 6. (c)
7. (a) 8. (b) 9. (a) 10. (a) 11. (d) 12. (a)
13. (d) 14. (d) 15. (c) 16. (c) 17. (b) 18. (d)
19. (c) 20. (a) 21. (b) 22. (c) 23. (a) 24. (d)
25. (b) 26. (a) 27. (b) 28. (d) 29. (c) 30. (d)

1. (b) Number of ways of distributing 22 And 5 identical Apples can be

players in two teams such that they distributed among 3 students in
play against each other is (22C11)/2 5+3–1C 7
3–1 = C2 = 21 ways.

2. (d) Consider 1st book it can be dealt in So total number of ways is 66 × 21 ×

n ways, next book again can be dealt
in n ways and so on hence number of
ways is nm
Alternately:
Since we have to distribute distinct
articles to distinct groups hence we
can use the formula (Where)What
hence number of ways is nm
3. (b) Total number of persons is 2n and
we need n pairs so required number
(2n)!
of pairs is
2n
4. (c) In this case each person will get 5
articles, so required number of ways
15! 15!
is = Case (i) 2+2+1 = 5, total number of
(3!) (5!)(5!)(5!) (3!) (5!)3
5. (a) 10 identical mangoes can be
distributed among 3 students in
10+3–1C 12C = 66 ways.
3–1 = 2
Similarly 5 identical Oranges can
be distributed among 3 students in
5+3–1C 7
3–1 = C2 = 21 ways.
21 = 29106
6. (c) 10 identical mangoes can be
distributed among 3 students such
that each student receive at least 1
mango is 7+3–1C3–1 = 9C2 = 36 ways.
Similarly oranges and apples can be
distributed in 36 ways so total number
of ways is 36 × 36 × 36 = 46656
7. (a) Total number of possible outcome is
65. Now consider the outcomes when
6 doesn’t appear which is 55 hence
required number of outcomes is
65 – 55 = 7776 – 3125 = 4651
8. (b) Here we have two cases-
ways in this case is (5C2)(3C2)(1C1)
(3) = 90
Case (ii) 3+1+1 = 5, total number of
ways in this case is (5C1)(4C1)(3C3)
(3) = 60
198  Theory of Counting
1 r
Since S(n, r) = [ C0 (rn) – rC1 (r – 1)n
r!
+ rC2(r – 2)n - … + (–1)r–1(rCr–1)(1n)]
And S(n, 1) = 1, S(n, 2) = 2n–1 – 1 ,
S(n, n–1) = nC2, S(n, n) = 1
Here in this case required number of
ways is S(10,1) + S(10, 2) + S(10, 3)
+ S(10, 4) + S(10,5)
Since S(10, 1) = 1, S(10, 2) = 29 – 1 = 511,
From the formula S(10, 3) = 1/3!
[3C0 (310) – 3C1(210) + 3C2(110)]
= 59049 −3072 +  3 = 9330
6 that no bags is empty.
From the formula S(10, 4) = 1/4! [4C0
(410) – 4C1(310) + 4C2(210) – 4C3(110)]
1048576 − 236196 + 6144 − 4
= (1, 1, 8) (1, 2,7), (1, 3, 6), (1, 4, 5), (2,
24
= 34105
Hence S(10, 5) = 1/(5!) [5C0(510) – 5C1
410 + 5C2(3)10 – 5C3 210 + 5C4(1)10]
= 1/(5!) [9765625 – 5242880 + 590490
– 10240 + 5] = 1/(5!) [5103000]
= 42525
Required Number of ways is S(10,1)
+ S(10, 2) + S(10, 3) + S(10, 4) +
S(10,5) = 1+511+9330+34105+42525
= 86472
19. (c) This case is similar to distributing r
distinct articles to n identical groups
this is explain in column 4 and row
4 (Case viii) of ‘12-fold way” table,
Since number of chocolates is more
than the number of bags hence
number of ways is 0.
20. (a) This case is similar to distributing r
identical articles to n identical groups
this is explain in column 4 and row 4
(Case ix) of ‘12-fold way” table, and it
is definition of sterling number
From the table required number of
ways is S(10, 5) = 42525 (we have
already calculated that in previous
questions)
21. (b) This case is similar to distributing
r identical articles to n identical
groups this is explain in column 4 and
row 4 (Case x) of ‘12-fold way” table,
Required number of ways is P1(10) +
P2(10) + P3(10) + P4(10) + P5(10)
Since Pn(r) represents the number
of ways r identical chocolates can
be placed into n identical bags such
P1(10) = 1, P2(10) = 5,
P3(10) = 8 ways as can be seen
2, 6), (2, 3, 5), (2, 4, 4), (3, 3, 4)
P4(10) = 9 ways as can be seen (1,
1, 1,7), (1, 1, 2, 6), (1, 1, 3,5), (1, 1,
4,4), (1, 2, 2,5), (1, 2, 3, 4), (1, 3,
3,3), (2, 2, 2, 4), (2, 2, 3, 3),
P5(10) = 7 ways as can be seen
(1, 1, 1, 1, 6)(1,1,1,2,5), (1,1,1,3,4)
(1,1,2,2,4), (1,1,2,3,3)(1,2, 2, 2,3),
(2,2,2,2,2)
Total number of ways is
  1+5+8+9+7 = 30
22. (c) This case is similar to distributing r
distinct articles to n identical groups
this is explain in column 4 and row 4
(Case xi) of ‘12-fold way” table,
Since number of chocolates is more
than number of bags hence number
of ways is 0
23. (a) This case is similar to distributing r
distinct articles to n identical groups
this is explain in column 5 and row 4
(Case xii) of ‘12-fold way” table,
198  Theory of Counting
1 r
Since S(n, r) = [ C0 (rn) – rC1 (r – 1)
r!
n + rC (r – 2)n - … + (–1)r–1(rC )(1n)]
2 r-1
And S(n, 1) = 1, S(n, 2) = 2n-1 – 1 ,
S(n, n–1) = nC2, S(n, n) = 1
Here in this case required number of
ways is S(10,1) + S(10, 2) + S(10, 3)
+ S(10, 4) + S(10,5)
Since S(10, 1) = 1, S(10, 2) = 29 – 1 = 511,
From the formula S(10, 3) = 1/3!
[3C0 (310) – 3C1(210) + 3C2(110)] =
59049 −3072 +  3
= 9330
6 that no bags is empty.
From the formula S(10, 4) = 1/4! [4C0
(410) – 4C1(310) + 4C2(210) – 4C3(110)]
1048576 − 236196 + 6144 − 4
= (1, 1, 8) (1, 2,7), (1, 3, 6), (1, 4, 5), (2,
24
= 34105
Hence S(10, 5) = 1/(5!) [5C0(510) – 5C1
410 + 5C2(3)10 – 5C3 210 + 5C4(1)10] =
1/(5!) [9765625 – 5242880 + 590490
– 10240 + 5] = 1/(5!) [5103000] =
42525
Required Number of ways is S(10,1)
+ S(10, 2) + S(10, 3) + S(10, 4) +
S(10,5) = 1+511+9330+34105+42525
= 86472
19. (c) This case is similar to distributing r
distinct articles to n identical groups
this is explain in column 4 and row 4
(Case viii) of ‘12-fold way” table,
Since number of chocolates is more
than the number of bags hence
number of ways is 0.
20. (a) This case is similar to distributing r
identical articles to n identical groups
this is explain in column 4 and row 4
(Case ix) of ‘12-fold way” table, and it
is definition of sterling number
From the table required number of
ways is S(10, 5) = 42525 (we have
already calculated that in previous
questions)
21. (b) This case is similar to distributing r
identical articles to n identical groups
this is explain in column 4 and row 4
(Case x) of ‘12-fold way” table,
Required number of ways is P1(10) +
P2(10) + P3(10) + P4(10) + P5(10)
Since Pn(r) represents the number
of ways r identical chocolates can
be placed into n identical bags such
P1(10) = 1, P2(10) = 5,
P3(10) = 8 ways as can be seen
2, 6), (2, 3, 5), (2, 4, 4), (3, 3, 4)
P4(10) = 9 ways as can be seen (1,
1, 1,7), (1, 1, 2, 6), (1, 1, 3,5), (1, 1,
4,4), (1, 2, 2,5), (1, 2, 3, 4), (1, 3,
3,3), (2, 2, 2, 4), (2, 2, 3, 3),
P5(10) = 7 ways as can be seen
(1, 1, 1, 1, 6)(1,1,1,2,5), (1,1,1,3,4)
(1,1,2,2,4), (1,1,2,3,3)(1,2, 2, 2,3),
(2,2,2,2,2)
Total number of ways is
  1+5+8+9+7 = 30
22. (c) This case is similar to distributing r
distinct articles to n identical groups
this is explain in column 4 and row 4
(Case xi) of ‘12-fold way” table,
Since number of chocolates is more
than number of bags hence number
of ways is 0
23. (a) This case is similar to distributing r
distinct articles to n identical groups
this is explain in column 5 and row 4
(Case xii) of ‘12-fold way” table,

From the table required number of
ways is P5(10) = 7
24. (d) Each chocolate has 2 options hence
total number of ways is 2 × 2 × …
2 = 28 = 256, but it is given that no
box remains empty hence required
number of ways is 256 – 2 = 254
25. (b) Total number of ways is 210–1 = 1023
26. (a) Here we just have to select n
students from 3n students and that
can be done in 3nCn, since chocolates
are identical so we can arrange them
in only 1 way.
27. (b) In Physics 1st and 2nd prize can be
given in 10 × 9 = 90 ways and similarly
prizes in other 2 subjects can be given
in 90 ways, Hence total number of
ways is 90 × 90 × 90 = 729000
Distribution  199
28. (d) From the ’12 fold table’ required
number of ways is S(7, 1) + S(7, 2) +
S(7, 3)
Since S(n, 1) = 1, and S(n, 2) = 2n–1 – 1,
Hence S(7, 1) = 1 and S(7, 2) = 26 – 1 =
63, now we have to calculate S(7, 3)
From the formula S(7, 3)
= 1/3! [3C0 (37) – 3C1(27) + 3C2(17)]
2187 −384 +  3
= = 301
6
Required Number of ways is
1 + 63 + 301 = 365 ways.
29. (c) Total number of ways is 15C3
30. (d) Total number of ways is
  15C + 15C2 +15C3
1
200  Theory of Counting
Part B
Concept 1 Partitioning Theory
Distribution of ‘n’ articles into ‘r’ groups:-
In this type of questions we have different
cases that depends on whether ‘n’ articles are
identical or distinct, similarly ‘r’ groups are
identical or distinct. We will discuss each and
every case separately:
Concept 2 Distribution of Distinct Article
Distribution of ‘n’ distinct articles to ‘r;
distinct groups:- The number of ways of
distributing ‘n’ distinct articles to ‘r’ distinct
group is rn.
1st article can be dealt in r ways, 2nd article
can be dealt in r ways and so on each article
can be dealt in r ways hence number of ways
is rn
In general students used to get confuse that
whether 510or 105 is the correct answer, to
get rid of this confusion we can remember 1
simple formula (where)(What).
In this case ‘Where’ we are sending the
articles? It is boxes and number of boxes is 5,
then next is what we are sending? It is rings
and the number of rings is 10 hence from
(Where)(What) formula required number of
ways is 510
Case (i) [Partitioning Theory] :- Number of
ways of dividing ‘n’ identical things among
‘r’ distinct groups or ‘r’ persons when each
group can get any number of things ≤ n is
(n+r-1)C
r-1
Arrangements in groups:
• The number of ways in which n different
things can be arranged into r different
group (when a particular group may be
empty) is r(r+1)(r+2)…(r+n–1)
(r + n − 1)!
=
(r − 1)!
• The number of ways in which n different
things can be arranged into r different
group (when no group is empty)
is n – 1Cr – 1
• The number of ways in which n different
things can be distributed into r different
groups (when no group is empty) is
rn – rC1(r–1)n +….. + (–1)r–1(rCr–1)
 Distribution  201

Concept 3 Distribution in Groups

Type 1: Number of ways of dividing (m+n) Type 7: Number of ways, in which n distinct
distinct articles in two groups containing m objects can be divided into r unequal groups
and n articles respectively (m ≠ n) is (m+nCn) containing a1, a2, a3, ......,ar things (ai ≠ aj)
{(m + n)!}
(mCm) = (m+nCm)(nCn) = n n–a1 n–a1 –a2 n!
{(m !)(n !)} = Ca . Ca . Ca =
1 2 r a1! a 2! a 3!… ar!
Type 2: Number of ways of dividing 2m
Here a1 + a2 + a3 + ... + ar = n.
distinct articles in two groups containing m
{(2 m)!} Type 8: Number of ways in which n distinct
articles in each group
{(m !)(m !)(2!)} objects can be distributed among r persons
Type 3: Number of ways of dividing 2m such that some person get a1 objects, another
distinct articles between two persons such person get a2 objects ......... and similarly
{(2 m)!} someone gets ar objects
that each of them get m articles is
{(m !))(m !)} n n–a1 n–a1 –a2
= Ca . Ca . Ca
1 2 r
Type 4: Number of ways of dividing 3m
(n!)(r!)
distinct articles in three groups containing m =
a1! a 2! a 3!… ar!
{(3m)!}
articles in each group Here a1 + a2 + a3 + ... + ar = n.
{(m !)(m !)(m !)(3!)}

Type 5: Number of ways of dividing 3m distinct Type 9: Number of ways in which m × n

articles among three persons such that each distinct objects can be divided equally into n
{(3m)!} groups (unmarked) = (mn)!/(m!)n n!.
of them get m articles is .
{(m !)(m !)(m !)}
Type 10: Number of ways in which m × n
Type 6: Number of ways of dividing (m+n+p) different object can be distributed equally
distinct articles in three groups containing m, among n persons (or numbered groups)  =
{(m + n + p )!} (number of ways of dividing) × (number of
n, p articles in three groups is
{(m !)(n !)( p !)} groups)! = (mn)!n!/(m!)n n! = (mn)!/(m!)n.
202  Theory of Counting
Stanley’s “12-fold way” for Distribution
Consider a question: How many ways can r pieces of Chocolates be distributed among nboxes?
Answer of this question depends on following factors-
1. Chocolates are Identical or Distinct.
2. Boxes are identical or distinct.
3. Is there any restriction on number of chocolates in a box?
Answer of all these can be given by following tables-

Number of Number of
Chocolates
Boxes (n) No restriction Chocolates in a Chocolates in a
(r)
bag ≤ 1 bag ≥ 1

nr n! (n!) S(r, n)
Distinct Distinct (n – r)!
Case (i) Case (ii) Case (iii)
n+r–1C nC r–1C
r
Identical r–1 n–1
Distinct
Case (iv) Case (v) Case (vi)
n
1 if r ≤ n
∑ S(r, k) 0 if r >n
S(r, n)
k =1
Distinct Identical

Case (vii) Case (viii) Case (ix)

n 1 if r ≤ n
Pn(r)
Identical Identical
∑ Pk(x) 0 if r >n
k =1
Case (x) Case (xi) Case (xii)
Here S(r, n) is sterling number and is defined as-
1 r
S(n, r) = [ C0 (rn) – rC1 (r – 1)n + rC2(r – 2)n – ... + (–1)r–1(rCr–1)(1n)]
r!
And S(n, 1) = 1,
S(n, 2) = 2n–1 – 1 , S(n, n–1) = nC2, S(n, n) = 1
Pn(r) represents the number of ways r identical chocolates can be placed into 4
identical bags such that no bag is empty.
Since there is only 1 way to express the number n as the sum of 1 number
(namely, n = n), so P1(n) = 1.
Similarly, there is only 1 way to express the number n as the sum of n numbers (namely, n =
1 + 1 + 1 + … + 1),so Pn(n) = 1.
Consider, Pn–1(n) = 1, since there will be 1 bag with 2 Chocolates and the rest of the bags will
have 1 chocolates each.
n – 1
In general, when n is even, P2(n) = n/2, and when n is odd, P2(n) = .
2
For e.g. P2(8) = 4, and P2(11) = 5.
 Distribution  203

1
Concept Deviator (CD)
Ideal Time Revise your concept (IIT advance or
5 Min. tougher questions)
Per Question

1. An ice cream parlor has 20 different
flavors of ice cream available. If they sell
ice cream in a cone in triples (3 flavors in
a cone), how many different set of tastes
it can offer to its customer?
(a) 1140 (b) 1250
(c) 1540 (d) None of these
4. Five balls of different colours are to be
2. The total number of ways in which 5 balls
of different colours can be distributed
among 3 persons so that each person gets
at least one ball is:     [IIT JEE 2012]
(a) 75 (b) 150
(c) 210 (d) 243
3. There are four balls of different colours
and four boxes of colours, same as those
of the balls. The number of ways in which
the balls, one each in a box, could be placed
such that a ball does not go to a box of its
own colour is [IIT JEE 1992]
(a) 9 (b) 11
(c) 13 (d) None of these
placed in three boxes of different sizes.
Each box can hold all five. In how many
different ways can we place the balls so
that no box remains empty?
[IIT JEE 1981]
(a) 420 (b) 240
(c) 300 (d) None of these

Response Grid
1. a b c d 2. a b c d 3. a b c d 4. a b c d

2
Concept Eliminator (CE)
Ideal Time Revise your concept (Maths Olympiad
Just solve it or tougher questions)

1. If P represents the number of ways of
distributing n distinct objects to n+2
persons such that exactly 2 persons gets
nothing and Q represents the number of
ways of distributing n distinct objects to
n+2 persons such that exactly 3 persons
gets nothing then find the ratio of P:Q
(a) n(n–1)/6 (b) 4/n(n–1)
(c) n(n–1)/4 (d) None of these
204  Theory of Counting
2. Ramesh has 2n number of fruits out
of which n of them are identical and
remaining n are distinct, In how many
ways he can distribute these fruits to
his two children Bhavesh and Sanjesh
such that both of them will receive equal
number of fruits?
(a) 2n–1 (b) 2n
(c) 2n+1 (d) None of these
3. In how many ways 5 chocolates of
different brands can be distributed into
three students such that each student
gets at least one chocolate?
(a) 120 (b) 150
(c) 180 (d) None of these
Concept Deviator (CD)
1. (c) 2. (b) 3. (a) 4. (c)
1. (c) Here in this question repetition of
flavor is not allowed and order in
which the three flavors are given is
not important. Required number of
ways (20C3) + 2(20C2) +(20C1) = 1140
+ 380 + 20 = 1540 ways.
4. What is the total number of permutations
of n distinct things taken not more than
r at a time if each thing may be repeated
any number of times?
(a) n+r–1C n–r+1C
r–1 (b) r–1
n(n r – 1)
(c) (d) None of these
n–1
5. Amrita has 5 distinct rings, in how many
ways can she wear these rings on her 10
fingers?
(a) 14C 14C
4. (b) 5
14P
(c) 5 (d) None of these
Solutions
Alternate way:
Required number of ways is 20+3–1C3
= 22C3 = 1540
2. (b) Total number of ways is given by
35 – 3C1 × (3 – 1)5 + 3C2(3 – 2)5
= 243 – 3 × 32 + 3 = 150

Alternately:-
Case (i) If distribution is done such that
5 = (1, 2, 2) then number of ways is
 5!   3! 
    =  90
 (2!)(2!)  2! 
Case (ii) If distribution is done such that
5 = (1, 1, 3) then number of ways is
 5!   3! 
    =  60
 (3!)  2! 
So total number of ways is 90 + 60
= 150
Concept Eliminator (CE)
1. (d) 2. (c) 3. (b) 4. (c) 5. (c)
1. (d) Since we have to distribute n distinct
objects to n+2 persons just that
exactly 2 persons gets nothing that
means remaining n persons gets 1
objects, so number of ways is (n+2C2)
(n!) = P
Similarly for 2nd case 1st we will
select 3 persons out of n+2 and that
can be done in n+2C3. Now we have
to distribute n distinct objects to
n-1 persons so exactly one person
will get 2 objects that can be done
in (n–1C1)(nC2) then remaining n-2
distinct objects can be distributed
to n–2 persons in (n–2)! Ways hence
total number of ways is
Q=(n+2C3)(n–1C1)(nC2)(n–2)!
Required ratio is P:Q = 6/n(n–1)
Distribution  205
3. (a) This is question of De-arrangement
so required number of ways is
1 1 1 1
(4!)1 – + – + =9
 1! 2! 3! 4! 
4. (c) There are two cases-
Case (i) if it is (2, 2, 1) and number of
ways (3!)(5C2)(3C2)(1C1) = 120
Case (ii) if it is (3, 1, 1) and number of
ways (3!)(5C3)(2C1)(1C1) = 180
Total number of ways is 120 + 180 = 300
2. (c) Ramesh has to 1st select n fruits out
of 2n fruits , for this following cases
may arise-
Case (i) Number of distinct fruits 0 and
number of identical fruits n then
number of ways is nC0
Case (ii) Number of distinct fruits 1 and
number of identical fruits n–1 then
number of ways is nC1
Case (iii) Number of distinct fruits 2
and number of identical fruits n–2
then number of ways is nC2
And so on
Last case Number of distinct fruits
n and number of identical fruits 0
then number of ways is nCn
So total number of ways is nC0 + nC1
+ nC2 +… + nCn = 2n ways.
206  Theory of Counting
Since there are two sons so it can
de distributed in (2!) ways. Hence
required number of ways is (2)(2n)
= 2n+1
3. (b) We know that the number of ways
in which n different things can be
distributed into r different groups
(when no group is empty) is
rn – rC1(r–1)n +….. + (–1)r–1(rCr–1)
Hence required number of ways is
35 – 3C1(3–1)5 + 3C2(3–2)5 – 3C3(3–3)5
= 243 – 96 + 6 – 0 = 150
Alternately:
Here we have two cases-
Case (i) 2+2+1 = 5, total number of ways
in this case is (5C2)(3C2)(1C1)(3) = 90
Case (ii) 3+1+1 = 5, total number of
ways in this case is (5C1)(4C1)(3C3)
(3) = 60
Hence total number of ways is 90 +
60 = 150
4. (c) The number of ways if 1 item is
taken is n
The number of ways if 2 items is
taken is n2
The number of ways if 3 items is
taken is n3
Similarly …
The number of ways if r items is
taken is nr
Hence total number of ways is n + n2
n(n r – 1)
+n3+…+nr =
n–1
5. (c) Since all the 10 fingers are distinct
and distinguishable. Consider 1st
ring there are 10 places for it, now
consider the 2nd ring it has total 11
places (since 1st ring created two
separated places for 2nd ring on the
finger), similarly 3rd ring has 12, 4th
has 13 and 5th has 14 places.
So total number of ways is 10 × 11 ×
12 × 13 × 14 = (14!)/(9!) = 14P5.
 8
Number of Integral Solution  207

Number of Integral Solution

Topics Covered
 Number of Integral Solution

 Multinomial Theorem

 Integral Solution from Multinomial Theorem

 Application of Multinomial Theorem

 De-arrangement

Part A: Topic Number of Questions

Solved Example 10
Concept Applicator 10
Concept Builder 10
Concept Cracker 15
Part B: Topic Number of Questions
Concept Deviator 10
Concept Eliminator 5
Total 60
208  Theory of Counting
Part A

Concept 1 Number of Integral Solution

In last chapter we have studied portioning
theory, as per that theory- Number of ways
of dividing ‘n’ identical things among ‘r’
distinct groups or ‘r’ persons when each
group can get any number of things ≤ n is
(n+r-1)C
r-1
Now consider an equation with non negative
integral solution- a + b + c = 20
We need to find the non negative integral
solution of the equation. As per the given
condition a ≥ 0, b ≥ 0, and c ≥ 0. If we
observe carefully then situation is similar to
distributing 20 identical chocolates among
three students say A, B and C such that
number of chocolates received by A, B and C
is a, b and c respectively then a + b + c = 20
and a ≥ 0, b ≥ 0, and c ≥ 0.
Hence any such question can be dealt by
formula/theory of partitioning theory. Hence
required number of solution of the given
equation is 20+3–1C3–1 = 22C2.
Example 1:  Find the number of non
negative integral solution of the
equation x + y + z = 10
Solution:  Question is similar to, in how many
ways we can distribute 10 chocolates among
three students without any condition and
QR Code / Video Link
the number of ways from the partitioning
theory is 10+3–1C3–1 = 12C2 ways.
Example 2:  Find the number of non
negative integral solution of the
equation p + q + r + s = 10
Solution:  Required number of ways from the
partitioning theory is 10+4–1C4–1 =13C3 ways.
Example 3:  Find the number of positive
integral solution of the equation
x + y + z = 10
Solution:  Question is similar to, in how
many ways we can distribute 10 chocolates
among three students such that each
student receive at least 1 chocolates and
the number of ways from the partitioning
theory is 10–1C3–1 = 9C2 ways.
Alternately:-
Let as assume that x = 1 + x1 such that x1 ≥ 0
Similarly y = 1 + y1, z = 1 + z1 such that y1 ≥
0 and z1 ≥ 0,
Then the given equation x + y + z = 10 can be
reduced to (1 + x1) + (1 + y1 ) + (1 + z1 ) = 10
Or the new equation is x1 + y1 + z1 = 7 such
that x1 ≥ 0, y1 ≥ 0 and z1 ≥ 0,

For Smart phone/ Tablet users

Video Link for Desktop/Laptops users http://dishapublication.com/video-resources

210  Theory of Counting
Let us assumethat the different things
be denoted by the letters a, b, c, …
Then consider the term
(1 + ax + a2x2 + . . . + apxp) (1 + bx + b2x2
+ . . . + bqxq) (1 + cx + c2x2 + . . . + csxs). . .
In this expansion the exponent of the
letters a, b, c is same as that in x. Now
consider the coefficient of xr in the
expansion it is same as the number of
ways of taking r of the letters a, b, c, . . .
. . . with the restriction that maximum
number of a’ s is p, maximum number of
b’ s is q, maximum number of c’ s is and
so on.
Since the coefficient of xr in the expansion
will not change if we take a = b = c = . . .
. . . = 1.
Hence the number of combinations/
selections of r things out of n things of
which p are alike and are of one kind, q
are alike and are of second, s are alike
and are of third kind and so on.
= co-efficient of xr in [( 1 + x + x2 + . . . +
xp) (1 + x + x2 + . . . + xq) ( 1 + x + x2 + . .
. + xs)]
(ii) Number of combinations/selections
of r things out of n things of which
p are alike and are of one kind, q
are alike and are of second kind and
remaining ( n – p – q ) things are all
different kind is given by
= co-efficient of xr in [( 1 + x + x2 + ……..
+ xp)( 1 + x + x2 : …………………. + xq )
{( 1+ x) (1 + x) ……….. to (n – p – q )
factors}
= co-efficient of xr in { (1 + x + x2 … xp)
( 1 + x + . . . + xq ) ( 1 + x )n – p – q}
(iii) Restricted Combination :-Number of
selections of r things out of n things of
which p are alike and are of one kind, q
are alike and are of second kind, r are
alike and are of third kind such that n =
p+q+r and each things is taken at least
once
= Co-efficientof xr in { ( x + x2 + x3 +
……… + xp) ( x + x2 + x3 + ……. + xp)
( x + x2 + x3 + ……….. + xr)}
= Co-efficientof xr in [ ( 1 + x + x2 +
……. + xp – 1 ) ( 1 + x + x2 + …… + xq–1 )
( 1 + x + x2 + ….. + xr – 1 )]
(iv) Number of terms in the expansion of
(a1 + a2 + a3 + …. + an)r
In any term let exponents of a1, a2… an
are x1, x2, … and xn then x1 + x2+… xn
=r
= number of ways of distributing r
identical things among n persons when
each person can get zero or more things
= n + r – 1 Cr–1
Example 5:  Four students A, B, C and D
plucked some flowers if it is known
that each of them plucked at least
3 flower and all together they have
plucked 16 flowers then in how many
ways this can be done?
Solution:  Let us assume that the number of
flowers plucked by A, B, C and D is a, b,
c, and d respectively then from the given
condition we have to find the integral
solution of the equation a + b + c + d = 16,
where a, b, c, d ≥ 3
There are different methods to solve a
question, we will solve this question by four
different methods-
Method 1: (partitioning theory)
This question is similar to the question - In
how many ways 16 identical Chocolates can
be distributed among 4 persons if each person
gets at least 3 Chocolates.
We have solved these type of questions in
last chapter, 1st we will give 3 chocolates to
each of 4 persons then remaining chocolates is
16 – 12 = 4, now we have to distribute these 4
210  Theory of Counting
Let us assumethat the different things
be denoted by the letters a, b, c, …
Then consider the term
(1 + ax + a2x2 + . . . + apxp) (1 + bx + b2x2
+ . . . + bqxq) (1 + cx + c2x2 + . . . + csxs). . .
In this expansion the exponent of the
letters a, b, c is same as that in x. Now
consider the coefficient of xr in the
expansion it is same as the number of
ways of taking r of the letters a, b, c, . . .
. . . with the restriction that maximum
number of a’ s is p, maximum number of
b’ s is q, maximum number of c’ s is and
so on.
Since the coefficient of xr in the expansion
will not change if we take a = b = c = . . .
. . . = 1.
Hence the number of combinations/
selections of r things out of n things of
which p are alike and are of one kind, q
are alike and are of second, s are alike
and are of third kind and so on.
= co-efficient of xr in [( 1 + x + x2 + . . . +
xp) (1 + x + x2 + . . . + xq) ( 1 + x + x2 + . .
. + xs)]
(ii) Number of combinations/selections
of r things out of n things of which
p are alike and are of one kind, q
are alike and are of second kind and
remaining ( n – p – q ) things are all
different kind is given by
= co-efficient of xr in [( 1 + x + x2 + ……..
+ xp)( 1 + x + x2 : …………………. + xq )
{( 1+ x) (1 + x) ……….. to (n – p – q )
factors}
= co-efficient of xr in { (1 + x + x2 … xp)
( 1 + x + . . . + xq ) ( 1 + x )n – p – q}
(iii) Restricted Combination :-Number of
selections of r things out of n things of
which p are alike and are of one kind, q
are alike and are of second kind, r are
alike and are of third kind such that n =
p+q+r and each things is taken at least
once
= Co-efficientof xr in { ( x + x2 + x3 +
……… + xp) ( x + x2 + x3 + ……. + xp) ( x
+ x2 + x3 + ……….. + xr)}
= Co-efficientof xr in [ ( 1 + x + x2 +
……. + xp – 1 ) ( 1 + x + x2 + …… + xq -1 )
( 1 + x + x2 + ….. + xr – 1 )]
(iv) Number of terms in the expansion of
(a1 + a2 + a3 + …. + an)r
In any term let exponents of a1, a2… an
are x1, x2, … and xn then x1 + x2+… xn
=r
= number of ways of distributing r
identical things among n persons when
each person can get zero or more things
= n + r – 1 Cr–1
Example 5:  Four students A, B, C and D
plucked some flowers if it is known
that each of them plucked at least
3 flower and all together they have
plucked 16 flowers then in how many
ways this can be done?
Solution:  Let us assume that the number of
flowers plucked by A, B, C and D is a, b,
c, and d respectively then from the given
condition we have to find the integral
solution of the equation a + b + c + d = 16,
where a, b, c, d ≥ 3
There are different methods to solve a
question, we will solve this question by four
different methods-
Method 1: (partitioning theory)
This question is similar to the question - In
how many ways 16 identical Chocolates can
be distributed among 4 persons if each person
gets at least 3 Chocolates.
We have solved these type of questions in
last chapter, 1st we will give 3 chocolates to
each of 4 persons then remaining chocolates is
16 – 12 = 4, now we have to distribute these 4
 Number of Integral Solution  211
chocolates among 4 students and that can be Then p + q + r + s = 16 – 12 = 4
done in 4 + 4 – 1C4 – 1 = 7C3 ways. and p, q, r, s ≥ 0
Required number of solution is =7C3
Method 2: (Multinomial Theorem)
Required number = coefficient of x16 in ( x3 + Method 4: (Listing down method)
x4 + … + x7 )4 = coefficient of x16 in x12 ( 1 + x
+ … + x4)4 Here we have to make sets of four positive
= coefficient of x4 in (1 + x + … + x4)4 integers each greater than or equal to 3 whose
4 sum is 16 are
1 – x 5 
= coefficient of x4 in =   { 3, 3, 3, 7}, {3, 3, 4, 6}, { 3, 3, 5, 5}, {3, 4, 4, 5},
 1 – x  { 4, 4, 4, 4}

= coefficient of x4 in (1 – x 5 )4 (1 – x )−4 
 
= coefficient of x4 in
[( 1 – 4x5 + 6x10 – ……. ) ( 1 – x)–4 ]
= coefficient of x4 in ( 1 – x) –4[ leaving terms
containing power 5 of x greater than 4]
= 7C 4 = 7C 3
Method 3: (Non negative integral solution
method )
Given equation is a + b + c + d = 16,
where a, b, c, d ≥ 3
Let p = a – 3, q = b – 3, r = c – 3, s = d – 3
Now elements of 1st set i.e{ 3, 3, 3, 7} can be
arranged in 4!/3! = 4 ways
Elements of 2nd set i.e. {3, 3, 4, 6} can be
arranged in 4!/2! = 12 ways
Elements of 3rd set i.e. { 3, 3, 5, 5) can be
arranged in 4!/ 2! 2! = 6 ways
Elements of 4th set i.e. {3, 4, 4, 5} can be
arranged in 4!/2! = 12 ways
Elements of 5th set i.e. {4, 4, 4, 4} can be
arranged in 4!/4! = 1 way
Required number = 4 + 12 + 6 + 12 + 1 = 35
= 7C 3

Integral Solution from

Concept 3 Multinomial Theorems

(i) Number of non-negative integral (ii) Number of positive integral solution

Solution Equation of equation
a + 2b + 3c + 4d = n a + 2b + 3c + 4d = n
= Co- efficient of xn in = Co- efficient of xn – ( 1 + 2 + 3 + 4 )
[(1 – x )–1( 1 – x2) – 1( 1 – x3 ) – 1( 1 – x4 )–1] In [( 1 – x)– 1( 1 – x2 )– 1( 1 – x3 ) – 1
(1 – x4) –1]
212  Theory of Counting
(iii) Number of non- negative integral (iv) Number of positive integral solution
solution of equation of equation
x1 + 2x2 + 3x3 = … + nxn = m x1 + 2x2 + 3x3 + … + nxn = m
= coefficient of xm in Coefficient of xm in
[(1 + x + x2 + x3 + …) ( 1 + x2 + x4 + x6 + [( x + x2 + x3 + … ) ( x2 + x4 + x6 + … )
…) ( 1 + x3 + x6 + x9 + …) (1 + xn + x2n + (x3 + x6 + x9 …) … ( xn + x2n + x3n + …)]
x3n + ....)] = coefficient of xm – ( 1 + 2 + 3 + … + n ) in
= coefficient of xm in [ 1 + x + x2 + … ) ( 1 + x2 + x4 + …) ( 1 +
[( 1 – x) – 1( 1 – x2 ) – 1( 1 – x3 )–1 … x3 + x6 + …) … ( 1 + xn + x2n + …)]
( 1 – xn )–1] = coeff. of xm – n( n + 1)2 in [(1 – x )– 1
( a – x2 )– 1 ( 1 – x3)- 1 … ( 1 – xn) – 1]

Concept 4 Application of Multinomial Theorem

Permutation with  x x2 xp  x x2 xq  

 1
   + +    
+…+  1
   + +    
+…+  … 
Repetition  1! 2! p !   1! 2! q!  

The number of permutation of r things out
of n things of which p are of one kind, q are Example 6:  In how many ways 4 letters
second kind and so on can be selected from the letters of the
word EXAMINATION.
= r! .co-efficient of xr in
Solution:  In the given word EXAMINATION
 x x2 xp  x x2 xq   there are 11 letters and these are A,A; I,I;
 1
   + +    
+…+  1
   
+ +  
+…+   …  N,N; E,X, M, T, O.
 1! 2! p !   1! 2! q!  
 Method 1: (Listing down cases)
Proof:- Let the different things be denoted by Case (i) When all 4 letters re distinct then 4
a, b, c, ……… consider the product letters can be selected from 8 different letters
i.e, A, I, N, E, X, M, T, & O, this can be done
 2x 2 
 ax a a p x p   bx b2 x 2 bq x q 
1   + + +  ..  +  1 +  +  +…+
     8!
 1! 2! p !   1! 2! q !  in 8C4 ways = = 70
 ( )(4!)
4
...(1)
Case (ii) When 2 letters are identical and
Required number of arrangements = sum of remaining two are distinct, Two identical
all possible terms of the form letters can be selected in 3 ways (either A, or I or
r! /p! /q! apbq …. , where p + q … = r N) and 2 distinct letters can be selected from
= r! .co-efficient of xr in remaining 7 letters in 7C2 = 21 ways so total
number of ways in this case is 3 × 21 = 63.
 Number of Integral Solution  213
Case (ii) When 2 letters are identical and So total number of words formed
remaining two are also identical this can be = 1680 + 756 +18 = 2454.
done in 3 ways. Method 2: (Multinomial Theorem)
So total number of ways = 70 + 63 + 3 =136 Required number of permutation or required
Method 2: (Multinomial Theorem) number of words is given by
3
Required number of combinations = coefficient  x x2   x
5
of x4 in ( 1 + x + x2)3 ( 1 + x)5 coefficient of x4 in 4!   1
   + +   1
   
+ 
 1! 2!   1! 
3
 3
= Coefficient of x4 in 1 − x  (1 + x )5  x2 
3

 1 − x 
= coefficient of x4 in 4!  1
   +  x  + 
2
(1  +  x )5

= Coefficient of x4 in (1 − x 3 )3 (1 − x )−3 (1 + x )5 = coefficient of x4 in
Coefficient of x4 in  3 x
6
3 2  5
−3 5 4! (1    +  x ) + + (1 +  x ) x 2 +  ¾ x 4 (1 + x ) (1 +  x )
(1 − x 9 + 3x 6 − 3x 3 ) (1 − x ) (1 + x ) = 136  8 2 

Example 7:  In how many ways 4 letter
word can be formed from the letters of
the word EXAMINATION.
Solution:  In the given word EXAMINATION
there are 11 letters and these are A,A; I,I;
N,N; E,X, M, T, O.
Method 1:- (Listing down cases)
Case (i) When all 4 letters re distinct then 4
letters can be selected from 8 different letters
i.e, A, I, N, E, X, M, T, & O, this can be done
8!
in8C4 ways = = 70, so number of words
(4 )(4!)
formed in this case is 70(4!) = 70 × 24 = 1680
Case (ii) when 2 letters are identical and
remaining two are distinct, Two identical
letters can be selected in 3 ways (either A, or
I or N) and 2 distinct letters can be selected
from remaining 7 letters in 7C2 = 21 ways so
total number of ways in this case is 3 × 21 =
63.so number of words formed in this case is
63(4!/2!) = 63 × 12 = 756
Case (iii) when 2 letters are identical and
remaining two are also identical this can be
done in 3 ways, so number of words formed in
 4! 
this case is 3  = 3 × 6 = 18
 2!2! 
= 4! {8C4 + 0 + 3/2. 7C2 + 3/4}
= 1680 + 765 + 18 = 2454
Example 8:  Consider a word ‘PARALLEL’
in how many ways 4 letters of this word
can be selected?
Solution:  The given word ‘PARALLEL’ has
L-3, A-2, P-1, R-1, E-1 and total number of
letters is 8.
Method 1: (Listing down method)
Case (i) When 3 letters are identical and
remaining one different, Number of ways is 4.
Case (ii) When 2 letters are identical and
remaining 2 are identical, means 2 Ls and 2
As are selected so number of ways is 1
Case (iii) When 2 letters are identical and
remaining 2 are different, Two identical can
be selected in 2 ways (either L or A) and
remaining 2 are selected from remaining 4
letters so total number of ways is 2(4C2) = 12
ways.
Case (iv) When all the 4 letters are different
then 4 letters can be selected from 5 letters in
5C ways or in 5 ways.
4
Total number of ways is 4 + 1 + 12 + 5 = 22
214  Theory of Counting
Method 2: (Multinomial Theorem) As are selected so number of ways is 1, And
The given word ‘PARALLEL’ has L-3, A-2,  4! 
number of words formed is 1  =6
P-1, R-1, E-1 and total number of letters is 8.  2!2! 
Required number: Case (iii) When 2 letters are identical and
remaining 2 are different, Two identical can
= Coefficient of x4 in
be selected in 2 ways (either L or A) and

(
 )(
 1 +  x  +  x 2 +  x 3 1
)
   +  x  +  x 2 (1
3
   +  x ) 

remaining 2 are selected from remaining 4
letters so total number of ways is 2(4C2) = 12
 4! 
= Coefficient of x4 in (1 – x) – 5(1 – x2)3 ( 1 – x3) ways, And number of words formed is 12  
 2! 
(1 – x4) =12 × 12 = 144
= Coefficient of x4 in (1 – x) – 5(1 – x3 – x4 + x7) Case (iv) When all the 4 letters are different
(1 – 3x2 + 3x4 + x6) then 4 letters can be selected from 5 letters in
5C ways or in 5 ways, And number of words
= Coefficient of x4 in (1 – x)–5(1 – x3 + 2x4 – 3x2) 4
formed is 5(4!) =120
= Coefficient of x4 in ( 1 – x)–5 – Coefficient of
x in ( 1 – x) – 5 + 2 Coefficient of x6 in (1 – x) – 5 So total number of words formed is 16 + 6 +
– 3 Coefficient of x2 in ( 1 – x) – 5 144 + 120 = 286

= (8C4) –( 5) + (2) – 3(6C2) = 22 Method 2:- (Multinomial Theorem)

Example 9:  Consider a word ‘PARALLEL’ The given word ‘PARALLEL’ has L-3, A-2,
in how many ways 4 letter word can P-1, R-1, E-1 and total number of letters is 8.
be formed from the letters of the word Since the number of permutation of r things
PARALLEL out of n things of which p are of one kind, q
Solution:  The given word ‘PARALLEL’ has are second kind and so on
L-3, A-2, P-1, R-1, E-1 and total number of = r! .co-efficient of xr in
letters is 8.  x x2 xp  x x2 xq  
 1
   + +    
+…+  1
   + +    
+…+  … 
Method 1:- (Listing down method)  1! 2! p !   1! 2! q!  

Case (i) When 3 letters are identical and Required number of words is given by-
remaining one different, Number of ways is 4.
= Coefficient of x4 in
 4! 
And number of words formed is 4   = 16 3
 3!   x x2   x x2 x3   x
4!  1
   + ! +   1
   + + ! +   1   + 
Case (ii) When 2 letters are identical and  1 2!   1! 2 3!   1! 
remaining 2 are identical, means 2 Ls and 2
= 24 ( 2 + 6 + 7/2 + 5/12) = 2863
 Number of Integral Solution  215

Concept 5 De- arrangement

What is De-arrangement? To understand

 1 1 1 
this let us assume a situation where three = (4!)1 − 1 + − +
friends A, B and C stay in a hostel, on a  2 6 24 

particular night none of them slept in their 12 − 4 + 1 
own room in how many ways this is possible. = (4!)  = 12 − 4 + 1 = 9
 24 
To understand this situation we will list down
all the possibilities- 1 1 1 1 1 1
D(5) = (5!) – + – + − 
Let us assume that room of A is ‘a’, that of B  0! 1! 2! 3! 4! 5! 
is ‘b’ and that of C is ‘c’ then
 1 1 1 1 
Own Person Case (i) Case (ii) = (5!)1 − 1 + − + −
 2 6 24 120 
Rooms
a A b c  60 − 20 + 5 − 1 
= (120 )  = 44
b B c a  120 

c C a b Partial De-arrangement - Consider n articles
In this case we have seen that 3 articles can be only r articles are de arranged remaining
de arranged in two ways. Now lets generalize (n – r) articles are at their own place. Then
it- this can be done in (nCr)[D(r)]
If  n distinct items are arranged in a row, then
the number of ways they can be rearranged such Example 10:  Suvrojyoti writes letters to
that none of them occupies its original position is his 5 students but while putting letters in
called De-arrangement, and it can be calculated the addressed envelopes he was not able
with the help of formula- to put a single letter in its correct envelope
in how many ways he can do so?
1 1 1 1
D(n) = n !  – + – +     +
(−1)1  Solution:  As per the given condition we need
 0! 1! 2! 3! n !  to find the value of D(5)
Note: De-arrangement of 1 object is not 1 1 1 1 1 1
possible. D(5) = (5!) – + – + − 
 0! 1! 2! 3! 4! 5! 
D(1) = 0
 1 1 1 1 
D(2) = 1 = (5!)1 − 1 + − + −
 2 6 24 120 
D(3) = 2
 60 − 20 + 5 − 1 
1 1 1 1 1 = (120 )  = 44
D(4) = (4!) – + – +   120 
 0! 1! 2! 3! 4! 
216  Theory of Counting

1
Concept Applicator (CA)
Ideal Time Apply your concepts with easy and
10 Min. conceptual questions

1. Find the number of non-negative integral 6. Find the number of positive integral
solution of the equation x + y = 20. solution of the equation
(a) 21 (b) 20 w + x + y + z = 20.
(a) 22C (b) 20C3
(c) 19 (d) None of these 3
(c) 23C
3 (d) None of these
2. Find the number of positive integral
7. Find the number of non negative integral
solution of the equation x + y = 20. solution of the equation a+b+c+d+e = 15
(a) 21 (b) 20 (a) 19C (b) 19C16
5
(c) 14C
(c) 19 (d) None of these 4 (d) None of these
3. Find the number of non-negative integral 8. Find the number of positive integral
solution of the equation x + y + z = 20. solution of the equation
22C a + b + c + d + e = 15
(a) 3 (b) 22C2
(a) 14C (b) 14C11
(c) 23C 10
2 (d) None of these 14C
(c) 6 (d) None of these
4. Find the number of positive integral
9. Find the number of non negative integral
solution of the equation x + y + z = 20. solution of the equation
(a) 22C (b) 22C2
3 a + b + c +…+ z = 5
(c) 23C
2 (d) None of these (a) 30C (b) 30C5
9
(c) 30C
5. Find the number of non-negative integral 26 (d) None of these
solution of the equation 10 Find the number of positive integral
solution of the equation
w + x + y + z = 20.
a + b + c +…+ z = 5
(a) 22C (b) 21C3
3 30C
23C
(a) 9 (b) 30C5
(c) 3 (d) None of these 30C
(c) 26 (d) None of these

Response Grid
1. a b c d 2. a b c d 3. a b c d 4. a b c d 5. a b c d
6. a b c d 7. a b c d 8. a b c d 9. a b c d 10. a b c d
218  Theory of Counting
3
Concept Cracker (CC)
Ideal Time
30 Min.
1. 100 students are standing in a straight
line. In how many ways, two students can
be selected such that there are at most
10 students between the two selected
students.
(a) 90C2 (b) 100C2 – 90C2
(c) 100C2 – 88C2 (d) None of these
2. Find the number of positive integral
solution for a + b + c < 10.
(a) 74 (b) 77 b, c, d ≥ 3
(c) 79 (d) None of these
3. Metro train route in Kolkata is from
Garia to Dumdum, if there are 20 stations
between Garia to Dumdum, In how many
ways can a train be made to stop at 5 of
these 20 intermediate stations if no two
of which are consecutive?
(a) 16C4 (b) 16C5
17
(c) C5 (d) None of these
4. What is the number of ways of selecting
15 flowers out of unlimited number of
red, green, blue, yellow and white colored
flowers?
(a) 16C4 (b) 19C5
(c) 19C4 (d) None of these
5. Find the number of integral solution of
the equation a + b + c + d = 0 if a≥ –10,
b≥ – 10, c ≥ –10, and d ≥ –10.
(a) 39C3 (b) 43C3 x + y + z = 10 and x ≤ 6, y ≤ 7 and z ≤ 8
49
(c) C3 (d) None of these
6. At an ice cream parlor, ice creams of 10
different brands are available. Trina
went to that parlor in order to buy only
5 ice cream, in how many different ways
she can place an order of 5 ice cream?
Boost up your confidence with good
questions
(a) 105 (b) 510
10
(c) C5 (d) None of these
7. What is the number of outcomes when 20
identical cubical dice (numbered from 1
to 6) are thrown?
(a) 620 (b) 206
25
(c) C5 (d) None of these
8. Find the number of integral solutions of
the equation ‘a + b + c + d = 16’, where a,
(a) 16C3 (b) 16C14
7
(c) C3 (d) None of these
9. Hasan, a book lover, went to his favorite
book store from where he purchased
30 books of 8 different languages such
that he has at least 2 books from each
language, in how many ways he can do
so if the book store has unlimited supply
of books?
(a) 21C7 (b) 29C7
(c) 27C7 (d) None of these
10. What is the number of non – negative
integral solutions of the equation
  a + b + c + 4d = 20?
(a) 21C20 (b) 22C20
18
(c) C16 (d) None of these
11. What is the number of non – negative
integral solutions of the equation
OR
In how many ways a bill of ` 10 can be
paid by three students Hasan, Susmit
and Madhur, if they have ` 6, 7 and 8
respectively.
218  Theory of Counting
3
Concept Cracker (CC)
Ideal Time
30 Min.
1. 100 students are standing in a straight
line. In how many ways, two students can
be selected such that there are at most
10 students between the two selected
students.
(a) 90C (b) 100C2 – 90C2
2 (a) 620 (b) 206
(c) 100C2 – 88C2 (d) None of these
2. Find the number of positive integral
solution for a + b + c < 10.
(a) 74 (b) 77 b, c, d ≥ 3
(c) 79 (d) None of these
3. Metro train route in Kolkata is from
Garia to Dumdum, if there are 20 stations
between Garia to Dumdum, In how many
ways can a train be made to stop at 5 of
these 20 intermediate stations if no two
of which are consecutive?
(a) 16C4 (b) 16C5
17
(c) C5 (d) None of these
4. What is the number of ways of selecting
15 flowers out of unlimited number of
red, green, blue, yellow and white colored
flowers?
(a) 16C4 (b) 19C5
(c) 19C4 (d) None of these
5. Find the number of integral solution of
the equation a + b + c + d = 0 if a≥ -10,
b≥ – 10, c≥ –10, and d ≥ –10.
(a) 39C3 (b) 43C3 x + y + z = 10 and x ≤ 6, y ≤ 7 and z ≤8
49
(c) C3 (d) None of these
6. At an ice cream parlor, ice creams of 10
different brands are available. Trina
went to that parlor in order to buy only
5 ice cream, in how many different ways
she can place an order of 5 ice cream?
Boost up your confidence with good
questions
(a) 105 (b) 510
10
(c) C5 (d) None of these
7. What is the number of outcomes when 20
identical cubical dice (numbered from 1
to 6) are thrown?
25
(c) C5 (d) None of these
8. Find the number of integral solutions of
the equation ‘a + b + c + d = 16’, where a,
(a) 16C3 (b) 16C14
7
(c) C3 (d) None of these
9. Hasan, a book lover, went to his favorite
book store from where he purchased
30 books of 8 different languages such
that he has at least 2 books from each
language, in how many ways he can do
so if the book store has unlimited supply
of books?
(a) 21C7 (b) 29C7
(c) 27C7 (d) None of these
10. What is the number of non – negative
integral solutions of the equation
  a + b + c + 4d = 20?
(a) 21C20 (b) 22C20
18
(c) C16 (d) None of these
11. What is the number of non – negative
integral solutions of the equation
OR
In how many ways a bill of ` 10 can be
paid by three students Hasan, Susmit
and Madhur, if they have ` 6, 7 and 8
respectively.

OR
Anshuman went to a park where he saw
3 different varieties of flowers namely
Rose, Calendula, and Lavender. He
plucked total 10 flowers, if it is given that
in the number of flowers are 6 (Rose), 7
(Calendula) and 8 (Lavender), in how
many ways he can do so?
(a) 47 (b) 49 9?
(c) 43 (d) None of these
12. How many positive integers less than
1000000 have the sum of the digits 18 ?
(a) 7722 (b) 33649 Madhur, Susmit, Anshuman, Abhishek
(c) 25927 (d) None of these
Direction for question number 13
and 14:- Consider the letters of the word
‘INDEPENDENT’ if P is the total number of
ways of selecting five letters from the letters of
Number of Integral Solution  219
the word ‘INDEPENDENT’ and Q is the total
number of ways of forming five letter word
from the letters of the word ‘ INDEPENDENT’
then
13. What is remainder when P divided by 9?
(a) 8 (b) 3
(c) 7 (d) None of these
14. What is remainder when Q divided by
(a) 8 (b) 3
(c) 7 (d) None of these
15. In how many ways six friends Hasan,
and Ricky can pay a bill of less than $18
if none of them have more than $6?
(a) 17C11 – 6. 11C5 (b) 17C11– 11C5
17 11
(c) C11 + 6. C5 (d) None of these

Response Grid
1. a b c d 2. a b c d 3. a b c d 4. a b c d 5. a b c d
6. a b c d 7. a b c d 8. a b c d 9. a b c d 10. a b c d
11. a b c d 12. a b c d 13. a b c d 14. a b c d 15. a b c d
220  Theory of Counting

Solutions
Concept Applicator (CA)

1. (a) 2. (c) 3. (b) 4. (d) 5. (c) 6. (d)

7. (d) 8. (a) 9. (b) 10. (d)

1. (a) Since we have to find the number of
non negative integral solution hence
required number is
20+2–1C 21C = 21
2–1 = 1
2. (c) Since we have to find the number of
positive integral solution hence required
number is 20–1C2–1 = 19C1= 19
3. (b) Since we have to find the number of
non negative integral solution hence
required number is 20+3–1C3–1 = 22C2.
4. (d) Since we have to find the number
of positive integral solution hence
required number is
20 – 1C 19C .
3–1 = 2
5. (c) Since we have to find the number of
non negative integral solution hence
required number is
20 + 4 – 1C
4–1 =
23C .
3
6. (d) Since we have to find the number
of positive integral solution hence
required number is 20 – 1C4 – 1 = 19C3.
7. (d) The question is similar to the
condition that we have to distribute
15 chocolates to 5 students and that
can be done in
  15+5–1C5-1 = 19C4 = 19C15
8. (a) The question is similar to the
condition that we have to distribute
15 chocolates to 5 students such that
each student gets at least 1 chocolate
and that can be done in
15–1C =14C4 = 14C10 ways
5–1
9. (b) The question is similar to the
condition that we have to distribute
5 chocolates to 26 students and that
can be done in 5+26–1C26–1 =30C25 = 30C5
10. (d) The question is similar to the
condition that we have to distribute
5 chocolates to 26 students such
that each of them receive at least 1
chocolate but 5 < 26 hence number
of ways is 0.

Concept Builder (CB)

1. (b) 2. (a) 3. (c) 4. (c) 5. (d) 6. (a)
7. (b) 8. (d) 9. (c) 10. (b)

1.
(b) Since as per the give condition
x > 1, so assume that x = 2 + a here
a is non negative integer,
y > 1 so y = 2 + b and similarly z > 1
so z = 2+c or (2 + a) + (2+b) + (2+c) =
20 or a+b+c = 14 and we need to find
the number of non negative integral
solution of the equation a+b+c = 14
which is 14+3–1C3–1 = 16C2

2. (a) Since as per the give condition
x > 1, so assume that x = 2 + a here
a is non negative integer,
y > 2 so y = 3 + b and similarly z > 3
so z = 4+c or (2 + a) + (3+b) + (4+c) =
20 or a+b+c = 11 and we need to find
the number of non negative integral
solution of the equation a+b+c= 11
which is 11+3–1C3–1 = 13C2
3. (c) Just assume that you have 100
chocolates and you have to distribute
it among 5 students such that they
should get more than 5, 10, 15, 20
and 25 chocolates respectively.
1st give them 6, 11, 16, 21 and 26
chocolates then remaining chocolates
is 100 – (6+11+16+21+26) = 20 which
can be distributed among 5 students
in 20+5–1C5–1 = 24C4
4. (c) As per the given condition x1 + x2
+…+x10 = 50 such that each variable
is more than or equal to 2.
Assume x1 = y1 +2 such that y1≥ 0
similarly x2 = y2 +2 such that y2≥ 0
hence we will have a new equation
that is y1 + y2 + …. + y10 = 50 – 20
= 30, so required number of ways is
30+10–1C
10–1 =
39C
9
5. (d) Since as per the give condition
x > –1, so x is non negative integer,
this question is same as question
number 3 of Concept Applicator (CA)
Since we have to find the number of
non negative integral solution hence
required number is 20+3–1C3–1 = 22C2.
6. (a) Since as per the give condition
x > – 1, so x is non negative integer,
y > – 2 so y = –1 + b and similarly
z > 3 so z = – 2 + c
or (x) + (–1 + b) + (– 2 + c) = 23
Number of Integral Solution  221
or  x + b + c = 23
and we need to find the number of
non negative integral solution of
the equation x + b + c = 23 which is
23 + 3 –1C 25C = 25C
3–1 = 2 23
7. (b) Let the number of Roses, , Calendula,
Jasmine and Lavender that Hasan
plucked is a, b, c and d respectively
then from the given information
a + b + c + d = 20 and a ≥0, b ≥ 0,
c ≥ 0, d ≥ 0.
Hence required number of ways is
20+4–1C
4–1=
23C
3
8. (d) Let the number of Roses, , Calendula,
Jasmine and Lavender that Hasan
plucked is a, b, c and d respectively
then from the given information a +
b + c + d = 20 and a ≥1, b ≥ 1, c ≥ 1, d ≥ 1.
Hence required number of ways is
20–1C 19C
4–1 = 3
9. (c) From the given equations we can
deduce b + c + e = 10 and a + d = 10
Number of non negative integral
solutions of the equation
b + c + e =10 is 10+3 – 1C3 – 1 = 12C2 = 66
Number of non negative integral
solutions of the equation a + d=10 is
10+2–1C 11C = 11
2–1 = 1
Hence required number of solution
is 66 × 11 = 726
10. (b) Maths faculty can distribute 10
identical chocolates among 3 students
in 10+3–1C3–1 = 12C2 ways, similarly
reasoning and English faculty can
distribute in 22C2 and 32C2 ways.
Total number of ways is (12C2)(22C2)
(32C2)
222  Theory of Counting

Concept Cracker (CC)

1. (b) 2. (d) 3. (b) 4. (c) 5. (b) 6. (d)

7. (c) 8. (c) 9. (a) 10. (d) 11. (a) 12. (c)
13. (d) 14. (a) 15. (a)

1. (b) Let 100 students are standing in a
straight line,
Let after ‘a’ students 1st student is
selected, and there are ‘b’ students
between the two students and after 2nd
student there are ‘c’ students then as
per the given condition a + b + c = 98
As per the given condition maximum
value of b is 10.
Now consider the reverse condition
that is b > 10 and a + b + c = 98 then
number of integral solution is
98 – 10 + 3 – 1C 90C .
3–1 = 2 out of which 5 stations has stoppage
Without restriction we can select
2 students out of 100 students in
100C .
2 15 and a ≥ 0, b > 0, c > 0, d > 0, e > 0,
So required number of ways is
100C – 90C
2 2
2. (d) Since a, b and c are positive integers
hence we have following cases-
a + b + c = 3 then number of positive
integral solution is 3 – 1C3 – 1 = 2C2 = 1.
a + b + c = 4 then number of positive
integral solution is 4 – 1C3 – 1 = 3C2 = 3.
a + b + c = 5 then number of positive
integral solution is 5 – 1C3 – 1 = 4C2 =
6 and so on
a + b + c = 9 then number of positive
integral solution is 9–1C3–1 = 8C2 =
28
Hence required summation is 1 + 3+
6 +10 + 15 +21+ 28 = 84
3. (b) Let 1st stoppage is after ‘a’ stations
then a ≥ 0,
There are ‘b’ stations between 1st
stoppage and 2nd stoppage then b > 0
There are ‘c’ stations between 2nd
stoppage and 3rd stoppage then c > 0
There are ‘d’ stations between 3rd
stoppage and 4th stoppage then d > 0
There are ‘e’ stations between 4th
stoppage and 5th stoppage then e > 0
And there are ‘f’ stations between 5th
stoppage and the final destination
Dumdum then f ≥ 0
Since total number of stations is 20
hence-
The equation is a + b + c + d + e + f =
and f ≥ 0.
So required number of positive
integral solution is 16C5
Alternately :
Total number of stations is 20 out of
which train stopped at 5 stations and
doesn’t stop at 15 stations, consider
these 15 stations a1, a2, and a15 this
will create 16 places, so we just have
to select 5 out of 16 and that can be
done in 16C5 ways.
4. (c) From the given condition a + b + c
+ d + e = 15, here, a, b, c, d and e
is the number of red, green, blue,
yellow and white colored flowers
respectively.
The condition is similar to number
of non negative integral solution of
 Number of Integral Solution  223
the equation a+b+c+d+e = 15, which
is 15 + 5 – 1C5 – 1 = 19C4
5. (b) Given equation is a + b + c + d = 0
and a ≥ –10, b ≥ –10, c ≥ –10, and d ≥ –10.
Let us assume that a = –10 + a1,
b = –10 + b1, c = –10 + c1 and d = –10 + d1
Then we will have to find the number
of non negative integral roots of the
equation a1 + b1+ c1+ d1 = 40,
So required number of integral solution
is given by 40 + 4 – 1C4 – 1 = 43C3.
6. (d) Let the number of ice creams of 1st
brand she ordered is x1, that of 2nd
brand is x2 and so on for 10th brand
x10, then from the given condition
x1+ x2 + … + x10 = 5 and xi ≥ 0,
Required number of solution is
10 + 5 – 1C 14C .
5–1 = 4
7. (c) Let the number of times that ‘1’
appeared is x1, that of 2 is x2 and so
on for 6 is x6, then from the given
condition x1+ x2+…+ x6 = 20 and
xi ≥ 0
Required number of solution is
20 + 6 – 1C 25C .
6–1 = 5 Then p+q+r+s = 16 – 12 =4 and p, q,
8. (c) We will solve this question by four
different methods-
Method 1: (partitioning theory)
This question is similar to the
question - In how many ways
16 identical Chocolates can be
distributed among 4 persons if each
person gets at least 3 Chocolates.
We have solved these type of questions
in last chapter, 1st we will give 3
chocolates to each of 4 persons then
remaining chocolates is 16 – 12 = 4,
now we have to distribute these 4
chocolates among 4 students and
that can be done in 4 + 4 – 1C4 – 1 =
7C ways.
3
Method 2: (Multinomial
Theorem)
Required number = coefficient of x16
in ( x3 + x4 + … + x7 )4 = coefficient of
x16 in x12 ( 1 + x + … + x4)4
= coefficient of x4 in ( 1 + x + … + x4)4
4
1 – x 5 
= coefficient of x4 in =  
= coefficient of x4 in  1 – x 
(1 – x 5 )4 (1
   – x )−4 
 
= coefficient of x4 in
[( 1 – 4x5 + 6x10 – ...) ( 1 – x)–4 ]
= coefficient of x4 in ( 1 – x)–4
= 7C 4 = 7C 3
[leaving terms containing power 5
of x greater than 4]
Method 3: (Non negative integral
solution method )
Given equation is
a + b + c + d = 16, where a, b, c, d ≥ 3
Let p = a – 3, q = b – 3, r = c – 3,
s=d–3
r, s ≥ 0
Required number of solution is
=7C3
Method 4: (Listing down method)
Here we have to make sets of four
positive integers each greater than
or equal to 3 whose sum is 16 are
{ 3, 3, 3, 7}, {3, 3, 4, 6}, { 3, 3, 5, 5},
{3, 4, 4, 5}, { 4, 4, 4, 4}
Now elements of 1st seti.e{ 3, 3, 3, 7}
can be arranged in 4!/3! = 4 ways
Elements of 2nd set i.e. {3, 3, 4, 6}
can be arranged in 4!/2! = 12 ways
Elements of 3rd set i.e. {3, 3, 5, 5} can
be arranged in 4!/ 2! 2! = 6 ways
Elements of 4th set i.e. {3, 4, 4, 5} can
be arranged in 4!/2! = 12 ways
224  Theory of Counting
Elements of 5th set i.e {4, 4, 4, 4} can
be arranged in 4!/4! = 1 way
Required number = 4 + 12 + 6 + 12 + 1
= 35 = 7C3
9. (a) Method 1:
Let the number of books of first,
second, … , eighth languages that
Hasan has bought is x1, x2, … , x8
respectively, then
x1 + x2 + … + x8 = 30, where x1, x2, …,
x8 ≥ 2
Let yi = xi – 2 such that yi ≥ 0
Then
y1 + y2 + … + y8 = ( x1 + x2 + … + x8) – 16
Or, y1 + y2 + … + y8 = 14,
where y1, y2, …, y8 ≥ 0
Required number of ways
  = 8 + 14 – 1C14 = 21C14 = 21C7
Method 2: (by Multinomial
Theorem)
Required number of ways is
= coefficient of x30 in (x2 + x3 +...+ x16)8
= coefficient of x30 in x16 (1 + x +...+
x14)8
= coefficient of x14 in (1 + x +... + x14)8
8
 15 
= coefficient of x14 in 1 – x 
 1 – x 
= coefficient of x14 in ( 1 – x)– 8
= 21C14 = 21C7.
10. (d) Method 1: (Multinomial Theorem)
Required number of solution is
= coefficient of x20 in ( 1 – x) – 1
( 1 – x) – 1 ( 1 – x) – 1 ( 1 – x4 ) – 1
= coefficient of x20 in
[( 1 + x) – 3 ( 1 – x4 ) – 1 ]
= coefficient of x20 in (1 + 3C1x +
4C x2 + 5C x3 + … + 22C x20 + …)
2 3 20
(1 + x4 + x8 + x12 + x16 + x20)
= 1 + 6C4 + 10C8 + 14C12 + 18C16 + 22C20
=1 + 15 + 45 + 91 + 153 + 231 = 536.
Method 2: (Listing down method)
Here maximum value of d is 5 hence
we have 6 different cases-
Case I: When d = 0, In this case
a + b + c = 20.
Number of non-negative integral
solutions
= n + r – 1Cr = 3 + 20 – 1C20 = 22C20
Case II: When d = 1, number of non-
negative integral solutions
= 3 + 16 – 1C16 = 18C16
Case III: When d = 2, number of non-
negative integral solutions = 14C12
Case IV. When d = 3, number of non-
negative integral solutions = 10C8
CaseV. When d = 4, number of non-
negative integral solutions = 6C4
Case VI. When d = 5, number of
non-negative integral solutions = 2C0
Required number = 22C20 + 18C16 +
14C + 10C + 8C + 2C .
12 8 4 0
11. (a) In this question lower as well as
upper limits of variables are given
hence we have to use multinomial
theorem.
The required number of ways
= coefficient of x10 in (1 + x + x2 + ... + x6)
(1 + x + x2 + ... x7) (1 + x + x2 + ... + x8)
= coefficient of x10 in
1 – x 7  1 – x 8  1 – x 9 
  x    x   
 1 − x   1 − x   1 – x 
= coefficient of x10 in (1 – x7) (1 – x8)
(1 – x9) (1 – x)–3
= coefficient of x10 in (1 – x7 – x8 – x9)
(1 + 3C1x + 4C2x2 + 5C3x3 + ... 12C10x10)
= 12C2 – 5C3 – 4C2 – 3C1
= 66 – 10 – 6 – 3 = 47.
(Leaving the powers greater than 10)

12. (c) Since the number is between 1 and
1000000 so number must be in the
form of a1, a2, a3, a4, a5, a6
here 0 ≤ ai ≤ 9, i = 1, 2, 3, …, 6
As per the question sum of the digits
= 18 or a1 + a2 + a3 + a4 + a5 + a6 = 18,
0 ≤ ai ≤ 9, i = 1, 2, 3, …,6
Required number = coefficient of x18 in
( 1 + x + x2 + ……. + x9)6
6
1 – x10 
= coefficient of x18 in   more letter from remaining 4 letters
 1 – x 
= coefficient of x18 in
(1 – x10 )6 (1
   – x )−  6 
 
= coefficient of x18 in
[(1 – 6C1 x10) (1 – x)–6]
[Ignoring terms having powers of x
greater than 18]
= [coefficient of x18 in (1 – x)–6 ] –  
[6C1 . coefficient of x8 in (1 – x)–6]
= 6 + 18 – 1C18 – 6.6 + 8 – 1 C8
= 23C5 – 6.13C5 = 33649 – 7722
= 25927.
13. (d) Total number of letters = 11
(E–3, N–3, D–2, , I–1, P–1 and T–1)
Method 1: (Listing down with
different cases)
Case (i) When all the 5 letters are
different then number of ways to
select 5 letters out of 6 is 6C5 = 6
Case (ii) When the two letters are
identical and remaining three are
different then we will have following
sub cases-
(i) Two E’s and three out of I, N,
P, D, T then number of ways is
1 × 5C3 = 10.
(ii) Two N’s and three out of I, E,
P, D, T, then number of ways is
1 × 5C3 = 10.
Number of Integral Solution  225
(iii) Two D’s and three out of I, E,
P, N, T, then number of ways is
1 × 5C3 = 10.
So total number of ways in this case
is 10 + 10 + 10 = 30.
Case (iii) When out of 5 selected
letters two letters are identical and
are of one type, two are identical
and are of second type and rest one
is different that means 2 out of E, N
and D is selected (in 3 ways) and 1
are selected hence required number
of ways is 3 × 4 = 12.
Case (iv) When three letters are
identical and remaining two are
different, that means 2 out of E,
and N is selected (in 2 ways) and 2
more letter from remaining 5 letters
are selected (5C2 = 10 ways) hence
required number of ways is
  = 2 × 10 = 20.
Case (v) When three letters are
identical and remaining two are
identical. For identical 3 letters we
can make selection in 2 ways (Either
E or N) and for remaining two
identical in 2 ways so total number
of ways in this case is 2x2 = 4 ways.
Required number = 6 + 30 + 12 + 20
+ 4 = 72.
So P = 72 and required remainder is 0
Method 2: (Multinomial Theorem)
Total number of letters = 11(E – 3, N
– 3, D – 2, , I – 1, P – 1 and T – 1).
Required number of selections of 5
letters = coefficient of x5 in [(1 + x +
x2 + x3 )2 (1 + x + x2)(1 + x)3]
= coefficient of x5 in [( 1 + x2 + x4 +
x6 + 2x + 2x2 + 2x3 + 2x3 + 2x4 + 2x5)
(1 + x + x2 )(1 + x)3].
= coefficient of x5 in [(1 + 2x + 3x2 +
4x3 + 3x4 + 2x5) {(1 + x + x2) (1 + 3x
+ 3x2 + x3)}].
226  Theory of Counting
[Ignoring terms containing powers
of x greater than 5]
= coefficient of x5 in [( 1 + 2x + 3x2
+ 4x3 + 3x4 + 2x5){( 1 + x + x2) +
(3x + 3x2 + 3x3) +( 3x2 + 3x3 +3x4 ) +
(x3 + x4 + x5)}]
= coefficient of x5 in [( 1 + 2x + 3x2 +
4x3 + 3x4 + 2x5)( 1 + 4x + 7x2 + 7x3 +
4x4 + x5)]
= 1 + 8 + 21 + 28 + 12 + 2 = 72
So P = 72 and required remainder is 0
14. (a) Total number of letters = 11
(E–3, N–3, D – 2, , I – 1, P–1 and T – 1)
Method 1: (Listing down with
different cases)
Case (i) When all the 5 letters are
different then number of ways to
select 5 letters out of 6 is 6C5 = 6 and
number of words formed is 6(5!) = 720.
Case (ii) When the two letters are
identical and remaining three are
different then we will have following
sub cases-
(i) Two E’s and three out of I, N,
P, D, T then number of ways is
1 × 5C3 = 10
(ii) Two N’s and three out of I, E,
P, D, T, then number of ways is
1 × 5C3 = 10
(iii) Two D’s and three out of I, E,
P, N, T, then number of ways is
1 × 5C3 = 10
So total number of ways in this case
is 10 + 10 + 10 = 30, and number of
 5! 
words formed is (30)   = 30 × 60
= 1800.  2! 
Case (iii) When out of 5 selected
letters two letters are identical and
are of one type, two are identical
and are of second type and rest
one is different that means 2 out of
E, N and D is selected (in 3 ways)
and 1 more letter from remaining
4 letters are selected hence
required number of ways is 3x4 =
12, and number of words formed is
5!
(12) 2!2!  =12 × 30 = 360
 
Case (iv) When three letters are
identical and remaining two are
different, that means 2 out of E,
and N is selected (in 2 ways) and 2
more letter from remaining 5 letters
are selected (5C2 = 10 ways) hence
required number of ways is = 2 × 10
= 20, and number of words formed is
5!
(20) 3!  = 20 × 20 = 400
 
Case (v) When three letters are
identical and remaining two are
identical. For identical 3 letters we
can make selection in 2 ways (Either
E or N) and for remaining two
identical in 2 ways so total number
of ways in this case is 2 × 2 = 4 ways
and number of words formed is
5!
(4 ) 3!2! 
= 4 × 10 40
 
Required number
= 720 + 1800 + 360 + 400 + 40
= 3320
So Q = 3320 and required remainder
is 8
Method 2: (Multinomial
Theorem)
Since the number of permutation of
r things out of n things of which p
are of one kind, q are second kind
and so on
 Number of Integral Solution  227

 x x2 xp  x x2 xq  
= r! .co-efficient of xr in  1
   + +    
+…+  1
   + +    
+…+  … 
 1! 2! p !   1! 2! q!  

Required number of 5 letter words formed
 2 3
x x2 x3   x x2   x
= Coefficient of x5 
in (5!)   1    + +  +   1   + +      +  
1
 1! 2! 3!   1! 2!   1!  
 
= Coefficient of x5 in
 x4 x3 x4 x5   x2  
(5!) 1  +  x 2 + 4 +  2x  +  x 2 + 3 +  x 3  + 3 + 6   1  +  x  + 2  (1 +  3x  +  3x 2 +  x 3 )
   

= Coefficient of x5 in
 4 x 3 7x 4 x 5   13 11 5 x5  
(5!) 1  +  2x  +  2x 2  + 3 + 12  + 6   1  +  4x  + 2 x 2 + 2 x 3 + 2 x 4 + 2  
   

1
= (5!) ( + 5 + 11 + 26/3 + 7/3 + 1/6)
2
= (5!) (3 + 30 + 66 + 525 + 14 + 1/6) = 20 × 166 = 3320
So Q = 3320 and required remainder is 8
15. (a) Let x1, x2, ... , x6 be the amount with Hasan, Madhur, Susmit, Anshuman, Abhishek
and Ricky respectively.
From the given condition x1 + x2 + x3 + ... + x6 ≤ 17.
Let us assume a variable x7 ≥ 0, such that x1 + x2 + . . . + x6 + x7 = 17 here 1 ≤ xi≤ 6
where i = 1, 2, . . . , 6 and 0 ≤ x7
Required number of solution = coefficient of x17 in ( x + x2 + . . . + x6 )6 (1 + x + x2 + x3 + ...)
= coefficient of x11 in (1 – x6)6 (1 – x)–7 = coefficient of x11 in (1 – 6x6) (1 – x)–7
= coefficient of x11 in ( 1 – 6x6) ( 1 + 7C1x + . . . + 10C4x4 + 11C5x5 + . . . 17C11x11 +. . . )
= 17C11 – 6. 11C5
228  Theory of Counting
Part B
Concept 1 Integral Solution

In last chapter we have studied portioning groups or ‘r’ persons when each group can get
theory, as per that theory. Number of ways of any number of things ≤ n is (n + r – 1)Cr – 1.
dividing ‘n’ identical things among ‘r’ distinct

Concept 2 Multinomial Theorem

As per the multinomial theorem: −1

(iii) (1 − x ) = 1 − x + x 2 − x 3 + x 4 −………….
nx n (n − 1)x
2
(i) (1 + x )n = 1 + + +… 2
1! 2!  1  2 x  3x 2  4 x 3  5x 4 
(iv) 1  x
( −n)( − x ) ( −n) (−n − 1)( − x )2
(ii) (1 − x )−n = 1 − + +…
1! 2!

Integral Solution from

Concept 3 Multinomial Theorem
(i)
Number of non-negative integral (ii) Number of positive integral solution of
Solution Equation equation
a + 2b + 3c + 4d = n a + 2b + 3c + 4d = n
= Co- efficient of xn in = Co-efficient of xn – (1 + 2 + 3 + 4)
[( 1 – x )–1 ( 1 – x2) – 1 (1 – x3 )– 1( 1 – x4 )–1] in [(1 – x)–1( 1 – x2 )–1 ( 1 – x3) – 1(1 – x4)–1]
 Number of Integral Solution  229
(iii) Number of non- negative integral solution Coefficient of xm in
of equation
[( x + x2 + x3 + …)(x2 + x4 + x6 + …)
x1 + 2x2 + 3x3 + … + nxn = m
= coefficient of xm in ( x3 + x6 + x9 …)…(xn + x2n + x3n + …)]
[( 1 + x + x2 + x3 + …)( 1 + x2 + x4 + x6 + …)
= coefficient of xm – ( 1 + 2 + 3 + … + n ) in
( 1 + x3 + x6 + x9 + …)(1 + xn + x2n + x3n + ...)]
= coefficient of xm in [1 + x + x2 + …)(1 + x2 + x4 + …)
[(1 – x)–1(1 – x2)–1(1 – x3)–1 … (1 – xn)– 1] (1 + x3 + x6 + …)…(1 + xn + x2n + …)]
(iv) Number of positive integral solution of n(n + 1)
m–
equation = coeff. of x 2 [(1 – x)–1(1 – x2 )–1
in
x1 + 2x2 + 3x3 + … + nxn = m (1 – x3)–1 … ( 1 – xn)–1]

Application of
Concept 4 Multinomial theorem
Permutation with Repetition
The number of permutation of r things out of n things of which p are of one kind, q are second
kind and so on
 x x2 xp   x x2 xq  
= r! .co-efficient of xr in   1 + +    
+…+    1 + +    
+…+  … 
1! 2! p!   1! 2! q!  
 
Proof: Let the different things be denoted by a, b, c, ………
consider the product

 2
 ax a2 x a p x p   bx b 2 x 2 bq x q 
  
1  
+ + +  ..  
+  1 
+  
+    
+…+    ...(1)
 1! 2! p !   1! 2! q ! 

Required number of arrangements = sum of all possible terms of the form
R! /p! /q! apbq …. , where p + q … = r

 x x2 xp   x x2 xq  
= r! .co-efficient of xr in   1 + +    
+…+   
1  
+ +  
+…+   … 
1! 2! p!   1! 2! q!  
 
230  Theory of Counting

Concept 5 De- arrangement

1 1 1 1 1 1
1 1 1 1 (−1)1  D(5)  (5!)  –  –   
D(n) = n !  – + – +     +   0! 1! 2! 3! 4! 5! 
 0! 1! 2! 3! n ! 
 1 1 1 1 
Note: De-arrangement of 1 object is not  (5!) 1  1     
 2 6 24 120 
possible.  60  20  5  1 
 (120)    44
D(1) = 0  120 

D(2) = 1 Partial De-arrangement

D(3) = 2 Consider n articles only r articles are de
1 1 1 1 1 arranged remaining (n-r) articles are at their
D(4)  (4!)  –  –  
 0! 1! 2! 3! 4!  own place. Then this can be done in (nCr)
 1 1 1 [D(r)].
 (4!) 1  1    
 2 6 24 
 12  4  1 
 (4!)    12  4  1  9
 24 
 Number of Integral Solution  231

1
Concept Deviator (CD)
Ideal Time Revise your concept (IIT advance or
5 Min. tougher questions)
Per Question

1. If n articles are arranged in a straight a + b = 10, a + b + c + d = 21, a + b + c + d + e

line in how many ways 4 articles can
be selected so that no two of them are
consecutive?
(a) n – 4C4 (b) n – 5C4
(c) n – 3C3 (d) None of these
2. What is the number of distinct throws that
is obtained when ‘n’ indistinguishable
dice are thrown? [viz. if n = 3 then result
5,2,3 and 3,2,5 is considered as same as
throw]
(a) n+5C5 (b) n6
(c) 6n (d) None of these
3. In how many ways 5 boys and 50 girls
can be arranged in a straight line such
that between any two boys there must be
at least 5 girls?
(a) (5!)(50!) 41C5 (b) (5!)(50!) 35C5
35
(c) (5!)(50!) C4 (d) None of these
4. Find the number of non negative integral
solution of the equation x1+ x2+…+xk ≤ n
(a) n + kCn – 1 (b) n + kCn
(c) n + kCn + 1 (d) None of these
5. What is the number of ways of selecting 4
persons from a group of n persons sitting
around a circle such that no two of them
are consecutive?
(a) (n/4)(n – 5C3) (b) (n)(n – 5C3)
(c) (4n)( n – 5C3) (d) None of these
6. Find the number of non negative
solutions of the system of equations:
Response Grid
1. a b c d 2. a b c d 3. a b c d 4. a b c d 5. a b c d
6. a b c d 7. a b c d 8. a b c d 9. a b c d 10. a b c d
+ f = 33, a + b + c + d + e + f + g + h = 46, and
so on till a + b + c + d + … + x + y + z = 208.
(a) 22P10 (b) 22P11
(c) 22P12 (d) None of these
7. In a science conference total 100 students
from different schools participated.
Participants are standing in a straight
line in 5 different rooms. Find the total
number of different arrangements that
are possible.
(a) 104P100 (b) 104P4
(c) 105P100 (d) None of these
8. Let n and k be positive integers such that
k (k  +1)
n  ≥ . The number of solutions (x1,
2
x2, …, xk), x1 ≥ 2,… , xk ≥ k all integers
satisfying x1 + x2 + … + xk = n is given by
which one of the following assume that
2 n = 2 p + k 2 + k   ?
(a) k + p +1Cp (b) k + p – 1 Cp
(c) k + p – 1 Ck (d) None of these
9. What is the number of positive integral
solutions of the in equality a+b+3c ≤ 30?
(a) 1212 (b) 1215
(c) 1218 (d) None of these
10. Find the number of integral of the
equation a + b + c + c + d = 20 if it is given
that a > b > c > d > 0.
(a) 22 (b) 24
(c) 23 (d) None of these
232  Theory of Counting

2
Concept Eliminator (CE)
Ideal Time Revise your concept (Maths Olympiad
Just Solve It or tougher questions)

1. If n articles are arranged in a straight 4. Mr. Anshuman has thrown a dice 6 times
line in how many ways ‘r’ articles can in how many ways we can get a sum
be selected so that no two of them are greater than 17?
consecutive?
(a) 31518 (b) 31508
(a) n – r + 1C n – r + 1C
r – 1 (b) r
n – r – 1C
(c) 31528 (d) None of these
(c) r – 1 (d) None of these
5. In an Ice cream parlor at South City
2. In how many ways k boys and ‘nk’ girls
Mall kolkata, 4 different varieties of
can be arranged in a straight line such
that between any two boys there must be ice creams namely Vanila, Strawberry,
at least p girls? Chocolate and Butter Scotch were
(a) nk + kp + p + k – 2C available. On a particular day it was
k–1
(b) nk – kp + p + k – 2C noticed that each customer buys at least
k–2
nk + kp + k – 2C one ice cream and at max 10 ice creams,
(c) k–2
on further investigation it was noticed
(d) None of these
that no two customer buys same set
3. Three friends went to a shopping mall
of ice creams then find the number of
with $ 6, 7 and 8 with them in how many
customers visited the ice cream shop on
ways they can pay a bill of $10 if they
have note of only one denomination. that particular day.

(a) 47 (b) 94 (a) 800 (b) 1000

(c) 49 (d) None of these (c) 1009 (d) 1004

Response Grid
1. a b c d 2. a b c d 3. a b c d 4. a b c d 5. a b c d

Concept Deviator (CD)
1. (d) 2. (a) 3. (b) 4. (b) 5. (a) 6. (c)
7. (a) 8. (b) 9. (b) 10. (c)
1. (d) Let after ‘a’ articles we have selected
1st article here a ≥ 0
There are ‘b’ articles between 1st and
2nd article here b ≥ 1
Then there are ‘c’ articles between
2nd and 3rd article here c ≥ 1
Similarly there are ‘d’ articles
between 3rd and 4th article here d ≥ 1.
And there are ‘e’ articles after 4th
article here e ≥ 0.
Then from the given condition a + b
+ c + d + e = n – 4 with the conditions
a ≥ 0, b ≥ 1, c ≥ 1, d ≥ 1, e ≥ 0.
Required number of positive integral
solution n–3C4.
2. (a) Let after ‘n’ throws number of times
that ‘1’ appeared is a, number of
times that ‘2’ appears is b and so
on number of times that 6 appears
is f then a + b + c + d + e + f = n
and we have to find the number of
non negative integral solution of the
above equation.
From partitioning theory the number
of non negative integral solution is
n+6–1C n + 5C .
6–1 = 5
Number of Integral Solution  233
Solutions
3. (b) 1st arrange 50 girls that can be done
in 50! ways,
Let 1st boy is after ‘a’ girls so that
a ≥ 0, there are ‘b’ number of girls
between 1st boy and 2nd boy such
that b ≥ 5, similarly there are ‘c’
number of girls between 2nd and 3rd
boy, ‘d’ number of girls between 3rd
and 4th boy, ‘e’ number of girls between
4th and 5th boy and finally there are f
number of girls after 5th boy.
So from the given condition a + b + c
+ d + e + f = 50.
And as per the given condition a ≥ 0,
b ≥ 5, c ≥ 5, d ≥ 5, e ≥ 5 and f ≥ 0.
Let us assume b = 5 + b1 then b1≥0
similarly c = 5 + c1, d = 5 +d1 and
e = 5 + e1 where c1 ≥ 0, d1 ≥ 0 and e1 ≥ 0.
Then the new equation is a + b1 + c1
+ d1 + e1 + f = 30 where each variable
is non negative positive integer,
Hence required number of ways is
30+6–1C 35C .
6–1 = 5
Then girls can be arranged in (50!)
ways and boys can be arranged in (5!).
So total number of ways is (5!)(50!)
(35C5).
234  Theory of Counting
4. (b) We have following cases: Next equation is a + b + c + d = 21

If x1 + x2 + … + xk = 1 then number hence c + d = 11 and number of

of integral solution is k + 1 – 1C solutions of this equation is 12.

k – 1
= kCk – 1 = kC1. Similarly for third equation a + b +

If x1 + x2 + … + xk = 2 then number c + d + e + f = 33 or e + f = 12 or

of integral solution is k + 2 – 1C number of solutions is 13.

k–1
= k + 1C = k + 1C
k–1 2. Similarly for last equation a + b + c

If x1+ x2 +… + xk = 3 then number of + d + … + x + y + z = 208, or

integral solution is y + z = 22 or number of solution is 23.

k + 3 – 1C = k + 2C = k + 2C
k–1 k–1 3. Required number of ways is 11 × 12 ×

And so on… 13 × ... × 21 × 22 = (22!)/(10!) = 22P12.

If x1 + x2 + … + xk = n then number of 7. (a) Let a, b, c, d, e, be the number of

integral solution is k + n – 1Ck – 1. students in 5 different rooms say A,

B, C, D, and E respectively.
So total number of ways is kCk – 1 +
k + 1C k + 2C k + n–1C Then from the given condition
k–1 + k – 1 + ... + k–1

= kC + k + 1C2 + k + 2C + … + a + b + c + d + e = 100.
1 3
k + n – 1C = n + kC .
n n Number of ways of dividing 100
5. (a) Given that n persons are sitting in a persons in 5 distinct groups.
circle, let number of persons between = n + r – 1 Cr
1st and 2nd is a, that between 2nd and
= 5 + 100 – 1C100 = 104C100.
3rd is b, between 3rd and 4th is c and
But number of ways of dividing 100
between 4th and 1st is d then a + b +
students in 5 sets containing a, b, c,
c + d = n – 4, here a, b c and d each
d, e, students respectively is
of them is more than 1, so required
number of ways is 100!

(n – 8) + 4 – 1C = n – 5C ways, but (a !)(b !)( c !)(d !)(e !)

4–1 3
1st one can be selected in n/4 ways, Now students in first set can be
so required number of ways is (n/4) arranged among themselves in the
(n – 5C3). list in a! ways.
6. (c) Consider the equation a + b = 10 Similarly, b, c, d, e, persons can be
number of solutions of this equation arranged among themselves in b!, c!,
is 10 + 2 – 1C = 11.
2–1 d!, e!, ways respectively.

Hence required number of ways
= 206C6
100!
 × (a !)(b !)( c !)(d !)(e !)
(a. !)(b !)( c !)(d !)(e !)
= 104C100 . 100! = 104P100
8. (b) As per the given condition (x1, x2,
…, xk), x1 ≥ 2,… , xk ≥ k so we can
assume y1 = x1 – 1, y2 = x2 – 2.. and
so on yk = xk – k then from the given
condition y1, y2, …,yk ≥ 0.
Since x1+ x2 + … + xk = n
Thus y1 + y2 + … + yk = x1 + x2 + ….
+ xk – ( 1 + 2 + … + k)
k ( k  +  1) 2 n − k 2 – k
= n  – = =p
2 2
2n − k 2 – k
Thus y1 + y2 + … + yk = = p,
2
where yi ≥ 0 for i = 1, 2, …, k
k+p–1C
Required number =
9. (b) Since it is given that a + b + 3c ≤ 30,
so assume a number d ≥ 0 such that
a + b + 3c + d = 30, a, b and c are
the positive integers so a = a1+ 1, b
= b1+1, and c = c1+1 then the given
equation we can write as (a1+ 1) +
(b1 + 1) + 3(c1 + 1) + d = 30.
Or a1 + b1 + 3c1 + d = 25.
Since coefficient of c1 is 3 hence it
can not take a value more than 8 if
we form cases then we will have 9
cases:
Number of Integral Solution  235
Case (i) c1 = 0 then a1 + b1 + d = 25
and number of non negative integral
solution is 25 + 3 – 1C3–1 = 27C2 = 351.
Case (ii) c1 =1 then a1 + b1 + d = 22
and number of non negative integral
solution is 22 + 3 – 1C3 – 1 = 24C2 = 276.
Case (iii) c1 = 2 then a1 + b1 + d = 19
and number of non negative integral
solution is 19 + 3 – 1C3 – 1 = 21C2 = 210.
Case (iv) c1 = 3 then a1 + b1 + d = 16
and number of non negative integral
solution is 16 + 3 – 1C3 – 1 = 18C2 = 153.
Case (v) c1 = 4 then a1 + b1 + d = 13
and number of non negative integral
solution is 13 + 3 – 1C3 – 1 = 15C2 = 105.
Case (vi) c1 = 5 then a1 + b1 + d = 10
and number of non negative integral
solution is 10 + 3 – 1C3 – 1 = 12C2 = 66.
Case (vii) c1 = 6 then a1 + b1 + d = 7
and number of non negative integral
solution is 7 + 3 – 1C3 – 1 = 9C2 = 36.
Case (viii) c1 = 7 then a1 + b1 + d = 4
and number of non negative integral
p. solution is 4 + 3 – 1C3 – 1 = 6C2 = 15.
Case (ix) c1 = 8 then a1 + b1 + d = 1
and number of non negative integral
solution is 1 + 3 – 1C3 – 1 = 3C2 = 3.
So total number of integral solution
is 51 + 276 + 210 + 153 + 105 + 66 +
36 + 15 + 3 = 1215.
Method 2:
Instead of listing of all the possible
solutions we can find a general term
and then solve-
Since a1 + b1 + 3c1 + d = 25 hence
a1 + b1 + d = 25 – 3c1.
236  Theory of Counting
Let c1 = n where n varies from 1 to 8 then the new equation is
then a1 + b1 + d = 25 – 3n. (d + x + y + z) + (d + x + y) + (d + x) +
Number of non-negative integral d = 20 or 4d + 3x + 2y + z = 20
solution of this equation is given by here d, x, y, z > 0.
= 3 + 25 – 3n – 1 C = 27 – 3nC2.
3–1
Minimum value of 4d + 3x + 2y + z is
( 27 3n)(26 3n) 4 + 3 + 2 + 1 = 10.

2
3 Required number =
 (3n2 – 53n  – 234)
2 coefficient of x20 – 10
here n varies from 1 to 8
in ( 1 – x4) – 1 (1 – x3) – 1 (1 – x2)–1 ( 1 – x) –1.
Required number is
= coefficient of x10 in [(1 + x4 + x8 )
8 (1 + x3 + x6 + x9)( 1 + x2 + x4 + x6 + x8 +
3/2 ∑ (3n2 − 53n − 234) x10)(1 + x + x2 + x3 + …….. + x10)].
n= 1
[Ignoring terms containing powers
3  17   9 
= 3  8 ×  9  ×   – 53  8 ×  +  234 ×  9   of x greater than 10]
2   6  2 
= coefficient of x10 in [( 1 + x3 + x4 +
= 1215.
x6 + x7 + x8 + x9 + x10)( 1 + x + 2x2 +
10. (c) Given equation is a + b + c + d = 20,
2x3 + 3x4 + 3x5 + 4x6 + 4x7 + 5x8 +
a > b > c > d > 0.
4x9 + 6x10)]
c = d + x, b = d + x + y and
= 6 + 4 + 4 + 3 + 2 + 2 + 1 + 1 = 23
a=d+x+y+z

Concept Eliminator (CE)

1. (b) 2. (b) 3. (a) 4. (b) 5. (b)

1. (b) Let after ‘a1’ articles we have selected And there are ‘ar + 1’ articles after
1st article here a1 ≥ 0. rtharticle here ar + 1 ≥ 0.
There are ‘a2’ articles between 1st
Then from the given condition
and 2nd article here a2 ≥ 1.
a1 + a2 + a3 + …. + ar + ar+1 = n – r and
Then there are ‘a3’ articles between
a1 ≥ 0, a2 ≥ 1, a3 ≥ 1, …. ar ≥ 1, ar + 1 ≥ 0.
2ndand 3rd article here a3 ≥ 1.
And so on Required number of positive integral

There are ‘ar’ articles between (r – 1)th solution n – r + 1Cr.

and rtharticle here ar ≥ 1.

2. (b) 1st arrange ‘nk’ girls that can be
done in (nk)! Ways.
Let 1st boy is after ‘a1’ girls so that
a1 ≥ 0, there are ‘a2’ number of girls
between 1st boy and 2nd boy such
that a2 ≥ p, similarly there are ‘a3’
number of girls between 2nd and 3rd
boy, ‘a4’ number of girls between 3rd
and 4th boy, and so on and finally
there are ak+1 number of girls after
kth boys.
So from the given condition a1 + a2 +
a3 + … + ak + ak + 1 = nk.
And as per the given condition a1 ≥ 0,
a2 ≥ p, a3 ≥ p and so on ,ak ≥ p, ak + 1 ≥ 0.
Let us assume a2 = p + a2’
a2’ ≥ 0 similarly a3 = p + a3’ and so
on, ak = p + ak’ and ak+1 ≥ 0.
Then the new equation is a1 + a2 +
a3+ …. + ak + ak + 1 = nk – (k – 1)p
where each variable is non negative
positive integer, Hence required
number of ways is
nk – kp + p + k – 1 – 1C
k–1–1
= nk – kp + p + k – 2Ck – 2.
3. (a) They have note of same denomination
hence that denomination must be
HCF of 6, 7 and 8 which is 1, so each
of them have notes of $1.
Now let us assume that the number
of notes that they have is x1, x2, and
x3.
Number of Integral Solution  237
So the numbers of ways in which
they can denote Rs. 10 is the same
as the number of solution to the
question
x1 + x2 + x3 = 10
Subject to conditions
0 ≤ x1≤ 6, 0 ≤ x2≤ 7, 0 ≤ x3≤ 8
Hence the required number of ways
= coefficient of x10 in (1+ x + x2 + ...+ x6)
(1 + x + x2 + ... x7) (1 + x + x2 + ... + x8)
= coefficient of x10 in (1 – x7) (1 – x8)
(1 – x9) (1 – x)–3.
= coefficient of x10 in
( 1 – x 7 – x 8 – x 9) ( 1 + 3C 1x + 4C 2x2 +
then 5C 3 12C x10).
3x + ... 10
= 12C2–5C3 – 4C2 – 3C1
(ignoring powers higher than 10)
= 66 – 10 – 6 – 3 = 47.
4. (b) Let x1, x2, ... , x6 be the number that
appears on the six dies.
As per the given condition x1 + x2 +
x3 + ... + x6 ≤ 17.
Introducing a dummy variable x7
(0 ≤ x7) the inequality becomes an
equation
x1 + x2 + ... + x6 + x7 = 17.
Here 1 ≤ xi ≤ 6 where i = 1, 2, ... , 6
and 0 ≤ x7.
238  Theory of Counting
So that No. of solution 5. (b) Let a particular customer buys

= coefficient of x17 in ( x + x2 + ... + x6 )6 ice creams Vanila, Strawberry,

Chocolate and Butter Scotch of a, b ,
(1 + x + x2 + x3 + ...)
c and d numbers then from the given
= coefficient of x11 in (1 – x6)6 (1 – x)–7 condition 0 < a + b + c + d ≤ 10.

= coefficient of x11 in (1 – 6x6) (1 – x)–7 Let us assume a dummy variable

k such that a + b + c + d + k = 10
= coefficient of x11 in ( 1 – 6x6) then number of integral solution of
(1 + 7C1x + ... + 10C4x4 + 11C5x5 + ...
this equation is 10 + 5 – 1C5 – 1 = 14C4
17C x11 + ...) = 17C – 6. 11C
11 11 5 14! 14  13  12  11
=  = 1001.
(4!)(10!) 24
Since total number of outcome is 66
But there is one case when k =10
Required number of ways to get a sum then a + b + c + d = 10, this case is
greater than 17 = 66 – (17C11 – 611C5) not applicable case hence required
= 46656 – 12376 – 6 × 462 = 31508. answer is 1001 – 1 = 1000.
 9
Probability Introduction  239

Probability Introduction

Topics Covered
 Introduction and properties of sets

 Probability Introduction

 Properties of Probability

 Odds in favor & against

Part A: Topic Number of Questions

Solved Example 10
Concept Applicator 10
Concept Builder 15
Concept Cracker 15
Part B: Topic Number of Questions
Concept Deviator 20
Concept Eliminator 7
Total 77
240  Theory of Counting
Part A
Concept 1 Introduction
Partitioning
and Properties
Theory of Sets
In our day to day life we use statements like
“probability of catching a train” or “Probability of
passing an exam” etc. If we talk in mathematical
language then we can say the probability may
vary between 0 to 1. If probability is 0 then it
is called impossible event e.g. probability of
getting a red ball from a basket that has only
10 black balls. And if probability is 1 then it is
called sure event like getting head or tail when
a fair coin is tossed.
The theory of probability has its origin in
gambling when people went to casinos where
they used to get certain money if they won the
game. Mathematicians wanted to find out as
to how much a person will earn if the game is
played a large number of times or a certain
number of times.
Some basic concepts/ terms in
Probability:
1. Experiment & Random Experiment:
Any operation which may result in
some well defined outcomes is called
an experiment and any Experiment
whose outcome cannot be predicted with
certainly is called a random experiment.
In other words any experiment which
has more than 1 possible outcome and
it is not possible to predict the result of
experiment before hand is called random
experiment. Consider few examples:
Example (i): “Throwing an unbiased
die” is a random experiment because it
has more than 1 possibility (possibilities
are 1, 2, 3, 4, 5 and 6) and its result can
not be predicted before hand.
Example (ii) “Tossing of a fair coin”
is a random experiment because it has
more than 1 possibility (possibilities are
Head and Tail ) and its result can not be
predicted before hand
2. Sample space (or Possible out comes):-
While defining Random experiment we
have seen that a random experiment
must have more than 1 possible out comes
and the set of all possible outcomes of a
random experiment is called the sample
space. It is usually denoted by S.
Example (i): “Throwing an unbiased
die” is a random experiment and it has
more than 1 possibility, possibilities are
1, 2, 3, 4, 5 and 6 and a set that has all
these elements are the sample space of
this random experiment.
For this experiment Sample space
S = {1, 2, 3, 4, 5, 6}
Number of elements in this set is 6 and
that can be denoted as n(S) or |S| = 6
A sample space S is called a discrete
sample space if S is a finite set.
Example (ii): “Tossing of a fair coin” is
a random experiment and it has more
than 1 possibility and they are Head (H)
and Tail (T) hence set Sample space for
this random experiment is S = { H, T}
In this case number of elements in this
set is 2 and that can be denoted as n(S)
or |S| = 2
 Probability Introduction  241
Example (iii): “Tossing of two fair coins the number of elements in the sample
is a random experiment and it has more space.
than 1 possibility and set Sample space Solution:  Let the two apples be A1 and A2
for this random experiment is S = {HH, and three bananas as B1, B2, B3 then the
HT, TH, TT}
outcome will be as follows S = {HA1, HA2,
In this case number of elements in this HB1, HB2, HB3, T}
set is 4 and that can be denoted as n(S)
So number of elements in sample space
or |S| = 4.
n(S) = 6.
In other words we can say that we have
4 cases or 4 outcomes when we toss two Example 3:  Trina now decided to toss a
unbiased coins and these are: coin until she get a Tail write down all
the sample spaces and ?
1st 2nd
Cases Solution:  As per the given condition she will
coin coin
continue doing toss until she get a Tail
Case (i) H H HH So sample space hence sample space here would be
for this random
Case (ii) H T HT experiment is- n(S) = {T, HT, HHT, HHHT, …}
S = {HH, HT, Event: A subset of the sample space S is called
Case (iii) T H TH
TH, TT} an event and is generally denoted by E.
Case (iv) T T TT Or n(S) = 4 (i) Consider Tossing of a fair coin it is a
random experiment and Sample space
Example 1:  List down all the elements of for this random experiment is S = {H, T},
sample space if a coin is tossed thrice? Events of this experiment is {φ}, {H}, {T}
Solution:  Required sample space is {H or T}
S = {HHH, HHT, HTH, HTT, THH, THT, (ii) Impossible event: Ф (null set) is also a
TTH, TTT) subset of S (Sample space) and is called
And n(S) = 8. an impossible event.
Alternately : From fundamental principle (iii) Sure Event: S is also a subset of S which
of multiplication the total number of is called a sure event or a certain event.
elements is 23 = 8 ways. If we observe then we can find that
Sample space S plays the same role as
Example 2:  Trina has a fruit basket that
the universal set
has 2 Apples and 3 bananas, She tossed
a coin if she gets head then she will Each element of the sample space is called a
take out one fruit from the basket and sample point or an even point.
if she get Tail then she wont pick any Simple Event elementary Event: a
fruits, then list down all the possible singleton subset of the sample space S is
outcomes (sample space) and also find called a simple event.

QR Code / Video Link

For Smart phone/ Tablet users

Video Link for Desktop/Laptops users http://dishapublication.com/video-resources

242  Theory of Counting
Examples: “Throwing an unbiased die” is a “E” getting an Even number which is {2, 4,6}
random experiment and it has more than 1 and Event “O” getting an odd number which
possibility, possibilities are 1, 2, 3, 4, 5 and 6 is {1, 3, 5}. Number of elements in event E is 3
and a set that has all these elements are the and that in event O is also three hence we can
sample space of this random experiment. say that events E and O are equally likely.
When a die thrown, sample space S = {1, 2, 3,
Operations of Sets
4, 5, 6}
Let A = {5} = the event of occurrence of 5. Union of Sets: Union of two or more sets is
the set of all elements that belong to any one
B = {2} = the event of occurrence of 2.
of the sets or present in both of them. The
Here A and B are simple events. symbol used for union of sets is ‘∪’ i.e.
Example: When a coin is tossed, sample
A∪B = Union of set A and set B
space S = {H,T}
Example: A = {1, 2, 3, 4} and B = {2, 4, 5, 6}
{H} = event of occurrence of head and {T} =
then A∪B = {1, 2, 3, 4, 5, 6}
the event of occurrence of tail and these are
simple events Properties of Union:
Mixed Event or compound Event or
A∪B=B∪A
composite Event: a subset of the sample
space S which contains more than one element A∪A=A
is called a mixed event or in other words any A ∪ U = U, where U is the universal set
event which is not a simple or elementary A ∪ Φ =A
event is a mixed or compound event.
A ⊂ A∪ B and B ⊂ A ∪ B
Examples:
If B ⊆ A, then A ∪ B = A
(i) When a coin is tossed, sample space
A ∪ (B ∪ C) = (A ∪ B) ∪ C, this is known
S = {H,T}.
as associative law
Now consider an event P = {H,T} = the
event of occurrence of a head or tail. Here P Representation of union of sets:
has 2 elements hence it is a mixed event.
(ii) When a die is thrown, sample space A B
S = {1,2,3,4,5,6}
Now consider an event E ={2, 3, 5} = the event
of occurrence of a prime number and it has 3
elements so it is mixed events.
Equally Likely Events: If outcomes are
equally likely or when number of elements in
two events set is equal then these two events
are called Equally Likely Events. Intersection of Sets:
If a fair coin is tossed then event of getting
It is the set of all the elements, which are
Head is {H} and that of tell is {T} in both the
common to all the sets. The symbol used for
cases number of elements is 1 hence these two intersection of sets is ‘∩’ i.e.
events are equally likely.
A ∩ B = {x| x ∈A and x ∈B}
If a fair die is thrown then sample space is {1, Example: If A = {1, 2, 3, 4} and B = {2, 4, 5, 6}
2, 3, 4, 5, 6} now consider two events, Event then A ∩ B = {2, 4}

Properties of Intersection:
A∩B=B∩A
A∩A=A
If A and B are disjoint sets then A ∩ B = Φ
A∩Φ=Φ
(A ∩ B) ⊆ A and (A ∩ B) ⊆ B
A ∩ (B ∩ C) = (A ∩ B) ∩ C, i.e., associative law
Probability Introduction  243
A–Φ=A
(A – B) ∪ B = A ∪ B and (A – B) ∩ B = Φ
Complement of a Set:
The complement of a set A is the set of
elements which do not belong to A, in other
words, U

A B
Difference of Sets: The difference of set A to
B denoted as A – B is the set of those elements
that are in the set A but not in the set B i.e.
A – B = {x| x ∈ A and x ∉ B}.
Similarly B – A = {x: x ∈ B and x ∉ A}
Example: If A = {1, 2, 3, 4} and B = {3, 4, 5, 6,
7} then A–B = {1, 2} and B–A = {5, 6, 7}.
– A. Symbolically, denoted as, Ac or A′
A′ = {x|x∈ U, x ∉ A} = U – A
For every event A of an experiment there
exist another event A′ or Ac such that there
is no common element in events A and Ac and
collectively they form sample space.
When a die is thrown, sample space
S = {1,2,3,4,5,6}
Now consider an event E ={2, 3, 5} = the event
of occurrence of a prime number and it has 3
elements so its complementary event of this
element is E′ = { 1, 4, 6}

A–B
A B

Here shaded area represents A′

A B
Properties of Difference of Sets:
A–B≠B–A
A – B ⊆ A and B – A ⊆ B
Exhaustive Events:
B–A
For a random experiment A, set of events
is said to be exhaustive if one of them must
necessarily happen every time the experiment
is performed. If a fair die is thrown then
sample space is {1, 2, 3, 4, 5, 6} now consider
two events, Event “E” getting an Even number
which is {2, 4,6} and Event “O” getting an odd
number which is {1, 3, 5}.
If we consider event E and O together then
no element is left hence they are Exhaustive
Events.
244  Theory of Counting

Concept 21 Partitioning
Probability
Theory

The probability of occurrence of an event E is Example 5:  Consider an experiment

denoted by P(E) and is defined as - of throwing a fair die, what is the
n (E ) probability of getting an even
P  (E ) =
n (S ) number?
Here n(E) represents number of elements in E Solution:  Sample space S = All possible cases
= number of cases favorable to event E = {1,2,3,4,5,6} and number of elements in
and n(S) represents number of elements in sample space S is n(S) = 6
Sample space S = total number of cases Let E = the event of occurrence of an Even
Example 4:  Consider an experiment number = {2,4,6} and n(E) = 3
of tossing a fair coin, what is the n (E ) 3 1
Then P (E ) = = =
probability of getting a head? n (S ) 6 2
Solution:  Sample space S = All possible cases Example 6:  When two coins are tossed,
= {H,T} and then what is probability of getting one
number of elements in sample space S is head and one tail?
n(S) =2
Solution:  Sample space S= {HH,HT,TH,TT}
Let E = the event of occurrence of a head. so n(S) = 4
Then E = {H} and number of elements in Let E = the event of occurrence of one head
favorable case n(E) = 1 and one tail, then E = {HT,TH} so n(E) = 2
Thus P(E) = Probability of occurrence of n (E ) 2 1
Now P (E ) =
n (E ) 1 n (S )
= =
4 2
head = =
n (S ) 2

QR Code / Video Link

For Smart phone/ Tablet users

Video Link for Desktop/Laptops users http://dishapublication.com/video-resources

 Probability Introduction  245

Concept 31 Properties
Partitioning
of Probability
Theory

Property 1: Probability of occurrence of an Complement of an Event: Let S be the

event is a number lying between 0 and 1
If probability is 0 then it is called impossible
event e.g probability of getting a red ball from
a basket that has only 10 black balls.
If probability is 1 then it is called sure event like
getting head or tail when a fair coin is tossed.
Proof: Let S be the sample space and E be
an event.
Then we know that φ ⊆ E ⊆ S
\ n(φ) ≤ n(E) ≤ n (S)
Or  0 ≤ n (E) ≤ n (S) since n(φ) = 0
0 n (E ) n (S )
Or  ≤ ≤ [Dividing by n (S)]
n (S ) n (S ) n (S )
Or 0 ≤ P (E) ≤ 1 Solution:  Since event of passing and failing in
Property 2: If E is any event and E′ be the
complement of event E, then P(E) + P(E′) = 1
sample space for a random experiment and E
be an event.
Complement of event E is denoted by E′ or Ec.
By definition of complement of an event, E′
means non- occurrence of event E, hence E'
occurs if and only if E does not occur.
Proof: Let S be the sample space, then
n(E) + n(E') = n(S)
n (E ) n (E ′ )
\ +    or  P (E ) +  P (E ′ ) = 1
=1
n (S ) n (S )
Example 7:  If probability that Ramesh
will pass the exam is 3/5 then find the
probability that he fail in the exam.
the same exam is complement to each other
hence required probability is 1 – 3/5 = 2/5

Concept 41 Odds
Partitioning
in Favor &Theory
Against

Consider a random experiment, S be the its Odds in favor of event E is defined as

sample space and E be an event. Let E' denote  n (E )
the complement of event E, then we know that  
n (E )  n (S ) P (E )
n(E) + n(E′) = n(S) and P(E) + P(E') = 1 = = =
n (E ')  n (E ') P (E ')
• Odds in favor of event E  
 n (S ) 
246  Theory of Counting
Odds against an even E In other words here sample space
Odds against an even E = n(E′)/n(E) n(S) = 16, favorable event n(E) = 5 and
n(E′) = 11 hence odd against that event is
 n (E ')
  n(E′)/n(E) = 11/5
 n (S )  P (E ') Example 9:  If the probability of occurr-
= =
 n (E ) P (E ) ence of an event is 5/16, find the odds
  in favor of the event.
 n (S )
Solution:  In this case sample space n(S) = 16,
If odds in favor of an event is ‘F’ and against favorable event n(E) = 5 and n(E′) = 11 hence
an event is ‘A’ then F × A = 1 odds against that event is n(E)/n(E') = 5/11
Example 8:  If the probability of occurr- Example 10:  If odd against an event is
ence of an event is 5/16, find the odds 4/11 then what is the probability of
against the event. occurrence of that event?
Solution:  Out of every 16 events 5 are Solution:  From the definition of odds against an
favorable and events not favorable is 11 event E is n(E')/n(E) = 4/11 so n(E) = 11 and
hence odd against the event is 11/5 n(S) = 4+11 = 15, so P(E) = n(E)/n(S) = 11/15

1
Concept Applicator (CA)
Ideal Time Apply your concepts with easy and
10 Min. conceptual questions

1. If a fair coin is tossed, what is the 4. What is the probability that Mr. John
probability that it shows a head? was born on a Sunday?
1 1 1 1
(a) 2 (b) 4 (a) 2 (b) 4
1 1
(c) 3 (d) None of these (c) 3 (d) None of these
2. If a fair coin is tossed twice, what is the 5. What is the probability that Mr. John
probability that it shows a tail and a head? was born on a Saturday or on a Sunday?
1 1 1 1
(a) 2 (b) 4 (a) 2 (b) 4
1 2
(c) (d) None of these
(c) 3 (d) None of these 7
3. If a fair coin is tossed twice, what is the 6. If a fair die with 6 faces number 1 to 6
probability that it shows a tail in 1st toss is rolled, what is the probability that it
and a head in 2nd ? shows an odd number?
1 1 1 1
(a) 2 (b) 4 (a) 2 (b) 4
1 1
(c) 3 (d) None of these (c) 3 (d) None of these
 Probability Introduction  247
7. If a fair die with 6 faces number 1 to 6 9. If a fair die with 6 faces number 1 to 6
is rolled, what is the probability that it is rolled, what is the probability that it
shows a composite number? shows a perfect square number?
1 1 1 1
(a) 2 (b) 4 (a) 2 (b) 4
1 1
(c) 3 (d) None of these (c) 3 (d) None of these
8. If a fair die with 6 faces number 1 to 6 10. If a fair die with 6 faces number 1 to 6 is
is rolled, what is the probability that it rolled, what is the probability that It shows
shows either a prime or an even number? either a perfect square or an even number?
1 1 1 1
(a) 2 (b) 4 (a) 2 (b) 4
1
1
(c) 3 (d) None of these (c) (d) None of these
3
Response Grid
1. a b c d 2. a b c d 3. a b c d 4. a b c d 5. a b c d
6. a b c d 7. a b c d 8. a b c d 9. a b c d 10. a b c d

2
Concept Builder (CB)
Ideal Time Revise your concepts with questions
25 Min. medium difficulty level questions

1. If two fair dies with 6 faces numbers that both of them will show either prime
1 to 6 is rolled together, what is the or odd?
probability that one of them will show 1
even and other odd? (a) 4/9 (b)
6
1 1
1 (c) 4 (d) None of these
(a) 3 (b)
6 4. If two fair dies with 6 faces numbers
1 1 to 6 is rolled together, what is the
(c) 4 (d) None of these probability that at least one of them will
2. If two fair dies with 6 faces numbers 1 to 6 show a prime number?
is rolled together, what is the probability 1 1
that both of them will show prime number? (a) 3 (b)
6
1 1 1
(a) 3 (b) (c) 4 (d) None of these
6
1 5. N is a two digit number what is probability
(c) 4 (d) None of these that N is a prime number?
3. If two fair dies with 6 faces numbers 1 to 6 (a) 1/25 (b) 7/10
is rolled together, what is the probability (c) 7/30 (d) None of these
248  Theory of Counting
6. N is a two digit number what is probability
381
that N is a prime or a perfect square number? (c) (d) None of these
2530
(a) 1/25 (b) 3/10
11. If the probability of occurrence of an event is
(c) 29/90 (d) None of these
3/16, find the odds against the event.
Directions Qs. 7 to 10: In each case there is
a class with 10 boys and 15 girls then- (a) 3/13 (b) 13/3
7. What is the probability that a randomly (c) 13/16 (d) None of these
chosen student is a boy? 12. If the probability of occurrence of an event is
3/16, find the odds in favor of the event.
(a) 2/5 (b) 3/5
(a) 3/13 (b) 13/3
(c) 1/4 (d) None of these
(c) 13/16 (d) None of these
8. What is the probability that a random
13. If odd against an event is 5/11 then what is
selection of 2 students will comprise one the probability of occurrence of that event?
boy and one girl? (a) 5/16 (b) 13/16
(a) 2/5 (b) 3/5 (c) 12/16 (d) None of these
(c) 1/4 (d) None of these 14. If odd in favor of an event is 5/11 then
9. What is the probability that a random what is the probability of occurrence of
selection of 5 students will comprise 3 that event?
boys and 2 girls? (a) 5/16 (b) 13/16
(a) 2/5 (b) 60/121 (c) 12/16 (d) None of these
(c) 60/253 (d) None of these 15. A bag contains 30 balls of which 11 are
10. What is the probability that a random white, 7 are yellow, 7 are black and 5 are
selection of 5 students will comprise at green. What is the probability that a ball
least 3 boys? drawn at random is either white or black
or green?
762 381
(a) (b) (a) 7/10 (b) 3/10
1265 1265 (c) 23/30 (d) None of these
Response Grid
1. a b c d 2. a b c d 3. a b c d 4. a b c d 5. a b c d
6. a b c d 7. a b c d 8. a b c d 9. a b c d 10. a b c d
11. a b c d 12. a b c d 13. a b c d 14. a b c d 15. a b c d

3
Concept Cracker (CC)
Ideal Time Boost up your confidence with good
30 Min. questions

1. Find the probability of getting the sum
as a prime number when two dice are
thrown together.
(a) 5/12 (b) 7/18
(c) 11/36 (d) None of these
2. Find the probability of getting the sum
as a perfect square number when two
dice are thrown together.
(a) 5/12 (b) 7/18
(c) 7/36 (d) None of these

3. What is the probability that equal
numbers will come up on them if two
dice are thrown together?
(a) 5/12 (b) 1/6
(c) 7/36 (d) None of these
4. A number between 1 to 25 (both excluding)
is selected, what is probability that it is
neither multiple of 5 nor that of 7?
(a) 16/23 (b) 7/23
(c) 16/25 (d) None of these
5. Find the probability of getting a sum greater
than 9 if two dice are thrown at a time.
(a) 5/12 (b) 1/6
(c) 7/36 (d) None of these
6. What is the probability that a leap year
selected at random will have 53 Fridays?
(a) 2/7 (b) 1/7
(c) 7/52 (d) None of these
7. What is the probability that a non leap year
selected at random will have 53 Fridays?
(a) 2/7 (b) 1/7
(c) 7/52 (d) None of these
8. If three coins are tossed simultaneously, what
is the probability of getting three heads?
(a) 1/4 (b) 1/8
(c) 3/8 (d) None of these
9. If three coins are tossed simultaneously,
what is the probability of getting two
heads and one tail?
(a) 1/4 (b) 1/8
(c) 3/8 (d) None of these
Response Grid
1. a b c d 2. a b c d 3. a b c d 4. a b c d 5. a b c d
6. a b c d 7. a b c d 8. a b c d 9. a b c d 10. a b c d
11. a b c d 12. a b c d 13. a b c d 14. a b c d 15. a b c d
Probability Introduction  249
10. A bag contains 4 red & 6 balls white. Two
balls are drawn at random. What is the
probability that both are red?
(a) 2/7 (b) 1/7
(c) 7/52 (d) None of these
11. A bag contains 4 red & 6 white balls. Two
balls are drawn at random. What is the
probability that one of them is red and
the other is white?
(a) 7/15 (b) 8/15
(c) 4/15 (d) None of these
12. A bag contains 6 apples, 4 bananas and
8 mangoes. If three fruits are drawn at
random, then what is the probability
that all the three are apples?
(a) 5/204 (b) 7/204
(c) 11/204 (d) None of these
13. Five coins are tossed together. What is
the probability that at least one tail will
appear?
(a) 31/32 (b) 1/32
(c) 15/32 (d) None of these
14. A team of 5 is to be constituted out of 6
girls and 6 boys, then what is probability
that the team has 3 girls and 2 boys?
(a) 75/198 (b) 79/198
(c) 75/199 (d) None of these
15. If ratio of odds against an event to odds
in favor of an event is 9/25 then find the
probability of occurrence of the event.
(a) 3/8 (b) 5/8
(c) 1/8 (d) None of these
250  Theory of Counting

Solutions
Concept Applicator (CA)
1. (a) 2. (a) 3. (b) 4. (d) 5. (c) 6. (a)
7. (c) 8. (d) 9. (c) 10. (d)

1. (a) When a fair coin is tossed the sample
space is {H, T}. Number of elements
in sample space is 2. Hence required
1
probability is .
2
2. (a) If a fair coin is tossed twice then
sample space is {HH, HT, TH, TT}.
Number of elements in sample
space is 4 and favorable cases are
{HT, TH} and number of elements in
this is 2. Hence required probability
is 2/4 = 1/2.
3. (b) If a fair coin is tossed twice then
sample space is {HH, HT, TH, TT}.
Number of elements in sample space
is 4 and favorable case is {TH} and
number of elements in this is 1.
Hence required probability is 1/4.
4. (d) Since in a week we have 7 days hence
number of elements in the sample
space is 7 and favorable case is
only one. Hence required probability
is 1/7
5. (c) Since in a week we have 7 days.
Hence number of elements in the
sample space is 7 and favorable cases
are two. Hence required probability
is 2/7
6. (a) Required probability is 3/6 = 1/2
7. (c) From 1 to 6 composite numbers are 4
and 6 i.e 2 numbers. Hence required
probability is 2/6 = 1/3
8. (d) Favorable numbers in this case are 2,
3, 4, 5, and 6 so required probability
is 5/6
9. (c) From 1 to 6 only 2 perfect square
numbers exist (1 and 4) so required
probability is 2/6 = 1/3
10. (d) Number of favorable cases are
{1, 2, 4, 6} so required probability is
4/6 = 2/3

Concept Builder (CB)

1. (d) 2. (c) 3. (a) 4. (d) 5. (c) 6. (b)
7. (a) 8. (d) 9. (c) 10. (b) 11. (b) 12. (a)
13. (d) 14. (a) 15. (c)
 Probability Introduction  251
1. (d) Probability of being even in 1st 1
1 1 1 required probability is 150/300 = 2
and odd in 2nd is 2 × 2 = 4 and .
probability of being odd in 1st and Alternately
1 1 1
even in 2nd is 2 × 2 = 4 Here we have two cases:
1 1 1 Case (i) 1st selected students is boy and
So required probability is + = 2nd student is a girl then required
4 4 2
10 15 10 × 15
2. (c) Probability that a die will show prime probability is × =
1 25 24 25 × 24
is 3/6 = 2 and required probability Case (ii) 1st selected students is girl and
1 1 1 2nd student is a boy then required
is 2 × 2 = 4 15 10 10 × 15
probability is × =
3. (a) Probability that a die will show 25 24 25 × 24
prime or odd is 4/6 =2/3 and required So required probability is
probability is 2/3 × 2/3 = 4/9
10 × 15 10 × 15  10 × 15 
4. (d) Probability that a die will show +  = 2×
1 25 × 24 25 × 24  25 × 24 
prime is 3/6 = . Required probability
2 300 1
= =
1 1 1 3 600 2
= + − =
2 2 4 4
5. (c) Number of two digit numbers is 9.
(c) Out of 10 boys and 15 girls, 3 boys and
90. Hence sample space has 90 2 girls can be selected in 10C3 × 15C2 =
elements and number of two digit 10 × 9 × 8  15 × 14 
prime number is 21. Hence required  ×  = 120 × 105
 6   2 
probability is 21/90 = 7/30 ways and 5 students can be selected
6. (b) Number of two digit numbers is out of 25 students in 25C5 ways
90. Hence sample space has 90 25 × 24 × 23 × 22 × 21
elements and number of two digit =
120
prime number is 21 and number = 5 × 23 × 22 × 21 ways
of two digit perfect square number
is 6 hence number of elements in so required probability is
favorable case is 21+6 = 27 hence 120 × 105 60 60
= =
required probability is 27/90 = 3/10 5 × 23 × 22 × 21 23 × 11 253
7. (a) Number of boys is 10. Hence 1 boy can 10. (b) Out of 10 boys and 15 girls, we have
be selected in 10C1 ways = 10 ways. to select at least 3 boys hence we
Sample space is equal to selection of have the following cases-
1 student out of 25 students and that Case (i) Number of boys is 3 and number
can be done in 25C1 = 25 ways. Hence of girls is 2 then number of ways is
required probability is 10/25 = 2/5 10C × 15C = 120 × 105
3 2
8. (d) Out of 10 boys and 15 girls, 1 boy and Case (ii) Number of boys is 4 and
1 girl can be selected in 10C1 × 15C1 = number of girl is 1 then number of
10 × 15 = 150 ways and two students ways is 10C4 × 15C1 = 210 × 15 =
can be selected out of 25 students in
25C ways = 25 × 24/2 = 300 ways so Case (iii) Number of boys is 5 then
2
number of ways is 10C5 = 36 × 7
252  Theory of Counting
So total number of ways of selecting In other words here sample space
at least 3 boys is 120 × 105 + 210 × n(S) = 16, favorable event n(E) = 3
15 + 36 × 7 = (1800 + 450 + 36) × 7 = and n(E′) = 13. Hence odd against that
2286 × 7 event is n(E′)/n(E) = 13/3
5 students can be selected out of 25 12. (a) In this case sample space n(S) = 16,
students in 25C5 ways favorable event n(E) = 3 and n(E’) = 13
hence odds against that event is
25 × 24 × 23 × 22 × 21
=   n(E)/n(E’) = 3/13
120
13. (d) From the definition of odds against
= 5 × 23 × 22 × 21 an event E is n(E’)/n(E) = 5/11 so
= so required probability is n(E) = 11 and n(S) = 5+11 = 16, so
  P(E) = n(E)/n(S) = 11/16
2286 × 7 762
= 14. (a) From the definition of odds in favor
5 × 23 × 22 × 21 5 × 23 × 22 of an event E is n(E)/n(E’) = 5/11 so
381 381 n(E) = 5 and n(S) = 5+11 = 16, so
= =
5 × 23 × 11 1265   P(E) = n(E)/n(S) = 5/16
15. (c) Total number of balls is 30, and
11. (b) Out of every 16 events 3 are favorable number of balls that are either white
and events not favorable is 13. Hence or black or green is 11+7+5 = 23, so
odd against the event is 13/3 required probability is 23/30
Concept Cracker (CC)
1. (a) 2. (c) 3. (b) 4. (a) 5. (b) 6. (a)
7. (b) 8. (b) 9. (c) 10. (d) 11. (b) 12. (a)
13. (a) 14. (a) 15. (a)

1. (a) Sample space in this case is 6 × 6 = 36
Sum of two result is a prime number
we have following cases-
Case (i) if sum is 2 then we have only
one option (1, 1)
Case (ii) If sum is 3 then we have
following 2 cases (1, 2) and (2,1)
Case (iii) If sum is 5 then we have
following 4 cases (1, 4), (2, 3), (3,2)
and (4,1)
Case (iv) If sum is 7 then we have
following 6 cases (1, 6), (2, 5), (3,4),
(4,3), (5,2) and (6,1)
Case (v) If sum is 11 then we have
following 2 cases (5, 6), and (6,5)
So total number of ways is
1+2+4+6+2 = 15
So required probability is
15/36= 5/12
2. (c) Sample space in this case is
  6 × 6 = 36
Sum of two results is a perfect square
number we have following cases-
Case (i) If sum is 4 then we have following
3 cases (1, 3), (2, 2) and (3,1)
Case (ii) If sum is 9 then we have
following 4 cases (3, 6), (4, 5), (5, 4)
and (6,3)
So total number of ways is 3 + 4 = 7
So required probability is 7/36
3. (b) Sample space in this case is
  6 × 6 = 36
Sum of two results is equal numbers
we have following 6 cases- (1, 1),
(2, 2), (3, 3), (4, 4), (5, 5), (6, 6) so
total number of ways is 6/36 = 1/6
4. (a) Here in this case sample space has
23 elements.
 Probability Introduction  253
In the given range numbers that are selected in 4C1 × 6C1 ways such that
either multiple of 5 or 7 is 5, 7, 10, one of them is red and the other is
14, 15, 20 and 21 i.e total 7 numbers white hence required probability is
so total 23 – 7 = 16 numbers neither
multiple of 5 nor that of 7. Hence 4×6×2 8
=
required number of ways is 16/23.   10 × 9 15
5. (b) Sample space in this case is 12. (a) Total number of fruits is 6 + 4 + 8
  6 × 6 = 36 = 18, so three fruits can be selected
Sum of two results is a perfect square in 18C3 ways and that represents the
number we have following cases- sample space.
Case (i) If sum is 10 then we have 3 apples can be selected out of 6 in
6C ways so required probability is
following 3 cases (4, 6), (5, 5) and 3
(6,4) 6
C3 6×5×4 5
= =
Case (ii) If sum is 11 then we have 18
C3 18 ×17 × 16 204
following 2 cases (5, 6), and (6,5)  
Case (iii) If sum is 12 then we have Alternately:
following 1 case (6, 6) Probability that 1st one is apple is
So total number of ways is 6/18, 2nd one apple is 5/17 and 3rd one
apple is 4/16 so required probability
  3 + 2 + 1 = 6
6×5×4 5
So required probability is 6/36 = 1/6 is =
18 × 17 × 16 204
6. (a) Since a leap year has 52 weeks and
13. (a) Probability that none of them will
2 days hence required probability is
appear tail is (1/2)5 = 1/32
2/7
So required probability that at least
7. (b) Since a non leap year has 52 weeks
one tail will appear is 1 – 1/32 = 31/32
and 1 day hence required probability
is 1/7 14. (a) Out of 12 students 5 can be selected
in 12C5 = (12 × 11 × 10 × 9 × 8)/120 =
8. (b) Probability of getting a head in a
792 ways and the number of ways of
single throw is 1/2 hence required selecting 3 girls and 2 boys is 6C3 ×
probability is (1/2)(1/2)(1/2) = 1/8 6C = 20 × 15 = 300.
2
9. (c) Probability of getting a head in a So required probability is 300/792 =
single throw is 1/2 hence required 75/198
probability is 3(1/2)(1/2)(1/2) = 3/8 15. (a) From the definition odds in favor
of an event is n(E)/n(E′) and odds
10. (d) Here sample space is selecting 2 out against an event is n(E′)/n(E) and
of 10 i.e10C2and 2 red balls can be from the given information is
selected in 4C2 ways hence required  n(E) 
 
4
C 4 ×3 2  n(E′ )  = 9   or n(E) = 3
probability is 10 2 = =  n(E′ )  25 n(E′ ) 5
C2 10 × 9 15  
 n(E) 
11. (b) Here sample space is selecting 2
out of 10 i.e 10C2 and 2 balls can be hence required probability is 3/8
254  Theory of Counting
Part B

Concept 1 Introduction and Properties of Sets

Operations of Sets Properties of Intersection:

Union of Sets: Union of two or more sets is
the set of all elements that belong to any one
of the sets or present in both of them. The
symbol used for union of sets is ‘∪’ i.e.
A ∪ B = Union of set A and set.
Example: A = {1, 2, 3, 4} and B = {2, 4, 5, 6}
then A ∪ B = {1, 2, 3, 4, 5, 6}
Properties of Union:
A∪B=B∪A
A∪A=A
A ∪ U = U, where U is the universal set
A ∪ Φ =A
A ⊂ A∪ B and B ⊂ A ∪ B
If B ⊆ A, then A ∪ B = A
A ∪ (B ∪ C) = (A ∪ B) ∪ C, this is known as
associative law
A∩B=B∩A
A∩A=A
If A and B are disjoint sets then A ∩ B = Φ
A∩Φ=Φ
(A ∩ B) ⊆ A and (A ∩ B) ⊆ B
A ∩ (B ∩ C) = (A ∩ B) ∩ C, i.e., associative law
Properties of Difference of Sets:
A–B≠B–A
A – B ⊆ A and B – A ⊆ B
A–Φ=A
(A – B) ∪ B = A ∪ B and (A – B) ∩ B = Φ
Complement of a Set:
The complement of a set A is the set of elements
which do not belong to A, in other words, U – A.
Symbolically, denoted as, Ac or A′
A′ = {x|x∈ U, x ∉ A} = U – A

Concept 2 Probability

The probability of occurrence of an event E is Here n(E) represents number of elements in

denoted by P(E) and is defined as - E = number of cases favorable to event E and
n (E) n(S) represents number of elements in Sample
P  (E) = space S = total number of cases
n (S )

 Probability Introduction  255

Concept 3 Properties of Probability

Property 1: Probability of occurrence of an Property 2: If E is any event and E' be the

event is a number lying between 0 and 1 complement of event E, then P(E) + P(E') = 1

Concept 4 Odds in Favor & Against

Consider a random experiment, S be its sample Odds against an Event E

space and E be an event . Let E′ denote the
Odds against an event E = n(E′)/n(E)
complement of event E, then we know that
n(E) + n(E′) = n(S) and P(E) + P(E′) = 1  n (E ')
• Odds in favor of event E  
 n (S )  = P (E ')
Odds in favor of event E is defined as =
 n (E) P (E)
 n (E)  
   n (S )
n (E)  n (S ) P (E)
= = = If odds in favor of an event is ‘F’ and against
n (E’)  n (E’) P (E’)
  an event is ‘A’ then F × A = 1
 n (S ) 
256  Theory of Counting
1
Concept Deviator (CD)
Ideal Time Revise your concept (IIT advance or
5 Min.
Per Question
1. Four fair dice D1, D2, D3 and D4, each
having six faces numbered 1, 2, 3, 4, 5
and 6, are rolled simultaneously. The
probability that D4 shows a number
appearing on one of D1, D2 and D3 is:
[IIT JEE 2012]
(a) 91/216 (b) 108/216
(c) 125/216 (d) 127/216
Direction (Qs. 2 and 3):
Let U1 and U2 be two urns such that U1
contains 3 white and 2 red balls , and U2
contains only 1 white ball. A fair coin is
tossed. If head appears then 1 ball is drawn at
random from U1 and put into U2. However if
tail appears then 2 balls are drawn at random
from U1 and put into U2. Now 1 ball is drawn
at random from U2.
2. The probability of the drawn ball from
U2 being white is (IIT JEE 2011)
(a) 13/30 (b) 23/30
(c) 19/30 (d) 11/30
3. Given that the drawn ball from U2 is
white, the probability that head appeared
on the coin is (IIT JEE 2011)
(a) 17/23 (b) 11/23
(c) 15/23 (d) 12/23
4. Let ω be a complex cube root of unity with
ω ≠ 1. A fair die is thrown three times. If
r1, r2, and r3 are the numbers obtained
on the die , then the probability that ω r1
+ ω r2 + ω r3 = 0 is [IIT JEE 2010]
(a) 1/18 (b) 1/9
(c) 2/9 (d) 1/36
tougher questions)
5. Following question contains
STATEMENT − 1 (Assertion) and
STATEMENT – 2 (Reason).
It has 4 choices (a), (b), (c) and (d) out of
which ONLY ONE is correct. Select the
correct one- [IIT JEE 2007]
Let H1, H2, …, Hn be mutually exclusive
and exhaustive events with P(Hi) > 0,
i = 1, 2, …, n. Let E be any other event
with 0 < P(E) < 1.
STATEMENT -1: P(Hi|E) > P(E | Hi).
P(Hi) for i = 1, 2, …, n
because n
STATEMENT -2: P (Hi )=1
∑
i=1
(a) Statement–1 is True, Statement
–2 is true; Statement-2 is a correct
explanation for Statement-1
(b) Statement–1 is True, Statement–2 is
True; Statement-2 is NOT a correct
explanation for Statement-1
(c) Statement–1 is True, Statement–2
is False
(d) Statement–1 is False, Statement–2
is True
Direction (Qs. 6 to 8):
There are n urns each containing n + 1 balls
such that the ith urn contains i white balls
and (n + 1 − i) red balls. Let ui be the event of
selecting ith urn, i = 1, 2, 3 …, n and w denotes
the event of getting a white ball.

6. If P(ui) α I, where I = 1, 2,3 … n then
lim P( w) is equal to   [IIT JEE 2006]
n→∞
(a) 1 (b) 2/3
(c) 3/4 (d) 1/4
7. If P(ui) = c, where c is a constant ∀i then
P(ui/w) is equal to [IIT JEE 2006]
(a) 2/(n+1) (b) 1/(n+1)
(c) n/(n+1) (d) 1/2
8. If n is even and E denotes the event of
choosing even numbered urn ( P(ui) =
1/n) , then the value of P(ui / E) is
[IIT JEE 2006]
(a) (n+2)/(2n+1) (b) (n+2)/2(n+1)
(c) n/(n+1) (d) 1/(n+1)
9. If P(B) = 3/4, P(A∩B∩C′) = 1/3 and
P(A′∩B∩C′) = 1/3 then P(B∩C) is, where
A, B, C are in 3 events. [IIT JEE 2003]
(a) 1/12 (b) 1/6
(c) 1/15 (d) 1/9
10. Two numbers are selected randomly
from the set S = {1, 2, 3, 4, 5, 6} without
replacement one by one. The probability
that minimum of the two numbers is less
than 4 is [IIT JEE 2003]
(a) 1/15 (b) 14/15
(c) 1/5 (d) 4/5
11. A person has to go through three
successive tests. Probability of his passing
first exam is P. Probability of passing
successive tests is P or P/2 according
as he passed the last test or not. He is
selected if he passes at least two tests.
Find the probability of his selection.
[IIT JEE 2003]
(a) P2(1 – P) (b) P2(2 – P)
(c) P2(3 – P) (d) None of these
12. What is the probability that three girls
and nine boys can be seated in two vans
Probability Introduction  257
each having numbered seats, 3 in front
and 4 at the back such that 3 girls sit
together at the back row of a van?
[IIT JEE 1996]
(a) 9/91 (b) 4/91
(c) 1/91 (d) None of these
13. Two fair dice are thrown what is the
probability that 1st die will show 4 and
2nd one will not show 4?
(a) 1/6 (b) 5/12
(c) 5/36 (d) None of these
14. Two fair dice are thrown. What is the
probability that summation 12 will
appear on 12th throw?
3511 3511
(a) (b)
3612 3611
3510
(c) (d) None of these
3612
15. 3 people are select at random from a
large population. What is the probability
that they all have the same birthday (for
non leap year)?
1 1
(a) 2
(b)
365 3653
2
(c) (d) None of these
365
16. A box contains 2 black, 4 white and 3
red balls. One ball is drawn at random
from the box and kept aside. From the
remaining balls in the box, an- other ball
is drawn at random and kept beside the
first. The process is repeated till all the
balls are drawn from the box. Find the
probability that the balls drawn are in
the sequence 2 black, 4 white and 3 red.
[IIT JEE 1978]
(a) 1/630 (b) 1/1260
(c) 1/2520 (d) None of these
258  Theory of Counting
17. Two events A and B have probabilities of
0.25 and 0.50 respectively. The probability
that both A and B occurs simultaneously
is 0.14. Then the probability that neither
A nor B occurs is    [IIT JEE 1980]
(a) 0.39 (b) 0.25
(c) 0.11 (d) none of these
18. An anti-aircraft gun can take a maximum
of four shots at an enemy plane moving
away from it. The probabilities of hitting
the plane at the first, second, third and
fourth shot are 0.4, 0.3, 0.2 and 0.1
respectively. What is the probability that
the gun hits the plane?  [IIT JEE 1981]
(a) 0.3024 (b) 0.2349
(c) 0.6976 (d) None of these
19. A determinant is chosen at random from
the set of all determinants of order 2 with
elements 0 or 1 only. The probability
that the value of the determinant chosen
is positive is. [IIT JEE 1982]
(a) 0.3024 (b) 0.2349
(c) 0.6976 (d) None of these
20. A and B are two candidates seeking
admission in IIT. The probability that A
is selected is 0.5 and the probability that
both A and B are selected is at most 0.3.
What is the maximum value of probability
of B getting selected?    [IIT JEE 1982]
(a) 0.7 (b) 0.8
(c) 0.6 (d) None of these

1. a b c d 2. a b c d 3. a b c d 4. a b c d 5. a b c d
6. a b c d 7. a b c d 8. a b c d 9. a b c d 10. a b c d
11. a b c d 12. a b c d 13. a b c d 14. a b c d 15. a b c d
16. a b c d 17. a b c d 18. a b c d 19. a b c d 20. a b c d

2
Concept Eliminator (CE)
Ideal Time Revise your concept (Maths Olympiad
Just solve it or tougher questions)

1. This question is Based on Maths Olympiad
A bag contains 8 white balls and 2 red
balls. Each time one ball is drawn and
replaced by a white one.
Then the probability of drawing out all of
the red balls just in the fourth draw is-
(a) 434/10000 (b) 234/10000
(c) 334/10000 (d) None of these
2. This question is Based on Maths Olympiad
Nine numbered chits, numbered 1, 2,,,,9,
were put into a packet. Now A draws a ball
from the packet, noted that it is of number
a ,and puts back it. Then B also draws a
ball from the packet and noted that it is
of number b. Then the probability for the
inequality a – 2b + 10 > 0 to hold is:
(a) 53/81 (b) 61/81
(c) 62/81 (d) 65/81

3. If A, B, C are events such that P(A) = 0.3,
P(B) = 0.4, P(C)= 0.8
P(A ∩ B) = 0.08, P(A ∩ C) = 0.28
P(A ∩ B ∩ C) = 0.09
If P(A ∪ B ∪ C) ≥ 0.75, then find the range
of x = P(B ∩ C) lies in the interval
(a) 0.23 ≤ x ≤ 0.48
(b) 0.23 ≤ x ≤ 0.47
Probability Introduction  259
5. Three identical dice are rolled. The
probability that the same number will
appear on each of them is
(a) 1/6 (b) 1/36
(c) 1/18 (d) 3/28
6. If M and N are any two events, the
probability that exactly one of them
occurs is

(c) 0.22 ≤ x ≤ 0.48 (a) P(M) + P(N) – 2P( M ∩ N)

(d) None of these (b) P(M) + P(N) – P(M ∩ N)′

4. Fifteen coupons are numbered 1, 2, …, (c) P(M′) + P(N′) – 2P (M′ ∩ N′)

15 respectively. Sevens coupons are (d) P(M ∩ N′) + P (M′ ∩ N)
selected at random one at a time with 7. A box contains 100 tickets numbered 1, 2,
replacement. The probability that the … 100. Two tickets are chosen at random.
largest number appearing on a selected It is given that the maximum number on
coupon as 9, is the two chosen tickets is not more than
6 7 10. The minimum number on them is 5
 9  8
(a)   (b)   with probability is
 19   15 
7 (a) 7/15 (b) 3/5
 3
(c)   (d) None of these
 5 (c) 13/15 (d) None of these

Response Grid
1. a b c d 2. a b c d 3. a b c d 4. a b c d 5. a b c d
6. a b c d 7. a b c d
260  Theory of Counting

Solutions
Concept Deviator (CD)
1. (a) 2. (b) 3. (d) 4. (c) 5. (d) 6. (b)
7. (a) 8. (b) 9. (a) 10. (d) 11. (b) 12. (c)
13. (c) 14. (a) 15. (a) 16. (b) 17. (a) 18. (c)
19. (d) 20. (b)

1. (a) In this case sample space is n(S) × 2/3) = 23/30

= 6 × 6 × 6 × 6 = 64 3. (d) From conditional probability

Let E be the event that D4 shows a P(H/W) = (P(W/H) × P(H)) / P(W/T) .

number appearing on one of D1, D2 P(T) + P(W/H). P(H) = 12/23
and D3 4. (c) Required probability :
Then n(E′) = 6 × 5 × 5 × 5
3! × 2 C 1 × 2 C 1 × 2 C 1
= 2/9
So P(E′) = (6 × 5 × 5 × 5)/(6 × 6 × 6 × 6) 6×6×6
= 125/216 5. (d) From statement 1, P(H∩E) = 0 then
P(Hi/E) = P(E/Hi) = 0
Hence P(E) = 1–P(E′) = 1–125/216
And if P(H∩E) ≠ 0 then
= 91/216
P(Hi/E) = P(Hi∩E)/P(Hi) × P(Hi)/P(E)
2. (b) As per the given condition if outcome
> P(E/Hi) × P(Hi)
is H – 1 ball from U1 to U2
Since 0 < P(E) < 1
And if outcome is T – 2 ball from U1
to U2 So statement 1 is not always true,
while 2 is true
E : 1 ball drawn from U2
6. (b) Since P(ui) α i or P(ui) α ki and
P(W from U2 ) = 1/2 × ( 3/5 × 1 ) + 1/2
∑P (ui )=1
× (2/5 × 1/2) +1/2 × ( 3C2/5C2 ) + 1/2 ×
hence k = 2/n(n+1)
(2C2/5C2 × 1/3) + 1/2 × ( 3C1 . 2C1 / 5C2
 Probability Introduction  261
n So total probability
2i 2
And lim P( w) = lim ∑
n→∞ n→∞ i = 1 n (n + 1)2 = P 3 +  2 P 2 (1 − P ) =  P 2 (2 − P )

2 n(n + 1)(2 n + 1) 2 12. (c) 3 girls can be seated at the back row
= lim =
in 2 × 2(3!) ways, and remaining 9
n→∞ 6n(n + 1)2 3
boys can be arranged on remaining
 n  11 seats in (11P9) ways
c 
 n + 1 = 2
7. (a) Since P(ui/w) =
( )
 ∑i  n + 1
c
so total number of ways is 2 × 2(3!)
 (11P9) = 12!
n + 1
 
8. (b) Here we need to find P(W/E) Total number of ways is (14!)/2

2 + 4 + 6 + .. + n n+2 So probability is (12!)/{14!)/(2!)} = 1/91

= =
 n (n + 1) 2 (n + 1) 13. (c) Sample space is 6 × 6 = 36
 
 2 
And favorable case is (3, 1) (3, 2), (3, 4),
9. (a) We know that P(B∩C) (3, 5) and (3, 6)

= P(B) – P(A∩B∩C′) – P(A′∩B∩C′) So required probability is 5/36

= (3/4) – (1/3) – (1/3) = 1/12 Alternately:

10. (d) Sample space is (2!)(6C2) = 30,
Favorable cases are 24 so required
probability is 24/30 = 4/5
11. (b) As per the given condition Person is
selected if either he passes all the
three tests or he passes exactly two
of the tests.
Probability for 1st dice is 1/6 and that
for 2nd dice is 5/6 since these two
are independent events so required
probability is (1/6)(5/6) = 5/36
14. (a) Probability of getting summation as
12 is 1/36 and not getting sum as 12
is 35/36.

Probability that he passed all the Since summation 12 appeared on

three tests is P×P×P = P3 12th throw so till 11th throw each

throw result in a summation which
Now We need to find the probability of
is not 12 so required probability
passing the two tests
11 11
 35   1  35
 P  P =      = 12
P 2 (1 − P )+  P   (1 − P )+  (1 − P )  P    36  36 36
 2  2
=  2 P 2 (1 − P )
262  Theory of Counting
15. (a) Let 1st guy has any birth day
Say 20th Dec- then for 2nd guy
probability is 1/365 and for 3rd guy
it is 1/365 and required probability
 1  1  1
is     =
 365   365  3652
16. (b) Probability that 1st two balls are
black is (2/9)(1/8)
Probability that next 4 balls are
4 3 2 1
white is        
 7   6  5  4
Remaining must be red, hence
required probability is
 2   1  4   3  2   1 
            =
9 8 7 6 5 4
17. (a) As per the given condition
P(A) = 0.25, P(B) = 0.50 and P(A∩B) = 0.14
And P(A∪B) = P(A) + P(B) – P(A∩B)
= 0.25 + 0.50 – 0.14 = 0.61
Concept Eliminator (CE)
1. (a) 2. (b) 3. (a) 4. (d) 5. (b) 6. (a,c,d)
7. (c)
Hence required probability is
P(A∪B)′ = 1 – P(A∪B) = 1–0.61 = 0.39
18. (c) Probability that none of them hit the
plane is (1–0.4)(1–0.3)(1–0.2)(1–0.1)
= 0.6 × 0.7 × 0.8 × 0.9 = 0.3024
So required probability is 1 – 0.3024
= 0.6976
19. (d) In this case sample space is 24 = 16
Number of determinant with positive
values is 3
Required probability is 3/16
20. (b) As per the given information P(A) = 0.5
1
Probability that both A and B are
1260
selected is P(A ∩ B) ≤ 0.3
P(A) + P(B) – P(A ∪ B) ≤ 0.3
P(B) ≤ 0.3 + P(A∪B) – P(A)
≤ P(A∪B) – 0.2
So P(B) ≤ 0.8
 Probability Introduction  263
1. (a) In this case we have three cases-

1st 2nd 3rd 4th

Probability
draw draw draw draw

Case 1 Red White White Red  2  9  9  1  162
        =
10 10 10 10 10000

Case 2 White Red White Red  8  2  9  1  144
        =
10 10 10 10 10000

Case 3 White White Red Red  8  8  2  1  128
        =
10 10 10 10 10000
Total
434/10000
Probability

2. (b) Total number of outcome in two Total number of favorable cases

draw is 9 × 9 = 81,
Given inequality is a – 2b + 10> 0 or
2b < 10 + a
Now we have following cases-
Case (i) if b = 1, 2, 3, 4 or 5 then b can
take any value from 1 to 9 and it
will satisfy the given inequality, so
number of favorable cases is 9 × 5
= 45
Case (ii) If b = 6, then a can take any
value from 3 to 9 i.e 7 values.
Case (iii) If b = 7, then a can take any
value from 5 to 9 i.e 5 values.
= 45 + 7 + 5 + 3 + 1= 61
So required probability = 61/81
3. (a) Since P(A∪B∪C) = P(A) + P(B) +P(C)
– P(A ∩ B) – P(B∩C) – P(C ∩ A) +
P(A ∩ B ∩ C)
Or P(A∪B∪C) = 0.3+0.4+0.8 – (0.08
+0.28 + P(B ∩ C)) + 0.09
= 1.23 – P(B ∩ C)
Or P(B ∩ C) = 1.23 – P(A∪B∪C)
But we know that 0 ≤ P(A∪B∪C) ≤ 1
Hence 0.23 ≤ P(B ∩ C) ≤ 0.48
4. (d) Here sample space is 157

Case (iv) If b = 8, then a can take any Favorable cases are (97 – 87)
value from 7 to 9 i.e 3 values. 97 – 87
So required probability is
Case (v) If b = 9, then a can take only 157
one value i.e 9.
264  Theory of Counting
5. (b) Sample space is 66
Number of favorable case is 6C1 = 6
So required probability
 6  1 a number ‘a’ on the two tickets is
=  =
 216  36
6. (a,c & d) As per the given condition exactly
one of M and N occur so
Option (a) P(M) + P(N) – 2P(M∩N) is
correct
And Option (c) is correct P(M′) +
P(N′) – 2P (M′ ∩ N′)
7. (c) let assume that E be the event that
has maximum number on the two
chosen tickets is not more than 10,
that is the no. on them ≤ 10 and D
the event that the minimum no. on
them is 5 that the minimum no. on
them is 5 that is the no. on them is
≥ 5. We have to find P (E/D).
Now P(E/D) = P(E ∩ D) / P(E)
= n(E ∩ D) / n(E)
Now the number of ways of getting
coefficient of xa in the expansion of
(x1 + x2 +…+ x100)2 = x2 (1 + … + x99)2
= x2 [(1 – x100)/(1 – x)]2 = x2 (1 – 2x100
+ x200) (1 – x)-2
Now, x2(1 – 2x100 + x200)(1 + 2x +3x2
+ 4x3 + …)
Thus , co eff. of x2 = 1, of x3 = 2, of x4 = 3
of x10 = 9
Hence ,
n(E ∩ D) = 4 + 5 + 6 + 7 + 8 + 9 = 39
N(E) = 1 + 2 + 3 + 4 + … + 9 = 45
Therefore , required probability
= P(D/E) = 39/45 = 13/15
 10
Dependent and Independent Events  265

Dependent and
Independent Events

Topics Covered

 Dependent & Independent Events

 Addition Theorems of Probability

Part A: Topic Number of Questions

Solved Example 10
Concept Applicator 20
Concept Builder 16
Concept Cracker 20
Part B: Topic Number of Questions
Concept Deviator 15
Concept Eliminator 5
Total 86
266  Theory of Counting
Part A
Dependent and
Concept 1 Independent Events
Two or more events of an experiment are
said to be independent if occurrence or
non- occurrence of any one of them does not
affect the probability of occurrence or non-
occurrence of other event.
Consider A and B as two independent
events then probability of event B i.e P(B) is
completely independent from event A i.e P(A)
Let us take some examples to understand it—
Examples :
(i) When a fair coin is tossed twice, the event
of occurrence of ‘Tail’ in the first throw
and the event of occurrence of ‘Head’ in
the second throw are independent events,
in other word result of 1st coin has no
relation with the result of 2nd coin.
(ii) When two dice are thrown then
probability of getting an odd number
from 1st die and even number from 2nd
die is independent from each other
(iii) Let a bag contain 10 red and 5 black
balls. Two balls are drawn one by one
with replacement, then probability of
getting a red ball in 2nd draw depends
on the result of 1st draw hence these two
results are dependent events.
QR Code / Video Link
For Smart phone/ Tablet users
Video Link for Desktop/Laptops users http://dishapublication.com/video-resources
Properties of Independent events
Consider two independent events A and B:
• A and B′ are independent events
• A′ and B′ are independent events
• A′ and B are independent events
• For two independent events
P(A ∩ B) = P(A) × P(B)
• P (A ∪ B) = 1 – P(A′) P(B′)
Example 1:  Consider two independent
events A and B such that P(A) = 1/4
and P(B) = 1/3 then find the value of
P(A ∩ B).
Solution:  We know that for two independent
events P( A ∩ B) = P(A) × P(B) = (1/4)(1/3) = 1/12.
Example 2:  Consider two independent
events A and B such that P(A) = 1/4 and
P(B) = 1/3 then find the value of P(A ∪ B).
Solution:  We know that for two independent
events P( A ∩ B) = P(A) × P(B) = (1/4)(1/3) = 1/12.
Then P(A ∪ B) = P(A) + P(B) – P( A ∩ B) =
(1/4) +(1/3) – (1/4)(1/3) = 1/2.
Example 3:  Consider two independent
events A and B such that P(A) = 1/4 and
P(B) = 1/3 then find the value of P(A′ ∩ B′)
Solution:  We know that for two independent
events P(A ∪ B) = 1 – P(A′) P(B′) or P(A′)
P(B′) = 1 – (1/2) = 1/2
 Dependent and Independent Events  267
Example 4:  If two die are thrown
simultaneously then what is the
probability that 1st one will show
a prime while 2nd one will show a
composite number?
Solution:  Result from 1st dice and that from
2nd are independent from each other.
Hence we can use P( A ∩ B) = P(A) × P(B).
Addition Theorems
Concept 2 of Probability
If A and B be any two events in a sample
space S of an experiment, then the probability
of occurrence of at least one of the events A
and B is given by
P ( A ∪ B ) = P (A) + P (B) – P (A ∩ B)
Representation of Union of Sets
A B
From the set theory we know that:
n( A ∪ B ) = n(A) + n (B) – n ( A ∩ B )
Dividing both sides by n (S), we get
n(A  B) n(A) n(B) n(A  B)
  –
n(S) n(S) n(S) n(S)
Or P(A ∪ B) = P(A) + P(B) – P (A ∩ B)
Let P(A) = Probability of getting a prime number
= (3/6) = (1/2)
Let P(B) = Probability of getting a composite
number = (2/6) = (1/3)
So required probability
P(A ∩ B) = P(A) × P(B)= (1/2)(1/3) = 1/6.
Intersection of Sets
It is the set of all the elements, which are
common to all the sets. The symbol used for
intersection of sets is ‘∩’ i.e.
A ∩ B = {x| x ∈A and x ∈ B}.
Example: If A = {1, 2, 3, 4} and B = {2, 4, 5, 6}
then A ∩ B = {2, 4}
Properties of Intersection:
A∩B=B∩A
A∩A=A
If A and B are disjoint sets then A ∩ B = Φ
A∩Φ=Φ
(A ∩ B) ⊆ A and (A ∩ B) ⊆ B
A ∩ (B ∩ C) = (A ∩ B) ∩ C,
i.e., associative law
A B
268  Theory of Counting
Some more properties
(i) If A and B are mutually exclusive events,
then A ∩ B = φ and hence
P( A ∩ B ) = 0
\ P(A ∪ B) = P (A) + P(B)
(ii) Two events A and B are mutually exclusive
if and only if
P(A ∪ B) = P(A) + P(B)
(iii) Two events A and B are mutually
exclusive and collectively exhaustive if
and only if
P(A ∪ B) = P(A) + P(B) = 1
(iv) P(A′) = 1 – P(A)
Addition theorem for three events
Consider three events A, B and C in a sample
space S then from the addition theorem-
P( A ∪ B ∪ C) = P(A) + P(B) + P(C)
– P(A ∩ B) – P(B ∩ C)
– P(A ∩ C) + P(A ∩ B ∩ C)
Proof: From set theory, we know that
n(S) = n(A) + n(B) + n(C) – n(A ∩ B)
– n( B ∩ C) – n(A ∩C) + n ( A ∩ B ∩ C)
Dividing both sides by n (S), we get
n( A  ∪  B ∪  C ) n( A ) n( B ) n(C )
  
n(S ) n(S ) n(S ) n(S )
n( A  ∩  B ) n( B ∩  C )
– –
n(S ) n(S )
n( A ∩ C ) n( A  ∩ B ∩ C )
– 
n(S ) n(S )
\ P(A ∪ B ∪ C) = P(A) + P(B) + P(C) – P( A ∩ B)
– P(B ∩ C) – P(A ∩ C) + P( A ∩ B ∩ C).
QR Code / Video Link
For Smart phone/ Tablet users
Video Link for Desktop/Laptops users
If A, B, C are mutually exclusive events, then
A ∩ B = φ, B ∩ C = φ, A ∩ C = φ, A ∩ B ∩ C = φ
\ P(A ∪ B ∪ C) = P(A) + P(B) + P(C)
Example 5:  If probability that A can solve
a question is 2/3 and that B can solve
the same problem is 4/5, if both of them
attempted this question then what is
the probability that none of them is
able to solve that question?
Solution:  Since probability that A can solve
that question is P(A) = 2/3
Hence P(A′) = 1/3 and similarly P(B′) = 1/5.
So probability that none of them can solve the
question is 1/3 × 1/5 = 1/15.
Example 6:  If probability that A can
solve a question is 2/3 and that B can
solve the same problem is 4/5, if both
of them attempted this question then
what is the probability that question
is solved?
Solution:  This case is complement of the
previous case, so required probability
= 1 – 1/15 = 14/15
Example 7:  Probability that A will pass
the exam is 1/2, B will pass the exam
is 2/3 and C will pass the exam is 3/4,
what is the probability that exactly
one of them will pass the exam?
Solution:  Since P(A) = 1/2. So, P(A′) = 1/2,
P(B) = 2/3. So, P(B′) = 1/3 and P(C) = 3/4
so P(C′) = 1/4
http://dishapublication.com/video-resources
 Dependent and Independent Events  269
Exactly one of them will pass the exam so
required probability is P(A)P(B′)P(C′) + P(A′)
P(B)P(C′) + P(A′)P(B′)P(C) = (1/2)(1/3)(1/4) +
(1/2)(2/3)(1/4) + (1/2)(1/3)(3/4) = 6/24= 1/4
Example 8:  Gargy speaks the truth in 60%
cases while Ashmeet speaks the truth
in 90% of the cases. In what percentage
of cases they are likely to contradict
each other is stating the same fact?
Solution:  There are two cases when they will
contradict each other-
Case (i) When Gargy is speaking truth and
Ashmeet is lying then probability is (6/10)
(1/10) = 6/100.
Case (ii) When Gargy is lying and Ashmeet is
speaking truth then probability is
(4/10)(9/10) = 36/100.
Required probability
= 6/100 + 36/100 = 42/100 = 42%
Example 9:  Kushal and Karina is playing
a game “Pahle Tum, Pahle Tum” in
which they throw a coin alternately till
one of them gets a ‘head’ and wins the
game. Find the probability that Kushal
wins the game if he started the game?
1
Concept Applicator (CA)
Ideal Time
20 Min.
1. If P(A) = 2/11, P(B) = 2/5 and P(A ∩ B)
= 1/5 then find the value of P(A ∪ B)
(a) 23/55 (b) 19/55
(c) 21/55 (d) None of these
2. If P(A) = 2/11, P(B) = 2/5 and P(A∩B)
= 1/5 then find the value of P(A′∩B′)
(a) 34/55 (b) 37/55
(c) 21/55 (d) None of these
Solution:  Probability of getting a ‘head’ is
P(H) = 1/2
It is given that Kushal started the game and
he wins the game in the following number of
tosses-
Case (i) Number of toss is 1- the probability
is 1/2.
Case (ii) Number of toss is 3- This is possible
when Kushal didn’t get ‘head’ in 1st throw,
Karina didn’t get ‘head’ in 2nd throw and
then finally Kushal get ‘head’ in 3rd throw so
probability in this case
= (1/2)(1/2)(1/2) = 1/8.
Case (iii) Number of toss is 5- similar to above
case probability in this case is 1/32.
So total probability that Kushal wins the
1
 1  1  1  2
game =    +    +    + …∞  = 2 =
 2   8   32  1 3
1−
4
Example 10:  In the above question what
is the probability that Karina will win
the match.
Solution:  Probability that Karina will win is
1 – 2/3 = 1/3.
Apply your concepts with easy and
conceptual questions
3. If P(A) = 1/8, P(B) = 2/5 and A and B are
mutually exclusive then find P(A ∪ B).
(a) 23/40 (b) 19/40
(c) 21/40 (d) None of these
4. If P(A) = 1/8, P(B) = 2/5 and A and B are
mutually exclusive then find P(A′ ∪ B′).
(a) 23/40 (b) 19/40
(c) 21/40 (d) None of these
270  Theory of Counting
5. For two independent events A and B, it
is known that P(A) = 0.4, P(A ∪ B) = 0.6
then find the value of P(B).
(a) 1/2 (b) 1/3
(c) 2/3 (d) None of these
6. For two independent events A and B, it
is known that P(A) = 0.4, and P(B) = 0.6
the find the value of P(A ∪ B).
(a) 0.47 (b) 0.56
(c) 0.76 (d) None of these
7. For two independent events A and B, it
is known that P(A′) = 0.4, and P(B′) = 0.6
the find the value of P(A ∪ B).
(a) 0.47 (b) 0.56
(c) 0.76 (d) None of these
8. Amar and Bimal are two contestants for
an election, probability that Amar will
win is 1/4 and that Bimal will win the
election is 1/5, then what is probability
that either Amar or Bimal will win the
election.
(a) 13/20 (b) 9/20
(c) 11/20 (d) None of these
9. The probability that a police inspector
Ravi will catch a thief in a day is 1/4 and
the probability he will catch a robber in
that day is 1/5 and the probability that
he will catch both a thief and a robber in
a day is 1/15 then what is the probability
that Ravi will catch at least 1 mischief?
(a) 23/60 (b) 19/60
(c) 7/20 (d) None of these
10. A bag contains 6 green and 5 black
balls if two balls are drawn what is the
probability that both of them are of same
color?
(a) 41/110 (b) 9/22
(c) 2/11 (d) None of these
11. A bag contains 6 green and 5 black if two
balls are drawn what is the probability
that both of them are of different color?
(a) 41/110 (b) 9/22
(c) 2/11 (d) None of these
12. If P(A) = 1/3 and P(B) = 1/4 and it is given
that events A and B are independent
events then find P(A ∩ B).
(a) 5/12 (b) 7/12
(c) 1/12 (d) None of these
Direction for question number 13 to 15:
A bag contains 5 red and 6 black balls, while
another bag contains 4 red and 5 black balls.
One ball is drawn from each bag then:
13. Find the probability that both the balls
are of red color?
(a) 20/99 (b) 23/99
(c) 35/99 (d) None of these
14. Find the probability that both the balls
are of black color?
(a) 20/99 (b) 23/99
(c) 35/99 (d) None of these
15. Find the probability that one of the ball
is of red color while other of black color?
(a) 57/99 (b) 25/99
(c) 49/99 (d) None of these
16. A bag contains 4 red, 5 green and 6 black
balls. Two balls are drawn one after
the other with replacement what is the
probability that both the balls are of red
colored?
(a) 20/225 (b) 16/225
(c) 32/225 (d) None of these
17. A bag contains 4 red, 5 green and 6 black
balls. Two balls are drawn one after the
other without replacement what is the
probability that both the balls are of red
colored?
(a) 2/35 (b) 3/35
(c) 4/35 (d) None of these
18. Gunjan has two bags 1st bag contains 5
black and 6 red balls while another bag
has 6 black and 5 red balls, Gunjan has
drawn two balls one from each bag, what
is the probability that one ball is of black
and one is red color?
(a) 30/121 (b) 45/121
(c) 60/121 (d) None of these
 Dependent and Independent Events  271
19. If probability that A can solve a question is 20. If probability that A can solve a question
3/4 and that B can solve the same problem is 3/4 and that B can solve the same
is 4/5, if both of them attempted this problem is 4/5, if both of them attempted
question then what is the probability that this question then what is the probability
none of them able to solve that question? that question is solved?
(a) 1/20 (b) 3/20 (a) 19/20 (b) 13/20
(c) 7/40 (d) None of these (c) 17/40 (d) None of these

Response Grid
1. a b c d 2. a b c d 3. a b c d 4. a b c d 5. a b c d
6. a b c d 7. a b c d 8. a b c d 9. a b c d 10. a b c d
11. a b c d 12. a b c d 13. a b c d 14. a b c d 15. a b c d
16. a b c d 17. a b c d 18. a b c d 19. a b c d 20. a b c d

2
Concept Builder (CB)
Ideal Time Revise your concepts with questions
25 Min. medium difficulty level questions

1. If P(A′) = 9/11, P(B′) = 3/5 and P(A∩B) =
1/5 then find the value of P(A ∪ B)
(a) 23/55 (b) 19/55
(c) 21/55 (d) None of these
2. If P(A′) = 9/11, P(B′) = 3/5 and P(A∩B)
= 1/5 then find the value of P(A′ ∩ B′)
(a) 34/55 (b) 37/55
(c) 21/55 (d) None of these
3. If P(A′) = 7/8, P(B′) = 3/5 and A and B are
mutually exclusive then find P(A ∪ B).
(a) 23/40 (b) 19/40
(c) 21/40 (d) None of these
4. If P(A′) = 7/8, P(B′) = 3/5 and A and B are
mutually exclusive then find P(A′ ∪ B′).
(a) 23/40 (b) 19/40
(c) 21/40 (d) None of these
Direction for question number 5 to 7:
Rajesh appeared in IIT JEE exam and the
probability that he will pass in Paper I is 4/5
and the probability that he will pass in Paper
II is 1/3. If the probability that he will pass in
both the papers is 1/2 then:
5. What is the probability that he will pass
in at least one subject?
(a) 19/30 (b) 23/30
(c) 17/30 (d) None of these
6. What is the probability that he will fail
in at least one subject?
(a) 19/30 (b) 23/30
(c) 17/30 (d) None of these
7. What is the probability that he will fail
in both the subjects?
(a) 19/30 (b) 23/30
(c) 17/30 (d) None of these
272  Theory of Counting
8. Amar and Bimal are two contestants for
an election, probability that Amar will
lose is 3/4 and that Bimal will lose the
election is 4/5, then what is probability
that either Amar or Bimal will win the
election.
(a) 13/20 (b) 9/20
(c) 11/20 (d) None of these
9. Amar and Bimal are two contestants for
an election, odds against Amar will win
is 4 : 1 and odds against Bimal will win is
5 : 1 then what is probability that either
Amar or Bimal will win the election?
(a) 13/20 (b) 9/20
(c) 11/20 (d) None of these
10. Sumpa throws a die twice find the
probability of getting an even number in
1st throw and a prime number in 2nd throw.
(a) 1/3 (b) 1/4
(c) 3/4 (d) None of these
11. Sumpa throws a die twice find the
probability of getting at least 3 in 1st
throw and at most 3 in 2nd throw.
(a) 1/3 (b) 1/4
(c) 3/4 (d) None of these
12. A bag contains 4 red and 5 green balls
while another bag contains 5 red and 6
green balls, two balls are drawn one from
each bag what is probability that both of
them are of same color?
(a) 49/99 (b) 71/99
Response Grid
1. a b c d 2. a b c d 3. a b c d 4. a b c d 5. a b c d
6. a b c d 7. a b c d 8. a b c d 9. a b c d 10. a b c d
11. a b c d 12. a b c d 13. a b c d 14. a b c d 15. a b c d
16. a b c d
(c) 41/99 (d) None of these
13. If A and B are two independent events
and P(A' ∩ B') = 3/8 while P(A ∩ B) = 1/8
then find the value of P(A) – P(B) if
P(A) > P(B).
(a) 1/3 (b) 1/4
(c) 3/4 (d) None of these
st
14. Suman has 3 bags, 1 bag has 3 green
and 1 blue balls, 2nd bag has 2 green and
2 blue balls, while 3rd bag has 1 green
and 3 blue balls. One ball is selected from
each bag then what is the probability
that the three selected balls will have 2
blue and 1 green ball.
(a) 19/32 (b) 17/32
(c) 13/32 (d) None of these
15. Consider 2 independent events A and B,
if P(A) = 3P(B), P(A ∪ B) = 13/16 then
find the value of P(A)
(a) 1/4 (b) 3/4
(c) 2/5 (d) None of these
16. Two friends A and B appeared in IIT
JEE exam, Probability that A will crack
the exam is 2/5 and probability that B
will crack the exam is 3/4, what is the
probability only 1 from these two cracked
the exam?
(a) 11/20 (b) 9/20
(c) 13/20 (d) None of these
 Dependent and Independent Events  273
3
Concept Cracker (CC)
Ideal Time
30 Min.
1. If P(A) = 1/4, P(B) = 2/5 then find the
range of P(A ∪ B)
(a) (1/5, 13/20) (b) (1/4, 13/20)
(c) (2/5, 13/20) (d) None of these
2. If P(A) = 1/4, P(B) = 2/5 then find the
range of P(A′ ∩ B′)
(a) (1/4, 13/20) (b) (7/20, 3/5)
(c) (7/20, 13/20) (d) None of these
Direction for question number 3 to 5:
If A, B, C are mutually exclusive and
collectively exhaustive events associated with
a random experiment then-
3. Find P(A) if P(A) : P(B) : P(C) = 1 : 2 : 3
(a) 1/6 (b) 1/3
(c) 1/2 (d) None of these
4. Find P(A′) if P(A′) : P(B′):P(C′) = 1 : 2 : 3
(a) 1/6 (b) 1/3
(c) 1/2 (d) None of these
5. Find P(A) if P(A′) : P(B) : P(C′) = 1 : 2 : 3
(a) 1/6 (b) 1/3
(c) 1/2 (d) None of these
6. If A1, A2, … An are mutually exclusive and
collectively exhaustive events associated
with a random experiment then find the
summation of P(A1′) + P(A2′) + P(A3′) + …
P(An′)
(a) n – 1
(b) n
(c) n + 1
(d) Can not be determine
7. Amar, Bimal and Chetan are three
contestants for an election, odds against
Amar will win is 4 : 1 and odds against
Boost up your confidence with good
questions
Bimal will win is 5 : 1 and odds in favor
of Chetan will win 2 : 3 then what is
probability that either Amar or Bimal or
Chetan will win the election.
(a) 23/20 (b) 11/30
(c) 7/10 (d) None of these
8. Ashmit and Bishmit are two students
who appeared in Class X exam,
Probability that Ashmit will pass is 0.5
while probability that both of them will
pass is at least 0.1 and at most 0.3, and
probability that Bishmit will pass is P(B)
then find the range of P(B)
(a) (0.2, 0.8) (b) (0.15, 0.25)
(c) (0.1, 0.8) (d) None of these
9. Gargy speaks truth in 80% cases and
Ashmeet speaks truth in 75% cases,
Hasan asked them a fact what is the
probability that contradict?
(a) 12/25 (b) 9/20
(c) 7/20 (d) None of these
10. Three students A, B and C appeared in
IT JEE exam and probability that they
will pass the exam is 1/2, 1/3 and 1/4
what is the probability that exactly two
of them will pass the exam?
(a) 1/3 (b) 2/3
(c) 1/4 (d) None of these
11. Aman and Binay are playing dart game
and it is known that Aman can hit the
target 4 out of 5 shots while Binay can
hit the target 3 out of 4 shots, what is the
probability that target will be hit if both
of them try?
(a) 1/30 (b) 1/20
(c) 1/40 (d) None of these
274  Theory of Counting
12. Kushal and Karina are playing with
a dice wherein they throw a dice
alternately. Kushal wins if he throws a
prime number and Karina wins if she
throws a composite number. Kushal
starts the game and game continues till
one of them win. What is the probability
that Kushal will win the game?
(a) 1/4 (b) 1/2
(c) 3/4 (d) None of these
13. In the above question what is the
probability that Karina wins the game?
(a) 1/4 (b) 1/2
(c) 3/4 (d) None of these
14. Raj and Sanchita are playing game in
which they throw a die alternately till
one of them gets a six. Which one of the
following could be the probability that
Sanchita win the game?
(a) 7/15 (b) 6/11
(c) 4/9 (d) None of these
15. Raj and Sanchita are playing game in
which they throw two dice alternately
till one of them gets 9. Which one of the
following could be the probability that
Sanchita win the game?
(a) 7/15 or 8/15 (b) 6/11 or 5/11
(c) 8/17 or 9/17 (d) None of these
16. Gargy speaks the truth in 75% cases
while Ashmeet in 80% of the cases. In
what percentage of cases they are likely
to contradict each other is stating the
same fact?
(a) 7/20 (b) 9/20
(c) 11/20 (d) None of these
Response Grid
1. a b c d 2. a b c d 3. a b c d 4. a b c d 5. a b c d
6. a b c d 7. a b c d 8. a b c d 9. a b c d 10. a b c d
11. a b c d 12. a b c d 13. a b c d 14. a b c d 15. a b c d
16. a b c d 17. a b c d 18. a b c d 19. a b c d 20. a b c d
17. Gargy speaks the truth in 60% cases
while Ashmeet is lying in 30% of the
cases. In what percentage of cases they
are likely to agree to each other is stating
the same fact?
(a) 54% (b) 27%
(c) 49% (d) None of these
18. At Pioneer Career Kolkata, Teacher
asked a question to his three students A,
B and C and the probabilities that they
can solve that question is 1/3, 2/7 and 3/8
respectively. If all the three students try
to solve the question simultaneously then
what is the probability that the exactly
one of them will solve the question?
(a) 23/56 (b) 25/56
(c) 85/156 (d) None of these
19. Amar can solve 80% of the questions of
Maths while Bimal can solve only 70%
of the questions. What percentage of
questions can be solved by them from a
maths book.
(a) 89% (b) 91%
(c) 93% (d) None of these
20. Probability that a man who is 40 year old,
living till 75 years is 5/16, and another
man who is 35 years old living till 70
years is 3/7 then what is the probability
that at least one of them will be alive till
35 years hence?
(a) 11/28 (b) 19/28
(c) 17/28 (d) None of these
 Dependent and Independent Events  275

Solutions
Concept Applicator (CA)
1. (c) 2. (a) 3. (c) 4. (b) 5. (b) 6. (c)
7. (c) 8. (b) 9. (a) 10. (c) 11. (d) 12. (c)
13. (a) 14. (d) 15. (c) 16. (b) 17. (a) 18. (c)
19. (a) 20. (a)

1. (c) From the formula P(A ∪ B) 7. (c) Here P(A) = 1 – 0.4 = 0.6 and P(B) =
= P(A) + P(B) – P(A ∩ B) 1 – 0.6 = 0.4.
2 2 1 10 +  22 –1   1 21 Since P(A ∪ B) = P(A) + P(B) – P(A ∩ B)
= + – = =
11 5 5 55 55 = 0.6 + 0.4 – (0.6) × (0.4) = 1 – 0.24
2. (a) Since we know that = 0.76.
P(A′ ∩ B′) = P(A ∪ B)′ 8. (b) From the given information
probability that Amar will win the
= 1 – P(A ∪ B)
tournament is P(A) = 1/4 and Bimal
= 1 – 21/55 = 34/55 will win is P(B) = 1/5. Now since
3. (c) Since A and B are mutually exclusive both of them can not win together so
so P(A ∩ B) = 0 P(A ∩ B) = 0 so P(A∪B) = P(A) + P(B)
Now P(A ∪ B) = P(A) + P(B) – P(A ∩ B) = 1/4 + 1/5 = (5+4)/20 = 9/20
1 2 5 + 16 21 9. (a) Let P(A) = probability that Ravi will
= + = =
8 5 40 40 catch a thief 1/4
4. (b) Since P(A′ ∪ B′) = 1 – P(A ∪ B) P(B) = The probability that Ravi will
21 19 catch a robber = 1/5
=1   – =
40 40 Then from the given information
5. (b) We know that P(A ∩ B) = 1/15
P(A ∪ B) = P(A) + P(B) – P(A ∩ B) Then the probability that Ravi will
catch at least 1 mischief = P(A ∪ B)
For two independent events = P(A) + P(B) – P(A ∩ B)
P(A ∩ B) = P(A) × P(B)
1 1 1 15 +1  2 −4 23
So P(A ∪ B) = P(A) + P(B) – P(A) × P(B) = + – = =
4 5 15 60 60
Or 0.6 = 0.4 + P(B) – (0.4) × P(B) or
10. (c) In this case we have two cases-
0.2 = 0.6 P(B) or P(B) = 2/6 = 1/3.
Case (i) if both of them are green
6. (c) Since P(A ∪ B) = P(A) + P(B) – P(A ∩ B)
= 0.6 + 0.4 – (0.6) × (0.4) 65
then probability is
11  10
= 1 – 0.24 = 0.76.
276  Theory of Counting
Case (ii) if both of them are black
54
then probability is
11  10
So required probability is
6 5 54 20 2 = (5 × 5)/99 = 25/99.
  
11 10 11 10 110 11
Alternately:
Required probability is also given by
{( 6 C2 )   (5 C2 )} 6 5 54
 
11 11 10 11 10
C2
20 2 Alternately:
 
110 11
11. (d) Having different colour is complement
of having same colour.
Hence required probability is
  1 – 2/11 = 9/11
12. (c) Since A and B are independent
events so P(A ∩ B) = P(A) × P(B) =
1/3 × 1/4 = 1/12.
13. (a) Here we have two events and
probability of getting red from 1st
bag and that from the 2nd bag is
independent from each other.
Probability of getting red from 1st
bag = P(A) = 5/11
Probability of getting red from 2nd
bag = P(B) = 4/9
The probability that both the balls
are of red color = P(A ∩ B) = P(A) ×
P(B) = 5/11 × 4/9 = 20/99.
14. (d) Here we have two events and
probability of getting black from
1st bag and that from the 2nd bag is
independent from each other.
Probability of getting black from 1st
bag = P(A) = 6/11
Probability of getting black from
2ndbag = P(B) = 5/9
The probability that both the balls
are of red color = P(A ∩ B) = P(A) ×
P(B) = 6/11 × 5/9 = 30/99.
15. (c) Here we have two cases:
Case (i) Red ball from 1st bag
and black ball from 2nd bag then
probability of this event
Case (ii) Black ball from 1st bag
and Red ball from 2nd bag then
probability of this event
= (4 × 6)/99 = 24/99.
So required probability is 25/99 +
24/99 = 49/99.
From the solution of question
number 10 and 11 probability that
both of them are of same color
= 20/99 + 30/99 = 50/99
So required probability is
  1 – 50/99 = 49/99.
16. (b) Here 1st of all we have to understand
that these two events (drawing
two balls one after the other) is
independent events.
Let P(A) = Probability of getting red
ball in 1st draw = 4/15
Let P(B) = Probability of getting red
ball in 2nd draw = 4/15
Since these two are independent
events hence P(A ∩ B) = P(A) × P(B)
= 4/15 × 4/15 = 16/225.
17. (a) Here 1st of all we have to understand
that these two events (drawing
two balls one after the other) is
independent events.
Let P(A) = Probability of getting red
ball in 1st draw = 4/15
Let P(B) = Probability of getting red
ball in 2nd draw = 3/14
Since these two are independent
events hence P(A ∩ B) = P(A) × P(B)
= 4/15 × 3/14 = 4/70 = 2/35.
 Dependent and Independent Events  277
18. (c) Here we have two cases:
Case (i) black ball is from 1st bag and
red ball from 2nd bag then probability
is P(A) = 5/11 × 6/11 = 30/121.
Case (ii) red ball is from 1st bag
and black ball from 2nd bag then
probability is
  P(B) = 6/11 × 5/11 = 30/121
Required probability is
  30/121 + 30/121 = 60/121
19. (a) Since probability that A can solve
that question is P(A) = 3/4 hence
P(A') = 1/4 and similarly P(B’) = 1/5
So probability that none of them can
solve the question is 1/4 × 1/5 = 1/20.
20. (a) This case is complement of the
previous case, so required probability
  = 1 – 1/20 = 19/20.

Concept Builder (CB)

1. (c) 2. (a) 3. (c) 4. (b) 5. (a) 6. (d)
7. (d) 8. (b) 9. (d) 10. (b) 11. (a) 12. (d)
13. (b) 14. (c) 15. (a) 16. (a)

1. (c) Since P(A′) = 9/11 then P(A) = 2/11 Since

similarly P(B) = 2/5 21 19
From the formula P(A′ ∪ B′) = 1 – P(A ∪ B) =1
   – =
40 40
P(A ∪ B) = P(A) + P(B) – P(A ∩ B)
5.
(a) Let probability that Rajesh will pass
2 2 1 in paper I is = P(A) = 4/5
  –
11 5 5 And probability that he will pass in
10   22 –1
  1 21 paper II is = P(B) = 2/3
 
55 55 And from the given information
2. (a) Since P(A') = 9/11 then P(A) = 2/11 P(A∩B) = 1/2
similarly P(B) = 2/5 We have to find the value of
Since we know that P(A ∪ B) = P(A) + P(B) – P(A∩B)
P(A′ ∩ B′) = P(A ∪ B)′ 4 1 1
  –  
= 1 – P(A ∪ B) 5 3 2
= 1 – 21/55 = 34/55 24 10 –1
  5 19
 
3. (c) P(A') = 7/8 then P(A) = 1/8 similarly 30 30

P(B) = 2/5
6. (d) Rajesh will fail in at least one will be
Since A and B are mutually exclusive represented by
so P(A ∩ B) = 0
1 1
Now = 1 – P(A ∩ B) = 1
   –=
2 2
P(A ∪ B) = P(A) + P(B) – P(A ∩ B) 7. (d) Rajesh will fail in both will be
1 2 5 + 16 21 represented by P(A′ ∪ B′) then
= + = =
8 5 40 40 19 11
4. (b) P(A′) = 7/8 then P(A) = 1/8 similarly P(A′ ∪ B′) = 1 – P(A ∪ B) =1
   – =
P(B) = 2/5 30 30
278  Theory of Counting
8. (b) From the given information So required probability is
probability that Amar will win the 20 30 50
tournament is P(A) = 1 – 3/4 = 1/4 + =
99 99 99
and Bimal will win is P(B) = 1 – 4/5 = 1/5.
13. (b) Given that
Now since both of them can not win
together so P(A∩B) = 0. P(A′ ∩ B′) = 3/8 
So P(A ∪ B) = P(A) + P(B) = 1/4 + 1/5 = or P(A ∪ B) = 1 – 3/8 = 5/8
(5 + 4)/20 = 9/20. So P(A ∪ B) = P(A) + P(B) – P( A ∩ B)
9. (d) From the given information or  5/8 = P(A ) + P(B) – 1/8 or P(A) +
probability that Amar will win the P(B) = 5/8 + 1/8 = 6/8 = 3/4
tournament is P(A) = 1/5 and Bimal So now we have two equations–
will win is P(B) = 1/6. Now since P(A) × P(B) = 1/8
both of them can not win together so
and P(A) + P(B) = 3/4
P(A ∩ B) = 0.
So P(A∪B) = P(A) + P(B) = 1/5 + 1/6 on solving these two equations we
= 11/30 will get P(A) = 1/2 and P(B) = 1/4
hence P(A) – P(B)= 1/4
10. (b) Probability of getting an even
number in 1st throw = P(A) = 3/6 14. (c) In this question we have three
= 1/2 , and probability of getting a cases—
prime number in 2nd throw is Case (i) 1 green ball is from 1st bag
  P(B) = 3/6 = 1/2. then probability is
Since P(A) and P(B) are independent  3  1  3 9
=     =
hence  4   2   4  32
P(A ∩ B) = P(A) × P(B) Case (ii) 1 green ball is from 2nd bag
= (1/2) × (1/2) = 1/4 then probability is
11. (a) Probability of getting at least 3 in  1   1  3 3
=        =
1st throw = P(A) = 4/6 = 2/3 , and  4   2   4  32

probability of getting at most 3 in
Case (iii) 1 green ball is from 3rd bag
2nd throw is P(B) = 3/6 = 1/2.
then probability is
Since P(A) and P(B) are independent
hence  1  1  1 1
=        =
P(A ∩ B) = P(A) × P(B)  4   2   4  32

= (2/3) × (1/2) = 1/3 So required probability is
12. (d) We have two cases here- 9 3 1 13
+ + =
Case (i) if both the balls are of red 32 32 32 32
colored then probability is 15. (a) Let P(A) = x then the equation we
4 5 20 will get is
 
9 11 99 13
=  x  +  3x  – 3x 2 =  4 x  – 3x 2
Case (ii) if both the balls are of green 16
colored then probability is
or 13 =  64 x  – 48 x 2
5 6 30 or 48 x 2 – 64 x  +1
  3 =  0
 
9 11 99 On solving this quadratic equation
we will get
 Dependent and Independent Events  279
Now we have two cases:
64 ±   642 – 4 × 48 × 13 64 ±  40
x  = = Case (i) A cracked the exam and B
2 × 48 96 failed to crack then probability is
Or x = 24/96 = 1/4 P(A) × P(B') = 2/5 × 1/4 = 1/10
Case (ii) B cracked the exam and A
(ignoring the value more than 1)
failed to crack then probability is
16. (a) From the given information P(A′) × P(B) = 3/5 × 3/4 = 9/20
P(A) = 2/5 and P(A′) = 3/5 Required probability is
and P(B) = 3/4, P(B′) = 1/4. 1/10 + 9/20 = 11/20

Concept Cracker (CC)

1. (c) 2. (b) 3. (a) 4. (b) 5. (c) 6. (a)
7. (d) 8. (c) 9. (c) 10. (a) 11. (d) 12. (c)
13. (a) 14. (b) 15. (c) 16. (a) 17. (a) 18. (b)
19. (d) 20. (c)

1. (c) From the formula 3. (a) Since A, B, C are mutually exclusive

and collectively exhaustive events
P(A ∪ B) = P(A) + P(B) – P(A ∩ B)
hence P(A)+P(B)+P(C) = 1.
 1  2 – P(A ∩ B) Hence hence the value of P(A) = 1/6
4 5
5   8 4. (b) Since A, B, C are mutually exclusive
   P(A ∩ B) and collectively exhaustive events
20
hence P(A) + P(B) + P(C) = 1
13
   P(A ∩ B) Let P(A′) = x then P(B′) = 2x and
20
P(C′) = 3x hence P(A) = 1 – x,
So maximum value of P(A ∪ B) = 13/20
P(B) = 1 – 2x and P(C) = 1 – 3x.
And minimum value of P(A ∪ B) is
max{ P(A), P(B)} = 2/5 Hence P(A) + P(B) + P(C)
Hence required range is (2/5, 13/20). = (1 – x) + (1 – 2x) + (1 – 3x)
2. (b) Since we know that = 3 – 6x = 1
or x = 2/6 or 1/3
P(A′ ∩ B′) = P(A ∪ B)′ = 1 – P(A ∪ B)
So P(A') = 1/3
So minimum value of 5. (c) Since A, B, C are mutually exclusive
P(A′ ∩ B′) = 1 – 13/20 = 7/20 and collectively exhaustive events
hence P(A) + P(B) + P(C) = 1
And maximum value of
Let P(A′) = x then P(B) = 2x and
P(A′ ∩ B′) = 1 – 2/5 = 3/5
P(C′) = 3x hence P(A) = 1 – x, P(B) = 2x
So required range is (7/20, 3/5). and P(C) = 1 – 3x.
280  Theory of Counting
Hence P(A) + P(B) + P(C) = (1 – x) +
(2x) + (1 – 3x) = 2 – 2x = 1 or x = 1/2
So P(A) = 1/2
6. (a) Since A1, A2, ... An are mutually
exclusive and collectively exhaustive
events associated with a random
experiment so
P(A1) + P(A2) + P(A3) + ... P(An) = 1
Or [1 – P(A1′) ] + [1 – P(A2′) ]
+ [1 – P(A3′) ] + ... [1 – P(An′)] = 1
Or P(A1′) + P(A2′) + P(A3′) + ... P(An′)
=n–1
7. (d) From the given information
probability that Amar will win the
tournament is P(A) = 1/5 and Bimal
will win is P(B) = 1/6 and same for
Chetan is P(C) = 2/5.
Since these events are mutually
exclusive.
Hence P(A) + P(B) + P(C) = 1/5 + 1/6 +
2/5= 23/30.
8. (c) Let P(A) = probability that Ashmit
will pass, and P(B) = probability
that Bishmit will pass, then from
the given information
P(A) = 0.5, 0.1 ≤ P(A ∩ B) ≤ 0.3.
We have to find the value of P(B).
Since
P(A ∪ B) = P(A) + P(B) – P(A ∩ B)
Or P(B) = P(A ∪ B) + P(A ∩ B) – P(A)
For maximum value of P(B) both
P(A ∪ B) and P(A ∩ B) should be
maximum, maximum value of
P(A ∪ B) is 1 and maximum value of
P(A ∩ B) = is 0.3.
Hence P(B) = 1 + 0.3 – 0.5 = 0.8.
Similarly For minimum value of P(B)
both P(A ∪ B) and P(A ∩ B) should
be minimum, minimum value of
P(A∪B) = P(A) = 0.5 and minimum
value of P(A ∩ B) = is 0.1.
Hence P(B) = 0.5 + 0.1 – 0.5 = 0.1.
So required range is (0.1, 0.8).
9. (c) There are two cases when they will
contradict:
Case (i) Gargy speak truth and
Ashmeet speak lie then probability
is 4/5 × 1/4 = 1/5
Case (ii) Gargy speak lie and Ashmeet
speak truth then probability is 1/5 ×
3/4 = 3/20.
Hence required probability is 1/5 +
3/20 = 7/20.
10. (a) Let probability that A, B and C will
pass the exam is P(A), P(B) and P(C)
respectively then from the given
information P(A) = 1/2 , P(B) = 1/3 and
P(C) = 1/4 and also P(A′) = 1 – 1/2 =
1/2 , P(B′) = 1 – 1/3 = 2/3 and P(C′) =
1 – 1/4 = 3/4.
Now we have three cases:
Case (i) A and B will pass the
exam and C fails that exam then
probability is P(A) × P(B) × P(C′) =
1/2 × 1/3 × 3/4 = 1/8.
Case (ii) A and C will pass the
exam and B fails that exam then
probability is P(A) × P(B′) × P(C) =
1/2 × 2/3 × 1/4 = 1/12.
Case (iii) B and C will pass the
exam and A fails that exam then
probability is P(A′) × P(B) × P(C) =
1/2 × 1/3 × 3/4 = 1/8.
Total probability is
1/8 +1/12 +1/8 = 8/24 = 1/3
11. (d) Probability that Aman will hit the
target is P(A) = 4/5 and probability
that Aman will not hit the target is
P(A′) = 1 – 4/5 = 1/5.
Probability that Binay will hit the
target is P(A) = 3/4 and probability
that Binay will not hit the target is
P(A′) = 1 – 3/4 = 1/4.

Probability that none of them will
hit the target is
P(A′ ∩ B′) = 1/5 × 1/4 = 1/20
So probability that at least one of
them will hit the target is
1 – 1/20 = 19/20
12. (c) Let P(A) probability of getting a prime
number = 3/6 = 1/2 then P(A′) = 1/2.
And P(B) = probability of getting
a composite number 2/6 = 1/3 then
P(B′) = 2/3.
Now consider Kushal wins the game
it is possible in following cases-
Case (i) in one throw—if Kushal
gets a prime = P(A) = 1/2.
Case (ii) in three throws—If
Kushal fails to get a prime in 1st
throw, Karina fails to get composite
in 2nd throw and Kushal gets a prime
in 3rd throw, in this case probability
is P(A′) × P(B′) × P(A) = 1/2 × 2/3 × 1/2
= 1/6.
Case (iii) in 5 throw then similar
to above case probability is
(1/2) × (2/3) × (1/2) × (2/3) × (1/2) = 1/18
And this process will continue and
the required probability is
(1/2) + (1/6) + (1/18) + ... ∞
1 Required probability = 3/20 + 1/5 = 7/20.
Or required probability = 2 3
1 −
13. (a) Probability that Karina will win the
game is 1 – 3/4 = 1/4.
14. (b) Probability of getting a six is 1/6.
If Sanchita starts the game then the
probability that she wins is
1
1   5   5  1 
           ...     6 
6  6  6  6 
1
Dependent and Independent Events  281
And if Raj starts the game then
probability that Sanchita wins the
game is 1 – 6/11 = 5/11.
15. (c) When two dice is thrown then sample
space has 6 × 6 = 36 elements so
n(S) = 36
Now consider the event of getting 9
is (3, 6), (4, 5), (5, 4) and (6, 3).
So probability of getting 9 when two
dice is thrown is 4/36 = 1/9.
If Sanchita starts the game then the
probability that she wins is
1   8   8  1 
           ...    
9  9  9  9 
1
1 81 9
 9     
64 9 17 17
1
81
And if Raj starts the game then
probability that Sanchita wins the
game is 1 – 9/17 = 8/17.
16. (a) There are two cases when they will
contradict each other:
Case (i) Gargy is speaking truth and
Ashmeet is lying then probability is
(3/4)(1/5) = 3/20.
Case (ii) Gargy is lying and Ashmeet
is speaking truth then probability is
(1/4)(4/5) = 1/5.
= 17. (a) There are two cases when they will
1 4 agree to each other:
3
Case (i) When both of them are
speaking truth then probability is
(6/10)(7/10) = 42/100.
Case (ii) When both of them are
lying then probability is
(4/10)(3/10) = 12/100.
6 Required probability
25 11 = 42/100 + 12/100
56 = 54/100 = 54%
282  Theory of Counting
18. (b) We have three cases in this question:
Case (i) Only A has solved the
question and B and C failed to solve
that question then probability of this
 1   5  5 25
case is       =
 3   7   8  168
Case (ii) Only B has solved the
question and A and C failed to solve
that question then probability of this
 2  2  5 20
case is       =
 3   7   8  168
Case (iii) Only C has solved the
question and A and B failed to solve
that question then probability of this
 2  5  3 30
case is       =
 3   7   8  168
So required Probability is
25 20 30 75 25
+ + = =
168 168 168 168 56
19. (d) Given that P(A) = 8/10 and P(A′) = 2/10
similarly P(B) = 7/10 and P(B′) = 3/10
Probability that none of them can
solve a question is P(A′) × P(B′) =
(2/10)(3/10) = 6/100.
So required probability is
1 – 6/00 = 94/100 or 94%
20. (c) Let A be the event that 1st man will
be alive till 75 years and B be the
event that 2nd man will be alive
till 70 years then P(A) = 5/16 and
P(B) = 3/7 then P(A′) = 11/16, and
P(B′) = 4/7
Probability that none of them will be
alive 35 years hence is
P(A′) × P(B′) = 11/16 × 4/7 = 11/28
Then required probability is
1 – 11/28 = 17/28
 Part B
Concept 1 Introduction
Properties of Independent events
Consider two independent events A and B:
• A and B′ are independent events
• A′ and B′ are independent events
Concept 2 Addition Theorem of Probability
If A and B be any two events in a sample
space S of an experiment, then the probability
of occurrence of at least one of the events A
and B is given by
P ( A ∪ B ) = P (A) + P (B) – P (A ∩ B)
Representation Of Union Of Sets
A B
Dependent and Independent Events  283
• A′ and B are independent events
• For two independent events
P(A ∩ B) = P(A) × P(B)
• P (A ∪ B) = 1 – P(A′) P(B′)
From the set theory we know that:
n( A ∪ B ) = n(A) + n (B) – n ( A ∩B )
Dividing both sides by n (S), we get
n(A ∪ B) n(A) n(B) n(A ∩  B)
= + –
n(S) n(S) n(S) n(S)
or P(A ∪ B) = P(A) + P(B) – P (A ∩ B)
Addition theorem for three events
Consider three events A, B and C in a sample
space S then from the addition theorem
P( A ∪ B ∪ C) = P(A) + P(B) + P(C)
– P(A ∩ B) – P(B ∩ C)
– P(A ∩ C) + P(A ∩ B ∩ C)
Proof: From set theory, we know that
n(S) = n(A) + n(B) + n(C) – n(A ∩ B)
– n( B ∩ C) – n(A ∩ C) + n ( A ∩ B ∩ C)
284  Theory of Counting
Dividing both sides by n(S), we get \ P(A ∪ B ∪ C) = P(A) + P(B) + P(C)
n( A  B  C ) n( A) n( B) n(C ) – P( A ∩ B) – P(B ∩ C)
  
n( S ) n( S ) n( S ) n( S ) – P(A ∩ C) + P(A ∩ B ∩ C).
n( A  B ) n( B  C ) If A, B, C are mutually exclusive events, then
– – A ∩ B = φ,
n( S ) n( S )
B ∩ C = φ,
n( A  C ) n( A  B  C )
–  A ∩ C = φ, A ∩ B ∩ C = φ
n( S ) n( S ) \ P(A ∪ B ∪ C) = P(A) + P(B) + P(C)

1
Concept Deviator (CD)
Ideal Time Revise your concept (IIT advance or
5 Min. tougher questions)
Per Question

1. Let E and F be two independent events.
The probability that exactly one of them
occurs is 11/25 and the probability of
none of them occurring is 2/25. If P(T)
denotes the probability of occurrence of
the event T, then [IIT JEE 2011]
(a) P(E) = 4/5, P(F) = 3/5
(b) P(E) = 1/5, P(F) = 2/5
(c) P(E) = 2/5, P(F) = 1/5 of 4 outcomes, the number of outcomes
(d) P(E) = 3/5, P(F) = 4/5
Direction for question number 2 to 4:
A fair die is tossed repeatedly until a six is
obtained. Let X denote the number of tosses
required.
2. The probability that X = 3 equals one trial of an experiment is 0.4. Three
[IIT JEE 2009]
(a) 25/216 (b) 25/36
(c) 5/36 (d) 125/216
3. The probability that X ≥ 3 equals
[IIT JEE 2009]
(a) 125/216 (b) 25/36
4. The probability that X ≥ 6 given X > 3
equals [IIT JEE 2009]
(a) 125/216 (b) 25/36
(c) 5/36 (d) 25/216
5. An experiment has 10 equally likely
outcomes. Let A and B be two non empty
events of the experiment. If A consists
that B must have so that A and B are
independent, is [IIT JEE 2008]
(a) 2, 4 or 8 (b) 3, 6 or 9
(c) 4 or 8 (d) 5 or 10
6. The probability that event A happens in
independent trials of the experiment
are performed . The probability that the
event A happens at least once is-
[IIT JEE 1980]
(a) 0.936 (b) 0.784

(c) 5/36 (d) 25/216 (c) 0.904 (d) none of these

 Dependent and Independent Events  285
7. In a certain city only two news papers
A and B are published. It is known that
25% of the city population reads A and
20% reads B while 8% reads both A and
B. It is known that 30% of those who read
A but not B look into the advertisements
and 40% of those who read B but not A
look into the advertisements while 50%
of those who read both A and B look
into the advertisements. What is the
percentage of population who reads an
advertisement?      [IIT JEE 1984] (d) None of these
(a) 19.5% (b) 19%
(c) 21% (d) None of these
8. A and B are two independent events. The
probability that Both A and B occur is
1/6 and probability that neither of them
occurs is 1/3. Find the probability of
occurrence of A. [IIT JEE 1984] (c) E′ and F′ are independent
(a) 1/4 or 1/3 (b) 1/2 or 1/3
(c) 1/5 or 1/4 (d) None of these
9. A students appear for tests, I, II and III.
The student is successful if he passes
either in tests I and II or tests I and III.
The probabilities of the student passing
in tests I, II and III are p, q, are 1/2 ,
respectively. If the probability that the
student is successful is 1/2, then hold
[IIT JEE 1986]
(a) p = q = 1 (b) p = q = 1/2
(c) p = 1, q = 0 (d) p = 1, q = 1/2
10. Urn A contains 6 red and 4 black balls and
urn B contains 4 red and 6 black balls. One
ball is drawn at random from urn A and
placed in urn B. Then one ball is drawn at
random from urn B and placed in urn A. If
one ball is now drawn at random from urn
A, the probability that it is found to be red
is [IIT JEE 1988]
(a) 327/605 (b) 314/605
(c) 328/605 (d) None of these
11. A box contains 2 fifty paise coins, 5 twenty
five paise coins and certain fixed number
n (≥ 2) of ten and five paise coins. Five
coins are taken out of the box at random.
Find the probability that the total value
of these 5 coins is less than one rupee
and fifty paise. [IIT JEE 1988]
(a) 1 – 10(n + 2)/n + 7C5
(b) 10(n + 2)/n + 7C5
(c) 1 – (n + 2)/n + 7C5
12. If E and F are independent events such
that 0 < P (E) < 1 and 0 <P(F) < 1, then
[IIT JEE 1989]
(a) E and F are mutually exclusive
(b) E and F′ (the complement of the
event F) are independent
(d) P(E| F) + P (E| F′) = 1
13. For any two events A and B in a sample
space: [IIT JEE 1991]
(a)  A   { P ( A )   P ( B ) –1
 },
B  P(B)
 
P(B) ≠0, is always true
(b) P( A ∩ B′) = P(A) – P(A ∩ B) does not
(c) P(A ∪ B) = 1 – P(A′) P(B′), if A and B
are independent
(d) P(A ∪ B) = 1 – P(A′) P(B′) , if A and B
are disjoint
14. India plays two matches each with
the West Indies and Australia. In any
match, the probabilities of India getting
0, 1 and 2 points are 0.45, 0.05 and 0.50
respectively. Assuming that the outcomes
are independent, the probability of India
getting at least 7 points is
[IIT JEE 1991]
(a) 0.8750 (b) 0.0875
(c) 0.0625 (d) 0.0250
286  Theory of Counting
15. Let E and F be two independent events. (a) P(E) = 1/3, P(F) = 1/4
The probability that both E and F happen (b) P(E) = 1/2 , P(F) = 1/6
is 1/2 and the probability that neither E
(c) P(E) = 1/6, P(F) = 1/2
nor F happens is 1/12. Then
(d) P(E) = 1/4 , P(F) = 1/3.
[IIT JEE 1993]

Response Grid
1. a b c d 2. a b c d 3. a b c d 4. a b c d 5. a b c d
6. a b c d 7. a b c d 8. a b c d 9. a b c d 10. a b c d
11. a b c d 12. a b c d 13. a b c d 14. a b c d 15. a b c d

2
Concept Eliminator (CE)
Ideal Time Revise your concept (Maths Olympiad
Just solve it or tougher questions)

1. Two dice are thrown simultaneously what (a) 51/100

is the probability that sum of the two 99
numbers will be 5 before 7? 51   49 
(b) 
(a) 2/5 (b) 1/5  100   100 

(c) 3/5 (d) None of these

(c) 11/1010
2. There are 100 players participating in a
tournament. At the beginning player Pi (d) None of these
has i number of coins. At each stage, two
3. The probability of India winning a
players are chosen to play a game, with
the winner of the game receiving 1 coin test match against West Indies is 1/2.
from the looser. At any stage if fortune Assuming independence from west
of a player drops to 0 coins then he is Indies is 1/2. Assuming independence
eliminated from the tournament. This from match to match the probability that
process continues till only one player in a 5 match series India’s second win
having all the coins and is designated
occurs at the third test is
as winner of the tournament. What is
the probability that 51st player (having (a) 1/8 (b) 1/4
51 coins) will be the winner of the
(c) 1/2 (d) 2/3
tournament?
 Dependent and Independent Events  287
4. 3 friends A, B and C play the game
“Pahle Hum Pahle Tum” in which they
throw a die one after the other and the
one who will get a composite number
1st will be announced as winner, If A
started the game followed by B and then
C then what is the ratio of their winning
probabilities?
(a) 9 : 6 : 4 (b) 8 : 6 : 5
(c) 10 : 5 : 4 (d) None of these
5. 3 friends A, B and C play the game
“Pahle Hum Pahle Tum” in which they
throw a die one after the other and the
one who will get a composite number
1st will be announced as winner, then
remaining two will continue to play for
the 2nd position. If A started the game
followed by B and then C then what is the
probability that A will get 2nd position?
(a) 24/95 (b) 12/95
(c) 18/95 (d) None of these

Response Grid
1. a b c d 2. a b c d 3. a b c d 4. a b c d 5. a b c d

Solutions
Concept Deviator (CD)
1. (a,d) 2. (a) 3. (b) 4. (b) 5. (d) 6. (b)
7. (a) 8. (b) 9. (c) 10. (c) 11. (a) 12. (b, c, d)
13. (a, c) 14. (b) 15. (a, d)

1. (a, d) Since the probability that exactly one
of them occurs is 11/25 so
P (EF′) + P(FE′) = 11/25
And none of them occurring is 2/25
so P (E′F′) = 2/5
(1 – P (E)) (1 – P(F)) = 2 /25
From the given options option (a)
and (d) satisfy above condition.
2. (a) Probability of getting 6 is P(6) = 1/6 and
probability not getting 6 is P(6′) = 5/6

Since the events are independent so In this case X =3 which is possible

P(E)P(F′) + P(F)P(E′) = 11/25 when

P(E)(1–P(F)) + P(F) (1 – P (E)) = 11/25 P(6′)P(6′)P(6) = (5/6)(5/6)(1/6)

P(E) + P(F) – 2 P (E)P(F) = 11/25 = 25/216
288  Theory of Counting
3. (b) Here X ≥ 3 hence required probability 8. (b) It is given that A and B are two
is independent events i.e P(A) . P(B) =
1/6, and P(A′) . P(B′) = 1/3
 5  2  1   5 3  1   5  2  1 
                ... Or (1 – P(A))(1 – P(B)) = 1/3
6  6  6  6  6  6 
Or  1 – P(A) – P(B) + P(A) . P(B) = 1/3
Y using sum of infinite terms of GP Or  P(A) + P(B) = 5/6 and P(A) . P(B) = 1/6
required probability.
We will get a quadratic equation and
 5  2  1  
  the value of P(A) = 1/2 or 1/3
    
 6   6   25 9. (c) As per the given condition, to be
= 
successful student must pass in test
5 36
1– I and along with that he has to pass
6
4. (b) Here we need to find probability of in at least one of the test II or test III,
X ≥ 6 given that X > 3 1 1 q
probability of this is q+ − 
2  2 2
Required probability is
which is equal to 1/2.
  5     6     7   
 5 1 5 1 5 1 
                . 
 6   6   6   6   6   6   So 1  q + 1 − q  = 1   or p(q + 1) = 1,
2 2 2 2
  3     4     5   
 5 1 5 1 5 1  from the given options option (c)
                . 
 6   6   6   6   6   6   satisfy the condition,
  5  10. (c) It is given that third draw is red, we
 5 
   have four conditions for 1st 4 draws
 6   25
   and these are RB, RR, BR, BB.
  3  36
 5  Hence the result of three draws must
  
 6   be one of the- RBR, RRR, BRR, BBR.

5. (d) If A and B are independent events Required probability is
then P(A ∩ B) = P(A) × P(B) = (4/10)
(p/10) = 2p/5 is an integer so p = 5 or 10  5 5 6  6 6 5
 11 × 11 × 10  +  10 × 11 × 10 
6. (b) Probability that even A didn’t occur
is 1 – 0.4 = 0.6.
 4 4 7  4 7 6
Probability that A didn’t occur a single + × × + × ×
 10 11 10   10 11 10 
time is (0.6 × 0.6 × 0.6) = 0.216
328
So required probability is =
605
1 – 0.216 = 0.784 11. (a) Total number of coins is n + 2 + 5 = n + 7
7. (a) Required probability is given by Sample space is n + 7C5
P(E/A) × P(A) + P(E/B) × P(B) Now we have to calculate the number
of non favorable cases:
+ P(E/A ∩ B) × P(A ∩ B)
Case (i) Two 50 paise, two 5 paise
= (30/100)(25/100) + (20/100)(40/100) and one fron n coins of ten and five paise,
+ (50/100)(8/100) = 195/100 = 19.5% number of ways is (2C2 × 5C2 × nC1).
 Dependent and Independent Events  289
Case (ii) One 50 paise, five 25 paise Australia and to get 7 points in these 4
coins, number of ways is (2C1 × 5C5). matches condition must be either 4 win
Case (iii) Two 50 paise, three 25 paise or 3 win.
coins, number of ways is (2C2 × 5C3). So required probability is
(4C3)(0.05)(0.5)3 + (4C4)(0.5)4 = 0.0875
So total number of ways is
15. (a, d) It is given that P(E′ ∩ F′) = 1/2
(2C 2 × 5C
2 × nC
1 ) + (2C
1 × 5C
5 ) + (2C 2 × 5C3) Since E and F be two independent events.
= 10n + 20 = 10(n + 2). Hence E′ and F′ are also two independent
Required probability events hence-
= 1 – 10(n + 2)/(n + 7C5). P(E′ ∩ F′) = P(E′) P(F′)
12. (b, c, d) Since E and F are independent = 1/12 = (1 – P(E))(1 – P(F))
events hence statements b, c and d = 1 – P(E) – P(F) + P(E)P(F)
are correct.
= 1 – P(E) – P(F) + 1/12
13. (a, c) From the theory- option (a) and (c)
or  P(E) + P(F) = 7/12
are correct.
On solving above equations we will
14. (b) Since India plays 4 matches two
get P(E) = 1/3 and P(F) = 1/4 or P(E)
matches each with the West Indies and
= 1/4 and P(F) = 1/3.

Concept Eliminator (CE)

1. (a) 2. (d) 3. (b) 4. (a) 5. (a)

1. (a) Probability of getting 5 is 4/36, = 1/9, probability 1/n of being the winner.
Probability of getting 7 is 6/36 = 1/6 Now, suppose these n players are
divided into r teams, with team i
Probability that neither 5 nor 7 will
containing ni players, i = 1, . . . , r.
appear is 1 – 10/36 = 13/18
Then the probability that the victor
Required probability is is a member of team i is ni/n.
 1  13   1  13  13   1 
                
  . Applying to the similar logic in this
 9  18   9  18  18   9  case n = 1 + 2 + 3 + … + 100 = 100 ×

101/2 = 50 × 101= 5050.
 
  Required probability is
 1  2
  (1 / 9)  
1  13  5   51/5050
 18 
  3. (b) There are only two ways when it is
2. (d) To understand the situation properly possible- LWW and WLW. Here W
and L represents India’s win or loss.
let us assume that there are n
players, with each player initially So required probability is
having 1 coin. In this case all the  1  1  1  1  1  1 1
players have equal probability to be  2   2   2  +   2   2   2  = 4
the winner hence each player has
290  Theory of Counting
4. (a) Probability of getting a composite 2nd position and C is at 3rd position-
number is 2/6 = 1/3 From the solution of previous
question Probability that B will get
Probability that A will win the game 1st position is 6/19, now after B’s
is move C will continue then probability
1   2   2   2  1  that A will win over C is given by:
           
3  3  3  3  3   2  1   2   2   2  1 
             
 2   2   2   2   2   2  1  3  3  3  3  3  3 
                 .
3  3  3  3  3  3  3   2   2   2   2   2  1 
               .
1 3  3  3  3  3  3 

3  1 27  9
       2
8  3 19  19 2 9  2
1  9      
27 4

1 9 5  5
Probability that B will win the game 9
is
So required probability for this case
 2  1   2   2   2   2  1 
                6 2 12
3  3  3  3  3  3  3  is   .
19 5 95
 2   2   2   2   2   2   2  1 
                   . Case (ii) C is at 1st position, A is at
3  3  3  3  3  3  3  3  2nd position and B is at 3rd position-

2 From the solution of previous
9  2 27  6
       question Probability that C will get
8  9 19  19 1st position is 4/19, now after C’s
1
27 move A will continue then probability

Probability that C will win the game that A will win over C is given by:
is
1   2   2  1 
 2   2  1   2   2   2   2   2  1           
                    3  3  3  3 
3  3  3  3  3  3  3  3  3   2   2   2   2  1 
 2   2   2   2   2   2   2   2  1               .
                     ... 3  3  3  3  3 
3  3  3  3  3  3  3  3  3 

4 1
 4 27  4 3 1 9  3
 27             
4 3 5  5
8  27 19  19 1
1
27 9

So required ratio is 9 : 6 : 4. So required probability for this case
5. (a) We have to find the probability that 4 3 12
is  
A will be at 2ndpositions, there are 19 5 95
two different cases for the same- So required probability
Case (i) B is at 1st position, A is at   = 12/95 + 12/95 = 24/95
 11
Conditional Probability  291

Conditional Probability

Topics Covered

 Introduction of Conditional Probability

 Properties of Conditional Probability

 Bayes’ Theorem

Part A: Topic Number of Questions

Solved Example 5
Concept Applicator 10
Concept Builder 10
Concept Cracker 10
Part B: Topic Number of Questions
Concept Deviator 10
Concept Eliminator 4
Total 49
292  Theory of Counting
Part A
Introduction of
Concept 1 Conditional Probability

Conditional Probability: Consider two events Set theory approach

A and B such that B ≠ φ, then probability of A B
occurrence of event A when B has already
occurred is called conditional probability and
is denoted by P(A/B).
Lets take some examples to understand this-
(i) Find the probability of getting a number
A∩B
greater than 4 if it is given that the outcome
is an odd number:
Here in this case sample space
S = {1,2,3,4,5,6}
Let A = the event of occurrence of a number
greater than 4 = {5,6} and n(A) = 2. Now consider two events A and B in the sample
B = the event of occurrence of an odd space, we have to find the probability P(A/B)
number = {1,3,5} and n(B) = 3. since it is given that event B has occurred so
new sample space or reduced sample space is B
Now we have to find probability of getting a
which shown as a shaded area in the diagram,
number greater than 4 if it is given that the and now we have to find the occurrence of A
outcome is an odd number i.e P(A/B) i.e (A ∩B), so required probability is-
Here when an odd number has occurred, total P(A/B) = n(A ∩ B)/n(B)
number of cases is only 3 (not 6) so we can say
By dividing n(S) in numerator and denominator
that new Sample space or reduced Sample
we will get
space is {1, 3, 5} and it has only 3 elements
 n( A  B ) 
and favorable number of cases is 1 i.e {4}.  
 n(S ) 
Hence the required probability is 
P(A/B)  n( B )  = P(A ∩ B)/P(B)
P(A/B) = n(A ∩ B)/n(B) = 1/3  
 n(S ) 
So in the above example we have seen that B
works as the sample space and A ∩ B works
Hence P(A/B) = P(A ∩ B)/P(B)
as the event.

Conditional Probability for independent
Events
If A and B are independent events, then
probability of occurrence of event A is not
affected by occurrence or non-occurrence
of event B and vice versa then P(A/B) i.e
probability of occurrence of event A when B
has already occurred
Properties of
Concept 2 Conditional Probability
Some Properties of Conditional
Probability
(i) P(A/B) = P(A ∩ B)/P(B)
or P(A ∩ B) = P(B) ⋅ P(A/B)
(ii) P(B/A) = P(A ∩ B)/P(A)
or P(A ∩ B) = P(A) ⋅ P(B/A)
(iii) P(A/B) may or may not be equal to
P(B/A)
(iv) If A and B are independent events, then
P(B/A) = P(B)
(v) Two events A and B are independent if
and only if P(A ∩ B) or P(AB) = P(A) ⋅ P(B)
(vi) If A, B and C are any three independent
events, then
P(A ∩ B ∩ C) = P[A ∩ (B ∩ C)]
= P(A) ⋅ P(B ∩ C)
= P(A) ⋅ P(B) ⋅ P(C)
(vii) If we generalize the result for n events
then : If A1,A2, ... An be any n events none
of which is an impossible event, then
P(A1 ∩ A2 ∩ ... ∩ An)
= P(A1) ⋅ P(A2/A1) ⋅ P(A3/A1A2) …
P(An/A1A2 ⋅ An – 1)
Conditional Probability  293
P(A/B) = P(A ∩ B)/P(B)
but we know that for two independent events
P(A ∩ B) = P(B) ⋅ P(A)
Hence P(A/B) = P(A ∩ B)/P(B) = P(A)
Hence for two independent events A and B
P(A/B) = P(A)
P(B/A) = P(B)
If A1, A2, ... An are independent events, then
P(A1∩ A2∩ ... ∩ An) = P(A1). P(A2) ... P(An)
(viii) If A and B are two independent events,
then P(A ∪ B) = 1 – P(A′) ⋅ P(B′)
(ix) If A1, A2 ... An are independent events,
then P(A1∪ A2∪ ... ∪ An) = 1 – P(A′1) ⋅
P(A′2) ... P(A′n)
(x) If A and B are two events such that
B ≠ Ф, then
P(A/B) + P(A′/B) = 1
Proof: P(A/B) + P(A′/B) = P(A ∩ B)/P(B)
+ P(A′ ∩ B)/P(B)
= [P(A ∩ B) + P(A′ ∩ B)]/P(B)
= P(B)/P(B)
= 1 [Q (A ∩ B) ∪ (A′ ∩ B) = B and A ∩ B
and A′ ∩ B are mutually exclusive ]
(xi) If A and B be two events such that
A ≠ Ф, then
P(B) = P(A). P(B/A) + P(A′). P(B/A′)
Proof: P(A) ⋅ P(B/A) + (A′) ⋅ P(B/A′)
= P(A ∩ B) + P(A′ ∩ B)
= P[(A ∩ B) ∪ (A′ ∩ B)]
[Q A ∩ B and A′ ∩ B are mutually exclusive]
= P(B) [Q (A ∩ B) ∪ (A′ ∩ B) = B]
294  Theory of Counting
Example 1:  If P(A) = 1/3 and P(A ∩ B) = 1/6 Example 3:  If A and B are two mutually
then find the value of P(B/A) exclusive events with P(A) = 1/20
Solution:  We know that P(B/A) and P(B) = 1/11 then find the value of
1 P(A/B).
P A  B 6 1 Solution:  Since A and B are two mutually
  
P A 1 2 exclusive events so P(A ∩ B) = 0 so P(A/B) = 0
3
Example 4:  Two die are thrown together
Example 2:  If P(A/B) = 2/3 and P(A ∩ B) = 1/6 what is the probability that sum of
then find the value of P(B). these two number is a prime number
if it is given that both the results are
Solution:  We know that
prime numbers?
P A  B Solution:  As per the given condition outcome
P(A/B) =
P B is (2,2), (2,3), (2,5), (3,2), (3, 3), (3,5), (5, 2),
1 (5, 3) and (5,5).
P A  B 6 1 So sample space is 3 × 3 = 9 and number of
or P(B) =   favourable case is (2, 3), (2,5), (3, 2) (5,2)
P A / B 2 4
3 So required probability is 4/9.

Concept 3 Bayes’ Theorem

Bayes’ theorem is just extension of conditional event which occurs together (in conjunction)
probability, in order to understand the Bayes’ with either of Ai i. e. if A1, A2, ..., An form a
theorem lets discuss the partition of a set: partition of the sample space S and A be any
event, then from Bayes’ theorem
Partition of a Set A 
P  k 
A family of sets A1, A2, ... An is said to form a  A 
partition of a set A if following conditions are  A 
satisfied: P  
 Ak 
(i) A1, A2, ..., An are non – empty    P ( Ak ).
   
(ii) Ai ∩ Aj = φ for i ≠ j P ( A )  P  A    P ( A )    
 1   2 
(iii) A = A1 ∪ A2 ∪ … ∪ An   A1  
 
 A   A 
P    ...   P ( An )  P  
Bayes’ Theorem   
  A2   An  
Let us consider n mutually exclusive and
exhaustive events A1, A2, A3,... An and A is an Proof: Since A1, A2, ..., An form a partition of S,
 Conditional Probability  295
Now, • If A1, A2, ... An form a partition of an
A = A ∩ S = A ∩ ( A1 ∪ A2∪ …∪An) event A, then
= ( A ∩ A1) ∪ (A ∩ A2) ∪…∪(A ∩ An) P ( Ak )
P(Ak/A) 
Since A1, A2, ..., An are disjoint sets hence P ( A1 )  P ( A2 )     P ( An )
(A ∩ A1), (A ∩ A2), ..., (A ∩ An) are also
disjoint. Example 5:  Mr. Susmit a famous liar is
known to speak the truth 3 out of 4
\ From addition theorem
times. His friend Hasan throws a die
P(A) = P(A ∩ A1) + P( A ∩ A2) blindfolded and asked Susmit the
+ … + P(A ∩ An) result who says that it is a six. Find the
probability that it is actually a six.
We know that P(Ak/A ) = P(Ak ∩ A)/P(A)
Solution:  Let A = the event that Susmit
P ( Ak  A )
Or P(Ak/A )  reports occurrence of 6
P ( A1  A )   P ( A2  A )
Or P(Ak/A ) =   Let B = the event of occurrence of 6 when
     P ( An  A )
 
 A  a die is thrown
 
A  And B’ = the event of non- occurrence of
 P ( Ak )   k
     6 when a die is thrown
P ( A )  P  A   P ( A )  P  A  
 1 A  2  A 
  1  2  Now From Bayes’ theorem
 
  A  
 
     P ( An )   P   A
 P  
  An  
B 
P      P ( B )  B 
A 
 A  A  
P ( B )  P     P ( B )P    
Properties of Bayes’  B   B  

Theorem We know that P(B) = 1/6 and P(B′) = 5/6

• If A1, A2, ... An form a partition of S and
A be any event then
P(A) = P(A1) ⋅ P(A/A1) + P(A2) ⋅ P(A/A2)
+ ... + P(An) ⋅ P(A/An)
• If P(A1) = P(A2) = … = P(An),
P(Ak /A) = P(A/Ak)/P(A/A1) + P(A/A2)
+ … + P(A/An)
P(A/B′) = probability that man reports occurrence
of 6 when 6 has actually occurred = probability
that the man speaks the truth = 3/4
P(A/B′) = probability that man reports occurr-
ence of 6 when 6 has not actually occurred =
probability that the man tells a lie = 1/4.
Putting these values in (1), we get

• Priori and Posteriori Probabilities: 1   3 

    
The probabilities P(A1), P(A2), ..., P(A2), B  6  4  3
P    
..., P(An) which are known before the  A   1   3   5   1   8
        
experiment takes place are called priori           
 6   4   6   4  
probabilities and P(Ai/A) are called
posteriori probabilities.
296  Theory of Counting

1
Concept Applicator (CA)
Ideal Time Apply your concepts with easy and
10 Min. conceptual questions

1. If P(A) = 2/3 and P(A ∩ B) = 1/3 then find
the value of P(B/A).
(a) 1/2 (b) 1/3
(c) 1/4 (d) None of these
2. If P(A/B) = 2/3 and P(A ∩ B) = 1/3 then
find the value of P(B).
(a) 1/2 (b) 1/3
(c) 1/4 (d) None of these
3. If A and B are two mutually exclusive
events with P(A) = 1/5 and P(B) = 1/6
then find the value of P(A/B).
(a) 1/2 (b) 1/3
(c) 1/4 (d) None of these
4. If P(A) = 2/5, P(B) = (3/5) and P(A ∪ B) =
4/5 then find the value of P(A/B).
(a) 1/2 (b) 1/3
(c) 1/4 (d) None of these
5. Find the value of P(A/B) + P(A′/B)
(a) 0 (b) Less than 1
(c) 1 (d) None of these
6. If a die is thrown what is the probability
of coming up a number more than 4 if
it is known that the result is an odd
number?
(a) 1/2 (b) 1/3
(c) 1/4 (d) None of these
7. Two coins are tossed, what is the
probability of getting one Head and one
Tail if it is given that at least one Tail
comes up?
(a) 1/2 (b) 1/3
(c) 2/3 (d) None of these
8. Two dice are thrown, then what is the
probability of getting the sum of two
results more than 10 if it is known that
number 5 will always come on the 1st
die?
(a) 1/2 (b) 1/3
(c) 1/6 (d) None of these
9. Two dice is thrown, then what is the
probability of getting 3 on at least one
die if it is given that the summation of
the result is 8?
(a) 1/8 (b) 2/5
(c) 1/5 (d) None of these
10. Two dice are thrown, then what is the
probability of getting the sum of two
results as perfect squares if it is known
that number 3 will always come on the
1st die?
(a) 1/2 (b) 1/3
(c) 1/6 (d) None of these

Response Grid
1. a b c d 2. a b c d 3. a b c d 4. a b c d 5. a b c d
6. a b c d 7. a b c d 8. a b c d 9. a b c d 10. a b c d
 Conditional Probability  297

2
Concept Builder (CB)
Ideal Time Revise your concepts with questions
15 Min. medium difficulty level questions

1. If P(B) = 3/8 and P(A ∪ B) = 7/8 then find
the value of P(A’/B’)
(a) 1/2 (b) 1/3
(c) 1/4 (d) None of these
2. If P(A) = 0.4, P(A ∩ B) = 0.2 = P( A′ ∩ B′)
then find the value of P(B/A).
(a) 0.55 (b) 0.33
(c) 0.67 (d) None of these
3. If P(A/B) = 0.4, P(B/A) = 0.5, and P(B) = 0.6
then find the value of P(A)
(a) 0.67 (b) 0.33
(c) 0.75 (d) None of these
4. A bag contains 8 red and 6 black balls,
two balls are taken out from the bag one
after the other without replacement then
what is the probability that 2nd ball is
red if 1st ball was black?
(a) 8/13 (b) 5/13
(c) 7/13 (d) None of these
5. Three students are selected from a group
of 10 students. What is probability that
Hasan is selected if it is given that Adnan
is always one of the selected student?
(a) 7/36 (b) 11/36
(c) 13/36 (d) None of these
6. A bag contains 8 red and 6 black balls,
two balls are taken out from the bag one
after the other without replacement then
what is the probability that both of them
are black?
Response Grid
1. a b c d 2. a b c d 3. a b c d 4. a b c d 5. a b c d
6. a b c d 7. a b c d 8. a b c d 9. a b c d 10. a b c d
(a) 8/13 (b) 5/13
(c) 7/13 (d) None of these
7. A bag contains 25 tickets, numbered
from 1 to 25, two tickets are drawn from
the bag without replacement, what is the
probability that the 2nd ticket is a perfect
square if it is know that 1st ticket was a
perfect square number?
(a) 1/8 (b) 1/6
(c) 1/4 (d) None of these
8. A bag contains 25 tickets, numbered
from 1 to 25, one tickets are drawn from
the bag what is the probability that the
number is a perfect cube if it is given
that number is not a perfect square?
(a) 1/20 (b) 1/16
(c) 1/21 (d) None of these
9. Two dice are thrown simultaneously
what is the probability that two digit
number formed by two results is a prime
number if it is given that both the results
are prime number?
(a) 1/3 (b) 1/9
(c) 2/9 (d) None of these
10. Two dice are thrown simultaneously what
is the probability that two digit number
formed by two results is a perfect square
number if it is given that both the results
are prime number?
(a) 1/3 (b) 1/9
(c) 2/9 (d) None of these
298  Theory of Counting
3
Concept Cracker (CC)
Ideal Time
20 Min.
1. In Praxis Business School Kolkata, 50%
students like chocolate, 30% students
like cake and 10% like both. If a student
is selected at random then what is the
probability that he likes chocolates if it
is known that he likes cake?
(a) 1/3 (b) 2/5
(c) 3/5 (d) None of these
2. In a class 30% students like tea, 20% like
coffee and 10% like both tea and coffee. A
student is selected at random then what
is the probability that he likes tea if it is
known that he likes coffee?
(a) 1/3 (b) 1/4
(c) 1/2 (d) None of these
3. In a class 30% students like tea, 20% like
coffee and 10% like both tea and coffee. A
student is selected at random then what
is the probability that he does not like
tea if it is known that he likes coffee?
(a) 1/2 (b) 3/4
(c) 1/3 (d) None of these
4. In a class 30% students like tea, 20% like
coffee and 10% like both tea and coffee. A
student is selected at random then what
is the probability that he does not like tea
if it is known that he does not like coffee?
(a) 2/3 (b) 3/4
(c) 1/2 (d) None of these
5. What is the probability the quadratic
equation x2 + 2bx + (5b – 4) = 0 has
imaginary roots if – 5 < b < 5.
(a) 2/11 (b) 3/11
(c) 1/11 (d) None of these
Response Grid
1. a b c d 2. a b c d 3. a b c d 4. a b c d 5. a b c d
6. a b c d 7. a b c d 8. a b c d 9. a b c d 10. a b c d
Boost up your confidence with good
questions
6. Abhay speaks the truth only 60% . Hasan
rolls a die blindfolded and asks Abhay to
tell him if the outcome is a ‘prime’. Abhay
says, “YES”. What is the probability that
the outcome is really ‘prime’?
(a) 0.5 (b) 0.75
(c) 0.6 (d) None of these
7. Abhay speaks the truth only 60% . Hasan
rolls a die blindfolded and asks Abhay to
tell him if the outcome is a ‘prime’. Abhay
says, “NO”. What is the probability that
the outcome is really ‘prime’?
(a) 0.5 (b) 0.75
(c) 0.6 (d) None of these
8. Consider and event E = E1 ∩ E2 ∩ E3 find
the value of P(E) if P(E1) = 2/5, P(E2/E1)
=1/5 and P(E3/E1E2) = 1/10
(a) 2/125 (b) 1/125
(c) 3/125 (d) None of these
Direction for question number 9 and 10:
In a college 40% students play football, 50%
play cricket and 60% play chess, If P(A/B)
denotes the probability that a random selected
student is playing football if it is given that he
plays cricket or chess.
9. What is the maximum value of P(A/B).
(a) 1/3 (b) 1/2
(c) 2/3 (d) None of these
10. What is the minimum value of P(A/B)
(a) 1/3 (b) 1/2
(c) 2/3 (d) None of these
 Conditional Probability  299

Solutions
Concept Applicator (CA)
1. (a) 2. (a) 3. (d) 4. (b) 5. (c) 6. (b)
7. (c) 8. (c) 9. (b) 10. (b)

1.
(a) We know that P(B/A) 7.
(c) Sample space is {TH, HT, TT} so number
1 of elements is 3, and favorable case is
P( A  B) 3 1 {HT, TH} so required probability is 2/3
  
P( A) 2 2 Alternately:
3 Let A = event of getting one Head
2. (a) We know that and one Tail
P( A  B) and B = event of getting at least 1 Tail.
P(A/B)  P(B) Then P(A) = 2/4 = 1/2 ,
1
P(B) = 3/4 ,
P( A  B) 3 1
or  P(B)    and P(A ∩ B) = 2/4 = 1/2
P( A / B) 2 2
3 We have to find
3. (d) Since A and B are two mutually P(A/B) = P(A ∩ B)/P(B)
exclusive events so P(A ∩ B) = 0 so = (1/2)/(3/4) = 2/3
P(A/B) = 0.
8. (c) In this case sample space S = {(5,1),
4. (b) Since P(A ∪ B) = P(A) + P(B) – P(A ∩ B) so (5, 2), (5,3),(5,4), (5,5) and (5,6)}.
Number of elements in the sample
 2  3  4  1
P(A ∩ B) =   +    –   = space is 6 and the favorable case is
 5  5  5  5 (5, 6) so required probability is 1/6
1 Alternately:
P( A  B) 5 1 Let A = Event of getting outcome
Then P(A/B)     
P(B) 3 3 such as sum is more than 10
5 And B = Event of getting 5 on 1st
5. (c) We know that P(A/B) + P(A′/B)= 1. die
6. (b) It is known that the number is an Then  P(B) = 1/36 = 1/6 ,
odd number so sample space is and  P(A ∩ B) = 1/36
  S = { 1, 3, 5} We have to find
And favorable case is {5} so required P(A/B) = P(A ∩ B)/P(B)
probability is 1/3. = (1/36)/(1/6) = 1/6
300  Theory of Counting
9.
(b) In this case sample space S = { (2,6),
(3, 5), (4, 4), (5, 3) and (6, 2)}.
So number of elements in sample
space is 5.
Now consider the favorable cases-
{(3, 5) and (5, 3)}
So required probability is 2/5.
10. (b) Here Sample Space S = {(3, 1), (3, 2),
(3, 3), (3, 4), (3,5) and (3, 6)}.
So number of elements is 6.
And the favorable case is {(3, 1) and
(6, 3)}
So required probability is 2/6 = 1/3

Concept Builder (CB)

1. (d) 2. (d) 3. (c) 4. (a) 5. (d) 6. (d)
7. (b) 8. (a) 9. (c) 10. (b)

1. (d) We know that probability of 2nd ball being red is

P( A  B) 8/13.
P(A/B) = 5. (d) Total number of students are 10 but
P(B)
out of those Adnan is always selected
P ( A '  B ') so now we have to select 2 students
or P(A′/B′)  from 9 students and that can be done
P ( B ')
in 9C2 = 36 ways.
7
1 Number of ways such that Hasan is
1  P ( A   B ) 8 1
  selected is 8 so required probability
1  P(B) 3 5 is 8/36 = 2/9.
1
8
6. (d) Two black balls can be selected in
6C = 15 ways and two balls can
2. (d) We know that P( A′ ∩ B′) = 1– P(A∪B) 2
be selected in 14C2 = 91 ways, so
hence P (A ∪ B) = 1 – 0.2 = 0.8
required probability is 15/91.
Since P(A ∪ B) = P(A) + P(B) – P( A ∩ B)
7. (b) Sample space for the 2nd ticket is 24
or 0.8 = 0.4 + P( B) – 0.2 or P(B) = 0.6
(Since 1 ticket is already withdrawn)
Now P(B/A) = P(A ∩ B)/P(A) from 1 to 25 we have 5 perfect
= 0.2/0.4 = 1/2. squares so out of these 1 is already
3. (c) We know that drawn so favorable cases are only 4,
so required probability is 4/24 = 1/6
P( A  B)
P(A/B)   0.4  8. (a) From 1 to 25 we have 5 perfect
P(B) squares so sample space has 20
elements, and out of these only 8 is a
P( A  B) perfect cube so required probability
and P(B/A)   0.5 
P( A) is 1/20.
9. (c) As per the given condition outcome
P( A) 5
hence =   is (2,2), (2,3), (2,5), (3,2), (3, 3), (3,5),
P(B) 4 (5, 2), (5, 3) and (5,5)
Then P(A) = 0.75 So sample space is 3 × 3 = 9 and
number of favorable case is (2, 3)
4. (a) If 1st ball is black then remaining in
and (5,3)
bag is 8 red and 5 black balls then
So required probability is 2/9.
 Conditional Probability  301
10. (b) As per the given condition outcome So sample space is 3 × 3 = 9 and
is (2,2), (2,3), (2,5), (3,2), (3, 3), (3,5), number of favourable case is (2, 5).
(5, 2), (5, 3) and (5,5) So required probability is 1/9.

Concept Cracker (CC)

1. (a) 2. (c) 3. (a) 4. (b) 5. (b) 6. (c)
7. (d) 8. (b) 9. (c) 10. (d)

1. (a) Let P(A) = probability that a randomly Let P(A′) = probability that a
selected student likes chocolate = 0.5 randomly selected
Let P(B) = probability that a randomly student does not like
selected student likes cake = 0.3 tea = 1 – 0.3 = 0.7
Then P(A ∩ B) = 0.1 Let P(B) = probability that a
randomly selected
Now we have to find
student likes coffee
P(A/B) = P(A ∩ B)/P(B) = 0.2
= 0.1/0.3 = 1/3 Let P(B′) = probability that a
2. (c) Let P(A) = probability that a randomly randomly selected
selected student likes tea = 0.3 student does not like
Let P(B) = probability that a coffee = 1 – 0.2 = 0.8
randomly selected student likes And P(A ∩ B) = 0.1
coffee = 0.2 So P(A ∪ B) = P(A) + P(B) – P(A ∩ B)
Then P(A ∩ B) = 0.1 = 0.3 + 0.2 – 0.1 = 0.4
Now we have to find So P(A′ ∩ B′) = 1 – P(A ∪ B) = 1 – 0.4 =
P(A/B) = P(A ∩ B)/P(B) = 0.1/0.2 = 1/2 0.6
3. (a) Let P(A) = probability that a randomly Now we have to find
selected student likes tea = 0.3. P(A′/B′) = P(A′ ∩ B′)/P(B′) = 0.6/0.8 = 3/4
Let P(A′) = probability that a randomly 5. (b) For imaginary roots D < 0 or (2b)2 –
selected student does not like tea 4(1)(5b – 4) < 0
= 1 – 0.3 = 0.7.
Or b2 – 5b + 4 < 0 or (b – 1)(b – 4) < 0
Let P(B) = probability that a randomly or 1 < b < 4
selected student likes coffee = 0.2
So required probability is 3/11
Then
6. (c) There are two cases when Abhay
P(A′ ∩ B) = P(B) – P(A ∩ B) will say ‘Yes’:
= 0.2 – 0.1 = 0.1 Case (i) The number that came out
Now we have to find is a prime and Abhay is speaking
P(A′/B) = P(A′ ∩ B)/P(B) = 0.1/0.2 = 1/2 truth, probability for this case is
P(P) × P(T)
4. (b) Let P(A) = probability that a
randomly selected Here P(P) = probability of getting a
student likes tea = 0.3 prime = 3/6 = 1/2 = 0.5
302  Theory of Counting
P(T) is probability that Abhay is 8. (b) Required probability
speaking truth and P(T) = 0.6
= P(E)
So probability for this case is
0.5 × 0.6 = 0.3. = P(E1) × P(E2/E1) × P(E3/E1E2)
Case (ii) The number that came = (2/5)(1/5)(1/10) = 1/125.
out is not a prime and Abhay is not
speaking truth, probability for this Solution for 9 and 10.
case is P(P′) × P(T′) = 0.5 × 0.4 = 0.2.
So total probability for the given
Foot Ball (40x) Cricket (50x)
case is 0.3 + 0.2 = 0.5.
New sample space is 0.5 and we
have to find the probability of case
(i) which is 0.3/0.5 = 0.6. a d
7. (d) There are two cases when Abhay g b
will say ‘No’
f
Case (i) The number that came out is
e
a prime and Abhay is not speaking
truth, probability for this case is
P(P) × P(T’).
Here P(P) = probability of getting a Chess (60x)
prime = 3/6 = 1/2 = 0.5.
P(T) is probability that Abhay is
speaking truth and P(T) = 0.6 so From the above diagram
P(T’) = 0.4. P(A/B) =
So probability for this case is 0.5 x d+g+f 40x  – a
0.4 = 0.2. =
b + c + d + e + f + g 110x  –( g + e )
Case (ii) The number that came out
is not a prime and Abhay is speaking 9. (c) For maximum value of P(A/B)
truth, probability for this case is numerator should be maximum and
denominator should be minimum
P(P’) × P(T) = 0.5 × 0.6 = 0.3.
Or required value is 40x/60x = 2/3
So total probability for the given
case is 0.3 + 0.2 = 0.5. 10. (d) For minimum value of P(A/B)
numerator should be minimum and
New sample space is 0.5 and we
denominator should be maximum
have to find the probability of case
(i) which is 0.2/0.5 = 0.4. Or required value is 0/100 = 0
 Part B Conditional Probability  303

Introduction of
Concept 1 Conditional Probability
Conditional Probability: Consider two events of event B and vice versa then P(A/B) i.e
A and B such that B ≠ Ф, then probability probability of occurrence of event A when B
of occurrence of event A when B has already has already occurred
occurred is called conditional probability and P(A/B) = P(A ∩ B)/P(B)
is denoted by P(A/B). but we know that for two independent events
Hence P(A/B) = P(A ∩ B)/P(B) P(A ∩ B) = P(B) ⋅ P(A)
Hence
Conditional Probability for
independent Events P(A/B) = P(A ∩ B)/P(B) = P(A)
Hence for two independent events A and B
If A and B are independent events, then
probability of occurrence of event A is not P(A/B) = P(A)
affected by occurrence or non-occurrence P(B/A) = P(B)

Properties of
Concept 2 Conditional Probability
Some Properties of Conditional (v) Two events A and B are independent if
Probability and only if
(i) P(A/B) = P(A ∩ B)/P(B) P(A ∩ B) or P(AB) = P(A). P(B).
or P(A ∩ B) = P(B) ⋅ P(A/B). (vi) If A, B and C are any three independent
events, then
(ii) P(B/A) = P(A ∩ B)/P(A)
P(A ∩ B ∩ C) = P[A ∩ (B ∩ C)]
or P(A ∩ B) = P(A) ⋅ P(B/A)
= P(A) . P(B ∩ C)
(iii) P(A/B) may or may not be equal to
= P(A) ⋅ P(B) ⋅ P(C)
P(B/A).
(vii) If we generalize the result for n events
(iv) If A and B are independent events, then then : If A1,A2, ... An be any n events none
P(B/A) = P(B). of which is an impossible event, then
304  Theory of Counting
P(A1 ∩ A2 ∩ … ∩ An) = P(A1) ⋅ P(A2/A1) ⋅
P(A3/A1A2) … P(An/A1A2.An – 1)
If A1, A2, ... An are independent events,
then
P(A1∩ A2 ∩ ... ∩ An) = P(A1) ⋅ P(A2) ... P(An)
(viii) If A and B are two independent events,
then P(A ∪ B) = 1 – P(A′) ⋅ P(B′)
(ix) If A1, A2 ... An are independent events,
then P(A1 ∪ A2 ∪ …. ∪ An) = 1 – P(A′1) ⋅
P(A2′) ... P(An′)
(x) If A and B are two events such that
B ≠ Ф, then
P(A/B) + P(A′/B) = 1
(xi) If A and B be two events such that
A ≠Ф, then
P(B) = P(A). P(B/A) + P(A′). P(B/A′)

Concept 3 Bayes’ Theorem

Bayes’ theorem is just extension of conditional A 

P  k     
probability, in order to understand the Bayes’ A
theorem lets discuss the partition of a set. A
P  
Partition of a Set P( Ak ).  Ak 
 A  
A family of sets A1, A2, ... An is said to form a  P( A1 ).  P     P( A2 ). P  A  
 A   A 
partition of a set A if following conditions are  1  2 
 
satisfied:   A  
     P( An ).P 
  
 A  
(i) A1, A2,…., An are non – empty  n
(ii) Ai ∩ Aj = φ for i ≠ j
(iii) A = A1 ∪ A2 ∪ … ∪ An
Properties of Bayes’
Bayes’ Theorem
Theorem
Let us consider n mutually exclusive and
exhaustive events A1, A2, A3, ..., An and A is an • If A1, A2, ... An form a partition of S and
event which occurs together (in conjunction) A be any event then
with either of Ai i. e. if A1, A2, ..., An form a
P(A) = P(A1) ⋅ P(A/A1) + P(A2) ⋅ P(A/A2) +
partition of the sample space S and A be any
event, then from Bayes’ theorem … + P(An) ⋅ P(A/An)

• If P(A1) = P(A2) = … = P(An),
P(Ak /A) = P(A/Ak)/P(A/A1) + P(A/A2) + …
+ P(A/An)
• Priori and Posteriori Probabilities:
The probabilities P(A1), P(A2), ..., P(A2),
..., P(An) which are known before the
experiment takes place are called priori
1
Concept Deviator (CD)
Ideal Time Revise your concept (IIT advance or
5 Min.
Per Question
1. Let X and Y be two events such that
P(X|Y) = 1/2 , P(Y|X) =1/3, and
P(X ∩ Y) =1/6 . Which of the following is
(are) correct? [IIT JEE 2012]
(a) P(X ∪ Y) = 2/3
(b) X and Y are independent
(c) X and Y are not independent
(d) P(Xc ∩ Y) = 1/3
2. A signal which can be green or red with
probability 4/5 and 1/5 respectively, is
received by station A and transmitted to
station B. the probability of each station
receiving the signal correctly is 3/4. If the
signal received at station B is green, then
the probability that the original signal
was green is      [IIT JEE 2010] (c) 2/11 (d) 1/7
(a) 3/5 (b) 6/7
(c) 20/23 (d) 9/20
3. One Indian and four American men and
their wives are to be seated randomly
around a circular table. Then the
conditional probability that the Indian
man is seated adjacent to his wife given
Conditional Probability  305
probabilities and P(Ai/A) are called
posteriori probabilities.
• If A1, A2, ..., An form a partition of an
event A, then
P Ak 
P(Ak/A) 
P A1  P A2 
     P An 
tougher questions)
that each American man is seated
adjacent to his wife is  [IIT JEE 2007]
(a) 1/2 (b) 1/3
(c) 2/5 (d) 1/5
4. A person goes to office either by car,
scooter, bus or train probability of which
being 1/7, 3/7, 2/7 and 1/7 respectively.
Probability that he reaches office late, if
he takes car, scooter, bus or train is 2/9,
1/9, 4/9 and 1/9 respectively. Given that
he reached office in time, then what is
the probability that he travelled by a car.
[IIT JEE 2006]
(a) 1/9 (b) 1/11
5. A is targeting B, B and C are targeting
A. Probability of hitting the target by A,
B and C are 2/3,1/2 and 1/3 respectively.
If A is hit then find the probability that
B hits the target and C does not.
[IIT JEE 2003] 
(a) 1/2 (b) 1/5
(c) 2/11 (d) 1/7
306  Theory of Counting
6. A spaceship send signal to earth in respective probabilities 1/2, 1/4 and
binary logic, that means entire data is 1/4. For the ship to be operational at
sent only through two symbols ‘0’ and ‘1’. least two of its engines must function.
The probability that when 0 is sent from Let X denote the event that the ship is
the spaceship and received it correctly is operational and let X1, X2 and X3 denote
0.96 and the probability that when 1 is respectively the events that the engines
sent from the spaceship and received it E1, E2 And E3 are functioning. Which of
correctly is 0.95. If data received at the the following is (are) true?
earth is 1 then what is the probability [IIT JEE 2012]
that data sent is 0? c/X]
(a) P[X1 = 3/16
(a) 2/99 (b) 5/99
(b) P[Exactly two engines of the ship
(c) 4/99 (d) None of these
are functioning |X] = 7/8
7. Two fair dice are thrown what is the
(c) P[X|X2] = 5/16
probability that 1stdie will show a
number multiple of three if it is given that (d) P[X|X1] = 7/16
summation of two result is a multiple of 3.
10. For a biased die the probabilities for
(a) 1/6 (b) 5/12 different faces to turn up are given
(c) 7/36 (d) None of these below:
8. Two fair dice are thrown what is the
Face 1 2 3 4 5 6
probability that 1st die will show a
number multiple of three if it is given Probability 0.1 0.32 0.21 0.15 0.05 0.17
that summation of two result is not a
multiple of 3. The die is rolled and you are told that
face 1 or face 2 has turned up. Then the
(a) 1/6 (b) 5/12
probability that is face 1 is
(c) 7/36 (d) None of these
[IIT JEE 1981]
9. A ship is fitted with three engines
E1, E2 and E3. The engines function (a) 1/21 (b) 2/21
independently of each other with (c) 5/21 (d) None of these

Response Grid
1. a b c d 2. a b c d 3. a b c d 4. a b c d 5. a b c d
6. a b c d 7. a b c d 8. a b c d 9. a b c d 10. a b c d
 Conditional Probability  307

2
Concept Eliminator (CE)
Ideal Time Revise your concept (Maths Olympiad
Just solve it or tougher questions)

1. Rajesh doesn’t like to study. Probability (a) 7/15 (b) 7/30

that he will study is 1/3. If he studied (c) 8/15 (d) None of these
then probability that he will fail is 1/2
3. A pair of fair dice is rolled together till
and if he didn’t study then probability
a sum of either 5 or 7 is obtained. The
that he will fail is 3/4. If in result Rajesh
probability that 5 comes before 7 is
failed then what is the probability that
________ .
he didn’t studied.
(a) 1 (b) 2/5
(a) 2/3 (b) 3/4
(c) 1/5 (d) None of these
(c) 1/3 (d) None of these
4. In a Competitive test, a candidate
2. A box contains 8 red balls and 4 white
guesses, copies or knows the answer
balls. Hasan draws 2 balls from the box
to a multiple choice question with four
without replacement. It is given that the
choices. The probability that he makes a
balls have different weights, with each
guess is 1/3 and the probability that he
red ball having weight 0.1 kg and each
copies the answer is 1/6. The probability
white ball having weight 0.2 kg. Suppose
that his answer is correct given that he
that the probability that a given ball in
copied it is 1/8. Find the probability that
the urn is the next one selected is its
he knew the answer to the question,
weight divided by the sum of the weights
given that he answered it correctly.
of all balls currently in the box then what
is the probability that at least one of the (a) 24/29 (b) 26/29
ball is white? (c) 22/29 (d) None of these

Response Grid
1. a b c d 2. a b c d 3. a b c d 4. a b c d
308  Theory of Counting
Solutions
Concept Deviator (CD)
1. (a,b) 2. ( c) 3. (c) 4. (d) 5. (a) 6. (c)
7. (a) 8. (d) 9. (b, d) 10. (c)
1. (a,b) Since P(X/Y) = P(X ∩ Y)/P(Y) = 1/2
hence P(Y) = 2P(X ∩ Y) = 2 × 1/6 =
1/3
Similarly P(Y/X) = P(X ∩ Y)/P(X) = 1/3.
Hence P(X) = 3P(X ∩ Y) = 3 × 1/6 = 1/2
Now P(X ∪ Y) = P(X) + P(Y) – P(X∩Y)
= 1/2 + 1/3 – 1/6 = 2/3
Hence option (a) is correct.
Since P(X ∩ Y) = 1/6 and P(X) × P(Y)
= (1/2)(1/3) = 1/6
So P(X ∩ Y) = P(X) × P(Y)
So X and Y are independent
P(Xc ∩ Y) = (1 – 1/2)(1/3) = 1/6.
2. (c) Event G = original signal is green
E1 = A receives the signal correct
E2 = B receives the signal correct
E = signal received by B is green
Now total probability such that
signal received by B is green is
= P(GE1E2) + P [G(E1′E2′)]
+ P [E1 (G′E2′)] + P[E2(G′E1′)]
P(E) = 45/80
P(G/E) = (40/5 × 16)/46/5 × 16
= 20/23
3. (c) As per the given condition if we
Fix four American couples and one
Indian man in between any two
couples; we have 5 different ways
in which his wife can be seated, of
which only 2 cases are favorable.
∴  required probability = 2/5.
4.
(d) Let C, S, B, T be the events of the
person going by car, scooter, bus or
train respectively.
Then as per the given information
P(C) = 1/7, P(S) = 3/7, P(B) = 2/7, and
P(T) = 1/7.
Let L be the event of the person
reaching the office in time.
Now lets define a new event O as
an event of the person reaching the
office in time.
Then from the given information
P(O/C) = 7/9, P(O/S) = 8/9,
P(O/B) = 5/9 and P(O/T) = 8/9
Probability that he will reach office
late = P(O)
       
=  1  7    3  8     2  5     8  1 
 7 9   7 9   7 9   9 7 
Probability that he will reach office
1 7 
late if he travel by car   
7 9 
Here we need to find probability of
P(C/O) = {P(O/C) × P(C)}/P(O)
 1 7  
   
  7 9  
 1 7   3 8   2 5   8 1  
                  
 7 9   7 9   7 9   9 7  
1

7
5. (a) This is an example of conditional
probability,
 Conditional Probability  309
Required probability is
{P (A|BC ’)P (BC ’)}
{P (A|BC ’)P (BC ’)+  P (A|B’C )P (B’C )+  P (A|BC )P (BC )+  P (A|B’C ’)P (B’C ’)}
 1   2  
1     
=  2   3   
1
 1  2  1  1 1  1  1   2   2
(1)       (1)       (1)       (0)     
 2  3  2  3  2  3  2   3  
6. (c) If data received at earth is 1 then we have two cases:
Case (1) data sent is ‘1’ and received as ‘1’ probability in this case is 0.5(0.95)
Case (2) data sent is 0 and received as ‘1’, probability in this case is 0.5(0.04)
0.5 (0.04 )
So required probability is = 4/99.
{0.5 (0.95)+  0.5 (0.04)}
7. (a) Sum is multiple of 3 so we have following cases:
Case (i) sum is 3 then cases are (1, 2), (2, 1)
Case (ii) sum is 6 then cases are (1, 5), (2, 4), (3, 3), (4, 2) and (5, 1)
Case (iii) sum is 9 then cases are (3, 6), (4, 5), (5, 4), and (6, 3)
Case (iv) sum is 12 then only case is (6,6)
So total number of elements in sample space is n(S) = 12
Number of favorable cases are 2
So required probability = 2/12 = 1/6
8. (d) From the answer of previous question required probability is 1 – 1/6 = 5/6.
9. (b,d) We will analyze the options one by one-
 1  1  1
      1
2 4 4
(a) P[X1c/X]=  =
 1   1   3   1   1   1   1   1   3   1   1   1   8
      +       +       +       
 2 4 4 4 4 2 2 4 4 2 4 4 
 8   1   1   1  
  –       
(b) P(Exactly two engines are functioning/X) =  32   4   4   2  
8
 1   1   3   1   1   1   1   32
      +     +      
4  2 4 2 4 2 4  5
(c) P(X/X2) = =
1  1   1   1   3   1   1   1   3   8
    +      +     +     
4  2   4   2   4   2   4   2   4  
 1   1   1   1   3   1   3  
      +      +      
2  4 4 4 4 4 4  7
(d) P(X/X1) = =
1  3   3   1   1   1   3   1   3   16
  ×   +          +      
2  4   4   4   4   4   4   4   4  
Option b and d are correct.
10. (c) Here sample space is 0.1 + 0.32 = 0.42
And favourable case is 0.1, so required probability is 0.1/0.42 = 5/21.
310  Theory of Counting

Concept Eliminator (CE)

1. (b) 2. (d) 3. (b) 4. (a)

1. (b) He will fail in exam in two cases: Now, P( a sum of 5 in a single throw)
Case (i) He studied and failed,     = 4/36 =1/9
probability of this case is P( neither 5 nor 7) = 26/36 = 13/18
  (1/3)(1/2) = 1/6 Required probability

Case (ii) He didn’t studied and failed,  1   13   1   13  2  1  2

=                ... 
probability of this case is  9   18   9   18   9  5
4. (a) Let G, C, K, and A are events where
  (2/3)(3/4) = 1/2.
G = Guess answer, C = Copy answer,
So total probability is
K = Know the answer, and A = Answer
  1/6 + 1/2 = 4/6 = 2/3 correctly
Then required probability P(G) = Probability that the Candidate
Guess the answer = 1/3 (given)
  = (1/2)/(2/3) = 3/4.
P(C) = Probability that the Candidate
2. (d) Probability that 1st ball is red is Copy the answer = 1/6 (given)
8  0.1 1 P(K) = Probability that the Candidate

8  0.1   4  0.2 2 Know the answer = ?
Now, G,C and K are mutually
Probability that 2nd ball is red is
exclusive and exhaustive events
7  0.1 7
 Therefore, P(G) + P(C) + P(K) = 1
7  0.1    4  0.2 15
P(K) = 1 – 1/3 – 1/6 = 1/2.
So probability that both of them are
Say G(Candidate guesses) has
 1  7  7 occurred. As, there are four choices
red is     =
 2   15  30
out of which only one is correct, then
Required probability = 1–7/30 = 23/30. the probability that the candidate
made a guess is 1/4.
3. (b) Sum of 5 can be given by, (1,4), (4, 1),
(3,2) and (2,3) i.e 4 ways.   P(A/G) = 1/4
P( A/C) = 1/8 ( given) then
Sum of 7 can be given by ( 1,6), (6,1)
(2,5), (5, 2), (4,3) and (3,4) i.e 6 ways P( A/K) = Answer correctly that the
candidate know = 1
We can find the number of ways of
Applying Baye’s Theorem we have,
throwing neither 5 nor 7 is
P(K/A) = [ P(K).P(A/K)]/[P(G) ⋅ P(A/G) +
  36 – (4+6) = 26
P(C) ⋅ P(A/C) + P(K) ⋅ P(A/K) = 24/29
 12
Binomial Probability  311

Binomial
Probability

Topics Covered

 Introduction of Binomial Theorem

 Binomial Distribution

 Expected Value

Part A: Topic Number of Questions

Solved Example 5
Concept Applicator 10
Concept Builder 10
Concept Cracker 10
Part B: Topic Number of Questions
Concept Deviator 12
Concept Eliminator 5
Total 52
312  Theory of Counting
Part A
Introduction of
Concept 1 Binomial Probability
Consider a situation in which an experiment
is carried out n times
Let P = the probability of occurrence of an
event E in one trial
P′ = 1 – P = probability of non-occurrence of
event E in one trial.
Let r = number of successes i. e. number of
times event E occurs in n trials.
Then the probability of occurrence of event E
exactly r times in n trials is denoted by P(r)
and is given by
P(r) = nCrPr P′ n – r
= ( r + 1)th term in the expansion
of (P + P′)n
Proof: Probability of occurrence of event E in
one trial = P.
Probability of non-occurrence of event E in
one trial = Q = P′ = 1 – P
Event E occurs exactly r times in n experiments
means that the even E occurs r times and it
does not occur (n – r) times in n experiments.
In other words out of n experiments event
with probability P occurred r times and event
with probability P′ occurred n–r times
Out of n experiments event E can be selected
in nCr ways.
Since the n experiments are independent.
QR Code / Video Link
Therefore, probability of occurrence of event
E with probability P exactly r times out of n
experiments is given by
P(r) = nCr (P ⋅ P ... r times) [P′ . P′ ... (n – r) times]
= nCrpr q n – r
Example 1:  A coin is tossed thrice what
is the probability of getting exactly 1
‘HEAD’?
Solution:  Probability of getting a ‘HEAD’ is
1/2 , out of three results exactly 1 is HEAD
so we have three cases:
Case (i) if 1st result is Head then probability
is (1/2)(1/2)(1/2)
Case (ii) if 2nd result is Head then probability
is (1/2)(1/2)(1/2)
Case (iii) if 3rd result is Head then probability
is (1/2)(1/2)(1/2)
So total probability is 3/8.
Example 2:  A die is thrown 5 times, what is
the probability that a composite number
will appear exactly three times?
Solution:  Let us take this question to
understand the Binomial Probability:
When a die is thrown then probability of getting
a composite number is P(C) = 2/6 = 1/3
Then probability of not getting a composite
number is P(C′) = 1–1/3 = 2/3.

For Smart phone/ Tablet users

Video Link for Desktop/Laptops users http://dishapublication.com/video-resources

 Binomial Probability  313
Let us take a case in which 1st, 2nd and 3rd Alternately:
result is a composite number and 4th and 5th
Total number of experiments = n = 5
is not a composite numbers or the outcome
CCCC′C′ and probability in this case is Number of favorable cases = r = 3
3 2
 1   1   1   2  2  1   2 Probability of getting favorable case = P(F) = (1/3)
 3   3   3   3   3  =   3   3 
Probability of not getting favorable case
Now we have to find that how many such
cases exists, it is similar to in how many ways = P(F′) = (2/3)
we can arrange 3C and 2C′ which is equal to Required probability is
(5!)/(2!)(3!) = 5C3. 3 2
3 2
 1   2
 1   2 (5C3)(F)3(F′)2 = (5C3)    
So total number of ways is (5C3)     3 3
 3  3

Concept 2 Binomial Distribution

Consider E be an event. Example 3:  A bag contains 3 red and 2

Let P = probability of occurrence of event black balls, one ball is drawn 4 times
E in one trial. (with replacement) then what is the
And Q = probability of non-occurrence of probability that the result is 2 red and
event E in one trial = P′ = 1 – P
2 black balls?
Hence clearly P + Q = 1
Let number of times the experiment is carried Solution:  Total number of experiments = n = 4
out is n and out of these n experiments r Number of favorable cases = r = 2
number of times event E (With probability P)
occurred then probability of this is given by (Here favorable case is getting red ball)
P(r) = nCrpr q n – r Probability of getting favorable case
Consider with different values of r- = P(F) = (3/5)
P(0) = nC1qn Probability of not getting favorable case
P(1) = nC1pqn – 1
= P(F′) = (2/5)
P(2) = nC2p2qn – 2
Required probability is
P(3) = nC3p3qn – 3
… 2 2
 3  2
… (4C2)(F)2(F′)2 = (4C2)    
 5  5
P(n) = nCnpn
And P(1) + P(2) + P(3) + ... + P(n) = 1 = 6 × 36/3125 = 216/3125
314  Theory of Counting
Example 4:  A coin is tossed 8 times what
is the probability that at least one
‘Head” will appear?
Solution:  Probability that no Tail will appear
is (1/2)8 = 1/256
1 255
So required probability = 1 – = = P(F′) = (2/3)
256 256
Example 5:  A die is thrown 5 times what is
the probability that a number multiple
of 3 will appear exactly 4 times?
Concept 3 Expected Value
The concept of “expected value” is very
important in the Theory of Probability. To
understand this let us take an example, say
a man is playing a game of “throwing a die”.
He is given ` 100 if he throws a ‘one’ and ` 500
if he throws a “ six” on the die and not paid
anything if he throws any other number (i.e
if he throw 2, 3, 4 or 5) As per the rule of the
game , he will have to pay some amount to the
casino each time he wants to throw the die.
Suppose he throws the die a large number
of times – say 6000 times. As the number of
times the experiment is repeated becomes very
large hence the number of times each event
will occur is given by theory of probability.
A “one” will appear with a probability of 1/6,
i.e. it is expected to appear 1000 times out of a
total of 6000 times the die is thrown. Similarly,
a “six” will appear 1000 times. Hence, the
amount he will get in 6000 throws is 1000 ×
100 + 1000 × 500 = 600000. The amount he
gets per throw will be 600000/6000 = 100.
So in this example we can say that the person’s
expected value of this game per throw in the
long run is ` 100.
Solution:  Total number of experiments = n = 5
Number of favorable cases = r = 3
Probability of getting favorable case
= P(F) = (2/6) = (1/3)
Probability of not getting favorable case
Required probability is
5×2 10
(5C4)(1/3)4(2/3)1 = 5
=
3 243
Expected Value = Σ[Probability (Ei) ×
Monetary Value associated with event Ei]
Lets take one more example to understand
the concept of expected value:
Let us assume that in a biased game a person
will get ` 5 if he throws a ‘five’ and will get
` 8 for any other number, then we have to
find the expected income per throw for a large
number of experiments.
It is given that number ‘five’ will appear 5
times as frequently as any other number.
Here 1st we need the probability of the events
involved.
Let us assume that the probability of getting
any number other than ‘five’ as p. The
probability of getting a five is 5p.
Since all the events are mutually exclusive
and collectively exhaustive, the sum of their
probabilities must be equal to 1.
Hence p + p + p + p + p + 5p = 1
⇒ 10p = 1  or  p = 1/10
Hence the probability that the number ‘five’
appears is 5/10 = 1/2 and the probability that
any other number appears is 1/10.
Hence the expected value is = (1/2)(5) + 1/10(8
+ 8 + 8 + 8 + 8) = 65/10 = 6.5.

1
Concept Applicator (CA)
Ideal Time
10 Min.
1. A die is thrown 5 times, what is the
probability that an even number will
appear exactly three times?
(a) 5/16 (b) 5/32
(c) 5/64 (d) None of these
2. A die is thrown 10 times, what is the
probability that an odd number will
appear 6 times?
(a) 210/512 (b) 105/512
(c) 105/1024 (d) None of these
3. A die is thrown 5 times, what is the
probability that a prime number will
appear exactly three times?
(a) 5/16 (b) 5/32
(c) 5/64 (d) None of these
4. A coin is tossed five times what is the
probability of getting exactly 2 ‘HEAD’ ?
(a) 5/16 (b) 5/32
(c) 5/64 (d) None of these
5. A die is thrown 6 times, what is the
probability that a composite number will
appear three times?
(a) 40/729 (b) 80/729
(c) 160/729 (d) None of these
6. A bag contains 3 red and 2 black balls, one
ball is drawn 4 times (with replacement)
then what is the probability that the
result is 3 red and 1 black balls?
Response Grid
1. a b c d 2. a b c d 3. a b c d 4. a b c d 5. a b c d
6. a b c d 7. a b c d 8. a b c d 9. a b c d 10. a b c d
Binomial Probability  315
Apply your concepts with easy and
conceptual questions.
(a) 108/3125 (b) 216/3125
(c) 432/3125 (d) None of these
7. A bag contains 3 red and 3 black balls, one
ball is drawn 5 times (with replacement)
then what is the probability that the
result is 3 red and 2 black balls?
(a) 5/32 (b) 5/64
(c) 5/128 (d) None of these
8. A bag contains 6 red and 4 black balls, one
ball is drawn 6 times (with replacement)
then what is the probability that the
result is 3 red and 3 black balls?
(a) 432/3125 (b) 864/3125
(c) 216/3125 (d) None of these
9. A coin is tossed 10 times what is the
probability that exactly 5 ‘Tail” appear?
(a) 31/256 (b) 63/512
(c) 63/256 (d) None of these
10. A coin is tossed 10 times what is the
probability that at least one ‘Tail” will
appear?
1023 1
(a) (b)
1024 1024
511
(c) (d) None of these
1024
316  Theory of Counting

2
Concept Builder (CB)
Ideal Time Revise your concepts with questions
15 Min. medium difficulty level questions
1. In a school there are 100 students out of 5. Probability that a shooter can shoot the
which 10 girls and 90 boys, school teacher target is 0.8, if tried 5 times then what is
called 1 student every day for 8 days then the probability that the target will be hit (i.e
what is the probability that there will be 3 shooter will hit the target at least once)?
girls and 5 boys in that 8 students? (a) 624/625 (b) 3124/3125
1  9
3 5 (c) 124/125 (d) None of these
(a) (8C3)     6. A pair of dice is thrown 5 times. If getting
 10   10 
a total of 9 is considered as win then
3 5
 8  9 what is the probability of getting at least
(b) (8C3)    
 10   10  4 success?
3 5 40 39
 8  9 (a) (b)
(c) (8C5)     95
95
 10   10 
(d) None of these 41
(c) (d) None of these
2. What is the probability that at least one 95
girl is selected ? 7. A bag contains 5 red, 6 black and 4 blue
balls, 5 balls are drawn with replacement
108 −  89 108 −  98 then what is the probability that red ball
(a) (b)
108 108 will appear in exactly 3 times?
98 −  88 (a) 35/243 (b) 71/243
(c) (d) None of these
8
9 (c) 40/243 (d) None of these
3. If two dice are drawn 5 times then what 8. A bag contains 5 red, 6 black and 4 blue
is the probability that sum 10 will appear balls, 5 balls are drawn with replacement
in exactly 3 times? then what is the probability that red ball
will appear at least 3 times?
(a) 6655/124416 (b) 1210/124416
(a) 7/18 (b) 2/9
(c) 605/124416 (d) None of these
(c) 5/18 (d) None of these
4. A bag has 3 red and 2 black balls, 1 9. In the above question what is the
ball is drawn from the bag 5 times with probability that at least 1 red ball will
replacement, what is the probability that appear?
the there will be 3 red and 2 black balls
in the 5 results? 32 64
(a) (b)
243 243
(a) 57/225 (b) 104/225
31
(c) 216/625 (d) None of these (c) (d) None of these
243
 Binomial Probability  317
10. A die is thrown 5 times what is the 10 11
probability that a composite number will (a) (b)
243 243
appear exactly 4 times?
7
(c) (d) None of these
243
Response Grid
1. a b c d 2. a b c d 3. a b c d 4. a b c d 5. a b c d
6. a b c d 7. a b c d 8. a b c d 9. a b c d 10. a b c d

3
Concept Cracker (CC)
Ideal Time Boost up your confidence with good
20 Min. questions

1. A coin is tossed 10 times then what is the 2 10

probability that ‘Tail’ will appear at least  1   11 
(b) (12C10)    
8 times?  12   12 
(a) 7/128 (b) 7/256 1
10
 11 
2
(c) (12C10)    12 
(c) 7/512 (d) None of these  12 
2. Probability that India will win against (d) None of these
Pakistan in a cricket match is 2/3, in 5. If two dice are drawn 12 times then what
series of 5 matches what is the probability is the probability that sum will be at
that India will loose only 2 games? least 10 in exactly 10 times?
(a) 40/81 (b) 40/243 10 2
1  11 
(a) (12C3)    12 
(c) 80/243 (d) None of these  12 
3. Probability that India will win against 2
 1   11 
10
Pakistan in a cricket match is 2/3, in (b) (12C10)    
 12   12 
series of 5 matches what is the probability
10 2
that India will win the series? 1  11 
(c) (12C10)    12 
(a) 161/81 (b) 192/243  12 

(c) 172/243 (d) None of these (d) None of these

6. Probability that Priyanka will pass an
4. If two dice are drawn 12 times then what
exam is ‘k’, she appeared in 5 exams and
is the probability that sum 10 will appear
if probability that she will pass is exactly
in exactly 10 times?
4 out of 5 then find the value of ‘k’
10 2 (a) 4/5 (b) 1/5
1  11 
(a) (12C3)    12 
 12  (c) 2/5 (d) None of these
318  Theory of Counting
7. In a bulb manufacturing company it replacement, what is the probability that
is known that 10% of the bulbs are the there will be a red and b black balls
defective, what is the probability that in the (a+b) results?
out of 10 randomly selected bulbs not
( ab)!( a abb )
more than 10% is defective? (a)
( a !)(b !)( a + b)a +b
910 99
(a) (b)
1010 109 ( a + b)!( a abb )
10 (b)
9 ( a ! b !)( a + b)a +b
(c) (d) None of these
109
8. Two dice are thrown 4 times what is 2( a + b)!( a abb )
(c)
the probability the summation will be a ( a !)(b !)( a + b)a +b
prime number for exactly prime number
of times? (d) None of these
11 19 10. If ‘k’ coins are tossed together then what
(a) (b) is the probability that ‘Tail’ will appear
124 124
on Odd number of coins?
41
(c) (d) None of these  1  1 
124 (a)   (b) 
 2k   2k −1 
9. A bag has a red and b black balls, 1 ball
(c) 1/2 (d) None of these
is drawn from the bag (a+b) times with

Response Grid
1. a b c d 2. a b c d 3. a b c d 4. a b c d 5. a b c d
6. a b c d 7. a b c d 8. a b c d 9. a b c d 10. a b c d
 Binomial Probability  319

Solutions
Concept Applicator (CA)
1. (a) 2. (b) 3. (a) 4. (a) 5. (c) 6. (b)
7. (d) 8. (b) 9. (c) 10. (a)

1. (a) Total number of experiments = n = 5 Required probability is

Number of favorable cases = r = 3 3 2
 1  1
Probability of getting favorable case (5C3)(F)3(F′)2 = (5C3)    
 2  2
= P(F) = (1/2) = 10/32 = 5/16
Probability of not getting favorable 4. (a) Total number of experiments = n=5
case = P(F′) = (1/2)
Number of favorable cases = r = 2
Required probability is
Probability of getting favorable case
3 2
 1  1 = P(F) = (1/2)
(5C3)(F)3(F′)2 = (5C3)    
 2  2 Probability of not getting favorable
= 10/32 = 5/16 case = P(F′) = (1/2)
2. (b) Total number of experiments Required probability is (5C2)(F)2(F′)3
= n = 10 2
 1  1
3

Number of favorable cases = r = 6 = (5C2)     = 10/32 = 5/16.

 2  2
Probability of getting favorable case 5. (c) Total number of experiments = n=6
= P(F) = (1/2) Number of favorable cases = r = 3
Probability of not getting favorable Probability of getting favorable case
case = P(F′) = (1/2)
= P(F) = (1/3)
Required probability is
Probability of not getting favorable
6 4
 1  1 case = P(F′) = (2/3)
(10C6)(F)6(F′)4 = (10C6)    
 2  2 Required probability is
= 210/1024 = 105/512 3 3
 1   2
3. (a) Total number of experiments = n = 5 (6C3)(F)3(F′)3 = (6C3)    
 3  3
Number of favorable cases = r = 3
= 20 × 8/729 = 160/729
Probability of getting favorable case
6. (b) Total number of experiments = n=4
= P(F) = (1/2)
Number of favorable cases = r = 3
Probability of not getting favorable (Here favorable case is getting red
case = P(F′) = (1/2) ball)
320  Theory of Counting
Probability of getting favorable case Probability of getting favorable case
= P(F) = (3/5) = P(F) = (6/10) = (3/5)
Probability of not getting favorable Probability of not getting favorable
case = P(F′) = (2/5) case = P(F′) = (2/5)
Required probability is Required probability is
3 1 3 3
 3  2  3  2
(4C3)(F)3(F′)1 = (4C3)     (6C3)(F)3(F′)3 = (6C3)    
 5  5  5  5
= 27 × 8/3125 = (20 × 27 × 8)/15625
= 216/3125 = 864/3125
7. (d) Total number of experiments = n=5 9. (c) Total number of experiments
Number of favorable cases = r = 3 = n = 10
(Here favorable case is getting red Number of favorable cases = r = 5
ball) Probability of getting favorable case
Probability of getting favorable case = P(F) = (1/2)
= P(F) = (3/6) = (1/2) Probability of not getting favorable
Probability of not getting favorable case = P(F′) = (1/2)
case = P(F′) = (1/2) Required probability is
Required probability is 5 5
 1  1
3 2 (10C5)(F)5(F′)5 = (10C5)    
 1  1  2  2
(5C3)(F)3(F′)2 = (5C3)    
 2  2
= 63/256
= 10/32 = 5/16 10. (a) Probability that no Tail will appear
8. (b) Total number of experiments = n=6 is (1/2)10 = 1/1024
Number of favorable cases = r = 3 So required probability
(Here favorable case is getting red 1 1023
ball) = 1 – =
1024 1024

Concept Builder (CB)

1. (a) 2. (b) 3. (c) 4. (c) 5. (b) 6. (c)
7. (c) 8. (b) 9. (d) 10. (a)

1. (a) Total number of experiments = n=8 Required probability is

Number of favorable cases = r = 3 3 5
1  9
(Here favorable case is when girl (8C )(1/10)3(9/10)5 = (8C
3) 
3  10   10 
student is called)
Probability of getting favorable case 2. (b) Total number of experiments = n=8
= P(F) = (10/100) = (1/10) Number of favorable cases = r = 0
(Here favorable case is when girl
Probability of not getting favorable
student is called)
case = P(F′) = (9/10)
 Binomial Probability  321
Probability of getting favorable case Probability of getting favorable case
= P(F) = (10/100) = (1/10) = P(F) = (0.8)
Probability of not getting favorable Probability of not getting favorable
case = P(F′) = (9/10) case = P(F′) = (0.2)
Required probability is Required probability is
(8C0)(1/10)0(9/10)8 (5C0)(0.8)0(0.2)5 = 1/3125
1  9
0
98
8 So probability that the target is hit at
= (8C )     = least once is 1 – 1/3125 = 3124/3125
0  10   10 
108
6. (c) At least 4 success means a sum of 9
Required probability
occurred 4 or 5 times.
98 108 −  98 So required probability is P(4) + P(5)
= 1 − =
108 108 Total number of experiments = n = 5
3. (c) Total number of experiments = n = 5 Number of favorable cases = r = 4 or 5
Number of favorable cases = r = 3 Sum of 9 is given by (3, 6), (4, 5), (5,
Total sample space in one such trial 4), and (6, 3) so number of elements
is n(S) = 6 × 6 = 36 in favorable case is 4
Favorable cases are (4, 6), (5, 5) and Probability of getting favorable case
(6, 4) = P(F) = (4/36) = (1/9)
Probability of getting favorable case Probability of not getting favorable
= P(F) = (3/36) = (1/12) case = P(F′) = (8/9)
Probability of not getting favorable Required probability is now
case = P(F′) = (11/12) 4 1
 1   8
Required probability is P(4) = (5C4)    
 9  9
3 2
 1   11  5 0
(5C3)     = 605/124416  1   8
 12   12  And P(5) = (5C5)    
 9  9
4. (c) Total number of experiments = n = 5
4 1
Number of favorable cases = r = 3  1   8
So total probability = (5C4)    
(Here favorable case is getting red  9  9
ball) 5 0
 1   8 40 + 1 41
+ (5C5)     = =
Probability of getting favorable case  9  9 95 95
= P(F) = (3/5) 7. (c) Total number of experiments = n=5
Probability of not getting favorable Number of favorable cases = r = 3
case = P(F′) = (2/5)
(Here favorable case is getting red
Required probability is
ball)
10  27  4 216
(5C3)(3/5)3(2/5)2 =  Probability of getting favorable case
5 625
5 = P(F) = (5/15) = (1/3)
5. (b) Total number of experiments = n = 5
Probability of not getting favorable
Number of favorable cases = r = 0
case = P(F′) = (2/3)
(means he will not hit the target)
322  Theory of Counting
Required probability is 9. (d) Total number of experiments = n = 5
10  1  4 40 Number of favorable cases = r = 0
(5C3)(1/3)3(2/3)2 = 
5 243 (that means no red ball will appear)
3
8. (b) Total number of experiments = n = 5 Probability of getting favorable case
Number of favorable cases = r = 3 or = P(F) = (5/15) = (1/3)
4 or 5 (Here favorable case is getting
red ball). Probability of not getting favorable
case = P(F′) = (2/3)
Probability of getting favorable case
= P(F) = (5/15) = (1/3) Required probability is
Probability of not getting favorable 1  1  32
32
(5C0)(1/3)0(2/3)5 = 
case = P(F′) = (2/3) 3 243 5
P(3) = (5C3)(1/3)3(2/3)2 So probability that at least one red
32 211
10  1  4 40 ball is 1 – =
=  243 243
5 243
3 10. (a) Total number of experiments = n = 5
P(4) = (5C4)(1/3)4(2/3)1 Number of favorable cases = r = 3
5 1  2 10
=  Probability of getting favorable case
35 243
= P(F) = (2/6) = (1/3)
P(5) = (5C0)(1/3)5(2/3)2
1 1  4 4 Probability of not getting favorable
=  case = P(F′) = (2/3)
35 243
Required probability is Required probability is
40 10 4 54 2 52 10
+  +  = = (5C4)(1/3)4(2/3)1 = 
243 243 243 243 9 35 243

Concept Cracker (CC)

1. (a) 2. (c) 3. (b) 4. (c) 5. (d) 6. (a)
7. (d) 8. (d) 9. (b) 10. (c)

1. (a) As per the given question we have to 10

 1
find the probability of getting 8 or 9 =  
2
(45 +1 0 +1 ) = 56/1024 = 7/128
or 10 ‘Tail’
So required probability is P(8) + P(9) 2. (c) Total number of experiments = n = 5
+ P(10) Number of favorable cases = r = 3
8 2 9 1 (Here favorable case is when India
 1  1  1  1
(10C + (10C9) wins the game)
8) 
 2   2 
 2   2 
Probability of getting favorable case
10 0
 1  1 = P(F) = (2/3)
+ (10C 10) 
 2   2  Probability of not getting favorable
case = P(F′) = (1/3)
 Binomial Probability  323
Required probability is Favorable cases are For summation
3 2 as 10 – (4, 6), (5, 5) and (6, 4)
 2  1 
(5C3)     = 80/243 For summation as 11 – (5, 6) and (6.5)
 3  3
For summation as 12 – (6,6)
3. (b) Total number of matches = n = 5
So total number of favorable cases is 6
India will win the series if it wins
either 3 or 4 or 5 matches. Probability of getting favorable case
In previous question we have = P(F′) = (6/36) = (1/6)
calculated the value of P(3) = Probability of not getting favorable
probability of winning 3 matches case = P(F′) = (5/6)
3 2 Required probability is
 2  1 
= (5C 3)  10 2
 3   3   1  5
(12C10)    6 
Required Probability  6
= P(3) + P(4) + P(5) 6. (a) Total number of experiments = 5
3 2 4 1 Number of favorable cases = r = 4
 2  1   2  1 
= (5C3)     + (5C4)     Probability of getting favorable case
 3  3 3 3
= P(F) = (k)
5 0
 2  1  Probability of not getting favorable
+ (5C 5) 
 3   3  case = P(F′) = (1 – k)
10  8 5  16 1  32 192 Required probability is
   
243 243 243 243 (5C4) ( k )4 (1 − k )1 = 256/625 so k = 4/5
7. (d) Total number of experiments = n = 10
4. (c) Total number of experiments = n = 12
Number of favorable cases = r = 0
Number of favorable cases = r = 10
or 1 (Here favorable case is getting
Total sample space in one such trial defective bulbs)
is n(S) = 6 × 6 = 36
Probability of getting favorable case
Favorable cases are (4, 6), (5, 5) and
= P(F) = (1/10)
(6, 4)
Probability of not getting favorable
Probability of getting favorable case
case = P(F′) = (9/10)
= P(F) = (3/36) = (1/12)
Required probability is
Probability of not getting favorable
case = P(F′) = (11/12) 0 10 1 9
1  9 1  9
Required probability is (10C 0) 
 10   10  + (10C 1) 
 10   10 
10 2
1  11  19(99 )
(12C10)    12     =
 12 
1010
5. (d) Total number of experiments = n = 12 8. (d) Total number of experiments = n = 4
Number of favorable cases = r = 10 Number of favorable cases = r = 2 or 3
Total sample space in one such trial Total sample space in one such trial
is n(S) = 6 × 6 = 36 is n(S) = 6 × 6 = 36
324  Theory of Counting
Favorable cases are For summation Probability of getting favorable case
as 10 – (4, 6), (5, 5) and (6, 4) = P(F) = a/(a + b)
For favorable cases: Probability of not getting favorable
Summation is 2 – (1,1) case = P(F′) = b/(a+b)
Summation is 3 – (1, 2) and (2, 1) Required probability is
Summation is 5 – (1,4), (2, 3), (3, 2) (4, 1)  a   b 
a b
Summation is 7 – (1,6), (2, 5), (3,4 ), (a+bCa) 
 a + b   a + b 
(4,3), (5, 2) and (6, 1)
= ( a + b)!( a abb )
Summation is 11 – (5, 6) and (6, 5)
( a !)(b !)( a + b)a +b
So total number of favorable cases is
15 10. (c) Required probability is given by P(1)
+ P(3) + P(5) + ... here P(r) represents
Probability of getting favorable case
probability of getting ‘r’ number of
= P(F) = (15/36) = (5/12) tails.
Probability of not getting favorable Now
case = P(F′) = (7/12)
1 k −1
Required probability is  1  1
P(1) = (kC1)    
2 2  2  2
 5  7
P(2) + P(3) = (4C2)     + (4C3) k
 12   12   1
= (kC1)  
 2
 5  3  7 1 6   52  72   4  53  7
     3 k −3
12  12  124  1  1
P(3) = (kC3)    
 2  2
(52  7  2)(21   1
  0)
  k
4
12  1
= (kC3)  
350  31  2

124 So required probability
9. (b) Total number of experiments = P(1) + P(3) + P(5) +…..
= n = (a + b)  1
=  k  (kC1 + kC3 + kC5 + …)
Number of favorable cases = r = a 2 
(Here favorable case is getting red
ball)  1  k −1 1
=  k  (2 ) =
2  2
 Part B Binomial Probability  325

Introduction of
Concept 1 Binomial Probability
Consider a situation in which an experiment Let r = number of successes i. e. number of
is carried out n times times event E occurs in n trials.
Let P = the probability of occurrence of an Then the probability of occurrence of event E
event E in one trial exactly r times in n trials is denoted by P(r)
P′ = 1 – P = probability of non-occurrence of and is given by
event E in one trial. P(r) = nCrPr P′ n – r = ( r + 1)th term in the
expansion of (P + P′)n

Concept 2 Binomial Distribution

Consider E be an event. Consider with different values of r-

Let P = probability of occurrence of event E in P(0) = nC1qn
one trial. P(1) = nC1pqn – 1
And Q = probability of non-occurrence of event P(2) = nC2p2qn – 2
E in one trial = P′ = 1 – P
P(3) = nC3p3qn – 3
Hence clearly P + Q = 1
...
Let number of times the experiment is carried
...
out is n and out of these n experiments r
number of times event E (With probability P) P(n) = nCnpn
occurred then probability of this is given by And P(1) + P(2) + P(3) +…..+ P(n) = 1
P(r) = nCrpr q n – r
326  Theory of Counting

Concept 3 Expected value

Expected Value = Σ[Probability (Ei) × Monetary Value associated with event Ei]

1
Concept Deviator (CD)
Ideal Time Revise your concept (IIT advance or
5 Min. tougher questions)
Per Question

1. A multiple choice examination has 5 6 4

 4  2
questions. Each question has three (c) (10C6)    
alternative answers of which exactly one  5  5
is correct. The probability that a student (d) None of these
will get 4 or more correct answers just by 3. Probability that a shooter will hit
guessing is [IIT JEE 2013] the target is 1/2, What should be the
13 11 minimum number of shoots required so
(a)                              (b) that probability that the target is hit
5
3 35 twice is greater than 0.99
10 17
(c)                              (d) (a) 8 (b) 9
35 35 (c) 10 (d) None of these
2. In a large population 40% voted for 4. A lot contains 20 articles. The probability
candidate A and 60% voted for candidate that the lot contains exactly two defective
B, what is the probability that out of 10 articles is 0.4and the probability that the
students randomly selected from this lot contains exactly 3 defective articles
large population exactly 60% voted for is 0.6. Articles are drawn from the lot at
candidate B? random one by one , without replacement
6 4 and are tested till all the defective articles
 3  2  are found. What is the probability that
(a) (10C6)    
 5  5 the testing procedure ends at the twelfth
6 6 testing. [IIT JEE 1986]
 3  2 
(b) (10C4)     (a) 99/190 (b) 99/1900
 5  5
(c) 19/99 (d) none of these

5. An urn contain 2 white and 2 black balls.
A ball is drawn at random. If it is white,
it is not replaced into the urn. Otherwise
it is replaced along with another ball of
the same color. The process is repeated.
Find the probability that the third ball
drawn is black. [IIT JEE 1987]
(a) 27/30 (b) 23/30
(c) 25/30 (d) none of these
6. A man takes a step forward with
probability 0.4 and backwards with
probability 0.6. Find the probability that
at the end of eleven steps he is one step
away from the starting point.
[IIT JEE 1987]
(a) 11C 0.24)5 11C
6( (b) 7(0.24)
11C
(c ) 6( 0.2)5 (d) none of these
7. One hundred identical coins, each with
probability, p, of showing up heads are
tossed once, if 0 < p < 1 and the probability
of heads showing on 50 coins is equal to
that heads showing on 51 coins, then the
value of p is [IIT JEE 1988]
(a) 1/2 (b) 49/101
(c) 50/101 (d) 51/101
8. A box contains 24 identical balls of which
12 are white and 12 are black. The balls
are drawn at random from the box one at
a time with replacement. The probability
that a white ball is drawn for the 4th time
on the 7th draw is [IIT JEE 1994]
(a) 5/64 (b) 27/32
(c) 5/32 (d) 1/2
9. An unbiased die is tossed until a number
greater than 4 appears. The probability
that an even number of tosses is needed is
Response Grid
1. a b c d 2. a b c d 3. a b c d 4. a b c d 5. a b c d
6. a b c d 7. a b c d 8. a b c d 9. a b c d 10. a b c d
11. a b c d 12. a b c d
Binomial Probability  327
[IIT JEE 1994]
(a) 1/2 (b) 2/5
(c) 1/5 (d) 2/3
10. There are four machines and it is known
that exactly two of them are faulty. They
are tested, one by one, in a random order
till both the faulty machines are identified.
Then the probability that only two tests are
needed is [IIT JEE 1998]
(a) 1/3 (b) 1/6
(c) 1/2 (d) 1/4
11. Three players A, B, and C toss a coin cyclically
in that order (that is, A, B, C, A, B, C, A, B…)
till a head shows up. Let p be the probability
that coin shows a head. Let α β and ϒ be
5 respectively that A, B and C gets the first
head. Prove that β = ( 1 – p) α. Determine α,
β and ϒ (in terms of p) [IIT JEE 1998]
(a) p/(1 – q3), p(1 – q)/{1 – (1 – p)3}
and (p – 2p2 + p3)/ {1 – (1 – p)3}
(b) p/{1 – (1 – p)3), p(1 – q)/{1 – (1 – q)3}
and (p – 2p2 + p3)/ {1 – (1 – p)3}
(c) q/(1 – q3), p(1 – q)/{1 – (1 – p)3}
and (p – 2p2 + p3)/ {1 – (1 – p)3}
(d) p/(1 – q3), p(1 – p)/{1 – (q)3}
and (p – 2p2 + p3)/ {1 – (q)3}
12. An unbiased die, with faces numbered
1,2,3,4,5,6 is thrown n times and the
list of n numbers showing up is noted.
What is the probability that among the
numbers 1,2,3,4,5,6, only three numbers
appear in this list? [IIT JEE 2001]
(a) {(3 – 3.2 + 3) × C3}/ 6n
n n 6
(b) 3n × 6C3/ 6n
(c) {(3n – 3.2n + 3) × 6C3}/ 6
(d) none of these
328  Theory of Counting

2
Concept Eliminator (CE)
Ideal Time Revise your concept (Maths Olympiad
Just solve it or tougher questions)

1. This question is Based on Maths What is the probability that out of 10

Olympiad. balls, 1st box will get 2, 2nd will get 3 and
India and Pakistan is playing a best 3rd box will get 5 balls?
four of 7 match series. What is the 10! 1
probability that the tournament ends up (a) (b)
(2!)(3!)(5!)(2 ) 15 2 15
in 6 matches assume that no match ends
up in a draw? 1
(c) (d) None of these
(a) 5/16 (b) 5/32 2 14
(c) 5/48 (d) None of these
4. Two fair dice are thrown till outcome is
2. This question is Based on Maths Olympiad 12. What is the probability that one has
A number selector machine can select to do 20 throws for this?
any number from 1 to 9. This machine 18 2 19
 35   1  35   1
is operated ‘n’ times, means there are n (a)     (b)    
 36  36  36  36
results. These ‘n’ results are multiplied
19
then what is the probability that the  1  35 
(c)     (d) None of these
product is divisible by 10.  36  36
n n n
 8  5  4 5. In a bulb manufacturing company
(a)   –   +   
 9  9  9 probability that a bulb is defective is
n
 8  5
n
 4
n 0.01. The company sells the bulbs in a
(b) 1 –   –   +    package of 10. After getting complains
 9  9  9
n n n
about defective bulb company decided
8 5 4 to offer a money back guarantee that
(c) 1 –   –   −   
 9  9  9 at most of the 10 from the package
(d) None of these is defective. What percentage of the
3. This question is Based on Maths Olympiad packages company has to replace?
10 balls are thrown into three boxes (a) 1% (b) 4%
namely Box 1, Box 2, and Box 3 with (c) 5% (d) None of these
respective probabilities 1/4, 1/4 and 1/2.

Response Grid
1. a b c d 2. a b c d 3. a b c d 4. a b c d 5. a b c d
 Binomial Probability  329

Solutions
Concept Deviator (CD)
1. (b) 2. (a) 3. (d) 4. (b) 5. (b) 6. (a)
7. (d) 8. (c) 9. (b) 10. (b) 11. (d) 12. (a)

1.
(b) Let P(C) = probability of getting a 4. (b) Testing procedure may terminate in
correct answer is 1/3 the following two events:
From thye given condition required One – when the lot contains two
answer is defective articles.
4 1 5
 1  2   1 11 Two – when the lot has three
(5C4)     + (5C5)   =
 3  3  3 35 defective articles.
2. (a) Total number of experiments = n = 10 Number of experiments carried out
Number of favorable cases is 12.
= r = 60% or 6
Probability of getting favorable Let E be the event( testing procedure
case = P(F) = (60/100) = (3/5) (here ends at 12th testing)
we have assumed the event that E1 = lot has 2 defective articles
Candidate B got the vote)
E2 = lot has 3 defective articles
Probability of not getting favorable
Now, it can be possible that first 11
case = P(F′) = (40/100) = (2/5)
draws contains 10 non- defective
Required probability is
6 4
articles and a defective and 12th
 3  2  draw contains a defective article.
(10C6)(F)6(F′)4 = (10C6)    
 5  5 So,
3. (d) Let us suppose that number of shoots 18
C10  × 2C1
required is k then P(E/E1) = 20
× 1/9
C11
Probability that none of the time
Now, another case that first 11 draws
 1 contains 9 non- defective articles and
target was hit is  
 2n  two defective and 12th draw contains
Probability that target is hit once is a defective article. So,
 1   1  n  17
n  n−1    =  n  C9  × 3C 2
2   2  2  P(E/E1) = 20
× 1/9
C11
So required probability is
 1  n 99 Required probability
1 –  n −   n  > 0.99 = = P(E) ⋅ P(E/E1) + P(E)P(E/E2)
2  2  100
= 99/1900
or  n = 11
330  Theory of Counting
5. (b) Let, B and W be black and white
ball
Bn = nth ball drawn is black and
Wn = nth ball drawn is white ball
E = third ball drawn which is black.
We can observe that, the black ball
can be drawn in the third draw in one
of the following mutually exclusive
ways-
1. Both first and second balls drawn are
white and third all drawn is black.
i.e ( W1 ∩ W2) ∩ E
2. Both first and second balls are black
and third ball drawn is black
i.e (B1 ∩ B2) ∩ E
3. The first ball drawn is black, the
second ball drawn is white and the
third ball drawn is black
i.e (B1 ∩ W2) ∩ E
4. The first ball drawn is white, the
second ball drawn is black and the
third ball drawn is black
i.e (W1 ∩ B2) ∩ E
Therefore,
P(E) = P[{(W1 ∩ W2) ∩ E} ∪ {( B1 ∩ B2 )
∩ E} ∪ {( B1 ∩ W2) ∩ E} ∪
{( W1 ∩ B2) ∩ E}
2 1 2 3 4 2 2 
      1           
4 3 4 5 6 4 3
3  2 2  3 23
       
4  4 5  4 30
6. (a) From the question we can say that
the man will be one step away from
the starting point either he is one
step ahead or one step behind the
starting point.
Required probability = P(one step
ahead) + P ( one step behind)
Now, P (one step ahead) = the
probability that the man will be one
step ahead at the end of eleven steps
if he moves six steps forward and five
step backward = 11C6(0.4)6(0.6)5.
In similar way, the probability that
the man will be one step behind at
the end of eleven steps if he moves
six steps backward and five steps
forward = 11C6(0.4)5(0.6)6.
Hence, required probability
= 11C6( 0.24)5.
7. (d) According to question,
P( X = 50) = P(X = 51)
Or  100C 50(1 – p)50
50p
= 100C51p51(1 – p)49
Or  p/(1 – p) = 51/50 and p = 51/101
8. (c) As per the given condition white ball
is drawn for the 4th time on the 7th
draw it is possible when exactly 3
white ball appear in 1st 6 draws, so
required probability is
3 3
1 1 1
(6C3)        = 5/32
 2  2  2
9. (b) Let P(A) = probability of getting a
number greater than 4 is 4/6 = 1/3
then P(A′) = 2/3
Required Probability is given by A′A
+ A′A′A′A + A′A′A′A′A′A + ...
 Binomial Probability  331
Required Probability = P(H) P(T) + P(H)P(T)4
2  1 2  2  2  1 + P(H) P(T)7 + ...
=              
3  3  3  3  3  3 = P(T)[P(H)+ P(H)P(T)3
2  2  2  2  2  1
              + P(H) P(T)6+ ...]
3  3  3  3  3  3
2 = qa = (1 – p)a = p(1 – p)/ (1 – q3)
2 Again we have a + b + γ = 1,
..  9 
4 5 γ = 1 – a + b = 1 – [p + p(1 – p)]/
1
9 [1 – q3] = [p – 2p2 + p3]/ 1 – ( 1 – p)3
10. (b) Let P( two tests are needed) = P ( 1st
Hence,
machine is fault) × P( 2nd machine is
faulty) = 2/4 × 1/3 =1/6 a = p/(1 – q3),
b = p(1 – p)/{1 – (q)3}
11. (d) We assume q = 1 – p = probability of
getting the tail i.e P(T). and γ = (p – 2p2 + p3)/{1– (q)3}

Now, a = probability of A getting the 12. (a) Let Pn be the probability that no two
head on tossing firstly ( or more ) consecutive heads occur.

= P ( H1 or T1 T2 T3 H4 or T1 T2 T3 T4 Then Pn relates the probability that 1

T6 H7 or ….) = P (H) + P(H) P(T)3 +
P(H) P(T)6 + …..
= P(H)/{1 – P(T)3} = P/( 1 – q3)
Now b = probability of getting the
head on tossing secondly
= P (T1 H2 or T1 T2 T3 T4 H5
or  T1 T 2T 3T 4 T5 T6 H7 or ...)
or no head occur where n = 1, 2, 3, ...
Now, n = 1. Probability P = 1( both
the cases we get less than two heads
(H,T))
Now n = 2, P2 = 1 – p ( two head occur
simultaneously) = 1 – p(HH) = 1 – p2
Now
n ≥ 3, Pn = Pn – 1( 1 – P) + Pn – 2( 1 – P)P
332  Theory of Counting

Concept Eliminator (CE)

1. (a) 2. (b) 3. (a) 4. (b) 5. (b)

1. (a) Let India won the tournament, Probability for box 2 is (1/4)3
means India won total 4 matches Probability for box 3 is (1/2)5
out of 6 and Pakistan won only 2
matches, with the condition that And these can be arranged in
India won the last match. (10!)/(2!)(3!)(5!) ways.
So if we look at the result of 1st 5 So required probability is
matches then India won 3 and   2 3 5
10!   1   1   1  
Pakistan won 2 matches and then         
 (2!)(3!)(5!)   4   4   2  
6th match is won by India.
10!
So required probability in this case is  
(2!)(3!)(5!)(2 15 )
 1
(5C3)(2C2)  6  = 5/32
2  4.
(b) In a throw of two dice probability
A similar value we will get if that one will get 12 is 1/36 and will
Pakistan won the tournament- not get 12 is 35/36.
So required probability is As per the given condition in 1st 19
5/32 + 5/32 = 5/16 throw outcome is not 12 and 20th
throw outcome is 12 so required
2. (b) Product is divisible by 10 if and only
19
if at least one of the number selected 35
probability is    1
is 5 and at least one of the selected  36   
36
number is even.
5. (b) Probability that none of them
So required probability is 0 10
are defective is (0.1) (0.99 ) and
n n n
 8  5  4 probability that one of them are
1 –   –   +   
 9  9  9 0 10
defective is ( 10C1) (0.1) (0.99 )
(a) As per the given condition 1st box
3. Required proportion is
will get 2, 2nd will get 3 and 3rd box 0 10
will get 5 balls. 1 – (0.1) (0.99) – (10C1)
Probability for box 1 is (1/4)2 (0.1)0 (0.99)10 = 0.04 (approx)
 13
On the Cards  333

On the Cards

Topics Covered

 Introduction of playing cards

 Problems related to playing cards

Part A: Topic Number of Questions

Solved Example 5
Concept Applicator 10
Concept Builder 10
Concept Cracker 10
Part B: Topic Number of Questions
Concept Deviator 5
Concept Eliminator 4
Total 44
334  Theory of Counting
Part A

Concept 1 Introduction of Playing Card

A probability chapter/book/concept is • 52 cards are equally divided into 4 suits

incomplete without a good discussion of
questions based on playing cards, so I have
decided to dedicate a complete chapter on the
this concept.
Here is some of the features of the playing
cards:
• A deck of playing cards has 52 cards.
• Out of 52 cards, 26 are black coloured
and 26 are red coloured
with each suit has 13 cards.
• Out of 4 suits, 2 suits namely ‘Diamonds’
and ‘Heart’ are red coloured card and
‘Spades’ and ‘Clubs’ are black coloured
cards.
• A suit has 13 cards out of which 9 are
numbered (from 2 to 10) and 4 are face
cards (also known as Honours cards)
Namely Ace, King, Queen and Jack.

Pictorial representation of above classification is shown below:

Tree of Cards

PACK/DECK (52)

RED (26) BLACK (26)

Suits→ Diamonds(13) Hearts(13) Spades(13) Clubs(13)

Example 1:  A card is drawn from a well shuffled pack of cards. What is the probability
that it is a Diamond suit card?
Solution:  Since out of 52 cards, 13 cards belongs to ‘Diamond’ suit so required probability is
13/52 = 1/4.

Example 2:  A card is drawn from a well
shuffled pack of cards. What is the
probability that it is a red coloured
card?
Solution:  Since out of 52 cards, 26 cards are
red so required probability is 26/52 = 1/2.
Example 3:  Two cards are drawn from
a well shuffled pack of cards. What is
the probability that 1st is red coloured
card and 2nd is black coloured?
Solution:  Since out of 52 cards, 26 cards are
red and 26 are black coloured so required
probability is (26/52) × (26/51) = 13/51.
Example 4:  Three cards are drawn from
a well shuffled pack of cards (with
replacement). What is the probability that
at least one of them is black coloured?
Solution:  Since out of 52 cards, 26 cards are
red and 26 are black coloured probability
that none of them are black coloured is (1/2)
(1/2)(1/2) = 1/8.
So required probability is 1 – 1/8 = 7/8
1
Concept Applicator (CA)
Ideal Time
10 Min.
1. A card is drawn from a well shuffled pack
of cards. Find the probability that it is
a jack.
(a) 1/13 (b) 1/26
(c) 2/52 (d) None of these
2. A card is drawn from a well shuffled pack
of cards. Find the probability that it is a
black numbered card. 5. If two cards are drawn simultaneously
(a) 1/13 (b) 1/2
(c) 9/26 (d) None of these
3. A card is drawn from a well shuffled pack
of cards. Find the probability that it is a
club .
On the Cards  335
Example 5:  Two cards are drawn from
a well shuffled pack of cards (with
replacement). What is the probability
that these two cards are either black
coloured or honors cards?
Solution:  Consider the 1st card. Probability
of getting a black coloured card is
P(B) = 26/52 = 1/2.
Probability of getting a black an honor card is
P(H) = 16/52 = 4/13
Probability of getting a black coloured honor
card is
P(B ∩ H) = 8/52 = 2/13
P(B ∪ H) = P(B) + P(H) – P(B ∩ H)
= (1/2) + (4/13) – (2/13) = 17/26
17 17 289
Required probability = × =
26 26 676
Apply your concepts with easy and
conceptual questions
(a) 1/13 (b) 1/2
(c) 1/4 (d) None of these
4. A card is drawn from a well shuffled pack
of cards. Find the probability that it is a
red ace.
(a) 1/13 (b) 1/26
(c) 5/52 (d) None of these
from a well shuffled pack of cards then
find the probability of both being the
King
4
(a) 2/52 (b) C2 / 52 C2
(c) 4/52 (d) None of these
336  Theory of Counting
6. If two cards are drawn simultaneously then find the probability of both being
from a well shuffled pack of cards then numbered card.
find the probability of both being black 8 52 4 52
(a) C2 / C2 (b) C2 / C2
honors. 52
4 (c) 36 C2 / C2 (d) None of these
(a) 8
C2 /
52
C2 (b) C2 / 52 C2
9.
A card is drawn from a pack of cards the
(c) 16 C2 / 52 C2 (d) None of these probability that it is a black Queen is
7. If two cards are drawn simultaneously (a) 1/26 (b) 1/2
from a well shuffled pack of cards (c) 2/5 (d) 3/7
then find the probability of both being 10. Two cards are drawn from a well shuffled
Honours. pack of cards given that both the cards are
4 52 numbered cards. What is the probability
(a) 2/5 (b) C2 / C2
that the cards have same number and
(c) 16 C2 / 52 C2 (d) None of these different colour on them?
8. If two cards are drawn simultaneously (a) 1/35 (b) 1/70
from a well shuffled pack of cards (c) 2/35 (d) None of these

Response Grid
1. a b c d 2. a b c d 3. a b c d 4. a b c d 5. a b c d
6. a b c d 7. a b c d 8. a b c d 9. a b c d 10. a b c d

2
Concept Builder (CB)
Ideal Time Revise your concepts with questions
15 Min. medium difficulty level questions

1. If two cards are drawn at random from a 13 13 13

C1 C1 C2
pack of cards then what is the probability (a)   (b) 2
52 52 52
that one of them is a numbered card and C2 C2 C2
the other is a queen?
13 13
36 C2 C1
C1  ×   4 C1 36 4 (c) +  52 (d) None of these
(a) (b) C1  ×    C1 52
C2 C2
52
C2
36
C1 3. Two cards are drawn simultaneously from
(c) (d) None of these a pack of cards. What is the probability
52
C2 that both are black or both are Ace?
2. If two cards are drawn simultaneously
13 4
from a pack of cards then what is the C1 C1
(a) 
probability that both are diamond or 52
C2 52
C2
both are heart ?
 On the Cards  337
13 4 2 8. Four cards are drawn at random, from
C2 C C2
(b) 52 +  52 2 – a well shuffled pack of cards, then what
52
C2 C2 C2
is the probability that the cards are
26 4 2
C2 C2 C2 honours of four different suits?
(c) + –
52 52 52
C2 C2 C2
16 16
C4 C1
(d) None of these (a) (b)
52 52
4. Two cards are drawn at random from a C4 C4
well shuffled pack of cards. What is the
probability that both are spades or both 256
(c) (d) None of these
are clubs? 52
C4
(a) 4/17 (b) 3/17 9. If four cards drawn at random, from a
(c) 2/17 (d) 1/17 well shuffled pack of cards, then what
5. Two cards are drawn at random from a is the probability that three of them are
well shuffled pack of cards. What is the number cards of the same colour and the
probability that both are Jack or both
4th card is a numbered card of different
are red coloured?
(a) 331/1326 (b) 7/13 colour ?
(c) 200/221 (d) 55/221 18
2.18 C 1   18 C 3 C1   18 C3
6. Two cards are drawn at random from a (a) (b) 52
well shuffled pack of cards. What is the
52
C4 C4
probability that both are Heart or neither
is an Ace? 2.18 C 2   18 C 3
(c) (d) None of these
(a) 190/221 (b) 55/221 C4 52

(c) 200/1326 (d) 201/221 10. Two cards are drawn from a well
7. If four cards drawn at random, from a well shuffled pack of cards given that both
shuffled pack of cards, then what is the the cards are numbered cards. What is
probability that all of them are honours?
the probability that the cards have same
16 16
C4 C2
(a) (b) colour on them?
52 52
C4 C4
(a) 17/35 (b) 17/70
12
C4
(c) (d) None of these (c) 34/35 (d) None of these
52
C4

Response Grid
1. a b c d 2. a b c d 3. a b c d 4. a b c d 5. a b c d
6. a b c d 7. a b c d 8. a b c d 9. a b c d 10. a b c d
338  Theory of Counting

3
Concept Cracker (CC)
Ideal Time Boost up your confidence with good
20 Min. questions

1. When three cards are drawn in succession probability that both are queens or both
from a pack of cards with replacement, are hearts?
what is the probability that the first (a) 83/26 (b) 401/663
drawn card is a diamond, second is a red
(c) 14/221 (d) 7/221
card and third an honour?
6. If three cards are drawn at random from
(a) 1/26 (b) 1/39
a well shuffled pack of cards, then what
(c) 1/52 (d) None of these is the probability that all of them are
2. When three cards are drawn simultan- from the same suit?
eously from a pack of cards, what is the 13
C3 4 ⋅13 C3
probability that one of them is a red card (a) (b)
52 52
another a spade and the third is a club? C3 C3
26 13 13
(a)
C1 × C1 × C1 3 ⋅13 C3
52
(c) (d) None of these
C3 52
C3
26
C2 × 13C1 × 13C1 7. When three cards are drawn at random
(b) from a well shuffled pack of cards, then
52
C3
what is the probability that all of them
26 26
C1 × C1 × 13C1 are from the different suits?
(c)
52 13
C3 C3
(a) 52
(d) None of these C3
3. Two cards are drawn at random from a
well shuffled pack of cards. What is the 4 ⋅ (13 C1 ⋅13 C1 13
C1 )
probability that both are club or both are (b) 52
C3
diamonds?
(a) 2/17 (b) 1/17 3 ⋅13 C3 13C1 13C1
(c) 3/17 (d) 4/17 (c)
52
C3
4. Two cards are drawn at random from a
(d) None of these
well shuffled pack of cards. What is the
probability that both are numbered card
or both are black cards? 8. If three cards are drawn at random from
a well shuffled pack of cards, then what
(a) 101/1326 (b) 401/663
is the probability that two of them are
(c) 362/663 (d) 432/663 number cards from the same suit and
5. Two cards are drawn at random from a the 3rd number card is from a different
well shuffled pack of cards. What is the suit?
 On the Cards  339
(a) 8/325 (b) 4/325
4 ⋅ ( 9C2 ⋅ 27C1 ) 3 ⋅13 C313C1
(a) (b) (c) 1/65 (d) 2/65
52 52
C3 C3
10. If two cards are drawn at random from
13
C3 a well shuffled pack of cards. Given that
(c) (d) None of these
52
C3 both are red, what is the probability that
9. Two cards are drawn at random from a the cards have different honours and
well shuffled pack of cards. Given that belong to different suits?
both are red, what is the probability
(a) 9/325 (b) 18/325
that the cards have the same honour on
them? (c) 72/325 (d) 12/325

Response Grid
1. a b c d 2. a b c d 3. a b c d 4. a b c d 5. a b c d
6. a b c d 7. a b c d 8. a b c d 9. a b c d 10. a b c d
340  Theory of Counting

Solutions
Concept Applicator (CA)
1. (a) 2. (c) 3. (c) 4. (b) 5. (b) 6. (a)
7. (c) 8. (c) 9. (a) 10. (d)

1. (a) Required probability is 4/52 = 1/13.
2. (c) Since in one suit we have 9 numbered
card so number of black numbered
card is 18 and required probability
is 18/52 = 9/26.
3. (c) In suit Club number of cards is 13. So,
required probability is 13/52 = 1/4.
4. (b) Number of red Ace card is 2.
2 1
So required probability is = hence required probability is
52 26
5. (b) Here sample space is 52 C2 and
favorable case is 4 C2 . So required
probability is 4 C2 / 52 C2 .
6. (a) In one suit we have 4 honors cards
so total we have 8 black honors
cards hence required probability is
8
C2 / 52 C2 .
7. (c) In one suit we have 4 honors cards so
total we have 16 honors cards hence
required probability is 16 C2 / 52 C2 .
8. (c) Total number of numbered cards is
9 × 4 = 36.
So required answer is option (c).
9. (a) Since number of black queen is 2
2/52 = 1/26.
10. (d) Given that both the cards are
numbered so sample space is
9 × 4 = 36.
1stcard is anything now 2nd card
should be of the same number so
required probability is 2/36 = 1/18.

Concept Builder (CB)

1. (a) 2. (b) 3. (c) 4. (c) 5. (d) 6. (a)
7. (a) 8. (c) 9. (a) 10. (a)

1. (a) Probability that a numbered card 2. (b) Probability that both of them are
and the other is a queen is selected
36 13
C1 × 4C1 diamond is
C2
is . 52
52 C2
C2
 On the Cards  341
Probability that both of them are 6.
(a) Probability that both the cards are
13 13
C2 C2 13 × 12
heart is 52 Heart is P(H) = =
52
C2 C2 52 × 51
3. (c) Probability that both the cards are Probability that both the cards are
26 48
C2 C2 48 × 47
black is P(B) = not Ace is P(A') = =
52
52
C2 C2 52 × 51
Probability that both the cards are Probability that both the cards are
4
C2 Heart and they are not Ace is
Ace is P(A) = 12
52
C2 C2 12 × 11
P(H ∩ A') = =  
Probability that both the cards are 52 52 × 51
C2
2
C2 So required probability is
black Ace is P(A ∩ B) = 52
C2 P(H∪A′) = P(H) + P(A′) – P(H ∩ A’)
So required probability is 13 × 12 48 × 47 12 × 11
P(A ∪ B) = P(A) + P(B) – P(A ∩ B) = +  − 
52 × 51 52 × 51 52 × 51
26 4 2
=
C2
+
C2
–
C2 12 (13 + 188 − 11)
52 52 52 =
C2 C2 C2 52 × 51
4. (c) Probability that both the cards are 12 × 190 190
= =  
13 × 12 1
spades is = 52 × 51 221
52 × 51 17 7. (a) Since total number of honors card
Probability that both the cards are is 16 hence required probability is
13 × 12 1 16
C4
clubs is =
52 × 51 17 52
C4
So required probability is 2/17.
8. (c) Here sample space is 52 and
5. (d) Probability that both the cards are C4
26
C2 26 × 25 favorable case is 4 × 4 × 4 × 4 = 256.
red is P(R) = =
52 256
C2 52 × 51
So required probability is 52
Probability that both the cards are C4
4 52
C2 4×3 9. (a) Here sample space is C4 and
Jack is P(J) = 52 =
C2 52 × 51 18
favorable case is 2. C1    C3 hence 18

Probability that both the cards are red

2
C2 2 ×1 2.18 C1   18 C3
Jack is P(R ∩ J) = =   required answer is
52
52
C2 52 × 51 C4
10. (a) Sample space is 36C and favorable
So required probability is 2
P(R ∪ J) = P(R) + P(J) – P(R ∩ J) case is 2 × (18C 2) so required prob-
26 × 25 4×3 2 ×1
= +  −    ability is
52 × 51 52 × 51 52 × 51
325 + 6 − 1 55 2 × 18 × 17 17
2 × (18C2)/( 36C2) = =
= =   36 × 35 35
26 × 51 221

342  Theory of Counting

Concept Cracker (CC)

1. (a) 2. (a) 3. (c) 4. (c) 5. (c) 6. (c)
7. (c) 8. (d) 9. (d) 10. (a)

1. (a) It is an example of independent Probability that both the cards are

event. 26
C2 26 × 25
black is P(B) = =
Probability that 1st card is a diamond 52
C2 52 × 51
is 13/52 = 1/4
Probability that both the cards are
Probability that 2nd card is a red is
numbered and they are black is
26/52 = 1/2
18
Probability that 3rd card is a honors C2 18 × 17
P(N ∩ B) = =  
is 16/52 = 4/13 52 52 × 51
C2
Required probability is (1/4)(1/2) So required probability is
(4/13) = 1/26. P(N ∪ B) = P(N) + P(B) – P(N ∩ B)
36 × 35 26 × 25 18 × 17
2. (a) Sample space for this case is 52 C3 and = +  −   
52 × 51 52 × 51 52 × 51
favorable case is 26 C1 × 13C1 × 13C1
1604 401
so required probability is = =
2652 663

26 13 13 5. (c) Probability that both the cards are
C1 × C1 × C1
52
C3 queens is

4
C2 4×3
3. (a) Probability that both of them are P(Q) = =
52 52 × 51
13 C2
C213 × 12 1
club is = = Probability that both the cards are
52
C2 52 × 51 17
heart is
Probability that both of them are
13
13 C2 13 × 12
13 × 12C2 1 P(H) = =
diamonds is = = 52
C2 52 × 51
52 52 × 51 17
C2
Probability that both the cards are
So required probability is 2/17. queens and they are heart is 0.
4. (b) Probability that both the cards are
So required probability is
numbered is
4×3 13 × 12 14
36 + =
C2 36 × 35 52 × 51 52 × 51 221
P(N) = =
52 52 × 51
C2
 On the Cards  343
52 52
6. (b) In this case sample space is C3 (d) In this case sample space is C3 and
8.
13
and favorable case is 4 ⋅ C3 so favorable case is 12 ⋅ ( 9 C2 ⋅ 27C1 )
so required probability is
4 ⋅13 C3
required probability is . 12 ⋅ ( 9 C2 ⋅ 27
C1 )
52
C3
52
C3
7. (b) In this case sample space is 52
C3 and 9. (b) Sample space is 26C2 and number of
favorable case is 4.
13 13 13
favorable case is 4 ⋅ ( C1 ⋅ C1· C1 )
Required probability is
so required probability is
(4 × 2)/(26 × 25) = 4/325.
10. (d) Required probability is
4 ⋅ (13 C1 ⋅ 13C1 · 13
C1 )
. (8/26)(3/25) = 12/325.
52
C3
344  Theory of Counting
Part B
Introduction of
Concept 1 Playing Cards
Here is some of the features of the playing • Out of 4 suits, 2 suits namely ‘Diamonds’
cards: and ‘Heart’ are red colored card and
• Deck of playing cards has 52 cards. ‘Spades’ and ‘Clubs’ are black colored
• Out of 52 cards, 26 are black coloured cards.
and 26 are red coloured. • A suit has 13 cards out of which 9 are
• 52 cards are equally divided into 4 suits numbered (from 2 to 10) and 4 are face
with each suit has 13 cards. cards (also known as Honours cards)
Namely Ace, King, Queen and Jack.

Pictorial representation of above classification is shown below:

Tree of Cards

PACK/DECK (52)

RED (26) BLACK (26)

Suits→ Diamonds(13) Hearts(13) Spades(13) Clubs(13)

 On the Cards  345

1
Concept Deviator (CD)
Ideal Time Revise your concept (IIT advance or
5 Min. tougher questions)
per question

1. Two cards are drawn from set of 52 cards, [A  FULL HOUSE consists of 3  cards of
what is the probability that the 2nd card the same kind (eg, 3 Kings) and 2 cards
is Jack if it is given that both the cards of another kind (eg, 2 Aces)]
are honors cards?
6 4
(a) (b)
(a) 1/6 (b) 3/16 4165 4165
(c) 1/4 (d) None of these 3
(c) (d) None of these
2. Three cards are randomly selected, 4165
without replacement, from a deck of 52
5. Cards are drawn one by one at random
playing cards. What is the probability that
from well shuffled full pack of 52 playing
the first card selected is a club given that
cards until 2 aces are obtained for the
the second and third cards are clubs.
first time. If N is the number of aces
(a) 11/60 (b) 11/50 required to be drawn, then which one of
(c) 11/40 (d) None of these the following is correct if 2 ≤ n ≤ 50.
3. What is the probability of randomly [IIT JEE 1983]
drawing five cards from a deck has (51 − n)(52 − n)(n − 1)
exactly one Ace? (a)
13 × 17 × 49 × 50
(a) 0.3127 (b) 0.299
(b)
(51 − n)(52 − n)
(c) 0.273 (d) None of these 13 × 17 × 49 × 50
4. What is the probability of getting a (51 − n)(52 − n)(n − 1)
“FULL HOUSE” in five cards drawn in (c)
13 × 17 × 49
a poker game from a standard pack of
(d) None of these
52-cards?

Response Grid
1. a b c d 2. a b c d 3. a b c d 4. a b c d 5. a b c d
346  Theory of Counting

2
Concept Eliminator (CE)
Ideal Time Revise your concept (Maths Olympiad
Just solve it or tougher questions)

1. An ordinary deck of 52 playing cards
is randomly divided into 4 groups of 13
cards each. What is the probability that
each group has exactly 1 jack?
39 × 26 39 × 26 × 13
(a) (b)
51 × 50 51 × 50 × 49
39 × 26 × 11
(c) (d) None of these
51 × 50 × 49
2. In an examination that has multiple
choice questions with m options, a
student either know the answer or guess
the answer. While guessing an option
each option is of equal probability of
being correct. What is the conditional
probability that a student knew the
answer to a question given that he or she
answered it correctly? It is known that
p be the probability that the student
knows the answer of a question.
mp p different from each other.]
(a) (b)
{1 + (m − 1)p} {1 + (m − 1)p}
m (c) 0.329 (d) None of these
(c) (d) None of these
{1 + (m − 1)p}
3. If 3 identical cards are coloured both the
sides such that the first card are colored
red, both sides of the second card are
colored black, and one side of the third
card is colored red and the other side
black. The 3 cards are mixed up, and 1
card is randomly selected and put down
on the ground. If the upper side of the
chosen card is colored black, what is the
probability that the other side is colored
red?
(a) 1/2 (b) 2/3
(c) 1/3 (d) None of these
4. In a poker game what is the probability
of getting a “pair” in five cards?
[A  pair  consists of 2  cards of the same
kind (eg, 2  Kings) and 3  cards that are
different from the kind of the pair (eg,
different from Kings) and that are all
(a) 0.321 (b) 0.422

Response Grid
1. a b c d 2. a b c d 3. a b c d 4. a b c d
 On the Cards  347

Solutions
Concept Deviator (CD)
1. (c) 2. (b) 3. (b) 4. (a) 5. (a)

1. (c) Since both the cards are honors cards the deck and there are 13  different
hence sample space is 4 × 4 = 16. kinds of cards, so the total number
Here we have two cases for the 2nd of combinations possible of 2  cards
cards being a jack is 6  ×  13  =  78. There are 4  ways
Case (i) 1st card is a jack and 2nd card to choose 3  cards of the same kind
 4  3 from 4  cards of the same kind, but
is a jack the probability is    
 16   15  because the 3-of-a-kind suit must be
Case (ii) 1st card is not a jack and different from the 2-of-a-kind suit,
2nd card is a jack the probability is the possible combinations of this is,
 12   4  4 × 12 = 48.
   
16 15
Required probability is So total number of ways is
 4   3   12   4  1
    +      = 48 × 78 = 3744
16 15 16 15 4
Sample space is 52C5 = 2,598,560
2. (b) Required probability = P(all the 3
cards are Club)/P((2nd and 3rd cards Required Probability
are Club)
3744 6
 13 C 3  = =
 52  2598560 4165
 C 3 
= 13 5. (a) Since as per the given condition Nth
 C 2 
 52  draw gives 2nd Ace that means in 1st
 C 2  (N-1) draw only one Ace will appear

=
{(13 × 12 × 11) × (52 × 51)}= 11 and next card is Ace, so required
{(13 × 12 ) × (52 × 51 × 50)} 50 probability

3. (b) Required probability is =
{4 (48!)(n − 1)!(53 − n)!}× 3
(4C1)(48C4)/(52C5) = 0.299 (approx.) {52! (n − 2 )! (50 − n)!} 53 − n
(51 − n)(52 − n)(n − 1) 
4. (a) There are 6 ways to select 2 cards of =
13 × 17 × 49 × 50
the same kind from the 4  cards in
348  Theory of Counting

Concept Eliminator (CE)

1. (b) 2. (a) 3. (c) 4. (b)

1. (b) Probability that 1st group has only p mp

one jack is =
 4!  48!  
  1 
 p +   (1 − p )
{1 + (m − 1)p}
     m 

( C1 )( C12 )  3!   (12!)(36!) 
4 48
52
= 3. (c) Let the three cards represent as
C13  52!  (RR), (BB), (BR)
 
 (13!)(39!) In this case we have to find the
conditional probability
 4!  (39 × 38 × 37 × 13) 
=  P (BR|B)
 3!   (52 × 51 × 50 × 49) 
= (39 ×  38 ×  37) /(51 ×  50 ×  49)  {P (B|BR)P (BR)}
=
 P (B|BB)P (BB)+  P (B|BR )P (BR )
Similarly probability that 2nd group  
has a jack is: +  P (B|RR )P (RR ) 
 3!   36!    1  1
       
( C 1 )( C 12 )  2!  (12!)(24!) 
3 36
=
2 3
=
1
=   1  1  1 3
39  39!   1 
C 13
  (1)  +      +  (0 )  
3 2 3 3 
 (13!)(26!)

Alternately:
 3!  Let the three cards represent as
=   {(26 × 25 × 13) /(39 × 38 × 37)}
 2! (RR), (BB), (BR)
= (26 × 25) /(38 × 37)  If one face is red then we have

following cases-
Similarly probability that 3rd group
has a jack is 13/25 Front side Back Side
Then remaining 4th group must have Black Black
a jack Black Black
Required probability is Black Red
39  × 38 × 37 26 × 25 13 Out of three possible cases only
× ×
51 × 50  × 49 38 × 37 25 one case is favorable so required
39 × 26 × 13 probability is 1/3
= 4. (b) Total number of ways of selecting 2
51 × 50 × 49
cards (6 × 13) and that for 3rd, 4th
2. (a) He can answer the question correctly and 5th card is 48, 44 and 40 ways,
in two cases: so total number of favourable cases
Case (1): Probability that student is (78 × 48 × 44 × 40).
knows the answer = p. Sample space is 52C5 = 2,598,560
Case (2): Probability when he made Required Probability
a guess = (1 – p)/m.
78 × 48 × 44 × 40
So required probability is = = 0.422 (Approx.)
2598560
 14
Probability Miscellaneous  349

Probability
Miscellaneous

Topic Covered

 Revision of Permutation and Combination with Probability

Part A: Topic Number of Questions

Concept Applicator 15
Concept Builder 15
Concept Cracker 20
Part B: Topic Number of Questions
Concept Deviator 25
Concept Eliminator 7
Total 82
350  Theory of Counting
Part A
So finally we arrive at the end and the
concluding chapter of this book, here we
will see many problems of permutation and
combination can be converted to a problem
of probability after all both of them belongs
1
Concept Applicator (CA)
Ideal Time
15 Min.
1. If 11 players be selected out of 20 players
then what is probability that Sachin and
Sourav are always rejected?
(a) (18C11)/(20C11) (b) (18C09)/(20C11)
(c) ( 19C10)/(20C11) (d) None of these
2. If 5 distinct alphabets are selected from
English alphabets then what is the
probability that no vowels is selected?
(a) ( 26C5) /(25C5) (b) ( 21C5) /(26C5)
(c) ( 20C5) /(26C5) (d) None of these
3. Out of 6 apples, 5 mangoes and 4 bananas
one or more fruits are selected then what
is the probability that at least one mango
is always selected?
(a) 175/209 (b) 120/209
(c) 119/209 (d) None of these
4. Out of 6 apples, 5 mangoes and 4 bananas
one or more fruits are selected then what
is the probability that at least one fruit
of each type is always selected?
(a) 175/209 (b) 120/209
(c) 119/209 (d) None of these
5. In an examination a student has to
write 6 papers and has to pass in each
paper to pass the exam then what is the
probability that a student is failed in the
exam?
(a) 31/64 (b) 64/65
(c) 63/64 (d) None of these
to the same concept and that is concepts of
counting.
In this chapter we will discuss the questions
of previous chapters after converting them to
the questions of probability.
Apply your concepts with easy and
conceptual questions
6. In a class of 10 students 6 are boys
and 4 are girls, if class teacher selects
student/s for a project then what is the
probability that the group has at least 1
boy and 1 girl?
(a) 945/1023 (b) 1022/1023
(c) 512/1023 (d) None of these
7. From a system of 10 points that form a
polygon of 10 sides one line is selected at
random what is the probability that this
line is a diagonal?
(a) 5/9 (b) 7/9
(c) 4/9 (d) None of these
8. If 4 volumes of English and 6 volume of
Maths book are arranged on a bookshelf
then what is the probability that all the
English books and all the Maths books
are together?
(a) (4!)(6!)/(10!) (b) 2(4!)(6!)/(10!)
(c) (6! +4!)/(10!) (d) None of these
9. If ‘n’ boys and ‘n’ girls, can be arranged in a
straight line then what is the probability
that no two boys are together?
2(n !)2 (n !)2
(a) (b)
2n ! 2n !
4(n !)2
(c) (d) None of these
2n !

10. If 10 students can be seated around a
circular table having 10 seats then what
is the probability that two students A
and B are never together?
(a) 7/9 (b) 2/9
(c) 4/9 (d) None of these
11. If 7 boys and 8 girls are seated around a
circular table then what is the probability
that all the boys do not sit together?
Probability Miscellaneous  351
Direction from question number 13 to 15:
Letters of the word CREATIVITY is arranged
to form 10 letter word then:
13. What is the probability that the word
formed starts with letter C?
(a) 1/10 (b) 1/12
(c) 1/4 (d) None of these

(a)
(7!)× (8!) (b)
7! + 8! 14. What is the probability that the word
14! 14! formed starts with letter C and ends
with Y?
(c)
{(14!) – 7!
( )(8!)}
(d) None of these
14! (a) 1/10 (b) 1/12
12. A round table conference is to be held (c) 1/4 (d) None of these
between 20 delegates of 20 countries
then what is the probability that 2 15. What is the probability that the word
particular delegates Mr. A and Mr. B formed has all the vowels are together?
will sit together?
(a) 1/10 (b) 1/12
(a) 1/19 (b) 2/19
(c) 3/19 (d) None of these (c) 1/4 (d) None of these

Response Grid
1. a b c d 2. a b c d 3. a b c d 4. a b c d 5. a b c d
6. a b c d 7. a b c d 8. a b c d 9. a b c d 10. a b c d
11. a b c d 12. a b c d 13. a b c d 14. a b c d 15. a b c d

2
Concept Builder (CB)
Ideal Time Revise your concepts with questions
25 Min. medium difficulty level questions

1. If 10 students are selected from a group of (c) (20C10 – 18C8 – 1)/(20C10)

20 students then what is the probability
that Rajesh and Dinesh are not selected
together?
(a) (20C10 – 19C9 – 18C8 )/(20C10)
(b) ( 20C10 – 18C8 + 1)/(20C10)
(d) None of these
2. If one or more students are selected from
a group of 6 students then what is the
probability that at least 4 students are
selected?
352  Theory of Counting
(a) 21/64 (b) 20/63
(c) 22/63 (d) None of these
3. In a board exam there are two sections
each section has 5 questions. As per
the given condition a candidate has
to answer any 6 questions out of 10
questions. What is the probability that a
student answered 6 questions such that
not more than 4 questions selected from
one section?
(a) 10/21 (b) 16/21
(c) 20/21 (d) None of these
4. From 8 boys and 4 girls a team of 5 is to be
formed. In how many ways can this be done
so as to include at least 1 girl in the team?
(a) (12C5 – 8C5 + 1 /(12C5)
(b) (12C5 – 8C5/(12C5) in a row?
(c) (12C5 – 8C5 – 1/(12C5)
(d) None of these
5. There are 6 questions in an examination, a
student has to answer at least three question
to pass the exam, what is probability that a
student will fail the exam?
(a) 5/16 (b) 31/64
(c) 21/32 (d) None of these
6. If 5 Indians, 6 Americans and 4 Russians
be seated in a row then what is the
probability that all persons of the same
nationality sit together?
3!5!6!4! 5!6!4!
(a) (b)
15! 15!
(c)
(14!) (d) None of these
15!
7. If 10 boys and 8 girls are arranged in a
straight line then what is the probability
that two girls Seema and Reema are
together?
(a)
(16)(17!)(2!) (b)
(16!)(17)(2!)
18! 18!
(c)
(16!)(17!)(2!) (d) None of these
18!
8. If 10 students of different height are
arranged in a straight line then what
is the probability that the tallest and
shortest are never together?
(a) 3/5 (b) 1/5
(c) 4/5 (d) None of these
9. In how many ways 5 boys and 5 girls can
be seated in a row so that boys and girls
are alternate?
2 (5!)(5!) (5!)(5!)
(a) (b)
10! 10!
2 (5! +  5 !)
(c) (d) None of these
10!
10. What is the probability that A is always
ahead of B when 10 students are arranged
(a) 3/5 (b) 1/5
(c) 4/5 (d) None of these
11. If 5 distinct Apples and 4 distinct
bananas are arranged in a row then
what is the probability that no 2 apples
are together?
(a) 0 (b)
(5!)(4!)
9!
(c)
{(9!) – 4!
( )(5!)}
(d) None of these
9!
12. If 20 students can be seated around a
circle then what is the probability that 3
students A, B, C are always together?
(a) 6/19 (b) 2/19
(c) 1/57 (d) None of these
13. In an international convention, 5
participants from each of USA, China
and Russia were arranged around a circle
then what is the probability that no two
participants from USA are together?
(a) (9!)(10P5)/14! (b) (9!)(10C5)/(14!)
(c) (3!)(5!)(5!)(5!)/(14!) (d) None of these

14. In a family gathering 4 couples were to
sit around a circular table then what is
the probability that no two males as well
as no couple is together?
(a) 6/(7!) (b) 12/(7!)
(c) 18/(7!) (d) None of these
Probability Miscellaneous  353
15. Letters of the word INTERMEDIATE
are arranged then what is the probability
that in a randomly selected word no
vowel is between two consonants?
(a) 1/11 (b) 1/33
(c) 1/66 (d) None of these

Response Grid
1. a b c d 2. a b c d 3. a b c d 4. a b c d 5. a b c d
6. a b c d 7. a b c d 8. a b c d 9. a b c d 10. a b c d
11. a b c d 12. a b c d 13. a b c d 14. a b c d 15. a b c d

3
Concept Cracker (CC)
Ideal Time Boost up your confidence with good
40 Min. questions

1. In Independence Day party every student
gave a gift to every other student. Total
number of gift distributed is 240 if a
gift is selected at random then what is
the probability that this gift belongs
to Rakesh (received by a participant
Rakesh)?
(a) 1/15 (b) 1/16
(c) 1/18 (d) None of these
2. If teams of 11 players is to be made from
25 players then what is the probability
that the players Rajesh, Rajni and Riju
are not selected together?
(a) ( 25C11– 22C8 )/(25C11)
(b) ( 25C11 – 22C11)/(25C11) perform, but at a time only 3 singers can
(c) ( 25C11– 25C8)/(25C11) perform with a condition that no same
(d) None of these
3. In a group picnic 10 married couples
planned to play mixed doubled game in
tennis. In a game, what is probability
that no husband wife pair is participating
together ?
(a) (10C2 × 8C2 )/(2 × 10C2 × 10C2)
(b) (10C2 × 8C2)/( 10C2 × 10C2)
(c) (10C2 × 6C2)/(20C4)
(d) None of these
4. In a group of 10 students comprising 6
boys and 4 girls, what is the probability
that if a team of 5 is to be formed then
number of girls is always more than the
number of boys?
(a) (4C3 × 6C2) × (4C4 × 6C1) /(10C5)
(b) (4C3 × 6C1 + 4C4 × 6C1 )/(10C5)
(c) (4C3 × 6C2+ 4C4 × 6C1)/(10C5)
(d) None of these
5. In a function 10 singers were selected to
group of 3 singers performed twice, then
in a randomly selected performance what
is the probability that particular singer
Gunjan will perform?
(a) (10C2 )/(10C3) (b) (9C2)/(10C3)
(c) (9C1 × 8C1)/(10C3) (d) None of these
354  Theory of Counting
6. Total 16 people participated in a picnic, 6
peoples are to be selected for a work then
what is the probability that only one
from Mr & Mrs A is selected similarly
one from Mr & Mrs B and Mr & Mrs C is
selected for the work?
(a) 960 /(16C6) (b) 480/(16C6)
(c) 120/(16C6) (d) None of these
7. If 2 identical rooks are placed on a
chessboard what is the probability that
they are not in attacking positions, if
rooks can attack only in a same row or in
a same column?
(a) 4/9 (b) 5/9
(c) 7/9 (d) None of these
8. If 10 students are arranged in a row then
what is the probability that A is ahead of
B and who in turn is ahead of C ?
(a) 1/5 (b) 1/6
(c) 1/3 (d) None of these
9. There are 100 students with roll number
1 to 100. If 10 students are selected
out of 100 students and their names
are listed down according to their roll
numbers in increasing order then what
is the probability that rank 50 will be at
6th position?
(a) (49P5)(50P4) /(100P10)
(b) (49C 5)(
50C
4 )/(100P10)
(c) (49!)(50!)/(100P10)
(d) None of these
10. If 5 identical apples, 6 identical bananas
and 7 identical oranges are arranged in a
straight line then what is the probability
that at least one fruit is separated from
similar fruits?
(a)
(5!)(6!)(7!)
18!
(b)
(5!)(6!)(7!)(18)
18!
18!
(c) –1
(5!)(6!)(7!)
(d) None of these
11. If 2 Indians, and 2 Americans are
arranged in a row then what is the
probability that no two participants from
the same country are together?
(a) 1/3 (b) 1/2
(c) 1/6 (d) None of these
12. There are 2 Indians, 2 Americans and
2 Russians in a conference, if they are
arranged in a straight line then what is
the probability that no two participants
from the same country are together?
(a) 1/3 (b) 1/2
(c) 1/6 (d) None of these
13. Total 7 boys and 6 girls are selected
to represent their school in science
conference and they are arranged in a
line then what is the probability that 3
girls are together and other three are
also together but these two group of girls
are not together?
(a)
(5040)(8!) (b)
(2520)(8!)
13! 13!
(c)
(1260)(8!) (d) None of these
13!
14. A group of students comprising 3 girls
and 5 boys went for a picnic. During a
game they arranged in a circle then what
is the probability that each boy has one
girl on at least one side?
(a) 1/21 (b) 1/14
(c) 1/7 (d) None of these
15. Rishita has 5 distinct red and 5 distinct
white flowers with that she made garland
then what is the probability that the
garland has no flowers of same colour
are together?
(a) 24(5!)/(9!) (b) 12(5!)/(9!)
(c) 6(5!)/(9!) (d) None of these
 Probability Miscellaneous  355
16. In Praxis Business school during a 18. There are 40 distinct pearl, out of which
meeting professors from different 20 are of blue coloured and remaining
department were to sit around a circular 20 are of red coloured, a necklace is
table. If number of professors from formed from these pearls then what is
Marketing, Finance, Operations, and the probability that no two beads of same
HR are 4, 5, 6 and 7 in any order. What colour are together?
is the probability that all the professors
from the same department are together? (a)
{(40!) – 2 (19!)(20!)}
39!
(a)
(2!)(4!)(5!)(6!)(7!) {(39!) – 2 (19!)(20!)}
21! (b)
39!
(b)
(3!)(4!)(5!)(6!)(7!) (19!)(20!)
(c)
21! 2 × 39!

(c)
(4!)(5!)(6!)(7!)
21!
(d) None of these
17. In Praxis Business school during a
meeting professors from different
department were to sit around a circular
table. If number of professors from
Marketing, Finance, Operations, and
HR are 5 each. What is the probability
that all the professors from the same
department are together and HOD of
any department is exactly between the
professors of that department?
(a)
(3!)(4!)4 (b)
19!
(c)
(4 )(4!)4 (d) None of these
19!
(d) None of these
19. Letters of the word MATHEMATICS are
arranged in all the possible ways, and a
word is selected randomly then what is
probability that letter C is between S and
H (these three letters are not necessary
together)?
(a) 1/5 (b) 1/6
(c) 1/3 (d) None of these
20. Letters of the word MATHEMATICS are
arranged in all the possible ways, , and
a word is selected randomly then what
is probability that letter C is exactly
(4!)4 between S and H ?
19!
(a) 1/5 (b) 1/6
(c) 1/3 (d) None of these

Response Grid
1. a b c d 2. a b c d 3. a b c d 4. a b c d 5. a b c d
6. a b c d 7. a b c d 8. a b c d 9. a b c d 10. a b c d
11. a b c d 12. a b c d 13. a b c d 14. a b c d 15. a b c d
16. a b c d 17. a b c d 18. a b c d 19. a b c d 20. a b c d
356  Theory of Counting
Concept Applicator (CA)
1. (a) 2. (b) 3. (a) 4. (b) 5. (c) 6. (a)
7. (b) 8. (b) 9. (a) 10. (a) 11. (c) 12. (b)
13. (a) 14. (d) 15. (d)
1. (a) This question is based on question
number 7 of CA of chapter 2.
Required answer is option (a)
2. (b) This question is based on question
number 10 of CA of chapter 2.
Required answer is option (b)
3. (a) This question is based on question
number 11 and 12 of CA of chapter 2.
Required answer is option (a)
4. (b) This question is based on question
number 11 and 12 of CA of chapter 2.
Required answer is option (b)
5. (c) This question is based on question
number 14 of CA of chapter 2.
Required answer is option (c),
6. (a) This question is based on question
number 16 and 17 of CA of chapter 2.
Required answer is option (a)
7. (b) This question is based on question
number 15 of CA of chapter 3.
Number of diagonals is 35, and
number of sides is 10 so required
probability is 35/45 = 7/9
Required answer is option (b)
8. (b) This question is based on question
number 8 and 9 of CA of chapter 4.
Required answer is option (b),
Solutions
9.
(a) This question is based on question
number 14 of CA of chapter 4.
Here sample space is (2n!) so
2
2 (n !)
required probability is
2n !
Required answer is option (a).
10. (a) This question is based on question
number 3 of CA of chapter 5.
Required probability
{(9!) – (2!)(8!)} 7
= =
9! 9
Required answer is option (a).
11. (c) This question is based on question
number 7 of CA of chapter 5.
Required answer is option (c).
12. (b) This question is based on question
number 13 of CA of chapter 5.
Required answer is option (b).
13. (a) This question is based on question
number 4 of CA of chapter 6.
Here sample space is (10!)/(2!)(2!)
Required probability is
 9! 
 
 (2!)(2!) 1
=
 10!  10
 
 (2!)(2!)
Required answer is option (a)
 Probability Miscellaneous  357
14. (d) This question is based on question 15. (d) This question is based on question
number 5 of CA of chapter 6. number 6 of CA of chapter 6.
Required probability is
Required probability is
 8! 

 (2!)(2!)

1 {6(7!)} =
1
= 30
 10!  90  10! 
 
 
 (2!)(2!)  (2!)(2!)

Required answer is option (d). Required answer is option (d).

Concept Builder (CB)

1. (d) 2. (c) 3. (c) 4. (b) 5. (c) 6. (a)
7. (b) 8. (c) 9. (a) 10. (d) 11. (b) 12. (c)
13. (a) 14. (b) 15. (c)

1. (d) This question is based on question
number 6 of CB of chapter 2.
Required answer is option (d).
2. (c) This question is based on question
number 8 of CB of chapter 2.
Required answer is option (c).
3. (c) This question is based on question
number 11 of CB of chapter 2.
Here sample space is
10C = (10!)/(6!)(4!)
6 10. (d) This question is based on question
= (7 × 8 × 9 × 10)/(24) = 210
Required answer is 200/210 = 20/21.
4. (b) This question is based on question
number 12 of CB of chapter 2.
Required answer is option (b).
5. (c) This question is based on question
number 19 of CB of chapter 2.
Here sample space is 26 = 64
Required answer is option (c).
6. (a) This question is based on question
number 3 of CB of chapter 4.
Required answer is option (a).
7. (b) This question is based on question
number 6 of CB of chapter 4.
Required answer is option (b).
8. (c) This question is based on question
number 8 of CB of chapter 4.
Required probability is 8(9!)/(10!)
= 4/5
Required answer is option (c).
9. (a) This question is based on question
number 9 of CB of chapter 4.
Required answer is option (a).
number 13 of CB of chapter 4.
Required probability is 1/2.
Required answer is option (d).
11. (b) This question is based on question
number 15 of CB of chapter 4.
Required answer is option (b).
12. (c) This question is based on question
number 2 of CB of chapter 5.
Required answer is option (c).
13. (a) This question is based on question
number 10 of CB of chapter 5.
Required probability is (9!)(10P5)/(14!)
Required answer is option (a).
358  Theory of Counting
14. (b) This question is based on question
number 14 of CB of chapter 5.
Required answer is option (b).
15. (c) This question is based on question
number 8 of CB of chapter 6.
The word INTERMEDIATE has 2
I’s, 3 E’s 2 T’s and remaining are
single letters so sample space is
12!
(2!)(3!)(2!)
Concept Cracker (CC)
1. (b) 2. (a) 3. (b) 4. (c) 5. (b) 6. (a)
7. (c) 8. (b) 9. (a) 10. (d) 11. (a) 12. (a)
13. (b) 14. (c) 15. (a) 16. (b) 17. (a) 18. (c)
19. (b) 20. (b)
1. (b) This question is based on question
number 3 of CC of chapter 2.
Required answer is option (b).
2. (a) This question is based on question
number 9 of CC of chapter 2.
Required answer is option (a).
3. (b) This question is based on question
number 11 of CC of chapter 2.
Here sample space is selecting 2 male
and 2 female persons out of 10 males
and 10 females (in 10C2 × 10C2 ways)
and then arranging mixed double in
(in 2 ways) so required sample space
is 2 × 10C2 × 10C2.
Required answer is option (b).
4. (c) This question is based on question
number 13 of CC of chapter 2.
Required answer is option (c).
5. (b) This question is based on question
number 14 and 15 of CC of chapter 2.
Sample space is given by answer of
question number 14, and favorable
Required probability is
 (5!)(7!) 
 
 2   (5!)(7!)(2!)(3!)(2!)
 12!  (2)(12!)
 
 (2!)(3!)(2!) 
120  6  2

8  9  10  11  12
1

66
case is given by answer of question
number 15.
Required answer is option (b).
6. (a) This question is based on question
number 23 of CC of chapter 2.
Required answer is option (a).
7. (c) This question is based on question
number 20 of CC of chapter 3.
Here sample space is (64 × 63)/(2!)
Required probability is
(64 × 49)/(64 × 63) = 7/9
Required answer is option (c).
8. (b) This question is based on question
number 2 of CC of chapter 4.
Required answer is option (b).
9. (a) This question is based on question
number 7 of CC of chapter 4.
Required answer is option (a).
10. (d) This question is based on question
number 9 of CC of chapter 4.
Required answer is option (d).

11. (a) This question is based on question
number 13 of CC of chapter 4.
Required probability is 8/24 = 1/3
Required answer is option (a).
12. (a) This question is based on question
number 14 of CC of chapter 4.
Required probability is 2(5!)/6! = 1/3
Required answer is option (a).
13. (b) This question is based on question
number 16 of CC of chapter 4.
(2520)(8!)
Required probability
13!
Required answer is option (b).
14. (c) This question is based on question
number 8 of CC of chapter 5.
Required probability is 720/(7!) = 1/7
Required answer is option (c).
Probability Miscellaneous  359
15. (a) This question is based on question
number 9 of CC of chapter 5.
Required probability is 24(5!)/(9!).
Required answer is option (a).
16. (b) This question is based on question
number 11 of CC of chapter 5.
Required answer is option (b).
17. (a) This question is based on question
number 12 of CC of chapter 5.
Required answer is option (a).
18. (c) This question is based on question
number 14 of CC of chapter 2.
Required answer is option (c).
19. (b) This question is based on question
number 1 of CC of chapter 6.
Required answer is option (b).
20. (b) This question is based on question
number 2 of CC of chapter 6.
Required answer is option (b).
360  Theory of Counting
Part B
1
Concept Deviator (CD)
Ideal Time Revise your concept (IIT advance or
5 Min.
Per Question
1. In a multiple choice question there are
four alternative answers, of which one
or more is correct. A candidate will get
marks in the question only if he ticks
all the correct answers. The candidate
decides to tick answers at random. If he
allowed up to three chances to answer
the question, find the probability that we
will get marks in the question.
[IIT JEE 1985]
(a) 1/5 (b) 3/5
(c) 2/5 (d) 1
1   3 p 1 – p 1 – 2 p
2. If , and are the
3 4 2 n
probabilities of the three mutually
exclusive events, then the set of all
values of p is [IIT JEE 1986]
(a) –1/3 ≤ p  ≤ 1 / 2 (b) 1/3 ≤ p  ≤ 1 / 2
(c) 1/4 ≤ p  ≤ 1 / 2 (d) None of these
3. The probability that at least of the events
A and B occur is 0.6. If A and B occur
simultaneously with probability 0.2 then
P(A′) + P(B′) is [IIT JEE 1987]
(a) 0.4 (b) 0.8
(c) 1.2 (d) None of these
4. For two given events A and B, P(A ∩ B)
is [IIT JEE 1988]
(a) Not less than P(A) + P(B) – 1
(b) Not greater than P(A) + P(B)
(c) Equal to P(A) + P(B) – P(A ∪ B)
(d) Equal to P(A) + P(B) + P(A ∪ B)
tougher questions)
5. Suppose the probability for A to win
game against B is 0.4. If A has an option
of playing either “best of 3 games” or
a “ best of 5 games” match against B,
which option should A choose so that
his probability of winning is higher? (No
game ends in a draw) [IIT JEE 1989]
(a) Best of 3 (b) Best of 5
(c) Equal probability (d) None of these
6. A is a set containing n elements. A subset
P of A is chosen at random. The set A is
reconstructed by replacing the elements of P.
A subset Q of A is again chosen at random.
Find the probability that P and Q have no
common elements. [IIT JEE 1989]
n
 1  3
(a)   (b)  
 4  4
n
 2
(c)   (d) None of these
 3
7. Three faces of a fair die are yellow, two
faces red and one blue. The die is tossed
three times. The probability that the colours
yellow, red and blue appear in the first,
second and the third tosses respectively, is
__________. [IIT JEE 1992]
(a) 1/12 (b) 1/24
(c) 1/36 (d) None of these
8. An unbiased die with faces marked, 1, 2, 3,
4, 5 and 6 is rolled four times. Out of four
face values obtained, the probability that
the minimum face value is not less than 2
and the maximum face value is not greater
than 5 is then, [IIT JEE 1993]
(a) 16/81 (b) 1/81
(c) 80/81 (d) 65/81

9. Numbers are selected at random, from
the two digit numbers 00, 01, 02,….., 99
with replacement. An event E occurs if
and only if the product of the two digits of
a selected number is 18. If four numbers
are selected, find the probability that the
event E occurs at least 3 times.
[IIT JEE 1993]
97 98
(a) (b) (c) P(( A ∪ B)′) = P(A′) P(B′)
25 4 25 4
151
(c) (d) None of these
254
10. If two events A and B such that
P(A′) = 0.3, P(B) = 0.4 and P(A ∩ B′) = 0.5
then P(B|(A ∪ B′)) = [IIT JEE 1994]
(a) 1/2 (b) 3/4
(c) 3/5 (d) None of these
11. Let A, B, C be three mutually independent
events. consider the two statements S1
and S2. [IIT JEE 1994]
S1 : A and B ∪ C are independent
S2 : A and B ∩ C are independent
Then 2
(a) Both S1 and S2 are true
(b) Only S1 is true 2
(c) Only S2 is true
(d) Neither S1 nor S2 is true
12. An unbiased coin is tossed. If the result
is head, a pair of unbiased dice is rolled
and the number obtained by adding the
number on the two faces is noted. If the
result is a tail, a card from a well shuffled
pack of eleven cards numbered 2, 3, 4, …
12 is picked and the number on the card
is noted. What is the probability that the
noted number is either 7 or 8?
[IIT JEE 1994]
Probability Miscellaneous  361
(a) 91/792 (b) 101/792
(c) 193/792 (d) None of these
13. Let 0 < P(A) < 1, 0 < P(B) < 1 and P(A ∪ B)
= P(A) + P(B) – P(A) P(B). Then
[IIT JEE 1995]
(a) P(B – A) = P(B) – P(A)
(b) P(A′ ∪ B′) = P(A′) + P(B′)
(d) P(A|B) = P(A)
14. For the three events A, B and C, P
(exactly one of the events A or B occurs)
= P(exactly one of the events B or C
occurs) = P(exactly one of the events B
or C occurs) = P(exactly one of the events
C or A occurs) = p and P( all the three
events occur simultaneously) = p2, where
0 < p < 1/2 . Then the probability of at
least one of the three events A, B and C
occurring is [IIT JEE 1996]
3 p  2 p2 p  +  3 p 2
(a) (b)
4
2
p  +  3 p 3 p  +  2 p 2
(c) (d)
4
15. Three numbers are chosen at random
without replacement from {1, 2, ..., 10}.
The probability that the minimum of the
chosen numbers is 3, or their maximum
is 7, is: [IIT JEE 1997]
(a) 7/40 (b) 9/40
(c) 13/40 (d) 11/40
16. If p and q are chosen randomly from
the set {1, 2, 3, 4, 5, 6, 7, 8, 9, 10} with
replacement determine the probability
that the roots of the equation x2 + px q = 0
are real. [IIT JEE 1997]
362  Theory of Counting
(a) 61/100 (b) 62/100
(c) 63/100 (d) 64/100
Direction for question number 17 and 18:
Sixteen players S1, S2, ..., S16 play in a
tournament. They are divided into eight pairs at
random. From each pair a winner is decided on the
basis of the game played between the two players.
Assume that all the players are of equal strength.
17. Find the probability that the player S1 is
among the eight winners. [IIT JEE 1995]
(a) 1 (b) 1/2
(c) 1/4 (d) none of these
18. Find the probability that exactly one of
the two players S1 and S2 is among the
eight winners. [IIT JEE 1995]
(a) 1/15 (b) 2/15
(c) 4/15 (d) none of these
19. If E′ and F′ are complementary events
of E and F respectively and if 0 < P(E),
P(F) < 1, then [IIT JEE 1998]
(a) P(E|F) + P(E′|F′) = 1
(b) P(E|F) + P(E|F′) = 1
(c) P(E′|F) + P(E|F′) = 1
(d) P(E|F′) + P(E′|F′) =1
20. Seven white balls and three black balls are
randomly placed in a row. The probability
that no two black balls are placed adjacently
equals [IIT JEE 1998]
(a) 1/2 (b) 7/15
(c) 2/15 (d) 1/3
21. If from each of the three boxes containing
3 white and 1 black, 2 white and 2 black,
1 white and 3 black balls, one ball is
drawn at random, then the probability
that 2 white and 1 black ball will be
drawn is        [IIT JEE 1998]
(a) 13/32 (b) 1/4
(c) 1/32 (d) 3/1
22. A fair coin is tossed repeatedly. If the
tail appears on first four tosses, then the
probability of the head appearing on the
fifth toss equals [IIT JEE 1998]
(a) 1/3 (b) 1/6
(c) 1/2 (d) 1/4
23. If E and F are events with P(E) ≤ P(F)
and P(E ∩ F) > 0, then [IIT JEE 1998]
(a) occurrence of E ⇒ occurrence of F
(b) occurrence of F ⇒ occurrence of E
(c) non-occurrence of E ⇒ non-occurr
ence of F
(d) none of the above implications holds
24. If A, B and C are three events such
that P(B) = 3/4 , P(A ∩ B ∩ C′) = 1/3 and
P(A′ ∩ B ∩ C′) = 1/3, then P(B ∩ C) is equal to:
[IIT JEE 2003]
(a) 1/12 (b) 1/6
(c) 1/15 (d) 1/9
25. Two numbers are selected randomly
from the set A = {1, 2, 3, 4, 5, 6} without
replacement one by one. The probability
that minimum of the two numbers is less
than 4 is [IIT JEE 2003]
(a) 1/15 (b) 4/15
(c) 1/5 (d) 4/5

Response Grid
1. a b c d 2. a b c d 3. a b c d 4. a b c d 5. a b c d
6. a b c d 7. a b c d 8. a b c d 9. a b c d 10. a b c d
11. a b c d 12. a b c d 13. a b c d 14. a b c d 15. a b c d
16. a b c d 17. a b c d 18. a b c d 19. a b c d 20. a b c d
21. a b c d 22. a b c d 23. a b c d 24. a b c d 25. a b c d
 Probability Miscellaneous  363

2
Concept Eliminator (CE)
Ideal Time Revise your concept (Maths Olympiad
Just solve it or tougher questions)
1. The probabilities that a student passes in at random and is tossed twice. The first
Mathematics, physics and chemistry are time it shows head and the second time
m, p and c, respectively. Of these subjects, it shows tail. What is the probability that
the student has a 75% chance of passing the coin drawn is fair?
in at least one, a 50% chance of passing (a) 9m/(m – n) (b) 1/m + n
in exactly two. Which of the following (c) 9m/(8 N + m) (d) none of these
relations are true?
5. Three of the six vertices of regular
(a) p + m + c = 19/20 hexagon are chosen at random. The
(b) p + m + c = 27/20 probability that the triangle with these
(c) pmc = 1/10 three vertices is equilateral, equals
(d) pmc = 1/4 (a) 1/2 (b) 1/5
2. Eight players P1, P2, ... P8 play a knock – (c) 1/10 (d) 1/20
out tournament. It is known that whenever 6. Susmit met his fast friend Ricky. Susmit
the players Pi and Pj play, the player Pi will asked Ricky, How many children do you
win if i < j. Assuming that the players are have? Ricky replied 2, further Ricky
paired at random in each round, what is added that one of his son born on Sunday
the probability that the player P4 reaches then what is the probability that he has
the final? two sons?
(a) 35/105 (b) 36/105 (a) 1/2 (b) 14/27
(c) 1/75 (d) none of these (c) 13/28 (d) 13/27
3. An urn contains m white and n black 7. In a game show “Kaun banega Dus Crore
balls. A ball is drawn at random and is Pati” The host Mr. Kabir Khan gave the
put into the urn along with k additional guest Mr Rajesh a choice of three doors:
balls of the same colour as that of the Behind one door is a new shining car;
ball drawn. A ball is again drawn at behind the others, nothing. Mr. Rajesh
random. What is the probability that the pick a door, say No.  1, and the host,
ball drawn now is white? Mr. Kabir Khan who knows what’s
(a) m/(m + n) (b) (m – n)/(m + n) behind the doors, opens another door,
(c) 1/(m + n) (d) none of these say No.  3, which has nothing. He then
says to Mr Rajesh, “Do you want to pick
4. A box contains N coins, m of which are door No. 2?” What he should do now to
fair and rest are biased. The probability of win the car?
getting a head when a fair coin is tossed
is 1/2 , while it is 2/3 when a biased coin (a) 2/3 (b) 1/3
is tossed. A coin is drawn from the box (c) 1 (d) 0

Response Grid
1. a b c d 2. a b c d 3. a b c d 4. a b c d 5. a b c d
6. a b c d 7. a b c d
364  Theory of Counting

Solutions
Concept Deviator (CD)
1. (a) 2. (a) 3. (c) 4. (a, c) 5. (a) 6. (b)
7. (c) 8. (a) 9. (a) 10. (b) 11. (a) 12. (c)
13. (c) 14. (a) 15. (d) 16. (b) 17. (b) 18. (d)
19. (a,d) 20. (b) 21. (a) 22. (c) 23. (d) 24. (a)
25. (d)

1. (a) Lets first find the total number of ways: On solving these in-equations we
4C 4C 4C 4C 24 1 1
1+ 2 + 3 + 4 = – 1 = 15 will get –  p .
3 2
out of 15 only one is correct. 3. (c) Given that
He will get marks in three cases- P(A  B) = 0.6, P( A  B) = 0.2
Case (i) correct answer in 1st chance Now,
1/15. P( A ') + P( B′) = {1 – P(A)} + {1 – P(B)}
Case (ii) Correct answer in 2nd = 2 – {P(A) + P(B)}
chance ( 14/15)(1/14). = 2 – { P(A ∪ B) + P(A  B ) }
Case (iii) Correct answer in 3rd = 2 – (0.6 + 0.2) = 1.2.
chance ( 14/15)(13/14)(1/13). 4. (a, c) We know, P(A ∪ B) = P(A) + P(B)
So required probability is – P(A  B ) ,
Hence option (a) and (c) are correct.
1 14   1   14  13   1  1
             5. (a) Consider both the cases separately:
15 15  14  150  14  13  5
Case (i): Best if 3 games required
1  3p 1  p 1  2p
2. (a) Since, , , are probability is (3C2)(0.4)2(0.6)1 + (3C3)
4 4 2
mutually exclusive events. (0.4)3(0.6)0 = 0.288 + 0.064 = 0.352.

Therefore, all these will lie between Case (ii): Best if 5 games required
1  3p 1 p probability is (5C3)(0.4)3(0.6)2 +
0 to 1 i.e. 0   1, 0   1, (5 C )(0.4)4(0.6)1 + ( 5C )(0.4)5(0.6)0
4 4 4 5
1  2p = 0.31744.
0   1
2
Hence best of 3 is the correct option.
 Probability Miscellaneous  365
6. (b) Since set A contains n elements so NowP(B/A ∪ B′)
its power set has 2n elements so Set = P(B ∩ (A ∪ B′))/P(A ∪ B′)
P can be chosen in (2n) ways, and Q
= (0.7 – 0.5)/0.8 = 1/4.
can be selected in (2n) ways.
11. (a) Since all the three are independent
So P and Q can be selected in
events hence both statement S1 and
(2 )(2 )   4 ways
n n n
S2 are true.
Now number of disjoint sets is 12. (c) Consider the two cases of getting 7
n and 8 separately,
  r 0
( n Cr )2n  r  (1  2)n  3n
Getting 7:
n n
3  3 1   6  1   1  1 1
Required probability is =    .
n            
4  4 2 36
      2 11 12 22
7. (c) Required probability is
11  6 17
 
(3/6)(2/6)(1/6) = 1/36 132 132

8. (a) Probability of getting favorable case
Getting 8:
is (4/6) then required probability is
1   5  1   1  5 1
 4  4 16            
   2 36
      2 11 72 22
6  81 55  36 193
 
9. (a) Since product of two digit number is 792 792
18 so selected numbers must be one So required probability is
among 29, 36, 63, 92. 17 91 193
  .
So probability of getting favorable 132 792 792
case is (4/100) = 1/25. 13. (c) From the given information we can
conclude that P(A ∩ B) = P(A)P(B)
Out of 4 outcomes numbers favorable
hence A and B are independent
events will be at least 3 times. Hence
events, hence A′ and B′ are also
required probability is
independent
 1  3  24   1  4 97
= 4          4 So P(A ∪ B)' = P(A′ ∩ B′) = P(A′)P(B′)
 25   25   25  25
10. (b) From the given information 14. (a) P(Exactly one of A or B occurs)
P(A) = 1 – 0.3 = 0.7 = P(A) + P(B) – 2P(A ∩ B) = p
Since P(A ∪ B′) Similarly P(C) +P(B) – 2P(C ∩ B)
= P(A) + P(B′) – P(A ∩ B′) = P(A) + P(C) – 2P(A ∩ C) = p
= 0.7 + 0.6 – 0.5 = 0.8 Hence 2[P(A) + P(B) +P(C)
366  Theory of Counting
– P(A ∩ B) – P(B ∩ C) – P(C ∩ A)] = 3p q p No. of pairs
Since P(A ∩ B ∩ C) = p2 10 1,2,3,4,5,6 6
Hence P(at least one of A, B and C) 9 1,2,3,4,5 5
= [P(A) + P(B) + P(C) – P(A ∩ B) 8 1,2,3,4,5 5
– P(B ∩ C) – P(C ∩ A)] + P(A ∩ B ∩ C) 7 1,2,3,4,5 5
6 1,2,3,4 4
3p 3 p  2 p2
=   p2  5 1,2,3,4 4
2 2
4 1,2,3 3
15. (d) Let P(3) = Probability that the
3 1,2,3 3
minimum of the number is 3
2 1,2 2
1 7
{ ( C1 )  ( C2 )} 7 1 1 1
= 
{(10 C3 )} 40 Total 38
Let P(7) = Probability that the So number of cases not favorable is
maximum of the number is 7 100 – 38 = 62.

{(1 C1 )   ( 6 C2 )} 1 And required probability is

= 
{(10 C3 )} 8 62/100 = 0.62
Probability that the minimum of the
number is 3 and maximum of the
number is 7
{(1 C1 )  (1 C1 )  (3 C1 )}
= 
{(10 C3 )}
So required probability
7 1 1 11
= + – =
40 8 40 40
16. (b) Given equation is x   px  q    0
2
Roots of this equation is real if
p2  4q
Sample space for (p, q) is
10 × 10 = 100
Number of cases which is not
favorable is i.e. ( p   4q ) in the
2 number of ways in which 16 persons
following cases:
17. (b) Let P(S1 to be among the eight winners)
= P(S1 being a pair) × P(S1 wins)
= 1 × 1/2 = 1/2
18. (d) We can say that if S1 and S2 are in the
1
same pair then exactly one wins.
40
Now, If S1 and S2 are in two pairs
separately then we can say that one
among the two (i.e S1 and S2 )
Will be winner among the eight. If
S1 wins and S2 loses or S1 loses and
S2 wins. Now the probability if S1
and S2 being in the same pair and
one wins = P( same pair) × P( anyone
win in the pair)
Probability of S1 , S2 being the same
pair = n(E) /n(S), where n(E ) is the
can be divided in 8 pairs.
 Probability Miscellaneous  367
Therefore, two black ball put together is equal
14 ! 16 ! to the number of ways of choosing 3
n(E ) = and n(S) = ,
(2!)7 .7! (2!)8 .8! place out of eight places. Now this
can be done in 8C3 ways therefore our
(14!)(2!)8 . 8 ! required probability = 7/15.
now  P(same pair) =
(2!)7 . 7 !. (16 )!
21. (a) Let W be for white ball and B for
= 1/15 black balls.
The probability of any one winning in we can say, P(2 white and 1 black
the pairs of S1 S2 = ( certain event) = 1 ball) = P(W1 W2 B3 or W1 B2 W3 or B1
The pairs of S1, S2 being in two pairs W2W3)
separately and S1 wins, S2 + the = 3/4 × 2/4 × 3/4 + 3/4 × 2/4 × 1/4 +
probability of S1 S2 being in two pairs 1/4 × 2/4 × 1/4 = 13/32
separately and S1loses and S2 wins 22. (c) Let E be the event that the 5th toss
14 ! results in head which is independent
7
(2!) .7 ! of the event that the 1st 4 tosses
= {1 – } × 1/2 × 1/2
16 ! result in tails.
(2!)8 .8!
Therefore, required probability is 1/2.
14 ! 23. (d) As it is given that P( E) ≤ P (F) ⇒ E
(2!)7 .7 ! ⊆ F and P( E ∩ F) > 0 ⇒ E ≠ F,
+{1– } × 1/2 × 1/2 = 7/15
16 !
Option (a )and option( b)can be obtain
(2!)8 .8!
from second relation and option (c)
Therefore, required probability
can be obtain from 1st relation.
= 1/15 + 7/15 = 8/15
24. (a) Since P(B ∩ C) = P(B) – P(A ∩ B ∩ C′) –
19. (a,d) Option (a) and (d) are correct.
P(A′ ∩ B ∩ C′) = 3/4 – 1/3 – 1/3 = 1/12
20. (b) As we can find out, The number of
25. (d) Total number of ways is (2!)(6C2) = 30
ways of placing 3 black balls without
10C Not favourable cases are 6 so favour-
any restriction is 3. As we have
able cases are 30 – 6 = 24.
total 10 places to put 10 balls in a row.
Now the number of ways in which no Required probability = 24/30 = 4/5.

Concept Eliminator (CE)

1. (c) 2. (b) 3. (a) 4. (c) 5. (c) 6. (d)
7. (a)
368  Theory of Counting
1. (c) This question is based on principle
of inclusion and exclusion
Let X , Y and Z be the events that the
student passes in Maths , Physics
and chemistry.
P(X) = m, P(Y) = p and P(Z) = c
and P(passing in at least one)
= P(X ∪ B ∪ C) = 0.75 [ given]
Now, 1 – P( X′ ∩ Y′ ∩ Z′) = 0.75,
P(X) = 1 – P (X′) and P(X ∪ B ∪ C)′
= P(X ∩ Y ∩ Z )
⇒ 1 – P(X′) P(Y′) P(Z′) = 0.75
X, Y and Z are independent event
therefore X′, Y′ and Z′ are also
independent.
1 – (1 – m)(1 – p)(1 – c) = 0.75
⇒  (1 – m)(1 – p)(1 – c) = 0.25  ...(i)
also P( passing exactly in one subject)
= 0.4
⇒ P( X ∩ Y ∩ Z′ ∪ X ∩ Y′ ∩ Z ∪ X′
∩ Y ∩ Z) = 0.4
⇒ P( X ∩ Y ∩ Z′) ∪ P( X ∩ Y′ ∩ Z) ∪
P(X′ ∩ Y ∩ Z) = 0.4
pm – pmc + pc – pmc + mc – pmc = 0.4
...(ii)
Again P(passing at least in two
subjects) = 0.5
⇒ P(X ∩ Y ∩ Z′ ) ∪ P(X ∩ Y′ ∩ Z) ∪
P(X′ ∩ Y ∩ Z) ∪ P( X ∩ Y ∩ Z) = 0.5
⇒  (pm + pc+ mc) – pcm = 0.5  ...(iii)
From (ii) we get
  (pm + pc+ mc) – 3pcm = 0.4  ...(iv)
From (i) we get,
1 – (m + p + c) + (pm + pc + cm) – pcm
  = 0.25 ...(v)
Now from (iii), (iv) and (v) we get,
p + m + c = 1.35 = 27/20
and pmc = 1/10
2. (b) As P1, P2, ... P8 (the eight Players) the
number of ways they can be paired
in four pairs = 1/4! [ (8C2)(6C2)(4C2)
(2C2)] ways = 105 ways.
Now, at least two players certainly reach
the second round in between P1 , P2 and
P3, P4 can reach in the final, if exactly
two players play against each other
in between P1 , P2 and P3and remaining
player will play against one of players
from P 5, P6, P7, P8 and P4 plays against
one of the remaining three from P5 to P8.
Now this can be possible in
3C
2 × 4C1 × 2C1 = 36 ways.
Required probability = 36/105.
3. (a) Say that the first ball drawn is
white
W1 ⋅ P(W1) = (m/(m + n)
Ball drawn in the first draw is black
is B1 ⋅ P(B1) = n/(m + n)
the second ball drawn is white W2.
P(W2/W1) = (m + k)/(m + n + k)
and P(W2/B1) = m/(m + n + k)
Then required probability
P(W2) = P(W1) ⋅ P(W2/W1)
+ P(B1) ⋅ P(W2/B1)
= m/(m + n)
 Probability Miscellaneous  369
4. (c) Let A be the event that the coin Case (ii) 2nd children is boy and born
tossed twice, comes head at first on Sunday then sample space is
time and tail at second and B be the
1st Children (boy) 2nd Total 7
event that coin drawn is fair. Children cases
Required probability (Boy)
P(B/A) = P(A/B) ⋅ P(B)/{P(A/B) ⋅ P(B) Born on Sunday Born on
Sunday
+ P(A/B′) P(B′)} Born on Monday
= 9m/(8N + m) Born on Tuesday
5. (c) Three vertices of a regular hexagon
Born on Wednesday
can be chosen in 6C3 ways = 20 ways.
Born on Thursday
When we draw a regular hexagon,
we can see that only two triangles Born on Friday

can be formed. Born on Saturday

Then required probability = 2/20 = 1/10
1st Children (boy) 2nd Total 7
6. (d) Here we need to find sample space Children cases
1st and then we have to calculate the (Girl)
favourable cases: Born on Sunday Born on
Case (i) 1st children is boy and born Sunday
Born on Monday
on Sunday then sample space is
Born on Tuesday
1st 2nd Children (Boy) Total 7
Children cases Born on Wednesday
(boy)
Born on Thursday
Born on Born on Sunday
Sunday Born on Friday
Born on Monday
Born on Tuesday Born on Saturday
Born on Wednesday
Now what is total sample space is it
Born on Thursday
7 + 7 + 7 + 7 = 28 NO ITS NOT.
Born on Friday
Born on Saturday Be careful and see the repetition if
both the children are boy and born
Total 7 2nd Children Total 7
cases (Girl) cases on Sunday (As shown by dark cells
Born on Born on Sunday in the above table) we have counted
Sunday Born on Monday the same thing in 1st as well as 4th
Born on Tuesday table.
Born on Wednesday So sample space is 28 – 1 = 27
Born on Thursday
And favourable cases is 14 – 1 = 13
Born on Friday
Born on Saturday So required probability is 13/27.
370  Theory of Counting
7. (a) This is a famous Monty Hall Problem (Named after the host of a game show).

The correct answer is yes he should switch to door no 2.

To understand the situation let us list down all the possibilities:

Door No. 1 Door No. 2 Door No. 3 Result

Case (i) CAR Empty Empty Switch and loose

Case (ii) Empty CAR Empty Switch and win

Case (iii) Empty Empty CAR Switch and win

Case (iv) CAR Empty Empty Stay and win

Case (v) Empty CAR Empty Stay and loose

Case (vi) Empty Empty CAR Stay and loose

So probability of winning if Mr Rajesh switch is 2/3 and if not then 1/3

 15
Puzzles  371

Puzzles

Topics Covered

 Puzzles

 Miscellaneous Type of Puzzles

Part A: Topic Number of Questions

Concept Applicator 10
Concept Builder 10
Concept Cracker 25
Part B: Topic Number of Questions
Concept Deviator 11
Concept Eliminator 10
Total 66
372  Theory of Counting
Part A
Puzzles is an integral part of any aptitude test
exam. These are basically combination of one
or more concepts of logical reasoning.
1
Concept Applicator (CA)
Ideal Time
15 Min.
1. A group of students is organized in two
rows, crossing each other. If a student is
tenth from all ends, how many students
are there in the group?
(a) 27 (b) 47
(c) 37 (d) 39
2. A grocer sells half of the eggs that he has
and another half an egg to Anurag. Then
he sells half of the balance eggs and.
another half an egg to Deepak. Then he
sells half of the balance eggs and another
half an egg to Shivani. In the end he is
left with just 7 eggs and he claims that
he never broke an egg. How many eggs
did he start with?
(a) 66 (b) 63
(c) 33 (d) 68
3. A hunter has just returned after a day’s
bird shooting. He was asked how many
birds he had in his bag. He answered,
“They are all sparrows but six,” all
pigeons but six, and all doves but six.
How many birds did he have in his bag?
(a) 18 (b) 9
(c) 27 (d) None of these
4. Arun started walking positioning his
back towards the sun. After some time,
he turned left, then turned right and
then towards the left again. In which
direction is he going now?
There are more than 1000 types of puzzles
with 1000 different concepts so lets discuss
few good and selected puzzles.
Apply your concepts with easy and
conceptual questions
(i) North (ii) West
(iii) South (iv) East
(a) (i) or (ii) (b) (i), (ii) or (iii)
(c) (ii) or (iii) (d) (iii) or (iv)
5. In a row at a bus stop, A is 9th from the
right and B is 7th from the left. They
both interchange their positions. If there
are 20 people in the row, what will be the
new position of B from the left’?
(a) 11th (b) 12th
(c) 13th (d) 10th
6. In a game show, participants are asked
to build two towers of different designs
using plastic bricks. These plastic
bricks are of two types: Red and Blue.
Participants are given a fixed number of
bricks to build these towers. The height
of each tower is measured and 2 points
are awarded for every 10 centimetres of
first building and 1 point is awarded for
every 10 centimetres of second building.
One participant has 4 red and 3 blue
bricks left with him. If he wants to
increase the height of his first tower, he
would need 1 red and 2 blue bricks for
every 10 cm. For the second tower, to
raise the height he would need 2 red and
1 blue bricks, for every 10 cm. What is
the best option for him now?

(a) Raise the height of first tower by
20 cm
(b) Raise the height of second tower by
20 cm
(c) Raise the heights of first and
second towers by 10 cm & 20 cm
respectively
(d)  None of the above
7. There are two cups, one containing
orange juice and one containing an equal
amount of lemonade. One teaspoon of
the orange juice is taken and mixed with
the lemonade. Then a teaspoon of this
mixture is mixed back into the orange
juice. Is there more lemonade in the
orange juice or more orange juice in the
lemonade?
(a) More orange juice in the lemonade
(b) More lemonade in the orange juice
(c) Equal amount of each juice between
the two cups
(d) None of the above
8. All employees have to pass through
three consecutive entrance doors to
enter into the office and one security
guard is deployed at each door. These
security guards report to the manager
about those who come to office after 10
AM. Ms. Rani is an employee of this
office and came late on the annual day.
In order to avoid report to the manager
she had to pay each security guard half
of the money she had in her purse and 2
Response Grid
1. a b c d 2. a b c d 3. a b c d 4. a b c d 5. a b c d
6. a b c d 7. a b c d 8. a b c d 9. a b c d 10. a b c d
Puzzles  373
rupees more besides. She found only one
rupee with her at the end. How much
money Ms. Rani had before entering the
office on the annual day?
(a) ` 40 (b) ` 36
(c) ` 25 (d) ` 42
9. On 1st  March, Timon arrived in a new
city and was looking for a place to stay.
He met a landlady who offered to rent
her apartment at a reasonable price
hut wanted him to pay the rent on a
daily basis. Timon had a silver bar of 31
inches, and an inch of the silver bar was
exactly equal to a day’s rent. He agreed
to pay an inch of the silver bar towards
the daily rent. Timon wanted to make the
minimum number of pieces of the silver
bar hut did not want to pay any advance
rent. How many pieces did he make ?
(a) 5 (b) 8
(c) 16 (d) 20
10. Little Pika who is five and half years old
has just learnt addition. However, he does
not know how to carry. For example, he
can add 14 and 5, but he does not know
how to add 14 and 7. How many pairs of
consecutive integers between 1000 and
2000 (both 1000 and 2000 included) can
Little Pika add?
(a) 150 (b) 155
(c) 156 (d) 258
374  Theory of Counting

2
Concept Builder (CB)
Ideal Time Revise your concepts with questions
25 Min. medium difficulty level questions

1. Prof. Bee noticed something peculiar P A Y

while entering the quiz marks of his
M E
five students into a spreadsheet. The
spreadsheet was programmed to calculate R E A L
the average after each score was entered. M O N E Y
Prof. Bee entered the marks in a random
order and noticed that after each mark 3. The letter ‘Y’ should be
was entered, the average was always an (a) 0
integer. In ascending order, the marks (b) 2
of the students were 71, 76, 80, 82 and (c) 3
91. What were the fourth and fifth marks (d) None of the above
that Prof Bee entered? 4. There are nine letters and ten digits. The
(a) 71 and 82 (b) 71 and 76 digit that remains unutilized is:
(c) 71 and 80 (d) 76 and 80 (a) 4
2. In the figure, number in any cell is (b) 3
obtained by adding two numbers in the (c) 2
cells directly below it. For example, 9 in (d) None of the above
the second row is obtained by adding the 5. The resulting value of ‘MONEY’ is
two numbers 4 and 5 directly below it. (a) 10364
The value of X – Y is (b) 10563
68 (c) 10978
Y + 29 (d) None of the above
Directions for Questions 6 and 7:
Five horses, Red, White, Grey, Black and
9
Spotted participated in a race. As per the
Y 4 5 2 X rules of the race, the persons betting on the
winning horse get four times the bet amount
(a) 2 (b) 3 and those betting on the horse that came in
second get thrice the bet amount. Moreover,
(c) 4 (d) 5 the bet amount is returned to those betting
Directions for Questions 3 to 5: Substitute on the horse that came in third, and the
different digits (0, 1, 2, ... 9) for different rest lose the bet amount. Raju bets ` 3000,
letters in the problem below, so that the ` 2000, ` 1000 on Red, White and Black horses
corresponding addition is correct and it results respectively and ends up with no profit and no
in the maximum possible value of MONEY. loss.

6. Which of the following cannot be true?
(a) At least two horses finished before
spotted
(b) Red finished last
(c) There were three horses between
black and spotted
(d) There were three horses between
white and red
7. Suppose, in addition, it is known that
Grey came in fourth. Then which of the
following cannot be true?
(a) Spotted came in first
(b) Red finished last
(c) White came in second
(d) Black came in second
8. Three Englishmen and three Frenchmen
work for the same company. Each of
them knows a secret not known to others.
They need to exchange these secrets
over person-to-person phone calls so that
eventually each person knows all six
secrets. None of the Frenchmen knows
English, and only one Englishmen knows
French. What is the minimum number
of phone calls needed for the above
purpose?
(a) 5 (b) 10
(c) 9 (d) 15
Response Grid
1. a b c d 2. a b c d 3. a b c d 4. a b c d 5. a b c d
6. a b c d 7. a b c d 8. a b c d 9. a b c d 10. a b c d
Puzzles  375
9. Each family in a locality has at most two
adults, and no family has fewer than 3
children. Considering all the families
together, there are more adults than
boys, more boys than girls, and more girls
than families. Then the minimum possible
number of families in the locality is
(a) 4 (b) 5
(c) 2 (d) 3
10. My bag can carry no more than ten
books.I must carry at least one book each
of management, mathematics, physics
and fiction. Also, for every management
book I carry I must carry two or more
fiction books, and for every mathematics
book I carry I must carry two or more
physics books. I earn 4, 3, 2 and 1 points
for each management, mathematics,
physics and fiction book, respectively, I
carry in my bag. I want to maximise the
points I can earn by carrying the most
appropriate combination of books in my
bag. The maximum points that I can
earn are:
(a) 20 (b) 21
(c) 22 (d) 23
376  Theory of Counting
3
Concept Cracker (CC)
Ideal Time
40 Min.
1. Five persons with names P, M, U, T
and X live separately in any one of the
following: a palace, a hut, a fort, a house
or a hotel. Each one likes two different
colours from among the following: blue,
black, red, yellow and green. U likes red
and blue. T like black. The person living
in a palace does not like black or blue. P
likes blue and red. M likes yellow. X lives
in a hotel. M lives in a:
(a) hut (b) palace
(c) fort (d) house
2. There are ten animals–two each of lions,
panthers, bison, bears, and deer–in a zoo.
The enclosures in the zoo are named X, Y,
Z, P and Q and each enclosure is allotted
to one of the following attendants:
Jack, Mohan, Shalini, Suman and Rita.
Two animals of different species are
housed in each enclosure. A lion and a
deer cannot be together. A panther cannot
be with either a deer of a bison. Suman
attends to animals from among bison,
deer, bear and panther only. Mohan
attends to a lion and a panther. Jack
does not attend to deer, lion or bison. X,
Y, and Z are allotted to Mohan, Jack and
Rita respectively. X and Q enclosures
have one animal of the same species. Z
and P have the same pair of animals.
The animals attended by Shalini are:
(a) bear and bison
(b) bison and deer
(c) bear and lion
(d) bear and panther
Boost up your confidence with good
questions
3. Eighty kilograms (kg) of store material
is to be transported to a location
10 km away. Any number of couriers can
be used to transport the material. The
material can be packed in any number of
units of 10, 20, or 40 kg. Courier charges
are ` 10 per hour. Couriers travel at the
speed of 10 km/hr if they are not carrying
any load, at 5 km/hr if carrying 10 kg,
at 2 km/hr if carrying 20 kg and at 1 km/hr
if carrying 40 kg. A courier cannot carry
more than 40 kg. of load. The minimum
cost at which 80 kg of store material can
be transported to its destination will be:
(a) ` 180 (b) ` 160
(c) ` 140 (d) ` 120
Direction for Questions 4 and 5:
In a game played by two people there were
initially N match sticks kept on the table. A
move in the game consists of a player removing
either one or two matchsticks from the table.
The one who takes the last matchstick loses.
Players make moves alternately. The player
who will make the first move is A. The other
player is B.
4. The smallest value of N (greater than 5)
that ensures a win for B is
(a) 7 (b) 6
(c) 10 (d) 8
5. The largest of N (less than 50) that
ensures a win for B is
(a) 46 (b) 47
(c) 48 (d) 49

6. Consider the following set of three
statements:
(i) There are three statements in this
set.
(ii) Two of them are not true.
(iii) Your IQ score will go up by 20 if you
learn to play game Z.
For these three statements to be
consistent:
(a) Only statements (ii) and (iii) must
be true.
(b) Statement (iii) may be either true or
false
(c) Statements (ii) and (iii) must be
false.
(d) Statement (iii) must be false.
7. Three married couples on a journey come
to a river where they find a boat that
cannot carry more than two persons at
a time. An additional condition is that a
lady cannot be left on either bank where
other men are present, without her
husband.
(a) These people will not be able to cross
the river.
(b) They will be able to cross the river in
9 steps.
(c) They will be able to cross the river in
10 steps.
(d) They will be able to cross the river
in 13
Directions for Questions 8-11 on the basis
of the information given below:
Help Distress (HD) is an NGO involved in
providing assistance to people suffering
from natural disasters. Currently, it has 37
volunteers. They are involved in three projects:
Tsunami Relief (TR) in Tamil Nadu, Flood
Relief (FR) in Maharashtra, and Earthquake
(ER) in Gujarat. Each volunteer working with
Help Distress has to be involved in at least
one relief work project.
Puzzles  377
A maximum number of volunteers are involved
in the FR project. Among them, the number
of volunteers involved in FR project alone
is equal to the volunteers having additional
involvement in the ER project.
The number of volunteers involved in the
ER project alone is double the number of
volunteers involved in all the three projects.
17 volunteers are involved in the TR project.
The number of volunteers involved in the TR
project alone is one less than the number of
volunteers involved in ER project alone.
Ten volunteers involved in the TR project are
also involved in at least one more project.
8. Based on the information given above,
the minimum number of volunteers
involved in both FR and TR projects, but
not in the ER project is:
(a) 1 (b) 3
(c) 4 (d) 5
9. Which of the following additional
information would enable to find the
exact number of volunteers involved in
various projects?
(a) Twenty volunteers are involved in
FR.
(b) Four volunteers are involved in all
the three projects.
(c) Twenty three volunteers are involved
in exactly one project.
(d) No need for any additional
information.
10. After some time, the volunteers who
were involved in all the three projects
were asked to withdraw from one project.
As a result, one of the volunteers opted
out of the TR project, and one opted out
of the ER project, while the remaining
ones involved in all the three projects
opted out of the FR project. Which of the
following statements, then, necessarily
follows?
378  Theory of Counting
(a) The lowest number of volunteers is
now in TR project.
(b) More volunteers are now in FR
project as compared to ER project.
(c) More volunteers are now in TR
project as compared to ER project.
(d) None of the above
11. After the withdrawal of volunteers, as
indicated in previous Question, some
new volunteers joined the NGO. Each
one of them was allotted only one project
in a manner such that, the number of
volunteers working in one project alone
for each of the three projects became
identical. At that point, it was also found
that the number of volunteers involved in
FR and ER projects was the same as the
number of volunteers involved in TR and
ER projects. Which of the projects now
has the highest number of volunteers?
(a) ER
(b) FR
(c) TR
(d) cannot be determined
Direction for Questions number 12 to 15:
216 cubes of similar size are arranged in the
form of a bigger cube (6 cubes on each side, i.e.,
6 × 6 × 6) all the exposed surfaces are painted.
12. How many of the cubes have 0 faces
painted?
(a) 64 (b) 125
(c) 27 (d) None of these
13. How many of the cubes have 2 faces
painted?
(a) 144 (b) 125
(c) 96 (d) None of these
14. How many of the cubes have at most
2 faces painted?
(a) 208 (b) 144
(c) 210 (d) None of these
15. How many of the cubes have at least 2
faces painted?
(a) 104 (b) 144
(c) 120 (d) None of these
Directions for Questions 16 - 20:
In a family, Ishita is the granddaughter of
Ashima. Deepika is the mother of Hannah.
Chetan is the son of Anil. Rohini is the mother
of Ishita. Deepika is the sister of Vivek and
Chetan. Nilesh has two children, Gauri and
Hannah. Elesh is the only grandson in the
family. Chetan is not married. Rohini is the
daughter-in-law of Anil.
16. Who is married to Rohini?
(a) Anil (b) Nilesh
(c) Chetan (d) Vivek
17. Who is the daughter of Anil?
(a) Gauri (b) Hannah
(c) Ishita (d) Deepika
18. Who is the son-in-law of Ashima?
(a) Elesh (b) Vivek
(c) Nilesh (d) Anil
19. How many Children does Deepika have?
(a) One (b) Two
(c) Three (d) None
20. Who is the father of Ishita?
(a) Nilesh (b) Vivek
(c) Elesh (d) Anil
Direction for Questions 21 to 25 are based on
the following:
Sourav’s Fish Salon serves a special Friday
night seafood banquet consisting of seven
courses - hilsa, pomfret, Indian shrimp, rahu,
kingfish, lobster, and bhetki. Diners are
free to select the order of the seven courses,
according to the following conditions:
The kingfish is served sometime after rahu.
Exactly one course should be served between
the pomfret and the Indian shrimp.

The lobster is served some time before the
pomfret.
The kingfish is served either fifth or sixth.
The hilsa is served second.
21. Which one of the following sequences
would make for an acceptable banquet?
(a) rahu, hilsa, lobster, bhetki, pomfret,
kingfish, Indian shrimp
(b) rahu, hilsa, bhetki, pomfret, kingfish,
Indian shrimp, lobster
(c) lobster, hilsa, pomfret. rahu,
kingfish, Indian shrimp, bhetki
(d) obster, hilsa, rahu. kingfish. pomfret,
bhetki, Indian shrimp
22. If kingfish is the fifth course served, then
which one of the following MUST BE
true?
(a) Pomfret is the third course served
(b) Indian shrimp is the fourth course
served
(c) Bhetki is the seventh course served
(d) Lobster is the first course served
Puzzles  379
23. Which one of the following would make
it possible to determine the EXACT
ordering of the courses?
(a) Pomfret is the fourth course served
(b) Indian shrimp is the fifth course
served
(c) Kingfish is the sixth course served
(d) Lobster is the first course served
24. If kingfish is the sixth course served, then
which one of the following CANNOT be
true?
(a) Rahu is the fifth course served
(b) Indian shrimp is the seventh course
served
(c) Pomfret is the fifth course served
(d) Lobster is the third course served
25. If Bhetki is the third course served, which
one of the following MUST BE true?
(a) Pomfret is the fourth course served
(b) Kingfish is the fifth course served
(c) Rahu is the first course served
(d) Indian shrimp is the seventh course
served

Response Grid
1. a b c d 2. a b c d 3. a b c d 4. a b c d 5. a b c d
6. a b c d 7. a b c d 8. a b c d 9. a b c d 10. a b c d
11. a b c d 12. a b c d 13. a b c d 14. a b c d 15. a b c d
16. a b c d 17. a b c d 18. a b c d 19. a b c d 20. a b c d
21. a b c d 22. a b c d 23. a b c d 24. a b c d 25. a b c d
380  Theory of Counting

Solutions
Concept Applicator (CA)

1. (c) 2. (b) 3. (b) 4. (b) 5. (b) 6. (d)

7. (c) 8. (b) 9. (a) 10. (b)

1. (c) Suppose, the student is standing on 3. (b) Let the number of sparrows, pigeons
the centre as shown in the diagram. and doves be a, b and c respectively.
Then from the given condition a + b,
b + c = 6, and c + a = 6 on solving
9
we will get a = b = c = 3. The total
number of birds is 9.
4. (b) Arun’s back was positioned towards
9 the sun.Thus, depending on the time
(10) 9 of the day. Let say arun’s back is the
east direction.
W
9

S N
Hence, the total number of students
in the group = (9 + 9 + 9 + 9 + 1) = 37.
2. (b) Its better to solve this type of East      E
question from the end. As per the Finally he is going to south direction.
given condition after selling half an Now, assume that Arun’s back in the
egg more than half the number of south direction
eggs to Shivani, the grocer was left E
with 7 eggs. Therefore, before selling
eggs to Shivani the grocer had
(7 + 1/2)2 i.e., 15 eggs.
 
So, after selling half an egg more than
half the number of eggs to Deepak, the Finally he is going to west direction.
grocer was left with 15 eggs. Now, assume that Arun’s back in the
west direction.
Therefore, before sellings eggs to
Deepak, the grocer had (15 + 1/2)2 N S
i.e., 31 eggs. W
Similarly, before selling eggs to So, finally he is going in the North
Anurag (i.e at the start) the grocer direction.So, he can go either in
had (31 + 1/2) 2 i.e., 63 eggs. North or the South direction.

5. (b) After they interchange their
positions, B is 9th from the right.
Also, there are 20 people in the row.
So, B’s position is 12th from the left.
6. (d) As per the given conditions, if we
have 4 red and 3 blue bricks then
the best possible option is to raise 10
cm for both the towers, so 3 points
will be awarded. Now evaluate the
options one by one.
Option (a)–2 red and 4 blue bricks,
but it is not a possible case hence
ruled out.
Option (b) gives as 2 points, so it
is less then what can be achieved.
Option (c) since as per the given
condition we requires 5 red bricks
hence it is not possible.
7. (c) Equal amount of each juice between
the two cups.
8. (b) Let at first Ms. Rani had x rupees
with her.Then, equation will be
Puzzles  381
(1/2x + 2) + 1/2 (1/2x – 2) + 2 +
1/2 ( x/4 – 3 ) + 2 + 1 = x
After solving, x = ` 36.
9. (a) The parts should be made of lengths:
1, 2, 4, 8, 16. On day 1 he will give
first piece
On day 2 he will take first piece back
and will give second piece of length 2.
Similar pattern continues
Thus minimum parts = 5.
10. (b) He can add 30 numbers in each
group
1000 – 1099, 1100 – 1199,
1200 – 1299, 1300 – 1399,
1400 – 1499, i.e., 150 numbers.
He can also add 
1099 + 1100, 1199 + 1200
1299 + 1300, 1399 + 1400
1499 + 1500 and 1999 + 2000 i.e.
6 more numbers
Total numbers = 156.

Concept Builder (CB)

1. (c) 2. (c) 3. (d) 4. (d) 5. (d) 6. (d)

7. (c) 8. (c) 9. (d) 10. (c)

1. (c) We can solve this question by 68

elimination. Here we need to find
the last 2 numbers. As per the Y + 29
given condition after putting the 3
numbers average is an integer hence 9 7 X+2
the sum of three numbers must be
Y 4 5 2 X
divisible by 3.
Continue filling the boxes from the
Option (a)—in this case the 1st 3
bottom, we get the above one.
numbers are 76, 80 and 91 and their
sum 241 and it is not divisible by 68
3 hence it is ruled out. Similarly, Y + 29
option (b), and (d) are eliminated.
16 X + 9
Option (c) is correct.
9 7 X+2
2. (c) We have two variable here and if
we know the numbers at the bottom Y 4 5 2 X
most row then we can calculate the Proceeding upward we get the above
numbers for any row. one. Then, Y + 29 = 16 + X + 9 or X – Y = 4.
382  Theory of Counting
3. (d) Summation of ‘E’ and ‘L’ must give
zero in the end so that ‘y’ comes as it
is in the fourth row. (E + L =10) The
correct assignment of digits is
725
16
9624
10365
4.
(d) From the solution of last question.
5.
(d) From the solution of last question.
6.
(d) The maximum amount that he has
invested is ` 3000, on red horse, so
let us start eliminating from Red
horse,
Let red got 2nd rank then his return
= 3 × 3000 = 9000
No matter what rank White and
Black take he cannot end up with
No-Profit-No-Loss
Hence this condition ruled out.
Let red got 3rd rank then his return
= 3000
Now he can end up with No-Profit-
No-Loss if lose his amount on other
two horses, i.e., white or black come
either 4th or 5th rank. This is a
possible condition.
Let red got 4th or 5th rank in that
case he will lose ` 3000.
So his gain from other two should be
` 3000.
That is possible in two cases
Case (i) white got 2nd rank then
return = 3 × 2000 = 6000.
And black got either 4th or 5th rank.
Case (ii) white got 3rd rank then
return = ` 2000
And black got 1st rank then return
= 4000
We can sum up this result in tabular
form

Amount Invested Rank in case (i) Rank in case (ii) Rank in case (iii)
Red 3000 3 4/5 4/5
White 2000 4/5 2 3
Black 1000 2 4/5 1
Now from this table we can conclude Let us assume that the three English
that option (d) is correct. men are E1, E2, E3 and the Frenchmen
7. (c) If grey came 4th then case (ii) from are F1, F2, F3 respectively. Let us
the table is not possible, and white assume that E2 is the only English
cannot come 2nd. man who knows French. Since our
8. (c) aim is to use the minimum number
1 2 of calls, and there is only one possible
communicator (i.e., E2) between the
two groups, all the information to be
exchanged between the two groups
E1 E2 E3
can be done with a single call from
6 7 F2 to E2. Before this E2 should get
the secrets from E1 and E3 and F2
5 should get the secrets from F1 and F3.
Hence four calls are used till now,
two in each group. (Shown in the
8 9 diagram, from 1–4).
F1 F3
After this, E2 calls up F2 and both
F2 exchange the secrets of their
groups.
3 4

Now E2 and F2 knows all the secrets
o. So now E2 uses two calls (to E1
and E3 calls 6 and 7 shown in the
diagram) to convey the French
secrets. Same is the case with F2.
Total minimum number of phone
calls = (2 + 2) + 1 + (2 + 2) = 9 (as
shown in the diagram).
9. (d) Since:
Adults (A) > Boys (B) > Girls (G) >
Families (F)
Going by the options, when we take
the min. no. of families as 2, then the
max.possible no. of adults can be 4.
Since in any family there should be at
least 2 boys and a girl, which means
4 boys in 2 families, and violates our
condition of Adults > Boys.
When we take min. no of families
as 3, then all the conditions are
satisfied.
Puzzles  383
10. (c) For every Mathematics book I have
to carry 2 more physics books and
points earned with the combination
of these three books are 4 + 2 × 1
= 6 points (for 3 books) For every
management book I have to carry 2
more fiction books and points earned
with this combination I will earn
3 + 2 × 2 = 7 points (for 3 books).
So to maximize the points I will
carry 2 sets of management books
and one set of mathematics book
and total points earned is 7 × 2 + 6 =
20 (for 9 books), now as mathematics
and management book I cannot
select as these books come in a set of
3 books so the 10th book I will select
physics book and total points earned
= 22 + 2 = 24.

Concept Cracker (CC)

1. (b) 2. (c) 3. (b) 4. (a) 5. (d) 6. (b)
7. (b) 8. (c) 9. (a) 10. (b) 11. (a) 12. (a)
13. (c) 14. (a) 15. (b) 16. (d) 17. (d) 18. (c)
19. (b) 20. (b) 21. (a) 22. (d) 23. (b) 24. (a)
25. (c)

1. (b) From the table we have eliminated

Palace Hut Fort House Hotel
all four except M for palace, hence M
will stay in palace.
P (Blue & × 2. (c) Write down the information given
Red)
L → –D (Lion and Dear cannot be
M (Yellow) together)
U (Red or × P → –D and –Bs (A Panthor cannot
Blue) be with a Dear or a Bison)
T (Black) × Suman → – L
X × × × × √
Mohan → L + P
Jack → P or B
384  Theory of Counting
Hence we can short out following Solution for question number 4 to 5
table
Students please note that the best way to
Keeper Animal Enclosure answer this question is by finding generally
what would ensure a win for B. If B has to win,
Mohan L + P (given) X (given)
A has to pickup the last matchstick. This can
Jack B+P Y (given) be forced upon A if there are 2 or 3 matchsticks
Shalini B+L Q left on the table when it is B’s turn. As then,
B could pickup 1 or 2 matchsticks and force
Suman D+B P
upon A to pickup the last one. For this to
Rita D+B Z (given) happen there should always be odd number of
matchsticks initially. Eg. If there are 7 match
Since Z and P have the same pair of
sticks initially any of the following combinations
animals, the other 3 enclosures viz.,
X, Y and Q must contain the other 3 will leave either 2 or 3 matchsticks on the table
species within themselves. So apart when it is B’s turn.
from Lion and Panther, Bear must
be third species in X, Y, Q. A B B A
Jack gets Bear and Panther as he 1 2 3 4 5 6 7
doesn’t handle lion (given) that
leaves. Q with Lion and Bear; which A B B A A
goes to Shalini as Suman doesn’t 1 2 3 4 5 6 7
handle lion (given).
3. (b) When it carries 10kg, then speed is A A B A
5 kmph so time taken 2 hr, and cost 1 2 3 4 5 6 7
for 2 hr is ` 20, so if we send 8 couriers
together then it will transfer 80 kg
A B B A A
and costs 20 × 8 = 160.
When it carries 20 kg, then speed is 2 1 2 3 4 5 6 7
kmph so time taken 5 hr, and cost for Hence the smallest value of N
5 hr is ` 50, so if we send 4 couriers (greater than 5) to ensure a win for
together then it will transfer 80 kg
and costs 50 × 4 = 200. B is 7. Also the largest value of N (less
When it carries 40 kg, then speed than 50) to ensure a win for B is 49.
is 1kmph so time taken 10 hrs, and 4. (a) 5. (d)
cost for 10 hrs is ` 100, so if we send
2 courier together then it will 6. (b)
transfer 80 kg and costs 100 × 2 = 200. 7. (b) Let the three couples be represented
There are some more combination as follows.
but all of them has to be more than
` 160, hence ` 160 is the minimum. (M1, F1), (M2, F2), (M3, F3)
 Puzzles  385
The following table represent the steps.

Set Up People on the People People Travelling People on the

Side Travelled From Other Side Other Side
1 M1 M2 M3 F3 F1 F2 — —
2 M1 M2 M3 F3 — F2 F1
3 M1 M3 F3 M2 F2 — F1
4 M1 M3 F3 — F1 M2 F2
5 M1 F1 M3 F3 — M2 F2
6 M1 F1 — F3 M2 F2 M3
7 F3 M1 F1 — M2 F2 M3
8 F3 — M3 M1 F1 M2 F2
9 — M3 F3 — M1 F1 M2 F2

So, 9 steps are required. Since 17 volunteers are involved in

Answers from 8 – 11
8. (c) FR project has the maximum
number of volunteers. Let number of
volunteers involved in all the three
projects be g. Then the number of
people involved in ER project alone
will be 2g, and number of volunteers
in TR alone will be 2g – 1.
TR = 17
2g – 1 = 7 a b=8
g=4
c d=4
the TR project and 10 of them are
involved in at least one other project,
7 of them are involved in TR project
alone.
Hence 2g – 1 = 7 or g = 4.
Now it is given that the number
of volunteers in FR alone is the
same as those who have additional
involvement in ER hence b = d + 4
Now total of TR is 17 hence a + c = 6.
FR Total volunteer are 37 hence 8 + 7 +
4 + a + b + c + d = 37 or a + b + c + d
= 18, but a + c = 6 hence b + d =12,
but b = d + 4, hence 2d + 4 = 12 or d = 4,
b = 8.
Since, FR = 16 + a has a maximum
number of volunteers hence it must

be more than ER = 16 + c or TR = 17.

Hence 16 + c > 16 + a, or c > a but
2g = 8
a + c = 6.
Hence minimum possible value of
c = 4.
ER
386  Theory of Counting
9. (a) If it is known that twenty volunteers
are involved in FR i.e., 16 + a , then
we can find the value of ‘a’ and ‘b’
and hence the number of volunteers
in each project.
10. (b) The new Venn diagram becomes
TR = 17 FR
a+1
2g–1 = 7 b=8
g=4
c+2 d=4+1=5
2g = 8
ER
If one volunteer withdraw of the
TR project among the four who are
involved in all the projects, he will be
working only on FR and ER, So FR
+ ER becomes 4 + 1 = 5. Similarly,
when one opts out of ER project,
FR + TR becomes a + 1 and when
two opt out of FR project among the
four, TR + ER becomes c + 2.
From the previous question 3 < a ≤ 6.
FR can be 18, 19 or 20.
Also, since 0 ≤ b ≤ 3, ER can be 15,
16, 17.
Now the possibilities are (FR, ER,
TR) = (18, 17, 16) or (19, 16, 16) or
(20, 15, 16).
We can conclude that FR > ER.
11. (a) Since the addition of volunteers was
such that they were allotted to only
one projects each and the number
of volunteers working in one project
alone for each of the three projects
became equal, let us take it as x.
Here, the number of volunteers in
(FR+ ER) and (TR + ER) will not be
affected.Given (FR + ER) = (TR + ER).
Hence (4 + 1 + 0) = c + 2 or c = 3 and
hence a = 3
Also FR = (a + 1) + x + (4 + 1) = x+ 9
ER = (c + 2) + x + (4 + 1) = x + 10
TR = (c + 2) + x + (a + 1) = x + 9
Hence ER has the highest number of
volunteers.
Solution from 12-15
Since total number of cubes is
216 =  63 hence in the formula we
will substitute n =6
12. (a) Number of the cubes with 0 faces
3
painted is (6 − 2) =  43 =  64 .
13. (c) Number of the cubes with 2 faces
2
painted is 6 (6 − 2) =  6   × 1
  6 = 96 .
14. (a) At most 2 faces painted means
number of cubes with 0 face painted
+ number of cubes with 1 face
painted + number of cubes with 2
face painted = 64 + 48 + 96 = 208.
15. (b) At least 2 faces painted means
number of cubes with 2 face painted
+ number of cubes with 3 face
painted = 96 + 8 = 104.
 Puzzles  387
Tree of question 16 - 20

Anil Ashima

Vivek Chetan
Rohini Deepika Nilesh

Eshita Hannah
Elesh Gauri

16. (d) 17. (d) 18. (c) 19. (b) 20. (b)

Solution from 21 to 25 21. (a) Option (b) is wrong as lobster has to

There are 7 courses - conditions are as
follows:
1st condition: The kingfish is served
sometime after rahu.
2nd condition: Exactly one course should be
served between the pomfret and the Indian
shrimp.
3rd condition: The lobster is served some
time before the pomfret.
4th condition: The kingfish is served either
fifth or sixth.
5th condition: The hilsa is served second.
before pomfret, option (c) is wrong
as there are two fishes in between
Pomfret and indian shrimp and (d)
is wrong because kingfish should be
in 5th and 6th .
22. (d) From the given condition only
possible is lobster serve in first.
23. (b)
24. (a) If rahu is the 5th course served then
pomfret and indianshrimp on the
1st and 3rd place but lobster should
come before pomfret
25. (c)
388  Theory of Counting
Part B
1
Concept Deviator (CD)
Ideal Time
5 Min.
Per Question
1. Hasan and Susmit were describing the
result of the test conducted at Pioneer
Career Kolkata. There were three
contestants RAM, SHYAM and JODU.
Hasan reported that RAM won the
competition, while SHYAM came in second.
Susmit reported that JODU won the
competition, while RAM came in second.
In fact, neither Hasan nor Susmit had
given a correct report of the results of
the science exhibition. Each of them had
given one correct statement and one false
statement. What was the actual placing
of the three contestants? And who got 1st
rank?
(a) Jodu (b) Shyam
(c) Ram (d) None of these
2. Amit shares his experience of a family
reunion where the following people
were present: one grandfather, one
grandmother, two fathers, two mothers,
four children, three grandchildren,
one brother, two sisters, two sons,
two daughters, one father-in-law, one
mother-in-law, and one daughter-in-law.
But not as many people attended as it
sounds. How many were there, and who
were they?
(a) 4 (b) 10
(c) 7 (d) None of these
3. Your Shoes drawer contains 10 pairs of
white socks and 10 pairs of black socks.
If you’re only allowed to take one socks
from the drawer at a time and you can’t
see what color of socks you’re taking until
you’ve taken it, how many socks do you
Revise your concept (IIT advance or
tougher questions)
have to take out before you’re guaranteed
to have at least one matching pair?
(a) 4! (b) 2/20
(c) 3 (d) 4
4. Hasan plays a solo dice game where, on
each turn, a normal pair of dice is rolled.
The score is calculated by taking the
product, rather than the sum, of the two
numbers shown on the dice.
On a particular game, the score for the
second roll is five more than the score
for the first; the score for the third roll
is six less than that of the second; the
score for the fourth roll is eleven more
than that of the third; and the score
for the fifth roll is eight less than that
of the fourth. What was the score for
each of these five throws respectively?
(a) 10,15,9,12,20 (b) 10,15,9,20,12
(c) 10,9,20,15,12 (d) 10,20,15,12,9
5. In a promotional offer, a soap company
offers a soap free of cost in return of 5
wrappers of the soap. If Anushree has
241 wrappers, then how many soaps she
can get free of cost?
(a) 48 (b) 60
(c) 65 (d) None of these
6. Two trains travel toward each other on
the same track, beginning 100 miles
apart. One train travels at 40 miles per
hour; the other travels at 60 miles an
hour. A bird starts flying at the same
location as the faster train, flying at
a speed of 200 miles per hour. When it
reaches the slower train, it turns around,
flying the other direction at the same
speed. When it reaches the faster train
again, it turns around — and so on. This

process continues till both the trains
collide, how far will the bird have flown?
(a) 100 miles (b) 200 miles
(c) 450 miles (d) None of these
7. One Sunday morning, Harsh was
returning from office. He over heard a
conversation between his neighbor’s kids
Kid 1: How old are you?
Kid 2: I was eight years old two days ago
and next year I shall be eleven.
After listening to this reply the 1st kid
was puzzled.
Can you explain how Harsh helped the
1st kid by figuring out the 2nd kid’s reply?
8. A farmer goes to the forest everyday to
collect woods for burning purpose. One
day he found 7 straight sticks which can
be placed in different orientations to
make squares and right angled triangles.
He then realizes that the product of the
number of squares and the number of
right angled triangles is maximum.
Puzzles  389
Figure out that maximum number.
9. 16 playing cards are given to a player.
The cards are four Aces, four Kings,
four Jacks and four Queens. He is told
to make a 4 × 4 grid of these cards such
that no two same cards should be in
the same line horizontally, vertically or
diagonally. The player tried but couldn’t
do it, and then he is given some Joker
cards and is told to achieve the above by
replacing some of the cards with a Joker
such that the Joker can come in line with
any other card without a conflict. If for
each joker card he has to pay ` 10 then
what is his actual income if he receive
` 100 after completion of the task?
10. Can you make 120 with 5 zeros and
mathematical operators?
11. If distance between 1st and 5th
stations, when all stations are spaced
equidistantly, is 10 km, then what will
be the distance of 17th station from 1st
station?

Response Grid
1. a b c d 2. a b c d 3. a b c d 4. a b c d 5. a b c d

2
Concept Eliminator (CE)
Ideal Time Revise your concept (Maths Olympiad
Just solve it or tougher questions)

1. A king called all his sons and gave them
a certain number of gold coins such that
no two sons have the same number of
gold coins. If the king has 7 sons then
what could be the minimum number of
gold coins with king.
(a) 32 (b) 63
(c) 127 (d) None of these
2. A king called all his sons and gave them
certain number of gold coins such that
no two sons have same number of gold
coins. If king has 200 coins then find
the maximum number of sons that king
has.
(a) 9 (b) 8
(c) 7 (d) None of these
390  Theory of Counting
3. This question is based on Maths
Olympiad:
Five students A, B, C D and E took part
in a contest. There are two predictions
for the result.
Prediction 1: Contestant would finish
in the order ABCDE. This prediction
was very poor and no contestant finished
in the position predicted and no two
students predicted to finish consecutively
actually did so.
Prediction 2: Contestant would finish
in the order DAECB, this prediction
was better, exactly two of the contestant
finished in the positions predicted and
two disjoint pairs of students predicted
to finish consecutively actually did so.
Determine the order in which the
contestant finished and find the order
of A.
(a) 2 (b) 3
(c) 4 (d) 5
4. This question is based on Maths
Olympiad:
In how many ways 2 ‘+’ and 2 ‘–’ signs are
filled in to 4 × 4 cell where each cell can
contain maximum 1 character such that
each row and column can not contain
same sign? the front cannot see the colour of hat of
(a) 3960 (b) 3340
(c) 3255 (d) None of these
5. Continuation of Dhoom 2: At the end
of Dhoom 2, Mr. A and Sunahri started a
Dhaba and named it “Dhaba E Dhokha”.
One day Mr. A received 500 bottles of
cold drink. He came to know that one
of the 500 bottles is poisonous and even
a single drop of this drink can kill any
one in 10 minutes. Mr. A wants to find
out the poisonous bottle with the help
of rats (means he can give drop/drops
of cold drink to rats). On minimum how
many rats he has to do this check to find
out the poisonous bottle if has only 15
minutes to do this check?
6. From movie Chhole (Next part of
Sholay): The main villain Thakkar
send his best 50 commandos under the
leadership of Thamba to village Ramgarh.
These 50 commandos got defeated by
heroes Kai and Keeru. When these 50
commandos came back to Thakkar then
he got irritated and as a punishment he
told all these 50 commandos to participate
in the game called “In a line”.
As per the rule of the game, each of the
participant has to stand in a line one after
the other, then Thakkar will put a cap on
each of the commando (Thakkar has only
two types of Hats, Red colored and Green
colored and it is known to everyone).
They stand in such a way that the last
commando can see the colour of hat of all
the 49 commandos ahead of him and so
on. But the commando who is standing in
any commando. Then Thakkar will ask
the colour of hat of commandos starting
from the last commando, if a commando
will say the correct colour then he will
be kept alive otherwise will be killed
silently (means all the commandos can
listen to his previous commandos but
cannot make it out whether his answer
was correct or not).
Thakkar gave these commandos 1 hour
to devise a plan and save themselves if
they can.
What should be the strategy these
50 commandos should make to save

maximum number of commandos and
maximum how many commandos are
definitely safe?
7. Akbar and Birbal:
Akbar made a park named Mughal Park
that has 99 wells. Water in these wells is
poisonous and makes a person falls asleep/
feeling drowsiness. But the poisonous
effect of a well can be neutralized by
another well whose number is less than
the 1st well. (If someone has taken water
of well number 75 then its effect can be
neutralized by water of any well from 1
to 74). But well number 1 can be utilized
by only the king Akbar.
Once Akbar challenged Birbal for a
competition, the condition was that
both of them will bring a glass full of
water collected from any one well, then
exchange it and drink it. Akbar was sure
that he will win as he has special power
of using well 1.Birbal the most intelligent
person will devise a plan so that he can
save himself. What was his plan?
8. Topic- DON 3- Don in Need
In DON 3, The Don wants to send some
confidential file to his friend Roma in a
briefcase. On the other hand Bardhan
and his associate are always eager to
know the plans of Don, hence Don cannot
send anything in unlocked briefcase. The
problem is that Don is in UK but Roma
is in Delhi, hence they have different set
of locks and keys (that means the keys
of locks that Don has is with Don only
and not with Roma and vice versa). Don
cannot send anything in an unlocked
briefcase as it may have access to spies of
Bardhan, while the locked briefcase even
response
1. a b c d 2. a b c d 3. a b c d 4. a b c d
Puzzles  391
with small lock is safe. Can you help don
in sending this confidential file? Assume
that they have sufficient time and safety
of the documents is more important.
9. Topic—DHOOM 2:
Mr. A in DHOOM 2 has planned to rob
an ancient museum that has two golden
chains of length 200m each hanging from
the central hall. The height of central
hall is 200m. He has one knife with him
with which he can cut the chain. The
two chains are hanging through a hook
attached to the ceiling of hall at 1 ft from
each other. Being a good gymnast Mr A
can jump from 50m height. What is the
maximum length of the chain that Mr. A
can take with him?
10. Aaj ka Mahabharat:
As time changes so do human and
humanity; and also the Pandavas.
Aaj ka Pandavas have 100 gold coins
with them and they have to divide it
among themselves. All the Pandavas are
extremely intelligent and greedy.
Yudhisthir being the eldest among them
proposes a way of distribution of 100 gold
coins, and then all the 5 Pandavas will
vote for or against the proposal. If half
or more of the total member vote for the
proposal then that proposition is accepted
by all, if Yudhisthir fails to obtain
support of at least half of the members
(including himself) then remaining 4 will
kill the loser Yudhisthir (After all its
Aaj ka Mahabharat), and then this
process is continued by next eldest among
Pandava i.e Bhima and so on.
What is the maximum number of coins
Yudhisthir can keep without risking
his life?
Grid
392  Theory of Counting
Concept Deviator (CD)
1. (a) 2. (c) 3. (c) 4. (b) 5. (b) 6. (b)
1. (a) Jodu won; Shyam came in second;
Ram came in third.
2. (c) Total number of peoples is 7, (actually
a grand father is also a father).
3. (c) The correct answer is 3. In the worst
case, the first two socks you take
out will consist of one black and one
white shoes. The next shoes you
take out is guaranteed to match one
or the other.
4. (b) Following results satisfy the
conditions.
10 is the score for the first roll.
15 is the score for the second roll.
9 is the score for the third roll.
20 is the score for the fourth roll.
12 is the score for the fifth roll.
5. (b) Since from 240 wrappers she will get
240/5 = 48 soaps now she has 1 extra
wrapper.
From 48 soaps she will get 48
wrappers and from that she will get
[49/5] = 9 soaps and she will have 4
extra wrappers.
Again from 9 soaps she will get 9
wrappers so she will have 9+4 = 13
wrappers
From 13 wrappers she will get [13/5]
= 2 soaps and 3 extra wrappers.
Solutions
Now finally she has 5 wrappers from
this she can get 1 soap.
So total number of soaps that she
will receive is 48 + 9 + 2 + 1= 60.
6. (b) Since the trains are 100 miles apart,
and the trains are traveling toward
each other at 40 and 60 mph, the
trains will collide in one hour. The
bird will have been flying for an
hour at 200 miles per hour at that
point, so the bird will have traveled
200 miles.
7. The kid’s birthday must fall on
31st Dec and conversation must
have happened on 1st Jan (say 1st
Jan 2014), now see the following
illustration:
Day Age of Kid
Two days before 8
(30th Dec 2013)
Yesterday (31st Dec 2013) 9 (Birthday)
Today (1st Jan 2014) 9
This year (31st Dec 2014) 10
Next Year (31st Dec 2015) 11
8. The following configuration gives us
maximum value of the product.

Number of squares = 5 (4 small ones
and a bigger one formed by 4 smaller
ones).
Number of right angled triangles = 9
(The line that intersects all the six
lines forms a right angled triangle
with every set of perpendicular
lines)
Product = 5 × 9 = 45.
9. Let us represent Joker by JKR and
let A, K, Q and J represent Ace,
Concept Eliminator (CE)
1. (d) 2. (a) 3. (b) 4. (a)
1. (d) The numbers are of Fibonacci series
1, 2, 3, 5, 8, 13, and 21 so total
number of coins is 53.
2. (a) Continuation of Fibonacci series 1,
2, 3, 5, 8, 13, 21, 34, 55, 89…
Summation of 1st 9 numbers is 142
and that of 1st 10 numbers is 231
So king has 9 sons.
3. (b) Since 2nd prediction is more accurate
and in that there are 4 consecutive
pairs these are (DA), (AE), (EC), and
(CB), out of these four two of them
are correct pairs so possible cases
are:
Case (i) – (DA)B(EC) but in this
sequence (AB) pair is together which
is mentioned in prediction 1 hence
ruled out.
Puzzles  393
King, Queen and Jack respectively
One of the possible configurations is
as shown below:
J JKR A K
A K Q J
Q J JKR A
JKR A K Q
So he has to use 3 JKR cards hence
actual income is 100 – 30 = 70
10. (0! + 0! + 0! + 0! + 0!)! = 5! = 120
11. Let distance between two stations
= x km
Then distance between 1st & 5th
stations = 4x km
4x = 10; x = 2.5.
So, the distance between 1st and
17th stations = 16x = 16 × 2.5 = 40 km.
Case (ii) – (DA)(CB)E but in this
sequence C is at 3rd place which
is mentioned in prediction 1 hence
ruled out.
Case (iii): (AE)D(CB) but in this
sequence A is at 1stplace which is
mentioned in prediction 1 hence
ruled out.
Case (iv) E(DA)(CB) is the correct
sequence and rank of A is 3rd
4. (a) Let us consider 1st the ‘+’ sign, we
can select two columns in 4C2 = 6
ways and we can place two ‘+’ signs
in (4 × 3) = 12 ways so two ‘+’ signs
can be arranged in 72 ways.
Similarly two ‘–’ sign can be arranged
in 72 ways
394  Theory of Counting
Now we have to exclude the cases
in which both the signs are in same
cell.
When both the ‘–’ sign occupy the
cell of ‘+’ sign then number of ways
is 72.
When one of the ‘–‘ sign occupy the
cell of ‘+’ sign then number of ways
is 4 × 4 × 72 = 16 × 72.
So required number of ways
= 72 × 72 – 72 – 16 × 72 = 55 × 72 = 3960.
5. Mr. A will do this check on only 9
rats, as with the binary logic with
the help of 9 rats he can check 29 = 512
To understand the situation let us
assume that number of rats available
is 3 then on how many bottles we can
check.
1 2 3 4 5 6 7 8
A √ X X √ X √ √ X
B X √ X √ √ X √ X
C X X √ X √ √ √ X
As per the table bottle 1 (of course a
drop of bottle 1) is given to only rat
A, a drop of bottle 2 is given to rat B,
a drop of bottle 3 is given to rat C,
a drop of bottle 4 is given to each of
rat A and B and so on a drop of bottle
7 is given to all the three rats and
none of them get bottle 8.
If only rat A die means bottle 1 is
poisonous.
If only rat B die means bottle 2 is
poisonous.
If only rat C die means bottle 3 is
poisonous
If only rat A and B die means bottle
4 is poisonous.
If only rat A and C die means bottle
5 is poisonous.
If only rat B and C die means bottle
6 is poisonous
If all three die means bottle 7 is
poisonous
If none of them die means bottle 8 is
poisonous
Now let us see why it works:
Let us assume that we have n rats
for experiment:
Number of bottles that is given to
none of the rats is nC0[ = 1 and bottle
8 in above example]
Number of bottles that is given to
one of the rats is nC1[3C1 = 3 and
bottle 1, 2 and 3 in above example]
Number of bottles that is given to
two of the rats is nC2[ 3C2 = 3 and
bottle 4, 5 and 6 in above example]
Similarly….
Number of bottles that is given to all
of the rats is nCn[ 3C3 = 1 and bottle
7 in above example]
So total number of bottles is
nC nC nC nC n = 2n.
0+ 1+ 2 + ... + n = (1 + 1)
6. Out of 50 commandos 49 are
definitely safe.
They will device a plan such that the
last commando (50th commando)

will see how many red coloured hats
are in front of him if it is even then
he will sought (answer) red and if
its odd then he will answer green.
In this way only last means 50th
commando’s life is at stake. So 49
commandos are definitely safe.
If 50th commando answered Red
means number of red coloured caps
9. Follow the following steps –
in front of him is even, now 49th
commando will count the number of
red coloured caps in front of him, if
it is even then he is wearing green
coloured cap otherwise red coloured
cap and so on.
7. Akbar will bring water from well 1
because Akbar will think that there
is no antidote for poison of well 1.
Birbal can bring the water of any
well, since he knows Akbar can save
himself by drinking the water of
well 1.
So, Birbal will drink the water of
well 99 before drinking the water
brought by Akbar. In this case, the
water brought by Akbar will act as
an antidote.
8. There are 4 steps:
Step 1: 1st don will send the brief-
case to Roma with a small pad lock
on it. He will keep the keys of that
lock with himself.
Step 2: After receiving the briefcase
Roma will put one more small pad
lock on the briefcase and send it back
to Don. (Since pad locks are smaller
Puzzles  395
in size so we can put more than one
lock on the hook of briefcase)
Step 3: Now Don will remove his
lock (still that briefcase has one pad
lock whose key is with Roma) and
send it back to Roma.
Step 4: Now finally Roma will remove
the lock and get the document.
Step 1: he will reach on the top of
one rope and cut the other.
Step 2: He will come down to the
floor.
Step 3: He will join both the ropes
together. (Hanging end of one rope
with any one end of the rope that
he cut), so now he has a single rope
with 400 m length.
Step 4: Now he will move up keeping
one end of the rope with him.
Step 5: He will insert the loose end
of the combined rope it to the hook
(Similar to a thread in a needle)
keeping the other rope intact with
the hook.
Step 6: Now he will cut the 2nd
rope and the final situation will be
like entire 400 m of rope is passing
through a hook 200 m up and 200 m
down (i.e loose ends of the rope is
hanging near ground) .
Step 7: Finally he will come down
holding both the ropes and pull down
the entire rope.
396  Theory of Counting
So Mr. A will take away entire 400m
of ropes with him.
10. The five Pandavas are Yudhisthir,
Bhima, Arjuna, Nakula and Sahdeba.
To understand this question try to
understand the situation with a
group of 2 persons then 3 persons
and so on.
If there were 2 persons, then the
1st person being the most senior,
he would just vote for himself and
that would be 50% of the vote, so if
number of persons are two then the
senior person will keep entire 100
gold coins.
If there were 3 persons (Arjuna,
Nakula and Sahdeba), then 1st
person (Arjun) has to take at least
1 more vote, or convince at least one
other person to join in his plan. In
this case Arjuna would take 99 gold
coins and give 1 coin to Sahdeba
(The junior most). Since Sahdeba
(the junior most) knows if he does
not vote for Arjuna, then Arjuna will
loose and the batton will be passed
to Nakula who is not going to give
him any thing, so obviously Sahdeba
is going to vote for Arjua.
If there were 4 persons (Bhima,
Arjuna, Nakula and Sahdeba),
Bhima would give 1 coin to Nakul,
and Nakul knows if he does not vote
for Bhima, then the batton will be
passed to Arjuna and he gets nothing,
so obviously Nakula is going to vote
for Bhima.
Now in case of 5 persons, Arjuna (3rd)
and Sahdeba (5th) will obviously
better vote for the Yudhisthir, or
they face choosing nothing or risking
death.
So Yudhisthir will keep 98 gold coins
with him and will pass on 1 coins to
each Arjuna and Sahdeba.