Permutations

and
Combinations
IIT Mains Syllabus: Quadratic equations in real and complex number system and their solutions.
Relation between roots and coefficients , nature of roots, formation of quadratic equations with given
roots.
IIT Advanced Syllabus: Quadratic equations with real coefficients, relations between roots and
coefficients, formation of quadratic equations with given roots, symmetric functions of roots.

Mathematics of Counting….
www.brothersacademy.co.in Permutations and Combinations

LALPUR Campus, Circular Road, Lalpur, Ranchi-834001. Ph. 7488408051, 8235071441 Page 2
DORANDA Campus, Opp. Eylex Cinemas, Hinoo, Ranchi-834002. Ph. 6201469038, 8092071442
www.brothersacademy.co.in Permutations and Combinations

Introduction
This chapter is one of the most interesting chapters we will study at this level. Yet, majority of the
students preparing for IIT–JEE is confused with this topic. So, what is required to understand it properly:
Clarity of Thought, much more than anything else, is what is required to understand this topic properly.

Also we’d concentrate on building a logical approach, and would try to solve most of the things from
basic principles and refrain from remembering any formulae or particular cases.

The golden policy “Divide and Rule” fits perfectly in this topic i.e. dividing a bigger problem into a lot of
smaller problems and then developing the final solution as solution of the smaller problems.

Principles of Counting:
There are a lot of principles of counting. Some of them useful for us are mentioned as under:
 Bijection Princinple
 Fundamental Principles of Addition and Multiplication
 Inclusion–Exclusion Principle

Bijection Principle:
It is used when it’s not easy to count the number of elements belonging to a very large collection(set) directly.
Let us assume that we have a set A and we want to count the number of elements in set A [n(A)]. And
fortunately we have another set B [n(B) is easily countable] such that there exists one–one and onto
relation(also called as bijection) from set A to set B then, n(A)=n(B).
For e.g. :Eden Gardens stadium in Kolkata has a capacity of 90000. On a particular day, when the stadium is full
then, without actual counting, we can say that the total number of the people present in the stadium are 90000.

Fundamental Principles of Counting :

These principles are so fundamental, that we must have already used them so many times without realizing i.e.
they are already programmed into our minds. A logical step by step application of these principles gives rise to
the entire subject of Permutations and Combinations. There are two fundamental principles
Addition Principle of Counting
Multiplication Principle of Counting

Statement: Generalised Statement:

If If
 a work A can be done in ‘m’ ways and  a work A1 can be done in ‘m1’ ways,
 another work B can be performed in ‘n’ ways  work A2 can be done in ‘m2’ ways,
then,  work A3 can be done in ‘m3’ ways
….. and so on
 exactly one of A and B can be performed in ‘m+n’
then,
ways(called as Addition Principle)
 both of A and B can be performed in ‘mn’  exactly one of A1,A2,A3,…….. can be done in
ways(called as Multiplication Principle) m1+m2+m3+…….. ways(Addition Principle)
 all of works A1,A2,A3,…….. can be done in
m1m2m3…….. ways(Multiplication Principle)

LALPUR Campus, Circular Road, Lalpur, Ranchi-834001. Ph. 7488408051, 8235071441 Page 3
DORANDA Campus, Opp. Eylex Cinemas, Hinoo, Ranchi-834002. Ph. 6201469038, 8092071442
www.brothersacademy.co.in Permutations and Combinations

Illustration: A room contains 5 doors (3 on LHS and 2 on RHS).In how many ways can a
person standing inside the room can
(i)go out
(ii)go out and come in
(iii)go out and come in from different gates
(iv)go out and come in from different sides
(v)go out and come in from same side but different gates
Solution:

(i) go out
The person inside the room can ‘go out’ either through LHS or through RHS. He can
(a)go out from LHS in 3 ways and
(b)go out from RHS in 2 ways.
Now his objective to go out of the room can be accomplished by doing exactly one of (a) or (b). Hence total
number of ways in which the person can go out of the room are 3+2=5 ways(Addition Principle).
Note: Did you really think this much before answering this question. Probably Not (Why?):Because, this
fundamental principle is already programmed into our minds.

(ii) go out and come in

The person inside the room now has to perform two works i.e.
(a)go out (5 ways)
(b)come in (5 ways)
Now, since his objective is to go out and come in, hence he must perform both the works (a) and (b). Thus the
total number of ways in which the person can go out and come in = 5 × 5 = 25 ways (Multiplication Principle)
(iii) go out and come in from different gates
Again, the person inside the room has to perform two works i.e.
(a) go out (5 ways)
(b) come in from a different gate(4 ways)
Since the person cannot come in through the gate through which he went out hence the number of ways to
come in now are only 4.
Thus the total number of ways in which the person can go out and come in through different gates =
5 × 4 = 20 ways (Multiplication Principle)
(iv) go out and come in from different sides
To go out and come in from different sides, the person has two choices:
(a) Go out from LHS(3 ways) and come in from RHS(2 ways)
(b) Go out from RHS(2 ways) and come in from LHS(3 ways)
Now, proceeding as in above illustrations
work (a) can be done in 3 × 2 = 6ways and
work (b) can be done in 2× 3 = 6ways.(Multiplication Principle)
As our objective will be accomplished when exactly one of choices (a) or (b) are performed, hence the person
can go out and come in from different sides in 6+6=12 ways.(Addition Principle)
Note: As you might have already noticed that in this illustration both Addition and Multiplication Principles are
used to generate the final answer.
(v) go out and come in from same side but different gates
Proceeding in similar fashion as above, again the person has two choices
(a)Go out and come in from LHS (but through different gates)
(b)Go out and come in from RHS (but through different gates)
As it is also required for the person to use different gates, hence
Number of ways to do work (a)=3 × 2=6 ways
Number of ways to do work (b)=2 × 1=2 ways
As our objective will be accomplished when exactly one of choices (a) or (b) are performed, hence the person
can go out and come in from same side but through different gates in 6+2=8 ways

LALPUR Campus, Circular Road, Lalpur, Ranchi-834001. Ph. 7488408051, 8235071441 Page 4
DORANDA Campus, Opp. Eylex Cinemas, Hinoo, Ranchi-834002. Ph. 6201469038, 8092071442
www.brothersacademy.co.in Permutations and Combinations

Illustration: There are 2 Buses (B), 3 Trains (T) and 5 Planes (P) available to travel from Mumbai (MUM) to
Delhi (DEL). There are 6 places available from DEL to London (LON) and 7 planes available from LON to New
York (NY). Also there are 8 direct places from MUM to LON, 9 direct planes from DEL to NY and 10 direct planes
from MUM to NY. Now, answer the
following questions
In how many ways can a person travel
from
(i)MUM  DEL
(ii)DEL  NY
(iii)MUM  LON
(iv)MUM  DEL  NT
(v)MUM  NY
Solution:
(i) MUM  DEL
Number of ways to go from MUM  DEL = 3 + 2 + 5 = 10
(ii)DEL  NY
The work of going from DEL to NY can be done in two ways.
1)Direct Journey
2)Break Journey (DEL  LON  NY]
Number of ways to go from DEL  NY directly = 9
Number of ways to go from DEL  NY by break = 6  7
Total number of ways = 5 + 42 = 51
(iii) MUM  LON
Again we can go from MUM to LON in two ways
1)Direct journey [ 8 ways ]
2)Break journey [ (3 + 2 + 5)  6 = 60 ways]
 Total number of ways = 8 + 60 = 68 ways
For Break Journey, number of ways = 106
 Total ways = (3 + 2 + 5) 6 =10  6  60 [ As both the works should be done]

(iv) MUM  DEL  NY

Number of ways to go from MUM  DEL = 10 ways
Number of ways to go from DEL  NY = 51 ways
 Required number of ways = 10  51 = 510 ways
(v) MUM  NY
To go from MUM  NY, we can proceed as
a)MUM  DEL  NY = 510 ways
b)MUM  LON  NY = 68  7 = 478 ways
c)MUM  NY (directly) = 10 ways
 Required Answer = 510 + 478 + 10 = 996 [WRONG Answer]
Please, try to find out why this answer is WRONG before looking for the Correct Way.
CORRECT WAY:
We can go from MUM to NY in one of the following two ways
a)By direct journey [ 10 ways ]
b)By Break journey [566 ways]
Break Journey can again be done in 2 ways
1)By taking a single break 2)By taking 2 breaks
MUM  DEL  NY = 10  9  90 ways
MUM  LON  NY = 8  7  56 ways
 Number of ways to travel by just one  Number of ways to go from MUM  NY by taking 2 breaks
break = 90 + 56 = 146 ways = 10  6  7  420 ways
 Number of ways to travel from MUM  NY by break journey = 420  146  566 ways

LALPUR Campus, Circular Road, Lalpur, Ranchi-834001. Ph. 7488408051, 8235071441 Page 5
DORANDA Campus, Opp. Eylex Cinemas, Hinoo, Ranchi-834002. Ph. 6201469038, 8092071442
www.brothersacademy.co.in Permutations and Combinations

 Final answer = 566 + 10 = 576 ways

A special condition on the rule of product:

The rule of product is applicable only when the number of ways of doing each part is independent of each other.
Illustration: Find the number of three –digit natural numbers having digits in increasing order from left to right
Solution :Here we have to fill three places
 First place can be filled by numbers 1, 2, ….7, (7 ways)
 Second place can be filled by 2, 3, ….8 (7 ways)
 Third place can be filled by 3, 4,….9. (7 ways)
Hence, the total number of possible numbers is =777= 343. [WRONG Answer][Why?]
Explanation:
 When we fill ‘1’ at the first place, second place can be filled up by anyone of seven digits 2–8,but
 When we fill 2 at first place, then the number of ways of filling second place is only six (by any number
from 3–8).
 Hence, we can conclude that the number of ways of doing each part is not independent. So rule of
product is not applicable in this case. The right approach for this problem can be understood after we
study combinations.
Correct Method:
 Since the digits are in increasing order, hence they all must be distinct. So, we require 3distinct digits.
 We have a total of 10 different digits available. But, we can’t use ‘0’ as one of the digits(because in that
case ‘0’ would be the first digit, and the number formed will no longer be a 3digit number).
 Hence, out of the 9distinct digits, we can select 3different digits in 9 C3 ways.
 Now, these ‘3’ selected digits can be arranged in increasing order in only 1 ways.
Hence, total number of numbers possible is = 9 C3
Illustration: How many 5 – digit numbers can be formed by using the digits 1, 2, 3, 4, 5 without repeating any of
the digits.
Solution: Making a 5–digit number is equivalent to filling 5 places.
PLACE 1st 2nd 3rd 4th 5th
NUMBER OF WAYS TO FILL 5 4 3 2 1
 The first place can be filled in 5 ways using anyone of the given digits.
 The second place can be filled in 4 ways using any of the remaining 4 digits(because the digit which has
been used in 1st place can not be used for 2nd place as we can’t repeat any of the digits)
 Similarly, we can fill the 3rd place in 3 ways, 4th place in 2 ways and 5th place in 1 way.
No. of ways of filling all the five places = 5  4  3  2  1 = 120
Important Note:
Here, you might think that the number of ways of filling places 1to 5 are not independent. In other words, how
we fill place 1 will certainly affect how we fill place 2 etc.
For example: A number which is placed in 1st place can’t be filled in second place and the numbers which come
in 1st and 2nd place can’t come in 3rd place. Thus, the way in which we fill place 1 certainly affects the way in
which we fill the 2nd place (or any other place).This is certainly true. But when we talk about independence of
events, it is in a different sense.
Let us assume that
 A denotes the event of filling 1st place and
 B denotes the event of filling 2nd place after A has been accomplished.
A can be performed in 5 ways. After performing A, we are left with 4digits out of which any one can be filled in
2nd place. Hence, B can be performed in 4 ways.
Explanation I: Explanation II:
Which one of 4 remaining digits will go in 2nd place Of course the way in which A is performed will affect
definitely depends upon how event A was the way in which B will be performed.
accomplished, but the event B is itself the choice of But the number of ways in which A is performed does
one of the 4 remaining digits. The number of ways in not affects the number of ways in which B will be

LALPUR Campus, Circular Road, Lalpur, Ranchi-834001. Ph. 7488408051, 8235071441 Page 6
DORANDA Campus, Opp. Eylex Cinemas, Hinoo, Ranchi-834002. Ph. 6201469038, 8092071442
www.brothersacademy.co.in Permutations and Combinations

which B can be accomplished is still independent of performed.(The number of ways in which A and B are
how A was accomplished. performed are still independent.)
Whatever selection was made for A, the number of And in this topic we are mainly interested in number
ways in which B can be performed still remains 4. of ways as compared to the way itself.
This is the sense that should be attached to the phrase ‘independent events’.

Inclusion–Exclusion Principle:
This principle is actually a result from Set Theory. For understanding purpose, lets take a smaller example first:
n(ABC) = n(A)+ n(B)+ n(C)–n(AB) –n(BC) –n(CA)+ n(ABC)
Explanation:
 To find n(ABC), we first included n(A)+ n(B)+ n(C), but we made a mistake. We performed over–
inclusion [for eg. n(A)and n(B) both contain n(AB), hence n(AB) is included twice].
 So to compensate for our mistake we excluded n(AB) + n(BC) + n(CA). Again we did over–
exclusion.
 So again to compensate for our over–exclusion we included n(ABC) and finally got the right balance.
To find the value of n(ABC), we perform a series of inclusions and exclusions and hence this principle is
known as the Inclusion– Exclusion Principle.
Generalised Statement: Let U be a finite set of m elements and p1 , p2 , p3 , . . . ,pr be some properties which the
elements of U may or may not have,
Then the number of elements of U which have at least one of the properties p1, p2, p3, ….,pr is given by
 r 
n  A1  A2  ...  A r   n   A i   S1 – S2  S3 – S4  . . .   –1  Sr .
r–1

 i 1 
and the number of elements of U which have none of the properties p1, p2, p3 , . . . ,pr is given by
 r 
 
n A 1  A 2  ...  A r  n   A i   m – S1  S2 – S3  .   – 1  Sr , where
 i 1 
r

 Ai denotes thatset (subset of U) each of whose elements has the corresponding property p i (i=1,2,…, r)
 A ci denotes that set (subset of U) none of whose elements has the property pi
 Ai A j denotes that set, each of whose elements have both of the properties pi and pj
 Sk denotes the total number of elements of U which have any ‘k’ of the given ‘r’ properties.
 S1 = n(A1) + n(A2) + …. + n(Ar)
 S2 = n(A1A2) + n(A1 A3) +…. + n(A1Ar) + n(A2A3) + . . . + n(A2Ar) + …. + n(Ar–1 Ar)
 …. and so on.
In particular,
 For r =2 ,n(A1A2) = n(A1) +n(A2) – n(A1A2)
 For r = 3, n(A1A2A3) = n(A1) +n(A2) +n(A3) – n(A1A2) – n(A1A3) – n(A2A3) + n(A1 A2A3).
 For r = 4,
n(A1A2A3A4) = n(A1) +n(A2) +n(A3) + n(A4)
– n(A1A2) – n(A1A3) – n(A1A4) – n(A2A3) – n(A2A4) – n(A3A4)
+ n(A1 A2A3) + n(A1 A2A4)+ n(A1 A3A4) + n(A2 A3A4)
– n(A1A2 A3A4).

Illustration: Find the number of integers between 1 and 1000, both inclusive
(a)Which are divisible by either of 10, 15 and 25.
(b)Which are divisible by neither 10 nor 15 nor 25.
Solution: Let U denote the set of numbers between 1 and 1000 so that n(U) = 1000.
Let A,B and C denote the sets of integers divisible by 10, 15 and 25 respectively.
 1000   1000   1000 
n(A) =   =100, n(B) =   = 66,n(C) =   = 40 .
 10   15   25 
S1 = n(A) +n(B) +n(C) = 100 + 66 + 40 = 206

LALPUR Campus, Circular Road, Lalpur, Ranchi-834001. Ph. 7488408051, 8235071441 Page 7
DORANDA Campus, Opp. Eylex Cinemas, Hinoo, Ranchi-834002. Ph. 6201469038, 8092071442
www.brothersacademy.co.in Permutations and Combinations

Considering two of the three sets A, B, C, we have

AB = set of integers divisible by 10 and 15 = set of integers divisible by 30(=L.C.M of 10 and 15)
 1000 
n(AB)=    33 .
 30 
Similarly, B  C = set of integers divisible by 15 and 25 = set of integers divisible by 75 (=L.C.M of 15 and 25)
 1000 
n( B  C) =    13 .
 75 
Similarly, A  C = set of integers divisible by 10 and 25 = set of integers divisible by 50 (=L.C.M of 10 and 25)
 1000 
n( A  C) =    20 . S2 = 33 + 13 + 20 = 66.
 50 
A  B  C =set of integers divisible by 10,15 and 25 = set of integers divisible by 150 (=L.C.M of 10,15 and 25)
 1000 
n( A  B  C) =   6. S3 = 6 .
 150 
(a) We have to find the number of integers divisible by either of 10, 15, and 25 i.e. n(A BC)
n(A BC) = S1 – S2 +S3 = 206 – 66 + 6 = 146 .
(b) The number of integers divisible by neither 10 nor 15, nor 25 = n(U) – n(A BC) = 1000 – 146 = 854.
Note:
n 
 The number of integers from 1 to n which are divisible by k is   ([.] denotes the greatest integer
k 
function). For e.g.
 100 
 The number of integers from 1 to 100 which are divisible by 3 are    33
 3 
 100 
 The number of integers from 1 to 100 which are divisible by 5 are   = 20
 5 
 The number of natural numbers from 1 to n, which are perfect mth powers, is [n1/m].
For e.g. The number of perfect squares from 1 to 101 is [ 101 ] = 10.

Permutations versus Combinations:

Majority of students are not conceptually clear about the difference between permutations and combinations.
So let’s try and understand the difference between them through definitions and examples.

PERMUTATIONS COMBINATIONS

Arrangement of things Selection of things

Order of things is important Order is not important
Key Word: Arrange Key Word: Select, Choose
(1)Suppose there are 20 players who play cricket and we want to choose our playing 11.
 When we are choosing our playing 11, then we don’t care which player is chosen first and which player is
chosen second i.e. order of appearance is not considered.
For e.g. If we want both of M.S.Dhoni and Virat Kohli to play in our team, then we don’t care in which order
they are chosen as long as they both are in our team(selection).
 However when it comes to batting, then we do care which player will go first and which will go second and
so on(arrangement). Hence, when we have to deicde the batting order, then the order of appearance of
players will be considered.
That is why terms like “selection of team” and “batting order”are used (to differentiate between permutations
and combinations).

LALPUR Campus, Circular Road, Lalpur, Ranchi-834001. Ph. 7488408051, 8235071441 Page 8
DORANDA Campus, Opp. Eylex Cinemas, Hinoo, Ranchi-834002. Ph. 6201469038, 8092071442
www.brothersacademy.co.in Permutations and Combinations

(2)Number of different 3–lettered words which can be (2)Number of ways to select 3 letters from the letters
made using the letters of the word VARUN. Here of the word VARUN to form a 3 lettered word. Here
 VAR & RAV represent different arrangements,  VAR & RAV represent same selection,
 RUN & URN represent different arrangements,  RUN & URN represent same selection,
 VAR &RAN representdifferent arrangements  VAR & RAN represent different selections.
(3)Number of 5digit numbers which can be made (3)Number of ways to select a committee of 5
using the digits 1,2,3,4,5. members out of 10 Ladies and 15 Gents.
(4)Number of vectors which can be made using 3 (4)Number of line segments which can be made using
noncollinear points A,B,C. 3 noncollienar points in a plane A,B,C.
 Here AB and BArepresent different vectors  Here, AB and BA representsame line segments
and hence are considered to be different and hence will be considered same selections.
arrangements.  AB and CB represent different linesegments
 AB and CBrepresent different vectors and and hence considered as different selections.
hence considered as different arragements.

Permutations:Definition
 Different arrangements can be produced by taking some or all of a given number of things.
 Every such arrangement is known as a permutation.
 While arranging things, the order of their appearance is taken into account.
 2–digit numbers which can be made using digits 1, 2 and 3(without repetition) are
12,13,23,32,31,21. Each one of these numbers is called a permutation.
 Order of digits is taken into consideration i.e. 12 and 21 are considered as different
permutations. Similarly 23 and 32 are also different permutations.

Key Points:
While attempting any problem involving permutations, we must first check
 Repetition of things is allowed or not
 Nature of the things given (whether they are identical or different or mixed)

Repetition:
Suppose we have to find the number of 5digit numbers which can be made using the digits 1,2,3,4,5,6,7and 8.

Repetition not allowed: Repetition allowed:

If repetition is not allowed then it means that If repetition is allowed then it means that
 no two digits in our 5–digit number can be same  every digit has the freedom to occur more than
 i.e. all the digits must be distinct once in our 5–digit number
 i.e. the given digits are not allowed to repeat  i.e. one/more of the digits of our 5digit number
 i.e. numbers like 11111, 12233, 22233, 55567 can be same
should notbe counted.  i.e. numbers like 11111, 12233, 22233, 55567
should also be counted.
Generally, if nothing is mentioned in a question, then we assume that repetition is not allowed. Mostly it
depends upon the question.
 “if we have to place 5 persons(A,B,C,D,E) in 3 chairs”, then they obviously repetition is not allowed. i.e.
same person can’t sit in more than one chairs at the same time (simultaneously) i.e. permutations like
AAA, BBB, CCD, EAA etc. are meaningless.
 But “if we have to make 3–lettered words using a,b,c,d,e” then the same letter may come in more than
one places simultaneously i.e. aaa,bbc,ccd,eee etc.

LALPUR Campus, Circular Road, Lalpur, Ranchi-834001. Ph. 7488408051, 8235071441 Page 9
DORANDA Campus, Opp. Eylex Cinemas, Hinoo, Ranchi-834002. Ph. 6201469038, 8092071442
www.brothersacademy.co.in Permutations and Combinations

Nature of the given things :

It is also important to note the nature of things (i.e. they are identical or distinct or mixed)(mixed means some
are identical and remaining are distinct)
 If we have to arrange a,b,c in a row, then there are six different arrangements possible viz
abc,acb,bca,bac,cab and cba.
 If we have to arrange a,a,b in a row, then there are only three arrangements possible viz aab,aba,baa(as
two of the three things given are identical).

Counting Permutations:
Here we will develop a technique, which will help us in counting the number of different
permutations/arrangements in a given situation.
The fundamental issue in permutations is arrangement of things.Lets start with a question
Illustration: Find number of 2–lettered words which can be made by using the letters a,b,c,d.
Or
Find the number of permutations of letters a,b,c,d taken 2 at a time.
Solution: Number of letters given = 4 & Number of letters to be used at a time = 2
Basically, we have to fill 2 places using 2 of the given 4 letters.
Case I: Repetition not allowed: Case II: Repetition allowed:
If repetition is not allowed then If repetition is allowed then
 first place can be filled in 4 ways(by any of the  first place can be filled in 4 ways(by any of the
letters given) and then letters given) and then
 the second place can be filled in 3 ways(by  the second place can also be filled in 4 ways(by
remaining 3 letters). any of the letters given).
 Since, repetition is not allowed, hence the letter  Since, repetition is allowed, hence the letter
which came in first place can not come in the which came in first place can also come in the
second place. second place.
Place First place Second place Place First place Second place
No. of ways 4 ways 3 ways No. of ways 4 ways 4 ways
Table of all the possibilities: Table of all the possibilities:
First Place Second place The word formed First Place Second place The word formed
b ab a aa
a c ac b ab
a
d ad c ac
a ba d ad
b c bc a ba
d bd b bb
b
a ca c bc
c b cb d bd
d cd a ca
a da b cb
c
d b db c cc
c dc d cd
Total number of words possible = 4 × 3 = 12 a da
b db
d
c dc
d dd
 Total number of words possible = 4 × 4 = 16
Here some students argue that by filling first place first and then second place, we are giving preference to first
place over the second place. This point should be understood properly that no place is given any kind of
preference. Let’s look at it in this way:

LALPUR Campus, Circular Road, Lalpur, Ranchi-834001. Ph. 7488408051, 8235071441 Page 10
DORANDA Campus, Opp. Eylex Cinemas, Hinoo, Ranchi-834002. Ph. 6201469038, 8092071442
www.brothersacademy.co.in Permutations and Combinations

 Que: How many times does ‘a’ gets to come in first place?
Ans: 3 times

 Que. How many times does ‘a’ gets to come in second place?
Ans: 3 times.

 Similarly b,c and d all the letters come in each of first and second place exactly 3 times. Hence no place
is being given any kind of preference. Every letter gets equal opportunity of coming in every place.
If there is no condition, in–fact we can fill any place first. For example in the above illustration
 we can fill the second place first in 4 ways and then
 we can fill the second place in 3 ways
In this way, also we will get the same answer as 12 total ways.

Generalisation:
If ≤ , then, let us find
Number of permutations of ‘n’ different things taken ‘r’ at a time.
Or
Number of ways to arrange ‘n’ different things in ‘r’ places.
Or
Number of ways to seat ‘n’ persons in ‘r’ seats.
Or
Number of ways to seat ‘r’ persons in ‘n’ seats.
Or
Number of ways to form ‘rlettered words’ using ‘n’ different letters.
Case I: Repetition allowed: Case II: Repetition not allowed:
Since repetition is allowed, Since repetition is not allowed,
 1st place can be filled by any one of ‘n’ things in n  1st place can be filled by any one of ‘n’ things in n
ways, ways,
 2nd place can also be filled in ‘n’ ways (because  2nd place can be filled in (n–1) ways, (because
the thing which came in 1st place canalsocome in the thing which came in 1st place cannot come in
2nd place), 2nd place),
 3rd place can also be filled in ‘n’ ways  3rd place can be filled in (n–2) ways,
 …..and so on.  …and so on.
Place 1st 2nd 3rd … rth Place 1st 2nd 3rd … rth
place place place place place place place place
No. of n n n … n No. of n (n–1) (n–2) … (n–r+1)
ways ways ways ways ways ways ways ways ways ways
Hence, total number of ways to fill r places using n Hence, total number of ways to fill r places using n
different things different things
= n × n × n × … .× n(r times) = n × (n − 1) × (n − 2) … .× (n − r + 1)
= ways !
=( )!= ways.

Permutations of repeated objects: (some/all of the given things are identical)

If some of the things out of a given number of things become identical, then the number of permutations
decrease because of the identical things. Let’s illustrate this using an illustration:

Illustration: Suppose we have to find the number of anagrams of the word ‘bhargava’.
Solution: Let ‘p’ be the number of anagrams of the word ‘bhargava’. In every anagram there will be three
identical a’s. If these 3 a’s were to become different (say a,a’,a’’) then each one of these ‘p’ anagrams will

LALPUR Campus, Circular Road, Lalpur, Ranchi-834001. Ph. 7488408051, 8235071441 Page 11
DORANDA Campus, Opp. Eylex Cinemas, Hinoo, Ranchi-834002. Ph. 6201469038, 8092071442
www.brothersacademy.co.in Permutations and Combinations

produce 3! more words.

For making it more clear, let’s take any 4 of the ‘p’ possible anagrams (Say bhargava, aaabhgrv, bhaargva and
gabavhra) and see how each one of them produces 6(=3!) new words as soon as the 3 identical a’s become
distinct(without disturbing the relative positions of other letters).
bha1rg a2 va3 a1a2a3bhgrv bha1a2rgva3 ga1ba 2 vhra3
   
bha1rg a3 va2 a1a3a2bhgrv bha1a3rgva2 ga1ba3 vhra2
bha2rg a1 va3 a2a1a3bhgrv bha2a1 rgva3 ga 2ba1 vhra3
bharg
 ava   aaabhgrv   bhaa rgva   gabavhra  
When a's bha2rg a3 va1 a2a3a1 bhgrv bha2a3rgva1 ga 2ba3 vhra1
are identical bha rg a va a a a bhgrv bha a rgva ga ba vhra
 3 2 1
 3 2 1  3 2 1
 3 2 1

bha3rg a1 va2 a3a1a2bhgrv bha3a1rgva2 ga3ba1 vhra2

So, we can now conclude that if we treat the 3 identical a’s as distinct, then
 everyone of the assumed ‘p’ anagrams will produce 3! new words.
 Hence if all the a’s were different then the total number of anagrams = p(3!) ….(i)
But, if all the a’s became different, then we’d have a total of 8 different letters and the number of anagrams
produced by an 8–lettered word(containing all distinct digits) = 8! …..(ii)
8!
From (i)and (ii), we get p(3!) = 8! ⟹ p =
3!
Summary:

Without Repition:
(a)The number of permutations of ‘n’ different things taken ‘r’ at a time when repetition is not allowed
= The number of ways of filling ‘r’different places using ‘n’different things
= n(n – 1) (n – 2) ….. (n – r + 1) = P
(b) The number of permutations of n different things taken all at a time
= The number of ways to arrange ‘n’ given things using all of them
= npn= n!

With Repition:
(a) The number of permutations of ‘n’ different objects, taken ‘r’ at a time, when repetition is allowed
= The number of ways of filling r places where eachplace can be filled by any one of n objects
= (n)rways/permutations/arrangements

When all of the given things are not identical

n!
(b) = The number of arrangements that can be formed using ‘n’ objects out of which
p!q!r!
 ‘p’ are identical (and of one kind),
 ‘q’ are identical (and of second kind),
 ‘r’ are identical (and of third kind) and
 the rest are distinct
Illustration: There are 9 chairs placed long a row. If there are 5 girls and 4 boys, then in how many ways can
they sit such that
(i)all the boys sit together (ii)girls and boys sit alternately
(iii)girls occupy last 5 seats (iv)all girls sit together and all boys sit together
(v)the chairs having even numbers, are occupied by girls (vi)no two boys sit together
(vii)no two boys sit together and no two girls sit together (viii)at least two boys sit together
(ix)atmost 4 girls sit together (x)between any two boys, there is at least one girl
Solution :

LALPUR Campus, Circular Road, Lalpur, Ranchi-834001. Ph. 7488408051, 8235071441 Page 12
DORANDA Campus, Opp. Eylex Cinemas, Hinoo, Ranchi-834002. Ph. 6201469038, 8092071442
www.brothersacademy.co.in Permutations and Combinations

(i)all the boys sit together

Given 5G + 4B.
 If all the boys want to sit together, then this can be obtained
by tying all the boys by a hypothetical string and then treating them as a single object/entity or by
putting them into a box like this
5G + 4B [STRING/BOX METHOD]
 If all the boys are put in the box, and the box is treated as single object then we now have 6 objects(5
Girls+ 1 Box) 5  G  1  4B  which can be arranged in 6 P6  6 ways.
 Now in each of the 6 arrangements above 4B are together and can interchange their places in 4 ways.
Hence total number of ways = 6 4
Girl Boy Girl Boy Girl Boy Girl Boy Girl
(ii)girls and boys sit alternately
If girls and boys have to sit alternately then
 the girls must occupy odd places (i.e. 1st;3rd;5th;7th and 9th places) and
 theboys must occupy even places(i.e. 2nd;4th;6th and 8th places).
Now, 5 girls can sit in 5 places in 5 ways similarly 4 boys can sit in 4 places in 4 ways
Total number of ways = 5 4
Note:
 If there are 4 boys and 4 girls, then they can sit alternately in 2  4  4 ways because here there two
possibilities Girl Boy Girl Boy Girl Boy Girl Boy or Boy Girl Boy Girl Boy Girl Boy Girl
 If there are 6B and 4G, then they can sit alternately in 0 ways

(iii)girls occupy last 5 seats

If girls should occupy the last 5 seats, then boys must occupy first 4 seats
 4 boys can sit in first 4 seats in 4 ways and
 5 girls can sit in last 5 seats in 5 ways
Total number of ways  4 5

(iv)all girls sit together and all boys sit together

Put all the girls in one box and the boys in another box 5Gand4B
 These two boxes can be arranged in 2!ways.
 In first box, the 5 girls can sit in 5 ways and
 In other box the boys can sit in 4 ways
Total number of ways = 2 5 4

(v)the chairs having even numbers, are occupied by girls

There are 5 girls and 4 even places

MethodI: MethodII: MethodIII:

 ‘4 even places’ can be  Places 1, 3, 5, 7, 9 can be 5
 Out of 5 girls, 4 girls can be selected in C4
filled by a girls in 5 P4 filled by boys in 5 P4 ways.These 4 selcted girls can be seated in
ways, and then ways and then even places in 4! ways.
 In remaining 5 places  In remaining 5 places, 5  Now, the remaining 5 persons (1G and 4B)
4B + 1G can be placed girls can be seated in 5 can be seated in remaining 5 seats in 5!
in 5 ways ways ways.
 Total ways  5. P4  5 5  C4  4!
5 5

(vi)no two boys sit together,

These kindsofproblems,when“notwothings fromagroupare
together”aredonebyGAPmethod.

LALPUR Campus, Circular Road, Lalpur, Ranchi-834001. Ph. 7488408051, 8235071441 Page 13
www.brothersacademy.co.in Permutations and Combinations

 Since the girls don’t have any special preference, so firstarrangethegirls  5 ways 
 Once, girls are seated, there would be 6 gaps generated. Now, if we place the boysin these gaps, then no two
of them can ever be together. Hence 4 boys can sit in these 6 gaps in 6 P4 ways
Total number of ways when no two boys sir together= 5. 6 P4 ways
Counter Question: Some students say that in above situation we are discussing about 11 chairs (5G + 6 Gaps)
but we have only 9 chairs i.e. what happens to the 2 gaps which remain empty after placing the boys. Here, we
must understand that the gaps are hypothetical. If they remain empty, then the corresponding girls will sit
together. We can also understand this in the following manner
 Place 2 extra chairs and after the 9 persons (5G + 4B) are seated, then remove the extra chairs,
OR
 While doing these arrangements, assume that the boys and girls are standing in a row rather than
sitting. After the end of every permutations, exactly 9 persons will be standing so then make them sit in
the given 9 chairs

(vii)no two boys sit together and no two girls sit together
Same as girls and boys sitting alternately
Answer = 5 4 ways

(viii)at least two boys sit together

Sometimes, some questions are solved by doing the opposite of what they want us to do.
If we want that at least 2 boys should sit together, then what we don’t want is that no two boyssit together
i.e. we want that all the boys should not separately.
Number of ways when all the boys sit separately = 5 6P4 [using GAP Method]
Total number of ways without any condition = 9
 Required ways when at least two boys sit together
={Total ways}  {No. of ways when all the boys are sitting separately i.e. no 2 of them are together}
= 9  5 6 P4
(ix)atmost 4 girls sit together
Proceeding in the same way as in above question(viii), the opposite of atmost 4 girls sitting together is all 5 girls
sitting together
 Number of ways when atmost 4 girls sit together
={Total ways} {No. of ways when all 5 girls sit together}
= 9 5 5
(x)between any two boys, there is at least one girl
Same as no two boys sitting together
If no two boys sit together, then between any two boys there will be guaranteed a minimum of 1 girl
Illustration: Prove that n Pr n 1 Pr  r n 1Pr 1
Solution: Logical proof:Let us denote then different things as A1, A2, … ,An
Theoretical Proof : LHS= n Pr  Number of ways to arrange ‘r’ out of ‘n’ given things in ‘r’
RHS n1 Pr  r n1Pr 1 places. Now, this work can also be accomplished in another way.
n 1 r n 1 RHS= n 1 Pr  r n 1Pr 1
 
n  r 1 n  r Let’s consider any 1 thing (say A1). Now A1, may or may not be included
n 1 r n 1 in the final arrangement of the ‘r’ things.
   If A1 is not included, then the ‘r’ places must be filled by remaining
n  r 1 n  r n  r 1
(n–1) things.
n -1  r  Number of arrangements, when A1 is not included = n1 Pr
 1
n - r -1  n - r 

 If A1 is always included, then it can be placed in any one of the ‘r’
n 1 n places (r ways).Now, the remaining (r–1) places can be filled using
 
n  r 1 n  r remaining (n–1) things in n 1 Pr 1 ways.

LALPUR Campus, Circular Road, Lalpur, Ranchi-834001. Ph. 7488408051, 8235071441 Page 14
DORANDA Campus, Opp. Eylex Cinemas, Hinoo, Ranchi-834002. Ph. 6201469038, 8092071442
www.brothersacademy.co.in Permutations and Combinations

n Number of arrangements, when A1 is always included  r n 1 Pr 1


nr  Total number of arrangements = n 1
Pr  r n 1
Pr 1
 Pr
n

=LHS Hence n Pr n 1 Pr  r n 1
Pr 1
Illustration: Consider the letters of word ‘DEBOTRI’ 7 letters words are made by using all the letters of the
word DEBOTRI. Find the number of words in which
(i)consonants occupy odd places and vowels occupy even places
(ii)relative positions of vowels and consonants does not changes
(iii)there are exactly two letters between D and E
(iv)E comes after D
(v)E comes just after D
(vi)Consonants occurs in alphabetical order
(vii)R comes after T and I comes after R
(viii)between any two vowels, there are exactly two consonants
(ix)the word TRI doesn’t come
(x)consonants occupy the first and last positions
Solution :
(i)consonants occupy odd places and vowels occupy even places
Consonant should occupy 1st, 3rd, 5th and 7th positions [ 4 ways] and
Vowels should come in 2nd;4th and 6th places [ 3 ways]
 Total number of ways = 4 3

(ii)relative positions of vowels and consonants does not changes

By ‘relative position of vowels and consonants do not change’ we mean that vowels should not come in place of
consonants and vice versa. The relative positions of consonants(C) and vowels (V) is
DEBOTRI   CVCVCCV
Consonants occupy 1st, 3rd, 5th and 6th place, while vowels occupy 2nd, 4th and 7th places.
So 4 consonants can occupy 4 fixed places in 4 ways while 3 vowels can occupy 3 fixed places in 3 ways
 Final answer = 4 3

(iii)There are exactly two letters between D and E

Method I:
If we want exactly two letters to come between D and E, then D and E can be D E
positioned in 4  2 ways. D E
( 2 is multiplied because D and E can also interchange their places) D E
Now in remaining 5 places, 5 letters can be placed in 5 ways D E
 Number of ways when there are two letters between D and E is = 4  2  5
Method II:
If we want 2 letters between D andE, then those 2 letters can be selected from remaining 5 letters in 5 C2 ways .
Now, take these 2 selected letters along with D and E and then use BOX method.
D+2letters+E and 3remaining letters = Total 4 things (4!2!2! ways)
 First 2!  D and E can exchange their positions in the box
 Second 2!  the two letters selected lying between D and E can also interchange themselves.
Hence, required number of ways = 5 C2 4 2 2
(iv)E comes after D
MethodI:
 There are total 7 places available. Place D and E in any 2 places  7
P2 ways 
 Now, in the remaining 5 empty places, the remaining 5 letters can be filled in 5! ways.
Hence, total number of ways = 7 P2  5!

LALPUR Campus, Circular Road, Lalpur, Ranchi-834001. Ph. 7488408051, 8235071441 Page 15
DORANDA Campus, Opp. Eylex Cinemas, Hinoo, Ranchi-834002. Ph. 6201469038, 8092071442
www.brothersacademy.co.in Permutations and Combinations

MethodII:
 Keep D and E aside to be filled later. Now, we have 5 letters to fill.
 There are total 7 places available. Place these 5letters in any 5 places  7
P5 ways 
 Now, in the remaining 2 empty places, letters D and E can be filled in 2! ways.
7
Hence, total number of ways = P5  2!
Method III:If E comes after D, then look at the probable placements of D and E in the
adjoining diagram (Dots () represents the probable positions of E)
Total ways to place D and E = 6+5+4+3+2+1= 21
After placing D and E; remaining 5 positions can be filled in 5 ways
 Total ways when E comes after D is = 21  5
Method IV: Since D should always come before E hence they can’tbe arranged among themselves.
Imagine like this, there are two identical boxes and remaining 5 letters BOTRI
7
Number of ways to arrange above 7 things in a row =
2
7
Each of the above arrangements is different from one another. In every arrangement we have two identical
2
boxes placed in 2 of 7 places. Now place D in whichever box which comes first and E is the other box.In this way
D will always come before E
Method V: Since every possible arrangement has to be considered, in half of them D will come before E and in
other half D will come after E (as both D and E cannot come together in same place)
Total Ways 7!
 Required ways =   21 5
2 2

(v)E comes just after D

If E comes just after D, then in every arrangement we must get DE together with D before E. So use string/box
method. Put D and E in a box with D coming before E .
DE BOTRI = Total 6 different objects
 No. of ways = 6
[ Here, D and E can’t interchange their places, That’s why 2! is not present]
(vi)Consonants occurs in alphabetical order
Consonants are D,B,T,R. They should come in alphabetical order.
So the first consonant in the 7 lettered word must be B, then D, then R and then T.
MethodI:
 Keep D,B,T and R aside (to be filled later). Now, we have to fill E,O and I.
7
 There are a total of 7 places available. In these 7 places, we can fill E, O and I in P3 ways.
 Now, there are 4 empty places. In these 4 empty places, we can fill D,B, T and R alphabetically in 1 way.
7
Hence, required number of ways = P3
MethodII:
D, B, T and R can’t be arranged amongst themselves.
Let’s take a look at one of the sample arrangements say BEDORTI. Now, if we don’t change or disturb the vowels
then the 4 consonants on their own can produce 4 arrangements, out of which only 1 is useful here.
Hence out of a group of 4 arrangements only 1 is useful
7
 Out of a group of 7! arrangements, only are useful.
4
7
 Required no. of ways =
4

MethodIII:

LALPUR Campus, Circular Road, Lalpur, Ranchi-834001. Ph. 7488408051, 8235071441 Page 16
DORANDA Campus, Opp. Eylex Cinemas, Hinoo, Ranchi-834002. Ph. 6201469038, 8092071442
www.brothersacademy.co.in Permutations and Combinations

 There are a total of 7 places available. 4 places out of these 7 places can be selected in 7 C4 ways
 In these selected places, place D,B,T,R alphabetically(1 way).
 In the remaining 3 places, we can fill E, O and I in 3! ways.
7
Hence, required number of ways = C3 3!
(vii)R comes after T and I comes after R
MethodI:
 Leave T,R and I aside(to be filled later). Now we have to fill D,E,B,O.
 There are total 7 places available. D,E,B,O can be filled in these places in 7 P4 ways leaving 3 empty places
 In these 3 places T,R and I can be filled in only 1 way(first T, then R, then I)
Hence, total no. of ways = 7 P4
MethodII:
Consider a sample arrangement DTERBOI
If we don’t disturb any letter other than T, R and I, then
T,R and I alone can produce 3 (= 6) arrangements.
Out of these six arrangements, only one where T, R and I come in the given order
is useful
7
Required no. of ways =
3

Method III: Consider DEBO and arrange them in a row.

7
Number of arrangements =
3
Now in every arrangement T, R and I can be filled in only 1 way but putting T, R and I in 1 st, 2nd and 3rd boxes
respectively.
MethodIV: (Using Combinations)
7
 Out of the 7 places available, we can select 3 places in C3 ways. In these 3 places, T,R and I can be filled
(in the given order) in 1 way.
 Now, D,E,B and O can be filled in the 4 empty places in 4! ways.
7
 Total no. of ways= C3  4!
(viii)Between any two vowels, there are exactly two consonants
Since there are 3 vowels(V) and 4 consonants(C) then only possibile arrangement looks like this VCCVCCV
 Vowels E,O,I can be filed in 1st,4th and 7th places in 3! Ways
 In remaining 4 places, consonants can be filled in 4! ways
So, number of words possible = 4 3
(ix)The string ‘ TRI’ doesn’t come
Number of words which contain TRI = 5 [using BOX Method]
[Put TRI in a box and arrange along with other letters, and then don’t interchange T, R and I]
Hence number of words which don’t contain the string “TRI” = 7  5

(x)Consonants occupy the first and last positions

MethodI:
 There are a total of 4 consonants avaialable. First and last places can be filled by consonants in 4 P2 ways
 Now, the remaining 5 empty places can be filled by 5 remg letters in 5 ways
 Total no. of ways = 4 P2 5  12 5
MethodII:
 If consonants occupy extreme ends, then vowels should come in places from 2 nd to 6th
5
 There are a total of 3 vowels available. They can come in places from 2nd to 6th in P3 ways
 Now, 4 consonants can be arranged 4 empty places in 4 ways

LALPUR Campus, Circular Road, Lalpur, Ranchi-834001. Ph. 7488408051, 8235071441 Page 17
DORANDA Campus, Opp. Eylex Cinemas, Hinoo, Ranchi-834002. Ph. 6201469038, 8092071442
www.brothersacademy.co.in Permutations and Combinations

 Total no. of ways = 5 P3 4  12 5

Illustration: Using digits 0,1,2,3,4,5,6 five digit numbers are formed, answer the following questions
considering both the cases mentioned below.
(a) repetition allowed (b) repetition not allowed
(i)How many numbers will be formed
(ii)How many of them will be even
(iii)How many are divisible by 4
(iv)How many are greater than 21000
(v)Find sum of all the numbers in (i)
Solution:
(i)How many numbers will be formed
We have to form a five digit number, hence we basically have to fill 5 places using 0,1,2,3,4,5,6
(a)Repetition not allowed: (b)Repetition Allowed:
Place 1 ST 2 ND 3 RD 4 TH 5 TH Place 1ST 2ND 3RD 4TH 5TH
Number Number of
6 6 5 4 3 6 7 7 7 7
of ways Ways
 Since 0 can’t come in 1st place, hence 1st place can  Since 0 can’t come in 1st place, hence 1st place can
be filled in 6 ways. be filled in 6 ways.
 Now for 2nd place: 0 can also come. So it can be  Now for 2nd place: 0 canalso come. So it can be
filled in 6 ways (using 6 remaining digits) filled in 7 ways
 Similarly 3rd place can be filled in 5 ways  Similarly 3rd place can also be filled in 7 ways
(excluding the numbers filled in first 2 places)  …and so on.
 …and so on. Total number of numbers with repetition
Total number of numbers without repetition = 67777
6
= 6 P4  6  6  5  4  3 = 67
(ii)How many of them will be even
(a)Repetition not allowed
MethodI:
Here, it is very difficult to decide which place should be filled first because
 As the final number should be even, we must fill 5thplace first with an even digit
 We also have 0 as one of the digits which means 1stplace should be filled first
 If 5thplace is filled first,then we can’t decide whether 0 is available or not for the 1 stplace
 If 1stplace is filled first,thenwe don’t know which even digit is available for 5th place.
So,here we should take 2 cases
Case I: Even No. ends with 0 Case II: Even No. ends with 2,4 or 6
 5th place can be filled in 1 way by using 0  5th place can be filled in 3 ways by 2,4 or 6
 1st place can be filled in 6 ways by 1,2,3,4 or 5  1st place : 5 ways (excluding 0 and one of
 2nd, 3rd, 4th places now can be filled freely (2,4,6) which has been filled in 5th place)
Place 1st 2nd 3rd 4th 5th  Now 2nd, 3rd and 4th places can be filled freely by
Number of ways 6 5 4 3 1 remaining 5 digits in P3   5 4 3  ways
5

 Number of numbers ending with zero  Number of even numbers not ending with 0
= 6  5  4  3  1 = 360 = 5 5 4 3 3
 Total number of even numbers = 21  60  1260
MethodII:
We can do this problem much easily by counting number of odd numbers first
Number of odd Numbers:
Place 1st 2nd 3rd 4th 5th  Last (5th) place should be filled by an odd digit (3 ways)
Number of  Now, 1st place can be filled in 5 ways (excluding 0 and one of
5 5 4 3 3
ways (1, 3, 5) filled in 5th place)
 Number of odd numbers = 5  5  4  3  3  900
Also, total number of numbers without repetition = 6  6  5  4  3  2160
 Number of even numbers ={Total numbers}{No. of odd numbers}= 2160 – 900 = 1260

LALPUR Campus, Circular Road, Lalpur, Ranchi-834001. Ph. 7488408051, 8235071441 Page 18
DORANDA Campus, Opp. Eylex Cinemas, Hinoo, Ranchi-834002. Ph. 6201469038, 8092071442
www.brothersacademy.co.in Permutations and Combinations

b)Repetition allowed:
Place 1st 2nd 3rd 4th 5th  Number of even numbers = 6  7  7  7  4 = 24  73
Number of ways 6 7 7 7 4
(iii)How many are divisible by 4
For a number to be divisible by , the last two digits must be divisible by 4
(a)Repetition not allowed:
The possible options for last two digits are 04, 12, 16, 20, 24, 32, 36, 40, 52, 56, 60, 64

CaseI:Numbers having 0 in any of last 2 places CaseII: Numbers not having 0 in any of last 2places
Number of numbers ending with 04, 20, 40, 60 Number of numbers ending with one of
Place 1st 2nd 3rd 4th 5th 12,16,24,32,36,52,56 or 64
Number Place 1st 2nd 3rd 4th 5th
5 4 3 1 1
of ways Number of ways 4 4 3 1 1
 Number of numbers ending with 04, 20, 40 or  Number of numbers ending with one of 12, 16, 24, 32,
60  4  5 4 311  240 36, 52, 56, 64  8   4  4 311  384
 Total no. of numbers divisible by 4 are = 384 + 240 = 624
(b)Repetition allowed:
Place 1st 2nd 3rd 4th 5th If repetition is allowed then possibilities for last two places are
Number of ways 4 4 3 1 1 00, 04, 12, 16, 20, 24, 32, 36, 40, 44, 52, 56, 60, 64
 Number of numbers divisible by 4 are  14  6 7 7 1 1  84  7 
(iv)How many are greater than 21000
a)Repetition not allowed
No. of numbers starting with 21 are Place 1st 2nd 3rd 4th 5th
= 1  1  5  4  3  60 Number of ways 1 1 5 4 3
No. of numbers starting with 23, 24, 25 or 26 are Place 1st 2nd 3rd 4th 5th
= 1  4  5  4  3  240 Number of ways 1 4 5 4 3
Numbers starting with 3,4,5,6 are Place 1st 2nd 3rd 4th 5th
= 4  6  5 4  3 Number of ways 4 6 5 4 3
 Total No. of numbers = 60 + 240 + 1440 = 1740
b)Repetition allowed:
3
 3

Proceeding in same way as above number of numbers  7  1  4  7  4 7 [21000 should not be included]
4

(v)Find sum of all the numbers in (i)

a)Repetition not allowed:
To find the sum, we will use the contribution of each digit in net sum rather than considering the number itself
Fact: 23456=20000+3000+400+50+6
There are a total of 2,160 numbers possible. Let us first add the digits in units place in each of 2,160 numbers.
No. of numbers having ‘1’ in units place = 5  5  4  3  1 Place 1st 2nd 3rd 4th 5th
Contribution of all the 1’s in units place = 1 55 4 3 Number of ways 5 5 4 3 1
No. of numbers having ‘2’ in units place = 5  5  4  3  1 Place 1st 2nd 3rd 4th 5th
Contribution of all the 2’s in units place = 2 5 5 4 3 Number of ways 5 5 4 3 1
No. of numbers having ‘3’ in units place = 5  5  4  3  1 Place 1st 2nd 3rd 4th 5th
Contribution of all the 1’s in units place = 3 55 4 3 Number of ways 5 5 4 3 1
No. of numbers having ‘4’ in units place = 5  5  4  3  1 Place 1st 2nd 3rd 4th 5th
Contribution of all the 4’s in units place = 4  55 4 3 Number of ways 5 5 4 3 1
No. of numbers having ‘5’ in units place = 5  5  4  3  1 Place 1st 2nd 3rd 4th 5th
 Contribution of all the 5’s in units place = 5 55 4 3 Number of ways 5 5 4 3 1
Hence, the contribution of all the digits in the units placeof all the 2160 numbers in the net sum is

LALPUR Campus, Circular Road, Lalpur, Ranchi-834001. Ph. 7488408051, 8235071441 Page 19
DORANDA Campus, Opp. Eylex Cinemas, Hinoo, Ranchi-834002. Ph. 6201469038, 8092071442
www.brothersacademy.co.in Permutations and Combinations

= 1 55 4 3 + 2 55 4 3 + 3 55 4 3 + 4  55 4 3 + 5 5 5 4  3

= 1  2  3  4  5  655 4 3
Similarly,
contribution ofall the digits in the tens place in the net sum is = 1  2  3  4  5  65 5 4 3 10
contribution ofall the digits in the hundredth place in the net sum is = 1  2  3  4  5  655 4  3 10
2

contribution of all the digits in the thousandth place in the net sum is = 1  2  3  4  5  655 4 3 10
3

contribution of all the digits in the tenthousandth place in the net sum is = 1  2  3  4  5  6 6 5 4 3 10
4

 Contribution of all the digits in the net sum = 1  2  3  4  5  655 4 3

+ 1  2  3  4  5  65 5 4 3 10
+ 1  2  3  4  5  65 5 4 3 10
2

+ 1  2  3  4  5  655 4 3 10

3

+ 1  2  3  4  5  66 5 4  3  10
4

Hence, Net sum = 1  2  3  4  5  6 55 4 3 1111   6 5 4 3  10 

4

 1  2  3  4  5  65 4 3 5 1111  6  104 

(b)Repetition allowed:
3
 
Proceeding in same way as above, net sum 1  2  3  4  5  6 7 6 1111  7 10 
4

Illustration: Find the no. of ways to fill5 different balls in 3 different boxes.
Solution:
Here, any box can have any no. of balls
 1stball can be filled in any box in 3 ways
 2ndball can be filled in any box in 3 ways
 ..and so on
Total number of ways = 35
Counter Question: Why can’t the answer be 53 using the following explanation:
 1st box can be filled in 5 ways
 2nd box can be filled in 5 ways
 3rdbox can be filled in 5 ways
Explanation:
1stbox can’t be filled in 5 ways, because
It might have 0 balls (1 way) It might have 1 ball ( 5 C1 ways)
5
It might have 2 balls ( 5 C2 ways) It might have 3 balls ( C3 ways)
5
It might have 4 balls ( 5 C 4 ways) It might have 5 ball ( C5 ways)
Hence, the above logic is wrong.
In such type of question, students are always confused with two possible answers i.e. 35 or 53 . To understand it
clearly, we should look for things which are repeatable
 35 means 33333 i.e. 3is repeating
 53 means 555 i.e. 5 is repeating
We should identify the thing which can repeat and the thing which can’t repeat. The thing which can repeat
should become the base and one the one which can’t repeat should become the exponent.
 Here, we have 5 balls. A ball can’t repeat itself i.e. same ball can’t go to more than 1 box simultaneously
 Also, we have 3 boxes. A box can repeat itself i.e. same box can contain more than 1 ball simultaneously
Hence, we would say that boxes are repeatable i.e. Answer =  No.of boxes 
No.of balls
 35
Illustration: In how many ways 10 letters can be posted in 5 post boxes.
Solution: A lot of students get confused between two possible answers i.e. 510 or 105
Let’s justify both of them one by one

LALPUR Campus, Circular Road, Lalpur, Ranchi-834001. Ph. 7488408051, 8235071441 Page 20
DORANDA Campus, Opp. Eylex Cinemas, Hinoo, Ranchi-834002. Ph. 6201469038, 8092071442
www.brothersacademy.co.in Permutations and Combinations

510  5  5  5  ......  5 (10 times) i.e. 10 5  10  10  10  10  10 i.e.

 1stletter we can be posted in 5 ways  1st post box can filled in 10 ways
 2nd letter we can be posted in 5 ways  2nd post box can filled in 10 ways
 …. and so on  … and so on
Of course second logic is illogical because
 1st postbox can be filled in 10 ways by exactly 1 letter only,
 then 2 letters can be posted in 1st postbox in 10 C2 ways
 …and so on.
Moreover, if a particular letter is posted in 1st postbox, then it can’t be posted in any other
postboxsimultaneously.
 510 is correct answer
Also, if we talk about who is repeatable and who is not, then
 Postbox is repeatable, because same postbox can contain more than 1 letter simultaneously
 Letter is not repeatable, because same letter can’t be posted in more than 1 postbox simultaneously
Hence, ans=  No.of post  boxes 
No. of letters
 510
Illustration: 15 persons want to go from Delhi to Mumbai. If there are 10 trains available from Delhi to Mumbai,
then in how many ways can they go from Delhi to Mumbai
Solution:
 1st person can go from Delhi to Mumbai in 10 ways, then
 2nd person can go in 10 ways
 … and so on
Total no. of ways = 1015
Justify why 1510 should be wrong
Illustration: In how many ways can we distribute 8 prizes among 5 students.
Solution:
 1st prize can given in 5 ways
 2nd prize can given in 5 ways
 …. and so on
 Number of ways = 58
Illustration: Samyak want to invite 15 of his friends to his b’day party. He has 5 servants. In how many ways can
he invite all his friends to his party so that no friend is invited more than once.
Solution:
 1stfriend can be invited in 5 ways
 2ndfriend can be invited in 5 ways
 3rdfriend can be invited in 5 ways
 …. and so on
Hence, Total no. of ways = 510
Here, we can see that
 Friends are not repeatable, because same friend cannot be invited by more than 1 servant simultaneously
 Servants are repeatable, because same servant can invite more than 1 friend simultaneously

Circular Permutations
Before starting this topic, let’s first understand the difference between linear and circular permutations.
 In linear permutations we have a beginning an end point i.e. we can say 1st place, 2nd place and so on
 A circle is endless i.e. no beginning and no end, hence no way of saying 1st place, 2nd place and so on.
So the big question is how anyone would differentiate between circular arrangements/permutations.
 By checking the neighbors of each object and the sense of direction i.e. clockwise or anticlockwise. Any
two circular arrangements in which every object has same set of neighbors in same direction are same.

LALPUR Campus, Circular Road, Lalpur, Ranchi-834001. Ph. 7488408051, 8235071441 Page 21
DORANDA Campus, Opp. Eylex Cinemas, Hinoo, Ranchi-834002. Ph. 6201469038, 8092071442
www.brothersacademy.co.in Permutations and Combinations

 By converting the circular permutations into

corresponding linear permutations, starting from the
same object and proceeding in same direction.
For e.g.Let us try to identify whether the four circular
permutations in the given diagram are identical or different. In order to do that, we have to convert them into
corresponding linear permutations. To get the linear permutations, we need to fix the starting point and the
direction of rotation. Suppose we will start from A and proceed in anticlockwise sense, then the corresponding
linear permutations are ABCD;ABCD;ABCD;ABCD. Since all these linear permutations are same, hence we can
say that the given 4 circular permutations are also same/identical.

Hence, if we have to arrange 4 objects say A,B,C,D around a circle, then corresponding to every group of 4 linear
permutations , we will get one circular permutation(one possible option is presented below).
4linear permutations 
 ABCD 
 
 BCDA   1 Circular permutation
 CDAB 
 
 DABC 
Number of linear permutations 4
 Number of circular permutations    4 1
4 4

Generalization:
n
 Number of ways to arrange ‘n’ things around a circle =  n 1
n
n
Pr
 Number of ways to arrange ‘r’ out of ‘n’ things around a circle =
r
Alternatively:The arrangement (permutation) in a row has a beginning and an end, but there is nothing like
beginning or end in circular permutation. Thus, in circular permutation, we consider one object as fixed and the
remaining objects can be arranged in (n – 1)! ways (as in the case of arrangement in a row).
 Number of ways to arrange remaining (n – 1) things = n  1

Clockwise and Anti clock wise arrangements:

There might arise some cases (necklace, garland etc) when clockwise and anticlockwise arrangements become
same. Sense of direction (clockwise/anticlockwise) can’t be applied in these cases
For e.g. a necklace can always be taken out of the neck and flipped(see below diagram).
Imagine a necklace containing 4 beads A, B, C, D. Then instead of 4(as in case of circular permutations), now 8
linear permutations will become same/one circular permutation.
FLIP TO RIGHT FLIP TO LEFT

X Y P Q

LALPUR Campus, Circular Road, Lalpur, Ranchi-834001. Ph. 7488408051, 8235071441 Page 22
www.brothersacademy.co.in Permutations and Combinations

In above diagram arrangements X and Y(or P and Q) are generally considered different circular permutations.
But if clockwise and anticlockwise arrangements become same (as in case of a necklace/garland), then they
will also become identical as one of them can be obtained from the other just by flipping it towards left / right.
Hence they can’t be treated as different circular permutations in that case. To nullify this redundancy, the actual
( )!
number of different arrangements is (extra 2 in denominator).
Summary:
 Number of ways to arrange ‘r’ out of ‘n’ things around a circle
n
Pr
(if anticlockwise and clockwise arrangements are different)
r  
=
n
Pr
(if anticlockwise and clockwise arrangements are same)
2r
 Number of ways to arrange ‘n’ things around a circle
n  1 ( if anticlockwise and clockwise arrangements are different)
=  
n 1
( if anticlockwise and clockwise arrangements are same)
2
Note:
 When the positions are numbered, circular arrangement is treated as a linear arrangement.
 In a linear arrangement, it does not make difference whether the positions are numbered or not.
Illustration: 6 Americans, 5 Indians and 4 Russians have to be seated around a circle. Find the number of ways
of seating them if
(i)there is no condition (ii)all Indians sit together
(iii)all Russians do not sit together (iv)no 2 Americans sit together
(v)persons from same country sit together (vi)Indians and Russians sit alternately
(vii)At least 2 Indians sit together (viii)At most 5 Americans sit together
(ix)There is at least 1 foreigner between any 2 Indians (x)There are 2 foreigners between any 2 Indians
Solution:
(i)there is no condition
If there is no condition, then 15 persons can be seated around a circle in (15–1)!=14! ways
(ii)all Indians sit together
If all Indians sit together, then we put them in a box and treat as single person [Box Method].
5I ;6A; 4R  Total11persons
 Now 11 persons can be arranged around a circle in 10! ways, and then
 5 Indians can be arranged amongst themselves in 5! Ways (after at least one person is seated, the
circular arrangements become same as linear)
 Number of ways = 10 5
(iii)all Russians do not sit together
Number of ways in which all Russians sit together = 11 4 [Using BOX Method]
 Number of ways in which all Russians do not sit together
={Total ways }  {No. of ways when all Russians sit together}
= 14  11 4
(iv)no two Americans sit together
If no two Americans sit together, then we will first arrange the remaining persons and then place Americans in
the gaps produced [GAP Method].
 (5I + 4R) can be seated around a circle in 8! ways
 Now there will be 9 gaps between these 9 persons (5I + 4R).
9
 In these 9 gaps, Americans can be seated in P6 ways
 Total no. of ways = 8!  9 P6

LALPUR Campus, Circular Road, Lalpur, Ranchi-834001. Ph. 7488408051, 8235071441 Page 23
DORANDA Campus, Opp. Eylex Cinemas, Hinoo, Ranchi-834002. Ph. 6201469038, 8092071442
www.brothersacademy.co.in Permutations and Combinations

(v) persons from same country sit together

Put all the Americans in one box
Put all the Russians in another box
Put all the Indians in a third box
6A 5I 4R =Total 3 boxes [BOX Method]
Number of ways when persons of same country sit together = 3  1 6 5 4
(vi)Indians and Russians sit alternately
If Indians and Russians are to sit alternately then first they must sit together
 6A  5I  4R = Total 7 persons (can sit around a circle in (71)! ways)
 Now, 5I and 4R can sit alternately inside the box in 5 4 ways
Total number of ways = 6 5 4
(vii)At least two Indians sit together
10
Number of ways in which no two Indians sit together = 9 P5 [Using GAP Method]
 Number of ways in which at least two Indians sit together
={Total ways}  {No. of ways when no 2 Indians sit together}
= 14  P5 9
10

(viii)At most 5 Americans sit together

Number of ways in which all 6 Americans sit together is = 9!6!  6A  5I  4R  Total 10 persons 
 
Number of ways in which maximum of 5 American will sit together
={Total ways}  {No. of ways when all 6 Americans sit together}
= 14  9 6
(ix)There is at least one foreigner between any two Indians
If there is a minimum of 1 foreigner between any 2 Indians, then it is same as no two Indians sitting together
Number of ways = 9  10P5
(x)There are exactly two foreigners between any two Indians
5–Indians + 10 – Foreigners
Step–I: Place 5 Indians around the circle (4! ways)
Step–II: Place 2 seats in every gap (1 way)
Step–III: Place 10 Foreigners in those seats  10 ways
Number of ways = 4 10
Illustration: Consider 23 different colored beads in a necklace. In how many ways can the beads be placed in
the necklace so that 3 specific beads always remain together?
Solution: Let’s consider those 3–specific beads as one.
Hence, effectively we have 21 beads i.e. n = 21.
The number of arrangements = (n–1)! = 20!
Also, the number of ways in which 3 beads can be arranged between themselves is 3! = 3 x 2 x 1 = 6.
!× !
Thus the total number of arrangements =

Combinations: Introduction
 Different groups/selections can be made by selecting some or all of a number of given things.
 Every such selection is said to be a combination.
 While selecting things, their order is not taken into consideration.
 No. of line segments which can be made using points A,B,C and D are
AB,AC,AD,BC,BD,CD
 Here, the order of appearance of points is taken into consideration i.e. AB and BA will represent
same linesegment and hence same selection.

LALPUR Campus, Circular Road, Lalpur, Ranchi-834001. Ph. 7488408051, 8235071441 Page 24
DORANDA Campus, Opp. Eylex Cinemas, Hinoo, Ranchi-834002. Ph. 6201469038, 8092071442
www.brothersacademy.co.in Permutations and Combinations

Counting Combintions:
Suppose, we want to find the number of ways to select ‘r’ things from a group of ‘n’ things.
● Let ‘x’denote the number of ways to select ‘r’things from a group of ‘n’things.
● Number of ways to arrange the ‘r’ things(selected above) in ‘r’ places is = r!
 Number of ways to arrange ‘r’ out of ‘n’ things in ‘r’ different places = x(r!) …(i)
But, we also know that
Number of ways to arrange ‘r’ out of ‘n’ things in ‘r’ different places= n Pr …(ii)
 From (i) and (ii), we get
n! n!
x  r!  n Pr  x  r!  x  n Cr
  r !
n   
n  r ! r !
 x  n Cr
Illustration: A committee of 6 students has to be selected from a group of 15 students (10 Boys + 5 Girls). In
how many ways can the committee be chosen if
(i)all the students are equally willing (ii)3 particular students refuse to be included
(iii)2 particular students should always be included (iv)2 particular students refuse to be together
(v)girls wish to be included together only (vi)at least one girl must be included
(vii)at most 4 girls can be included (viii)students of both gender are included
(ix)the girls should always be in majority (x)at least two and at most 4 girls are included
Solution:
(i) all the students are equally willing
If all the students are equally willing, then we can select any 6 students from given 15 students.
 Number of ways = 15C6
(ii)3 particular students refuse to be included
Since 3 particular students have refused to be included, hence we have to choose our committee from
remaining 12 students only
 Number of ways = 3 C0  12C6
(iii)2 particular students should always be included
If 2 particular students are always included, then we have to choose only 4 committee members from
remaining 13 students
Number of ways = 2 C2  13 C 4
(iv)2 particular students refuse to be included together
MethodI: 2 students refuse to be included together, so we have 2 options
(i)Don’t include any of them (ii)Include only one of them
If we don’t include any of them, then we have to 1 out of the 2 particular students can be chosen in
choose our 6 committee members from remaining 13 2 C ways, and then remaining 5 can be chosen in 13C
1 5
2 13
students ( C0  C6 ways) ways  2 C1  13 C 5 

Total no. of ways = 2C0  13C6  2C1  13C5

MethodII: Number of ways to choose committee when both the students are together = 13
C4
 Number of ways = Total ways – Unfavorable ways = C6  C4 15 13

(v)girls wish to be included together only

Again, we have two options
(i)No girl is included  10 C6 ways  (ii)All girls are included  10
C1  5 C5 ways 
 Number of ways = C6  C1  C5
10 10 5

(vi)at least one girl must be included

LALPUR Campus, Circular Road, Lalpur, Ranchi-834001. Ph. 7488408051, 8235071441 Page 25
DORANDA Campus, Opp. Eylex Cinemas, Hinoo, Ranchi-834002. Ph. 6201469038, 8092071442
www.brothersacademy.co.in Permutations and Combinations

MethodI:
If at least one girl must be include, then the following cases arise
No. of Boys No. of Girls No of ways  Number of ways when there is atleast 1 girl
10 5
5 1 C5  C1 10 5
= C5  C1
4 2 10
C 4  5 C2 + 10 C 4  5 C 2
+ C3  C3
10 5
3 3
10
C3  5C3
2 4 10
C 2`  5 C 4 + 10 C 2`  5 C 4
10 5
1 5
10
C1  5 C5 + C1  C5
MethodII:
If we want at least one girl to be always included, then what we don’t want is a committee with 0 girls.
10 5
Number of ways to choose a girl free committee = C6  C0
 Favourable ways = 15C6  10C6  5C0
NOTE: Again, by combining the two answers the following result from binomial theorem is proved
10
C6  5C0 + 10 C5  5C1 + 10 C 4  5 C2 + 10 C3  5C3 + 10 C 2`  5 C 4 + 10 C1  5 C5 = 15C6
(vii) at most 4 girls can be included
MethodI:
Boys Girls No. of ways  Number of ways when there are at the most 4 girls
6 0
10
C6  C0
5 10 5
= C6  C0
10
5 1 C5  5 C1 10 5
+ C5  C1
4 2 10
C 4  5 C2 + 10 C 4  5 C 2
+ C3  C3
10 10 5
3 3 C3  5C3
2 4 10
C2  5 C 4 + 10 C 2  5 C 4
MethodII: If we want a maximum of 4 girls to be included in committee, then what we don’t want is a
committee having all 5 girls
 Number of ways = 15C6  10C1  5C5
(viii) committee comprises of students of both gender
10
Number of ways such that committee comprises of boys only = C6  5C0
5
Number of ways such that committee comprises of girls only = C6  0
 Number of favorable ways =
15
C6  10 C6  5 C0
(ix)the girls should always be in majority
Boys Girls No.of ways  Number of ways
2 4 10
C2  5 C 4 = 10 10
C2  5 C 4 + C1  C5
5

10
1 5 C1  5 C5
(x) at least two and at most 4 girls are included
Boys Girls No of ways  No. of ways
4 2 10
C 4  5 C2 = 10 C 4  5 C 2
+ C3  C3
10 5
3 3
10
C3  5C3
2 4 10
C2  5 C 4 + 10 C 2  5 C 4
Illustration: In a plane, there are 15 points out of which 5 are collinear. Using these 15 points, find the
maximum number of
(i)linesegments which can be formed (ii)lineswhich can be formed
(iii)triangles which can be formed (iv)quadrilaterals which can be formed
(v)pentagons which can be formed

LALPUR Campus, Circular Road, Lalpur, Ranchi-834001. Ph. 7488408051, 8235071441 Page 26
DORANDA Campus, Opp. Eylex Cinemas, Hinoo, Ranchi-834002. Ph. 6201469038, 8092071442
www.brothersacademy.co.in Permutations and Combinations

Solution: Since we are talking about maximum values, hence the remaining 10 points must be such that no 3 of
them are collinear.
(i)linesegments which cane be formed
Joining any two points will generate a unique linesegment.
 Number of line segments = 15 C2
(ii) lines which cane be formed
Number of lines formed = 15 C2  5 C2  1
 Selecting any two points we will get a straight line but if the selected 2 points are from 5 collinear
points, then they will form same straight line.
 By subtracting 5 C2 we are subtracting every possibility of a straight line from 5 collinear points.
 But these 5 collinear points make ‘1’ straight line on which they all lie. Hence 1 is added
(iii)triangles formed
Proceeding in the same way as in (i) above
Number of triangles = C2  C3
15 5

(iv) quadrilaterals formed

15 5
Number of quadrilaterals is  C2  C3
Because, we are not removing the case when 3 points are selected from 5 collinear points and one from
remaining 10 points.
Total no.of quadrilaterals = 10C2  5C2  10C3  5C1  10C4  5C0
(v)pentagons formed
10
Number of pentagons = C3  5C2  10 C4  5C1  10C5  5C0
From 5collinear points, we can select a maximum of 2 points for our pentagon
Illustration: Consider an n–sided polygon. Find the number of (by using the vertices of polygon)
(i)diagonals
(ii)triangles
(iii)triangles having two sides common with that of polygon
(iv)triangles having one side common with that of polygon
(v)triangles having no sides common with that of polygon
(vi)quadrilaterals
(vii)quadrilaterals having 3 sides common with that of polygon
(viii)quadrilaterals having 2 sides common with that of polygon
(ix)quadrilaterals having 1 sides common with that of polygon
(x)maximum points of intersection of diagonals which lie inside the polygon
Solution:
(i)diagonals
By selecting any two vertices of a polygon we will get either side of polygon or diagonal of polygon
Number of diagonals = n C 2  n
(ii)triangles
n
Number of triangles = C3

(iii)triangles having two sides common with that of polygon

If we want two sides of triangle to be common with that of polygon, then those two sides must be consecutive
sides of polygon
 Possible triangles are A 1 A 2 A 3 ; A 2 A 3 A 4 ; A 3 A 4 A 5 ;.....; A n A 1 A 2
 Number of possible triangles having two sides common with that of polygon = n
(iv)triangles having one side common with that of polygon
 If we want only one side of polygon to be common with that of triangle, then that common side can be

LALPUR Campus, Circular Road, Lalpur, Ranchi-834001. Ph. 7488408051, 8235071441 Page 27
DORANDA Campus, Opp. Eylex Cinemas, Hinoo, Ranchi-834002. Ph. 6201469038, 8092071442
www.brothersacademy.co.in Permutations and Combinations

selected in ‘n’ ways.

 Let us assume that the common side is A1A2. So 2 vertices of the required triangles are
already fixed, hence we need to choose only one remaining vertex
 Possible options for 3rd vertex of triangle (apart from A1 and A2) are A4, A5, A6,……., An–

[A3 and An also can’t be the third vertex]

 If A1A2 is fixed as the only common side, then number of possible triangles = n – 4.
 Number of triangles = n   n  4 
(v)triangles
triangles having no sides common with that of polygon
Number of triangles having no side common wit
with that of polygon
 n C3  n  n  n  4   n C3  n  n  3 

(vi)quadrilaterals
Number of quadrilaterals = n C4
(vii)quadrilaterals
quadrilaterals having 3 sides common with that of polygon
If we want 3 sides of a quadrilateral to be common with that of polygon, then those 3 sides must be consecutive
sides of polygon.
Number of quadrilaterals having 3 sides common with that of polygon = n
(viii)quadrilaterals
quadrilaterals having 2 sides common with that of polygon
If 2 sides of the quadrilateral eral are common with that of polygon, then the common sides may be adjacent or
opposite
CaseI: 2 common sides are adjacent CaseII: 2 common
ommon sides are opposite
 For common sides to be consecutive,  For common sides to be opposite sides of quadrilateral,
we should select 3 consecutive lets fix one common side say A1,A2.
vertices [n ways viz.  Now 2 more consecutive vertices shouldould be selected
A 1 A 2 A 3 ; A 2 A 3 A 4 ; A 3 A 4 A 5 ;...; A n A 1 A 2 ; ] which can be any of A4A5, A5A6, A6A7,…………, An–2An–
 After fixing the 3 consecutive vertices 1[Please understand that if A1A2 is one side of

(say A1A2A3) then we are left to select quadrilateral then A3A4 or An An–1 can’t be the second
the fourth vertex for our quadrilateral side]
which can’t be any of A1, A2, A3, A4, An  Number of quadrilaterals having opposite sides common
 Hence, the 4th vertex can be selected n  n  5
with that of polygon =
in n5 ways 2
 Number of quadrilateral having 2 Reason for dividing by 2 is very simple. Consider aA
a 1A2A5A6.
adjacent sides common with that of We will get this quadrilateral 2 times once by fixing A1A2 and
polygon= n   n  5 then by fixing A5A6

(ix)quadrilaterals
quadrilaterals having 1 sides common with that of polygon
 If we want only one side of quadrilateral to be common, then it can be chosen in ‘n’ ways.
 Now, after fixing the common side (n ways) (say A1A2), the remaining two vertices can be chosen from
4) vertices [excluding A1, A2, A3, An] in C2   n  5 ways.
n4
remaining (n–4)
[n – 5 is subtracted because the remaining 2 vertices cchosen
hosen should not be consecutive]
 Number of quadrilateral having 1 side common with that of polygon = n   n  4 C2   n  5 
(x)maximum points
oints of intersection of diagonals which lie inside the polygon
For two diagonals to intersect inside the polygon, the two diagonals should be diagonals of a quadrilateral
So maximum number of points of intersection = Number of quadrilaterals = n C4
Corresponding to each quadrilateral, we will ge
get one point inside the polygon.

LALPUR Campus, Circular Road, Lalpur, Ranchi

Ranchi-834001. Ph. 7488408051, 8235071441 Page 28
www.brothersacademy.co.in Permutations and Combinations

Multiple Selections
In this section, we will learn how to perform multiple selection i.e. selections of more than one type.
Some of the questions which will be addressed in this section are
 An Urn contains n different balls. In how many ways can we choose a minimum of 2 balls?
 Navya has 10 identical coins of 50 Paise. In how many ways can she give a minimum of Re.1 to a bigger?
The point to remember here is to notice here is whether the given things different, identical are mixed
(someidentical + somedifferent)
Number of ways to choose Number of ways to choose from
Number of things to be chosen
n – different things given n–identical things
n
0 C0 1
n
1 C1 1
n
2 C2 1
n
3 C3 1
…… …… ……
n
r Cr 1
…… …… ……
n
n Cn 1
Suppose we have n things (n is sufficiently large), then
 n C1  n C1  n C2  ...  n Cn , if thingsaredistinct

1)Number of ways to choose at least one thing =  1  1  1  ...  1  n, if thingsareidentical
  
n times


 n C0  n C1  n C2  ...  n Cn 1 , if thingsaredistinct

2)Number of ways to choose atmost (n–1) things=  1  1  1  ...  1  n, if thingsareidentical
  
n times


 C  C6 ,
n n
if thingsaredistinct
3)Number of ways to choose either 5 or 6 things=  5
 1  1  2, if thingsareidentical

 C  C1  C2  C3  C4 ,
n n n n n
if thingsaredistinct
4)Number of ways to choose maximum of 4 things   0
 1  1  1  1  1  5, if thingsareidentical
Illustration: Suppose a bag contains 5 Black balls of same size, 6 Green balls of same size, 2 Pink balls of
different size and 7 Yellow balls of different size. Find the number of ways to choose
(i)at least 1 balls
(ii)at least 2 balls of each color
(iii)exactly 2 balls of each color
(iv)at most 2 balls of each color
(v)minimum 1 ball each of Black and Pink, and maximum 3 balls each of Green and Yellow color
Solution: Here we have 5B + 6G + 2P + 7Y i.e.
5 identical things of one type
6 identical things of second type
2 different things of third type
7 different things of fourth type
(i)at least 1 ball
Number of ways to choose zero or more Black balls = 6
Number of ways to choose zero or more Green balls = 7
Number of ways to choose zero or more Pink balls = 27
Number of ways to choose zero or more Yellow balls = 2 7
 Total number of ways to choose zero or more balls of any color = 6  7  27  27

LALPUR Campus, Circular Road, Lalpur, Ranchi-834001. Ph. 7488408051, 8235071441 Page 29
DORANDA Campus, Opp. Eylex Cinemas, Hinoo, Ranchi-834002. Ph. 6201469038, 8092071442
www.brothersacademy.co.in Permutations and Combinations

Number of ways to choose 0 balls = 1

 Number of ways to choose at least one ball = 6  7  27  27  1
(ii)at least 2 balls of each color
Number of ways to choose at least 1B = 5
Number of ways to choose at least 1G = 6
Number of ways to choose at least 1P = 22 – 1
Number of ways to choose at least 1Y = 27 – 1
 Number of ways to choose at least 1 ball of each color = 5  6  22  1    27  1 
(iii)exactly 2 balls of each color
Number of ways to choose exactly 2B = 1
Number of ways to choose exactly 2G = 1
Number of ways to choose exactly 2P = 2C2
Number of ways to choose exactly 2Y = 7C2
Number of ways to choose exactly 2 Balls of each color = 112 C2 7 C2

(iv)at most 2 balls of each color

Number of ways to choose maximum 2B = 3
Number of ways to choose maximum 2G = 3
Number of ways to choose maximum 2P = 22 = 2C0 + 2C1 + 2C2
Number of ways to choose maximum 2Y = 7C0 + 7C1 + 7C2
 Number of ways to choose maximum 2 balls of each color = 3  3  22   7 C0  7 C1  7 C2 
(v)minimum 1 ball each of Black and Pink, and maximum 3 balls each of Green and Yellow color
Number of ways to choose minimum 1 B ball = 5
Number of ways to choose maximum 3 G ball = 4
Number of ways to choose minimum 1 P ball = 2C1 + 2C2
Number of ways to choose maximum 3 Y ball = 7C0 + 7C1 + 7C2 + 7C3
Final answer = 5  4   2 C1  2 C2  7 C0  7 C1  7 C2  7 C3 

RESTRICTED SELECTION / ARRANGEMENT :

(a)The number of ways in which r objects can be selected from n different objects if k particular objects are
(i)always included = n–k Cr–k
(ii)never included = n–k Cr
(b)The number of arrangements of n distinct objects taken r at a time so that k particular objects are
(i)always included = n–k Cr–k .r!
(ii)never included = n–k Cr .r!
(c)The number of combinations of n objects, of which p are identical, taken r at a time is
 C r  Cr–1  Cr–2    C0 ,
n–p n–p n–p n–p
if r  p
=  n–p n–p n–p n–p
 C r  Cr–1  Cr –2   Cr–p , if r  p

Divisors and their sum

Number of divisors:

Suppose we have to find number of divisors of 6125

The prime factorization of 6125 is = 53  72  5  5  5 7  7

LALPUR Campus, Circular Road, Lalpur, Ranchi-834001. Ph. 7488408051, 8235071441 Page 30
DORANDA Campus, Opp. Eylex Cinemas, Hinoo, Ranchi-834002. Ph. 6201469038, 8092071442
www.brothersacademy.co.in Permutations and Combinations

Questions Answers
1) Can 2 be a divisor of 6125? No
2) Can 32 be a divisor of 6125? No
3) Can 54 be a divisor of 6125? No
4)Can 73 be a divisor of 6125? No
5) Can 5 be a divisor of 6125? Yes
6)Can 5  7 be divisor of 6125? Yes
From above discussion, one thing we can understand very clearly that
 We can’t use anything apart from  5  5  5  7  7  [i.e. three 5’s and two 7’s]to make a divisor of 6125.
 Any combination chosen out of three 5’s and two 7’s will be a divisor of 6125.
 So, basically we have 3 things of one type and 2 identical things of another type and we have to find
number of ways to select zero or more things
 Hence, number of divisors of 6125 = 4  3 = 12 where,
 4 = Number of ways to choose zero/more 5’s
 3 = Number of ways to choose zero/more 7’s

Sum of divisors:
Sum of Divisors of 6125 = 53  72
For finding the sum of the divisors we will write all the divisors and just add them.
We have 3 5’s and 2 7’s so
 5 can participate in a specific divisor in the form of 50, 51, 52, or 53 and
 7 can participate in a specific divisor in the form of 70, 71, or 72

5 7 70 71 72 Sum

50 50 70 50 71 50 72 50 (70 + 71 + 72)
51 51 70 51 71 51 72 51 (70 + 71 + 72)
52 52 70 52 71 52 72 52 (70 + 71 + 72)
53 53 70 53 71 53 72 53 (70 + 71 + 72)
Net Sum (50 + 51 + 52 + 53) (70 + 71 + 72)

Generalization:

Let N  p11 p22 p33 ...pn n where ,

 p1, p2, p3,…pnare PRIME numbers and

 1, 2,3,…n are non negative integers(Whole Numbers)
Then, we have the following results
Number of divisors of N is =  1  1 2  1 3  1 ....   n  1

Sum of divisors of N is = p10  p11  ...  p11  p
2
0
 p21  ...  p22 p
3
0
 
 p31  ...  p33 ...... pn 0  pn1  ...  pn n 
 p  1  p2  1   p  1   pn  1 
1 2 3 n
 1  
3
 ......  
 p1  1  p2  1   p3  1   pn  1 
Number of proper divisors of N is =   1  1   2  1   3  1  ....   n  1   2

Sum of divisors of N is = p10  p11  ...  p11  p
2
0
  
 p21  ...  p22 ...... pn0  pn1  ...  pn n  1  N 
 p  1  p2  1   p3  1   pn  1 
1 2 3 n
 1    ......    1  N 
 p1  1  p2  1   p3  1   pn  1 
NOTE : 1 and N are improper divisors of N

LALPUR Campus, Circular Road, Lalpur, Ranchi-834001. Ph. 7488408051, 8235071441 Page 31
DORANDA Campus, Opp. Eylex Cinemas, Hinoo, Ranchi-834002. Ph. 6201469038, 8092071442
www.brothersacademy.co.in Permutations and Combinations

Illustration: Consider N  2334 4556 . Now, find the number and sum of those divisors of N which are
(i)Proper divisors
(ii)Composite Numbers
(iii)Even
(iv)Divisible by 300
(v)Divisible by 30 but not divisible by 625
Solution: Given N = 23 34 45 56 = 213 34 56
(i)Proper divisors
Number of proper divisors on N = 13  114  1 6  1  2
 214  1   35  1   57  1 
Sum of proper divisors of N is = 
2  1

3  1

5  1

  1 2 3 5
14 5 7

   
(ii)Composite Numbers
Divisors of N which are prime = 2,3 and 5
 Number of composite divisors = 13  114  1 6  1  3
 214  1   35  1  57  1 
Sum of composite divisors =       2  3  5
 2  1   3  1  5  1 
(iii)Even
For a divisor to be even 2 must participate at least once
 Number of even divisors = (13) (4 + 1) (6 + 1)
 0 1

2 4 0 1 2

Sum of even divisors 2  2  ...  2 3  3  3  ...  3 5  5  5  ...  5
1 2 13 6

(iv)Divisible by 300
300  2 2  3  5 2
so if a divisor in divisible by 300 then
2 should come at least twice
3 should come at least once
5 should come at least twice
 Number of divisors = (12) (4) (5)
 13 1 2

Sum of divisors = 2  2  ...  2 3  3  3  3 5  5  ...  5
2 3 3 4 2 3 6
 
(v)Divisible by 30 but not divisible by 625

13 1 2 4 1

Total sum of divisors which are divisible by 30= 2  2  ...  2 3  3  ...  3 5  5  ...  5
1 2 2 6
 
Sum of divisors, which are divisible by 30 as well as divisible by 625 is
 13 1 2

= 2  2  ...  2 3  3  ...  3 5  5  5
1 2 4 4 5 6
 
 Sum of divisors, which are divisible by 30 but not divisible by 625
  4 1

2 6
 
1 2 13 1 2 4 4 5

= 2  2  ...  2 3  3  ...  3 5  5  ...  5  2  2  ...  2 3  3  ...  3 5  5  5
1 2 13 1 2 6
 
=  2  2  ...  2 3  3  ...  3 5  5  5 
1 2 13 1 2 4 1 2 3

Similarly,
Total number of divisors which are divisible by 30= (13)(4)(6)
No. of divisors, which are divisible by 30 as well as divisible by 625 is =(13)(4)(3)
 Number of divisors = (13)(4)(6)(13)(4)(3)=(13)(4)(3)
Illustration: Suppose a question paper consists of 10 questions.
(a)If every question have 4 options out of which only one is correct, then find the number of ways to
(i)answer at least one question
(ii)answer exactly 3 questions
(b)If every question has 4 options out of which one or more can be correct, then find the number of ways to
(i)answer all the questions

LALPUR Campus, Circular Road, Lalpur, Ranchi-834001. Ph. 7488408051, 8235071441 Page 32
DORANDA Campus, Opp. Eylex Cinemas, Hinoo, Ranchi-834002. Ph. 6201469038, 8092071442
www.brothersacademy.co.in Permutations and Combinations

(ii)answer all questions such that at least 2 questions are correct

(c)If every question is numerical answer type (any number from 0 to 9) then find the number of ways to
(i)answer exactly 2 questions correctly (not necessary to answer every question)
(ii)answer all the questions such that maximum 3 are correct
(d)If every question is a 44 Matrix–Matching type where each option in column – I has only one correct
alternative in column – II, then find the number of way to
(i)answer at least one option of every question
(ii)answer all options of every question
(e)If each question is 4  4 Matrix – Matching type where each option in Column – I has one or more correct
alternatives in column – II then find number of ways [if there is no partial marking]
(i)answer all questions incorrectly
(ii)answer at least 1 question correctly (all questions need not be answered)
Here, giving answer to a question doesn’t means that the answer given should necessarily be correct.
Also, attempting a question means to try to solve the question. In this process of trying, if one is not able to
solve the question then he/she might not answer it.
Solution:
(a)(i) If one question has 4 options, then there are 5 ways to attempt the question and 4 ways to answer the
question [while attempting we also have an option of not answering the question]
 Number of ways to attempt every question = 510
Number of ways to answer 0 questions = 1
Number of ways to answer at least 1 question = 510  1

(a)(ii)Number of ways to answer exactly 3 questions =

10
  
C3 43 17
We can answer a question in 4 ways and leave it unanswered in 1 way

(b) (i) If more than one option can be correct, then the following cases are possible
 Question is not answered i.e. no option is marked  4 C0 ways 
 Only ‘1’ of the options is marked  4 C1 ways 
 Any ‘2’ of the optionsare marked  C ways 
4
2

 Any ‘3’ of the optionsare marked  C ways 

4
3

 All ‘4’ optionsare marked  C ways 

4
4

Number of ways to attempt a single question = C0  C1  C2  C3  C4  2

4 4 4 4 4 4

Number of ways to give answer to a single question = 24 – 1

 Number of ways to answer all questions = 24  1 
10

(b)(ii)Number of ways to answer all questions =  24  1

10

Number of ways to answer ‘0’ questions correctly =  24  2

10

 2 = Total ways to attempt a single question

 1 =No. of ways when the question is not answered
 1 =No. of ways when correct answer is given to a question
Number of ways to answer exactly 1 question =
10

C1 24  1 
 Number of ways to answer at least 2 questions = 24    
10
 1  10 C1 24  1

(c)(i) A numerical answer type question can be

 answered in 10 ways
 attempted in 11 ways
 answered correctly in 1 way
 answered incorrectly in 9 ways

LALPUR Campus, Circular Road, Lalpur, Ranchi-834001. Ph. 7488408051, 8235071441 Page 33
DORANDA Campus, Opp. Eylex Cinemas, Hinoo, Ranchi-834002. Ph. 6201469038, 8092071442
www.brothersacademy.co.in Permutations and Combinations

 Number of ways to answer exactly 2 questions correctly = 10 C2 12 108 

Here, 10 = No. of ways to either leave the question or answer it incorrectly
(c) (ii) Number of ways to answer all the questions such that 0 are correct = 910
Number of ways to answer all the questions such that only 1is correct = 10 C1  1  99
Number of ways to answer all the questions such that only 2are correct = 10 C2  12  98
Number of ways to answer all the questions such that only 3are correct = 10 C3  13  97
 Number of ways to answer all the questions such that maximum 3 are correct
= 910 + 10 C1  1  99 + 10 C 2  12  98 + 10 C3  13  97

(d)(i) For a 4  4 matrix matching, there are 4 options (a,b,c,d)in column – I and 4 alternatives (p,q,r,s) in
column – II (single correct)
option(a) of column – I can be matched to any alternative (p;q;r;s) in columnII. Hence,
 option(a) of columnI can be answered in 4 ways and can be attempted in 5 ways
 option(b) of columnI can be answered in 4 ways and can be attempted in 5 ways
 option(c) of columnI can be answered in 4 ways and can be attempted in 5 ways
 option(d) of columnI can be answered in 4 ways and can be attempted in 5 ways
 Number of ways to attempt all the options of a single matching = 54
Number of ways to answer none of the options of a single matching = 1
 Number of ways to answer at least one option of a single matching = 54 – 1
Required No. of ways = 54 – 
10
1

(d) (ii).Number of ways to answer a single option of a single matching is = 4

Number of ways to answer all the 4 options of a single matching is = 44
Number of ways to answer every option of every question =  44   440  280
10

(e)(i) If every option in column – I can be matched with one or more options in column – II then,
 Option (a) can be answered in  24  1  ways and can be attempted in 24 ways
Number of ways to attempt a single option of a single matching = 24
Number of ways to answer a single option of a single matching =  24 – 1 
No. of ways to answer a matching correctly = 1
[as partial marking is not allowed, hence all the 4 options must be marked correctly]
Number of ways to answer a single matching incorrectly = 216  2
Number of ways to answer every question incorrectly =  216  2 
10

(e) (ii)
Number of ways to attempt every option of a single matching =  24 
4

 
10
 Total No. of ways to attempt all the matchings= 24 4  260

 
10
Number of ways to attempt every question such that no question is answered correctly = 216  1
 Number of ways to answer at least 1 question correctly = 260   216  110
Illustration: Consider a set S  1,2,3,...,n . Two sets A and B are constructed randomly (A may or may not be
equal to B). Then find the number of ways to construct A and B such that
(i)A = B (ii)n(A) = n (B)
(iii)n(A) > n(B) (iv)n(A) ≤ n(B)
(v) A  B (vi) A  B
(vii) A  B  S (viii) A  B  

LALPUR Campus, Circular Road, Lalpur, Ranchi-834001. Ph. 7488408051, 8235071441 Page 34
DORANDA Campus, Opp. Eylex Cinemas, Hinoo, Ranchi-834002. Ph. 6201469038, 8092071442
www.brothersacademy.co.in Permutations and Combinations

(ix) A  B  S and A  B   (x) n  A  B   10

(xi) n  A  B  5 (xii) n  A  B  8 and n  A  B  3
(xiii)a function can exist from A to B (xiv)an onto function can exist from A to B
(xv)a one – one into function can exist from A to B
Solution:
(i)A = B
Number of ways to construct A = 2n
ExplanationI: ExplanationII:
Since A is a subset of S, hence it contains any number Set S contains ‘n’ different elements each of these
of elements from 0 to n elements have two equally likely options
 Number of subsets containing 0 elements = n C0  Option – 1 : It may be present in A
 Option – 2 : It might not be present in A
 Number of subsets containing 1 element = n C1
 As every element in S have 2 options to form A,
 Number of subset containing 2 elements = n C 2 hence A can be constructed in 2  2

2  ... 2ways
 … n  times

 Number of subset containing n elements = n C n Now after constructing A, number of ways to

 Total Number of subsets of S construct B = 1 [ A = B, we should construct only
one of them and copy it for other]
= n C0  n C1  n C2  ...  n Cn  2n = 2n
Hence final answer = 2n ways
(ii)n(A) = n(B)
Number of Number of Number of ways to  Total no. of ways to construct A and B such
elements in A elements in B construct A and B that n(A)and n(B) are equal is
n n
0 0 C0 C0 = C20  C12  C22 ...  C2n
1 1 n
C1 n C 1 = 2n C n [ from Binomial theorem]
n
2 2 C2 n C2
……. ……. …….
n
n n Cn n Cn

(iii)n(A) > n(B)

MethodI:
No. of No. of  Total number of ways
No. of ways to construct
elements elements in
both A and B = C0 C1  C2  C3  ...  Cn 
in B A
+ C1  C2  C3  C4  ...  Cn 
0 1,2,3,……….n C0 C1  C2  C3  ...  Cn 
+ C2  C3  C4  C5  ...  Cn 
1 2,3,4,…….…n C1  C2  C3  C4  ...  Cn 
+…+
2 3,4,5,…….…n C2  C3  C4  C5  ...  Cn  + Cn 1Cn
…….. …….. ……..
n–1 n Cn 1Cn =   CiC j
0 i  j n

To find the above double summations look at the following result

22n  2n Cn
C0  C1  C2  C3  ...  Cn   C02  C12  C22  ...  Cn2  2  CiCj   CiCj 
2

0 i  j n 0 i  j n 2
MethodII:
No. of ways to construct set A is = 2n and No. of ways to construct set B is = 2n
Number of ways to construct both A and B 2n  2n  4n
Also, Number of ways to construct both A and B such that n(A) = n (B) is = 2n C n
 Number of ways to construct both A and B such that n  A   n  B is = 22n  2n C n
Now, as we are considering every possible way of constructing A and B, hence if n  A   n  B , then in half of the

LALPUR Campus, Circular Road, Lalpur, Ranchi-834001. Ph. 7488408051, 8235071441 Page 35
DORANDA Campus, Opp. Eylex Cinemas, Hinoo, Ranchi-834002. Ph. 6201469038, 8092071442
www.brothersacademy.co.in Permutations and Combinations

cases n  A   n  B and in the remaining half cases n  A   n  B

22n  2n Cn
Hence total ways to construct both A and B when n  A   n  B is =
2
(iv) ( ) ≤ ( )
Number of ways when n  A   n  B is = zn
Cn
2  2n Cn
2n
Number of ways when n  A   n  B is =
2
22n  2n Cn
Hence, Total no. of ways
2
(v) A  B
MethodI:
If A is a subset of B, then first B must be constructed and then A should be constructed using A. i.e. say if B has 5
elements, then A can be constructed in 25 ways (by using elements of B)

Number of Number of ways Number of ways to make  Total Number of ways

elements in B to construct B A such that A  B  C0 20  C1 21  C2 22  ...  Cn 2n
0 C0 20
 1  2  3n
n

1 C1 21

2 C2 22
3 C3 23
…….. …….. ……..
n Cn 2n
MethodII:
Number of ways to construct both A and B is = 2n  2n  4n
This answer 4n can also be justified in one more way from the perspective of elements of S
4n  4

4 
4  ...4
 which means when A and B both are constructed, then every element in S has 4 options to go
n  times

to A and B. Let us take a look at those 4 ways

S.No. A B Explanation
1   The element goes to both A & B
2   The element goes to A but doesn’t go to B
3   The element goes to B but doesn’t go to A
4   Doesn’t go to both A & B
Now if A  B , then a particular element can take the 2nd way (above in table) because if a particular element
goes to A but doesn’t goes to B, then how can A become subset of B.
So, if we want A  B , then every element of set S has 3 possible options.
Hence, number of ways to construct A and B such that AB is = 3n
(vi) A  B  B  A i.e. A is a proper subset of B
Number of ways to construct A and B such that B  A is = 3n
Number of ways such that B = A is = 2n
Number of ways to construct A and B such that AB is = 3n – 2n
(vii) A  B  S
MethodI:
S.NO. A B If A  B  S , then every element of Smust be present in at least one of A and B i.e.
1    either it should be present in A(option(2))
2    either it should be present in B(option (3))
3    either it should be present in both of A and B(option (1))
4   It means that it should never happen that a particular element of S is not present in both of

LALPUR Campus, Circular Road, Lalpur, Ranchi-834001. Ph. 7488408051, 8235071441 Page 36
DORANDA Campus, Opp. Eylex Cinemas, Hinoo, Ranchi-834002. Ph. 6201469038, 8092071442
www.brothersacademy.co.in Permutations and Combinations

A and B(i.e. option (4) in the adjoining table is unfavourable).

Hence number ways to construct A and B such that AB=S is = 3n
MethodII:
No. of ways to  Required Answer= C0 20  C1 21  C2 22  ...  Cn 2n  3n
No. of No. of ways
construct
elements to Explanation of any one term say n C 2  22 :
B, such that
in A construct A  When A contains any ‘2’ of ‘n’ elements (hence, the term
ABS
0 C0 2 0
n
C 2 ), then each of remaining (n–2) elements must go to B.
If any of these (n2) elements is absent in B, then AB
1 C1 21 can’t be =S
2 C2 22  Now the each of the 2 elements which A contains also
…….. …….. …….. have 2 options of going or not going to B.Hence the term
n Cn 2n 22
(viii) A  B  
Answer = 3n
Please try to answer this question on your own by both techniques mentioned in previous answer
(ix) A  B  S and A  B  
Answer = 2n
Please try to answer this question on your own by both techniques mentioned in previous answer
(x) n  A  B  10
S.NO. A B Total no. of ways = n C10  310  1n 10
1  
 n C10 = no. of ways to select the 10 elements which are going to go to A  B .These 10
2  
3   selected elements can go to A  B in 3 ways each(options 1,2 and 3)
4    310  No. of ways in which the selected 10 elements can reach AB
 1n 10 = No. of ways in which remaining (n – 10) elements which must not reach
AB[can be accomplished by option (4) only]
(xi) n  A  B  5
 Again 5 elements for AB can be selected in n C5 ways.
 These 5 selected elements can be placed in both A and B in 1 way only
 Remaining (n – 5) elements should not be able to reach A  B , which each of them can do in 3 ways
Total no. of ways = n C5 15 3n5
(xii) n  A  B  8 and n  A  B  3
Fact: An element which is not present in AB can never be present in AB
Proceeding in same way as in above cases,
Required answer = n C8  8 C3  13  283
Step 1: Select 8 elements for AB  C ways 
n
8

Step 2: Select 3 elements for A  B  C ways 

8
3

Step 3: Place the elements

 3 elements can be placed in AB i.e. both A and B in 1 way
 5 elements can be placed in AB when they should also not reach AB in 2 ways

(xiii)A function can exist from A to B

A function can exist between any two non–empty sets. Hence, if we want a function to exist between A and B,
then both of them must be nonempty i.e. n(A)0 and n(B)0

LALPUR Campus, Circular Road, Lalpur, Ranchi-834001. Ph. 7488408051, 8235071441 Page 37
DORANDA Campus, Opp. Eylex Cinemas, Hinoo, Ranchi-834002. Ph. 6201469038, 8092071442
www.brothersacademy.co.in Permutations and Combinations

Number of ways to construct A and B, such that n(A)0 and n(B) ≠ 0 is  2n  1 

2

(xiv)An onto function can exist from A to B

If we want an onto function to exist from A to B, then n(A)n(B)>0
Number of ways to construct A and B such that n(A)0n(B) i.e. n(A)>0 and n(B)>0 is =  2n  1 
2

Number of ways to construct A and B such that n(A)= n(B); n(A)>0 and n(B)>0 is = 2n C n  1

   
2
Number of ways to construct A and B such that n(A) n(B); n(A)>0 and n(B)>0 is = 2n  1  2n
Cn  1

 2  1    1
n 2 2n
Cn
Number of ways to construct A and B such that n(A)> n(B); n(A)>0 and n(B)>0 is =
2
Number of ways to construct A and B such that n(A) n(B); n(A)>0 and n(B)>0 is
2    2   
2 2
n
1  2n
Cn  1 n
1  2n
Cn  1
=
2
 2n
Cn  1  =
2
(xv)For a one – one into mapping to exist from A to B
If we want a oneone and into function to exist from A to B, then 0<n(A)<n(B)
Proceeding in the same way as in above problem, we get
2   
n 2 2n
1  Cn  1
Total no. of ways =
2

Counting Number of rectangles and squares:

Consider a 4  3 grid as shown here.There are 5 vertical lines and 4 horizontal lines, constituting 4 units of
length and 3 units of breadth.
Number of Rectangles:
To get a rectangle, we just need two horizontal lines and two vertical lines
4
 From 4 horizontal lines, 2 can be chosen in C2 ways
5
 From 5 vertical lines, 2 can be chosen in C2 ways
 Number of rectangles possible = 4 C2 5 C2
n  n  1
Also n C2   1  2  3  .........   n  1
2
 5C2  1  2  3  4  and 4 C2   1  2  3
⇒ Number of rectangles possible = ( 1 + 2 + 3 + 4)(1 + 2 + 3)
Note: This method will not work, if we ask number of rectangles whose
length is prime number and breadth is an odd number etc.
Suppose we want to find number of rectangles of dimension 3by2 i.e. length 3 units and breadth 2 units.
Length: Breadth:
Length of 3 units can be chosen in any of the following Breadth of 2 units can be chosen in any of the
ways following ways
 by choosing 4 consecutive vertical lines, we get a  By choosing 3 consecutive vertical lines we can
length of 3 units (1234, 2345 i.e. 2 ways) get a breadth of 2 units (123, 234 i.e. 2 ways).
 by choosing 3 consecutive sides (abc, bcd) i.e. 2  By selecting 2 consecutive sides (pq, qr i.e. 2
ways) ways).
 Number of ways to chose a length of 3 units = 2  Number of ways to get a breadth of 2 units is = 2
Since choosing lengths and breadths are independent of each other
 Number of rectangles of dimension[3  2] is = 2  2
Similarly, let’s count all the possible cases now:
Dimension No. of ways No. of rectangles  Total no. of rectangles

LALPUR Campus, Circular Road, Lalpur, Ranchi-834001. Ph. 7488408051, 8235071441 Page 38
DORANDA Campus, Opp. Eylex Cinemas, Hinoo, Ranchi-834002. Ph. 6201469038, 8092071442
www.brothersacademy.co.in Permutations and Combinations

Length Breadth = (4 + 3 + 2 + 1)(3 + 2 +1)

1 1 
4 3
1 2 4 2 4(3+2+1)
1 3 4 1
2 1 3 3
2 2 3 2 3(3+2+1)
2 3 
3 1
3 1 2 3
3 2 2 2 2(3+2+1)
3 3 2 1
4 1 1 3
4 2 1 2 1(3+2+1)
4 3 1 1
Similarly number squares
Dimension No. of Squares  Number of squares
Length Breadth  4 3  3 2  21
1 1 43
 12  6  2
2 2 3 2
3 3 2 1  20
Illustration: In above grid, we want to find number of rectangle whose
(i)length and breadth are even numbers
(ii)length and breadth are odd numbers
(iii)length is prime but breadth is odd
Solution:
(i)possibilities of length = 2 or 4 units (3 or 1 ways)
possibilities of breadths = 2 units = (2 ways)
 Dimensions possible = {2, 4}by{2} i.e. (2by2) or (4by2)
Number of rectangles = (3 + 1)  (2) = 8
(ii)possible dimensions = { 1,3 }  {1,3}
 Number of rectangles = (4 + 2)  (3 + 1)= 6  4 = 24
(iii)possible dimensions = {2,3}  {1,3}
 Number of rectangles = ( 3 + 2)  (3 + 1) = 5  4 = 20
Illustration: Find the number of rectangles on a chessboard which are not squares
Answer: Number of rectangles = C2  C2  3636  1296
9 9

Number of squares = 12  22  .......  82  204

 Required answer = 1296 – 204 = 1092
Illustration: On a chessboard, find the number of ways to
(i)select 2 smallest squares such that they have exactly 1 side in common
(ii)select 2 smallest squares such that they have exactly one corner in common
(iii)select 3 smallest squares such that they have exactly 3 corners in common
(iv)select 2 smallest squares such that they lie along a diagonal line
(v)place 2 ministers of same color such that they do not attack each other
(vi)place 2 ministers of same color such that they do not attack each other
(vii)place 2 horses of different colors such that they attack each other
Solution: (as a column)
(i)select 2 smallest squares such that they have exactly 1 side in common
MethodI:
On every row, there are 8 squares out of which 2 consecutive squares can be chosen in 7 ways
 Number of ways = 7  8  7  8 = 56 + 56= 112
MethodII:
If two smallest squares(i.e. of dimension 1by1) have exactly 1 side in common, then they must form a rectangle

LALPUR Campus, Circular Road, Lalpur, Ranchi-834001. Ph. 7488408051, 8235071441 Page 39
DORANDA Campus, Opp. Eylex Cinemas, Hinoo, Ranchi-834002. Ph. 6201469038, 8092071442
www.brothersacademy.co.in Permutations and Combinations

of dimension 1by2 or 2by1

No. of rectangles of dimension 1by2 i.e. are = 87
No. of rectangles of dimension 2by1 are = 78
Hence, total no. of ways = 87+78=112
MethodIII:
No. of sides which can actually become the common sides of two smallest squares = 782=112
Corresponding to each of the side counted above, there will be exactly one pair of squares of dimension 1by1.
(ii)select 2 smallest squares such that they have exactly one corner in common
MethodI:
In every square of dimension 2by2 we get 2 pairs of squares such that they have one
corner in common.
Number of ways = 2  [Number of squares of dimension 2by2 ]= 2  49 = 98
Method–II:
To find smallest squares having one corner in common, we must find number of ways to
select 2 consecutive squares on a diagonal line.
Total number of pair of squares having one corner in common
  2 6  5  4  3  2  1   7    2  6  5  4  3  2  1   7   27  6 7  2  49  98
 
parallel to diagonal AC parallel to diagonal BD

Method–III:
Consider the corner which is actually going to be common. There are 49 corners which
are capable of being common to two smallest squares. Corresponding to each one of the
49 corners, there are two pairs of squares possible
 Number of ways = 49  2 = 98
(iii)select 3 smallest squares such that they have exactly 3 corners in common
Consider the figurewhere middle square is fixed. There are 6 triplets having 2 corners common.
And we can fix Middle Square like this on a chessboard in 36 ways.
 Number of ways = 36  6 = 216 ways [WRONG]
We have missed 24 cases, which are left for the student to identify
Final answer = 216 + 24 = 240
Hint: Can’t we fix a square in 1st row or last row or 1st column or last columns
(iv)select 2 smallest squares such that they lie along a diagonal line
On the chessboard, there are 2–principle diagonals containing 8 squares each(AC and
BD).
Then, there are diagonals parallel to AC and BD as can be seen in the figure.
Number of ways  2 8C2  4  7 C2  6 C2  .......  2 C2 
 2.8 C2  4.8 C3  2  8 C3  9 C3 

(v)place 2 elephants of different colors such that they do not attack each other
64
Total number of ways to place 2 elephants = C2 2!
Number of ways to place 2–elephants when they attack each other = 2 8  C2 2!
8

[place the elephants in same row or same column]

 Required answer = 2! 64 C2  16  8C2 
(vi)place 2 ministers of different color such that they do not attack each other
Number of ways to place 2 ministers such that they attack each other
   
 2! 16 8 C2  2  8 C2   4  7 C2  6 C2  ....  2 C2   2! 18. C2  4. C3
8 8

 Required number of ways = 64 P2  2!18.8 C2  4.8 C3 

(vii) place 2 horses of different colors such that they attack each other
Consider a 2by3 rectangle. As can be seen in the figure, two horses can attack each other in 2
ways.Similarly we will get 2 ways in a 3by2 rectangle also.
 Number of ways when 2 horses will attack each other
2  [Number
= LALPUR Campus, CircularofRoad,
of rectangles Lalpur,
size 2by3 2
Ranchi-834001.
or 3by2] Ph. 7488408051, 8235071441 Page 40
= 2 DORANDA
[7  6]  2= 6  42
Campus, = 252
Opp. Eylex Cinemas, Hinoo, Ranchi-834002. Ph. 6201469038, 8092071442
www.brothersacademy.co.in Permutations and Combinations

Division/Distribution of things into groups:

Please read the following examples and their explanations to understand which type of problems can / should
be solved by using this topic.
Eg.1: No. of ways to divide 52 cards among 4 players such that they get 13,14,15,10 cards in any order.
Eg.2: No. of ways to distribute 10 books of different subjects among 3 persons A,B and C such that A,B & C get
2,3 & 5 books respectively.
Eg.3: No. of ways to fill 3 boxes of same shapes and sizes using 20 copies of same book.
Eg.4: No. of functions which exist from A={1,2,3,4,5,6} to B={1,2,3} such that every element in set B is image
of exactly two elements in A.

Question: What is common in all the above examples?

Answer:Distribution of things among groups. How?...Keep Reading..
Explanations:
Eg.1: 52 cards (52 different things) have to be distributed among 4 persons(4 different groups) in such a way
they get 10,13,14,15 cards in any order(i.e.every person has equal chances of getting 10 or 13 or 15 or
14 cards).
Eg.2: 10 books of different subjects (10 different things) have to be distributed among 3 persons (3 different
groups)(A,B & C)such that A,B & C get 2,3 & 5 books respectively.Also note that the exact way of
distribution is told i.e. its is know that which peson will get exactly how many things.
Eg.3: 20 copies of same book(20 identical things) have to be distributed among 3 boxes of same shape and
size(3 identical groups).Also it is not known about the way of distribution i.e. the boxes may contain
any no. of books(no. of things in groups is not fixed.)
Eg.4: Elements of set A can be thought of as numbered balls and that of B can be thought of as numbered
boxes.Now 6 numbered balls(6 different things) have to be equally distributed into 3 numbered
boxes(3 different groups) .Also the way of distribution is known i.e. we know the no. of things in boxes.

From above examples we can conclude that, in problems of this type:

 The way of distribution may or may not be known i.e. we may or may not know about the no. of things
contained in groups.
 The things given may be identical or different.
 The groups specified may be identical or different.
Hence the above topic can be categorized as follows:
(i)When the way of distribution is fixed (ii)When the way of distribution is not fixed
(no. of things in groups is fixed) (no. of things in groups may vary)
(a) things are different , groups are identical (a) things are different , groups are identical
(b) things are different , groups are different (b) things are different , groups are different
(c) things are identical , groups are identical (c) things are identical , groups are identical
(d) things are identical , groups are different. (d) things are identical , groups are different.
Eg.1: No. of ways to distribute 10 balls of same size and color among four identical boxes containing 1,2,3 and
4 things.(Case (I)c )
Eg.2: No. of ways to distribute 10 balls of same color among four boxes of different colors containing 1,2,3
and 4 things . (Case (I)d )
Eg.3: No. of ways to distribute 10 balls of different colors in 3 boxes of same shape and size.(Case (II)a )
Eg.4: No. of ways to distribute 10 balls of different colors in 3 boxes of different sizes. (Case (II)b )
Hoping that we have understood the subtleties of the different cases let’s start to discuss the cases one by one.
Standard Notation which will be used in the forthcoming problem
mnp  Means that (m+n+p) things have to be distributed or divided among three groups
containing m, n, p things.
m p  For nature of things and groups v.i.z. whether or not they are different or identical,
n
please refer to the case mentioned above the question(s).

LALPUR Campus, Circular Road, Lalpur, Ranchi-834001. Ph. 7488408051, 8235071441 Page 41
DORANDA Campus, Opp. Eylex Cinemas, Hinoo, Ranchi-834002. Ph. 6201469038, 8092071442
www.brothersacademy.co.in Permutations and Combinations

CaseI: When the way of distribution is fixed

Case(I)a: When the way of distribution is fixed & things are different
but groups are identical.
1) !
 Ans. = ! ! = C C = C C
4
 When we select 1 thing out of 4 things, then 3 things are automatically
1 3 left behind.Hence the answer is same as number of ways of selecting 3
things/1thing out of 4 different things.
2)  Ans. = C C C =
!
6 ! ! !
 Explanation:From 6 different things,we can select our first group
in C ways and then from remaining 5 things second group
1 3 containing 3 things can be selected in C ways,leaving behind the
2 third group containing 2 things.
3)  Ideal Ans. = C C =
!
=6
4 ! !

!
2 2  Real Ans. = =
! ( !) !

Explanation: For this question, assuming that the 4 different things are a,b,c,d,lets look at the 6 ways as in ideal
answer.
S.No. One Group Other Group Analysis
1 a,b c,d Looking at these 6 ways (as also in ideal answer), we can easily ascertain that
2 a,c b,d there is no difference between distributions 1 and 6(as groups are
3 a,d b,c identical).Similarly for 2,5 and 3,4 also. Hence there is an extra 2! In the
4 b,c a,d denominator of the real answer.
5 b,d a,c
4)  Ideal Ans. = C C C =
!
6 ( !)

!
2 2  Real Ans. = !
= ( !) !
2
Explanation: Let’s try to explain our ideal answer . According to answer first we can select our first group (say
G1) of 2 things in C ways.Then our second group (say G2) of 2 things can be selected from remaining 4
things in C ways ,thus leaving behind our last group(say G3) also of 2 things.
But wait, as mentioned in the above case the groups are identical.Hence instead of selecting the same
groups in order G1 G2 G3,we can also select them in order G3 G2 G1 and still, same distribution will be
produced.That is why we get an extra 3! In denominator of our real answer ,because G1 ,G2 and G3 can be
arranged in 3! Ways.
 Assume 6 things are a,b,c,d,e,f. Now in our ideal answer there are 3 terms.Lets look at two sample
distributions from our ideal answer.

Ideal Ans. C (First Term) C ( 2nd Term) C (3rd Term)

1. a,b c,d e,f

2. c,d e,f a,b

Now look at distributions 1 and 2 (above) from our ideal answer .If groups are identical then there is no way to
differentiate between them i.e. they are identical distributions.Hence the answer.

LALPUR Campus, Circular Road, Lalpur, Ranchi-834001. Ph. 7488408051, 8235071441 Page 42
DORANDA Campus, Opp. Eylex Cinemas, Hinoo, Ranchi-834002. Ph. 6201469038, 8092071442
www.brothersacademy.co.in Permutations and Combinations

Note:The difference between questions 2 and 4 is that in Q2, atleast the number of things in each group was
different .Hence even if the groups were identical then also there was a way to differentiate among them based
on the no. of things contained in each of them.(Hence 3! in denominator of Ans to Q2. is not present)
The following questions now can be easily answered…
5) 6) 7)
24 10

4 6 2 2
4 6 2 2
4 2
! ! !
Ans. = Ans. = ( !) ( !) ! Ans. = (
( !) ( !) ! ! !) !

Case(I) b : When the way of distribution is fixed & things are

different , groups are different.
 When we switch from previous case to this case then the identical groups in previous case become different
in this case.To tackle different groups now we can start to also consider ordering between different groups.
 Situational Example: No. of ways to distribute 4 different chocolates among two persons such that one of
! !
them gets 1 and the other gets 3 is equal to ∗ 2!. Here is the no. of ways to generate two groups
! ! ! !
relatively identical containing 1 and 3 chocoloates, and 2! is the no. of ways to give these groups to two
persons(because it is not said that which person will get 1 and which one will get 3 chocolates.). Hence the
answer.
 The following questions should be easy now..(remember the abovementioned case )
1) 2) 3) 4)
4 6 4 6

1 3 2 2 2 2
1 3
2 2
4! 6! 4! 6!
Ans. = × 2! Ans. = × 3! Ans. = × 2! Ans. = × 3!
3! 1! 1! 2! 3! (2!) 2! (2!)
5) 6) 7) 8)
24 40 20 20

4 6 10 9 4 5 2 6
4 6 9 10 1 5 3 5
4 2 5 4

24! 40! 20! 20!

Ans. = 5! Ans. = 5! Ans. = × 5! Ans. = × 5!
(4!) (6!) 3! 2! (10!) (9!) 2! (5!) (4!) 2! 3! 4! 5! 6!
 Some of the students argue with different answers for questions 3,4,5 and 6.
! !
 A sample answer from students for Q5) is equal to × .They argue that there are 5 groups
( !) ( !) ! ! ! !
out of which 3 are of one type and 2 of another.
 For the subject’s defense I have only one line:”The quantity of things might be same but the quality of
things is still different.(Remember that we had different things)”.

LALPUR Campus, Circular Road, Lalpur, Ranchi-834001. Ph. 7488408051, 8235071441 Page 43
DORANDA Campus, Opp. Eylex Cinemas, Hinoo, Ranchi-834002. Ph. 6201469038, 8092071442
www.brothersacademy.co.in Permutations and Combinations

Extra Question:No. of ways to distribute 40 things among a group of 3girls and 2 boys such that the girls get 10
!
things each and the boys get 5 each is equal to ( !) ( !) ! ! × 3! 2! .(Why?)

Case(I) c : When the way of distribution is fixed & things are

identical ,groups are identical.
1) 2) 3) 4)
4 6 4 6

1 3 2 2 2 2
1 3
2 2
Ans. = 1 Ans. = 1 Ans. = 1 Ans. = 1
5) 6) 7) 8)
24 40 20 20

4 6 10 9 4 5 2 6
4 6 9 10 1 5 3 5
4 2 5 4
Ans. = 1 Ans. = 1 Ans. = 1 Ans. = 1

Case(I) d : When the way of distribution is fixed & things are

identical ,groups are different.
1) 2) 3) 4)
4 6 4 6

1 3 2 2 2 2
1 3
2 2
Ans. = 2! Ans. = 3! 2! 3!
Ans. = =1 Ans. = = 1
2! 3!
5) 6) 7) 8)
24 40 20 20

4 6 10 9 4 5 2 6
4 6 9 10 1 5 3 5
4 2 5 4
5! Ans. =
!
5!
Ans. = ! ! Ans. = Ans. = 5!
2! 3! 3!
Illustration: Find the number of ways to distribute 12 balls equally among 4 boxes if
(i)balls are different but boxes are identical
(ii)balls are different and boxes are different
(iii)balls are identical but boxes are different
(iv)balls are identical and boxes are identical
Solution: Here balls can be thought of as things and the boxes can be thought of as groups.
12! 12!
(i) (ii)  4!
3! 4! 3! 4!
4 4

(iii)1 (iv) 1

LALPUR Campus, Circular Road, Lalpur, Ranchi-834001. Ph. 7488408051, 8235071441 Page 44
DORANDA Campus, Opp. Eylex Cinemas, Hinoo, Ranchi-834002. Ph. 6201469038, 8092071442
www.brothersacademy.co.in Permutations and Combinations

Illustration: In who many ways can 15 different things be divided

(i)equally among 3 identical groups
(ii)equally among 5 persons
(iii)among 5 numbered boxes such that 1st box gets i things ( I = 1,2,3,4,5)
(iv)among 10 persons such that exactly 9 persons get 1 thing each
(v)among 3 boys and 3 girls such that boys get 2 things each and girls get 3 things each
Answers:
15! 15!
( i) (ii)  5!
5! 3! 3! 5!
3 5

15! 15!
(iii) 1 (iv)  10!
1!
9
1!2!3!4!5! 6!9!
10!
(v)  3!3! 
3! 2!
3 3
3!3!
Now we move towards one of the most conceptually mis–understood topic of P&C:
Usage of multinomial expansion in finding out solutions to questions of P&C.
But, before we start please remember the following points:
1) Usage of multinomial expansion is very helpful in solving a lot of very difficult questions. But the calculations
are more as compared to some other alternative (limited) methods.
2) So first we’d discuss those kinds of problems where we can find solutions to problems without using
multinomial expansion.
3) Then we’d discuss multinomial expansion and its applications to problems in P&C.
3)All the topics which we have studied previous to this are very much required to understand the forthcoming
problems and theory completely. So its advised not to skip any topic.

Case(II) d : When the way of distribution is not fixed & things are
identical but groups are different.
Illustration: Find the no. of ways to divide 5 identical balls among 2 persons.
Solution:
Since the way of distribution is not fixed, hence we have to consider every possible case. The cases are as
follows :( Assuming that the two persons are A and B)
No. of things No. of things No. of ways to perform the distribution
A gets B gets
DISTRIBUTION

0 5 1  Since in every Distribution, it is fixed about the no. of

1 4 1 things A and B may get.
2 3 1  If we have 5 balls of same color then we can give 1 of them
3 2 1 to A and 4 of them to B in only 1 way.
4 1 1
5 0 1
Hence the answer = 6 ways.
Observation: We can clearly see that, all we are counting is the number of possible DISTRIBUTIONS
A Problem: In the above question we counted the no. of cases, but it would not be practically possible to count
all possible cases in every question of this type. Hence there is a strong need to develop a step by step logical
approach to address these kinds of problems.
Remember: We will solve such problem by using 3 methods.
Illustration: Find the number of ways to distribute 4 identical balls among 3 persons.
Solution:All we need to do in this question is devise a technique to split 4 amongst 3 different groups (any
group may have any no. of things).
Method–I: Method – II:
Imagine that each of the 4 identical balls are The overall objective of the question is to split

LALPUR Campus, Circular Road, Lalpur, Ranchi-834001. Ph. 7488408051, 8235071441 Page 45
DORANDA Campus, Opp. Eylex Cinemas, Hinoo, Ranchi-834002. Ph. 6201469038, 8092071442
www.brothersacademy.co.in Permutations and Combinations

represented by a B. Hence, we have BBBB and we 4identical balls among 3different persons.
have to distribute them into 3different groups. So, supposing that our
First person gets ‘p’ balls
No. of ways to distribute 4 identical balls among 3 Second person gets ‘q’ balls
persons Third person gets ‘r’ balls
is same as Hence, we have to find the number of ways in which
No. of different arrangements of BBBB↕↕ in a row p+q+r can become equal to 4, where p,q,r can take
any non negative integral value(non–negative means
Explanation:
eitherpositive or zero)
 ↕ is used for separating the row containing BBBB
No. of ways to distribute 4 identical balls among 3
(4identical balls) into 3 parts(groups)
persons
 Every different arrangement of BBBB↕↕ will give
is same as
rise to a new DISTRIBUTION, because to divide a
No. of non–negative integral solutions of equation
row into 3 parts we effectivelyneed only two
p+q +r=4.
lines. These Bars will act as Separators of the
different groups .
Now, we have to solve the equation p+q+r= 4,
 Let’s take a look at some of the sample
which can be done in the following way:
ARRANGEMENTS and their corresponding
DISTRIBUTIONS. (Assuming that three persons  Write 4 in form of four 1’s and also take two +
in the question are P,Q and R) signs (as we can see that our equation contains
two of them). Following in same way as in
S.No. ARRANGEMENT DISTRIBTUTION
method I we can say that
P Q R
1 BBBB↕↕ 4 0 0 No. of ways to distribute 4 identical balls among 3
2 BB↕B↕B 2 1 1 persons
3 B↕BB↕B 1 2 1 is same as
4 BB↕↕BB 2 0 2 No. of non–negative integral solutions of equation
5 ↕B↕BBB 0 1 3 p+q +r=4
 Arrangement 3(in above table) means that P gets is same as
1 Ball, Q gets 2 Balls and R gets 1 Ball. Number of different arrangements of 1111++ in a
Number of ways to give 1 ball to P is =1 row
Number of ways to give 2 balls to Q is =1
Number of ways to give 1 ball to R is =1 Hence, required number of ways =
 4  2 !
 Arrangement 5(in above table) means that P gets 4!2!
0 Balls, Q gets 1 Ball and R gets 3 Balls.
Observation: If this method is same as previous method then why did we study it?The reason will become clear
from the following problems.
Illustration: Find the no. of integral solutions of the following equations:
1) a +b + c = 10 {a,b,c are non negative }
2) p + q + r + s = 15 {p,q,r,s are positive integers}
3) x + y + z = 10 {x>–1,y>–2,z>–3}
4) a + b + c < 10 {a,b,c are non negative }
5) 8 < p + q + r + s < 15 {p,q,r,s are positive integers}
Solutions:
1)a +b + c = 10 {a,b,c are non negative }
The method to solve this type of problem is already discussed above.
( )!
Hence, the required number of ways =
! !

2)) p + q + r + s = 15 {p,q,r,s are positive integers}

Here p ≥1 ; q ≥ 1 ; r ≥ 1 ; s ≥ 1.
We can solve these kinds of questions very easily if the variables are non–negative. But here it is not so.
However we can convert it to meet our requirements:

LALPUR Campus, Circular Road, Lalpur, Ranchi-834001. Ph. 7488408051, 8235071441 Page 46
DORANDA Campus, Opp. Eylex Cinemas, Hinoo, Ranchi-834002. Ph. 6201469038, 8092071442
www.brothersacademy.co.in Permutations and Combinations

p  1 p  1  0 p1  0 p  1  p1 
q  1 q  1  0 q  0  
     1  q  1  q1 
    , where  
r  1  r  1  0  r1  0  r  1  r1 
s  1  s  1  0  s  0  s  1  s 
 1   1 

Number of integral solutions of p + q + r + s = 15 {p,q,r,s are positive integers}

is same as
Number of integral solutions of p1 + q1 + r1 + s1 = 19 [p1,q1,r1,s1≥0]
( )!
Hence, the required number of ways = ! ! [Arrange 19‘1’s’ and 3‘+’ signs in a row]
( )!
3)Proceeding similarly as in previous question, answer = ! !

4)For this question , we introduce a dummy variable in the original equation:

No. of non–negative solutions of equation a + b + c < 10
is same as
No of non–negative solutions of equation a + b + c + d = 9{d ≥ 0}
Because as the values of d change, we get all possible cases.
For eg.
 When d = 0, then we get solutions of a + b + c = 9
 When d = 1, then we get solutions of a + b + c = 8
 When d = 2, then we get solutions of a + b + c = 7
 When d = 3, then we get solutions of a + b + c = 6…and so on.
( )!
Hence the answer = [Arrange 9×1’s and 3 + signs in a row]
! !
(14+3)! (8+3)!
5)Following the same approach as in previous question we get answer = −
14! 3! 8! 3!

Coefficient of xn in the expansion of (1+x)n:

We know that (x+y)5 = C x + C x y + C x y + C x y + C x y + C y
!
The coefficient of x2y3 in (x+y)5 is equal to C = = C .
! !
The above statement and a lot others like the one above can actually be explained by using
combinations/(permutations with repetitions).
Observe that in (x+y)5…
 (x + y) is multiplied 5 times with itself.
 The degree of every term in the resultant expansion is 5.
 Is it a coincidence?? Probably not…
Look at this product (x+y)5=(x+y) (x+y) (x+y) (x+y) (x+y).
When these 5 brackets multiply why every resultant term is of degree 5?
 It so happens that each of the 5 brackets participate with exactly one variable (either x or y in this case)
to make every term of the expansion. Since every one of the brackets participates with one variable
each in making every term, that’s the reason why every term is of degree 5.
 These variables after coming out of the brackets, multiply and produce different terms like the ones
containing x5, x2y3 , xy4…etc. Now to make y5 all the brackets must participate with y, which can happen
in only 1 way, hence the coefficient of y5 in the expansion is equal to 1.
 Similarly, coefficient of x2y3 will be equal to no. of different ways our 5 brackets can produce x 2y3
(because as many times our brackets produce x 2y3, that many times it will be added to itself and thus
that no. will finally become its coefficient).
 So, the big question is in how many different ways can our brackets produce x 2y3?
To produce x2y3,
 2 of the brackets should participate with an ‘x’ and

LALPUR Campus, Circular Road, Lalpur, Ranchi-834001. Ph. 7488408051, 8235071441 Page 47
DORANDA Campus, Opp. Eylex Cinemas, Hinoo, Ranchi-834002. Ph. 6201469038, 8092071442
www.brothersacademy.co.in Permutations and Combinations

 3 brackets must participate with a ‘y’.

MethodI: MethodII:
No. of ways in which the 5 brackets can produce x2y3 No. of different ways our brackets can produce x2y3
is = C = C is same as
Explanation: No. of different ways to arrange xxyyy in a row,
 Out of 5 given brackets, 2 of them can be because every different arrangement will give rise to a
selected in C ways. new way of participation.
 Now from the selected 2 brackets, ‘x’ can be For e.g. Arrangement xyyxy means that the
taken from each of them in 1 way. 1st,2nd,3rd,4th and 5th brackets participate with x,y,y,x
 From the remaining 3 brackets, we can select and y respectively.
!
‘y’from each of them in 1 way. Hence, total number of ways = ! ! = C = C .
Now is the time that we should wait and ponder on how easily the following results can be explained:
!
 Coefficient of x2y3z5 in (x+y+z)10 =
! ! !
!
 Coefficient of x2y3z5 in (x2y+3z)10 = (−2) 3 ! ! !
!
 Coefficient of x2y3z5 in (2x3y+4z5)16 = 2 (−3) 4 (−5) ! ! ! !
2 3 4 21!
 Coefficient of a b2c3 d4 e5 f6 in (a+3b+5c+7d+11e+13f)21 = 3 5 7 115 136
1!2!3!4!5!6!

Now if we are able to do so many question so easily then why do we need a third method. It is because if
someone asks us to find the no. of non–negative integral solutions of equation x + y + z = 10 {0≤ x, y, z ≤ 8},
then none of the above two methods will be very effective.
 Such questions where the variables(x,y,z) also have an upper limit (like x8), should be done by using
multinomial expansion.
 [In some specific questions we can use substitutions like 8–x=a;8–y=b;8–z=c to get a, b, c ≥0.
 However please remember that such substitutions might not yield the correct answer always.]
 This brings us to method III which is as follows:
Original Question: Find the number of ways to distribute 4 identical balls among 3 persons.
Method – III:
No. of ways to distribute 4 identical balls among 3 persons.
is same as
No. of non–negative integral solutions of equation p + q + r = 4.
is same as
Coefficient of x4 in (1+x+x2+x3+x4)3
Explanation:
The equation p+q+r=4 x pq  r  x 4 (Raising both sides as powers/exponents of ‘x’)
     
 x 4  x p  xq  xr
Hence, the number of ways in which p,q,r can be added to get 4
is same as
The number of ways in which x ; x and x can be multiplied to get x 4
p q r

Possible values of p = 0,1,2,3,4

Possible values of q = 0,1,2,3,4
Possible values of r = 0,1,2,3,4

If we use method II, then we will add four 1’s using two ‘+’ signs. Now, adding four 1’s to get 4 is same as
multiplying four x’s to get x4 : the only difference is that the ones instead of getting added as bases will now be
added in exponents of x(= DUMMY Variable). So here we will put various possible values of p,q andras
powers/exponents of x.

Hence, the number of ways in which p,q,r can be added to get 4

is same as
The number of ways in which x p ; x q and x r can be multiplied to get x 4

LALPUR Campus, Circular Road, Lalpur, Ranchi-834001. Ph. 7488408051, 8235071441 Page 48
DORANDA Campus, Opp. Eylex Cinemas, Hinoo, Ranchi-834002. Ph. 6201469038, 8092071442
www.brothersacademy.co.in Permutations and Combinations

is same as
Coefficient of x4  0


1


2

 
3


4

in x  x  x  x  x x  x  x  x3  x 4 x0  x1  x2  x3  x 4
0

 
1


2


 
Bracket representing possible Bracket representing possible Bracket representing possible
values of 'p' as powersof x valuesof 'q' aspowersof x valuesof 'r' as powersof x

 In above product, the exponents of variable x in 1st, 2nd and 3rd brackets represents the possible values of
p,q and r.
 Let’s talk about the multiplication of the three brackets above:
In this multiplication,
 Each of the 3 brackets will participate with exactly one variable(1 or x or x2 or x3 or x4)
 The coefficient of x4 in the above product
is same as
The no. of ways to get x by multiplying one variable(1/x2/x3/x4 /x5) from each bracket.
4

 Also when these variables multiply then their exponents add(which are possible values of p,q,r).
 So in totality, finding the coefficient of x4 in the multiplication of the above 3 brackets
is same as
The number of ways to get 4 by adding p,q and r getting added.
Illustration: Try to generate the multinomial expansions for the following:
(1)x1 +x2 + x3 = 10{xi ≥ 0, i=1,2,3}
(2)x1 +x2 + x3+x4+x5 = 20{xi ≥ 1, i=1,2,3,4,5}
(3)x1 +x2 + x3 = 10{xi ≥ i, i=1,2,3}
(4)x1 +x2 + x3 = 15{0 ≤xi ≤ i2, i=1,2,3}
(5)x1 +2x2 + 3x3 = 20{xi ≥ 0, i=1,2,3}
Solution:
(1)x1 +x2 + x3 = 10{xi ≥ 0, i=1,2,3}
Possible values of x1 are 0,1,2,3,….10(no upper limit)
Possible values of x2 are 0,1,2, 3, 4,….10(no upper limit)
Possible values of x3 are 0,1,2,3, 4, 5,….10(no upper limit)
Hence answer is coefficient of x10 in (x0+x+x2+x3+…..+x10) (x0+x1+x2+x3+… +x10)(x0+x1+x2+x3+… +x10)
=coefficient of x10 in (x0+x+x2+x3+…..+x10)3
= coefficient of x10in (x0+x1+x2+…..+x10+x11+x12+…)3(WHY??)
= (Solving will be taught later)
(2)x1 +x2 + x3+x4+x5 = 20{xi ≥ 1, i=1,2,3,4,5}
Possible values of x1 are 1,2,3,….16
Possible values of x2 are 1,2, 3,….16
Possible values of x3 are 1,2, 3,….16
Possible values of x4 are 1,2, 3,….16
Possible values of x5 are 1,2, 3,….16
Hence answer is coefficient of x20 in (x1+x2+x3+…..+x16) (x1+x2+x3+… +x16)…….(x1+x2+x3…..+x16)
=coefficient of x20 in (x1+x2+x3+…..+x16)5
=coefficient of x20 in x5(x0+x1+x2+x3+…..+x15)5
=coefficient of x 205 in(x0+x1+x2+x3+…..+x14)5
=coefficient of x15 in (x0+x1+x2+x3+…..+x14+x15+x16+….)5
= (Solving will be taught later.)
(3)x1 +x2 + x3 = 10{xi ≥ i, i=1,2,3} i.e. x 1  1;x 2  2;and x 3  3
Possible values of x1 are 1,2,3,4,5
Possible values of x2 are 2, 3, 4,5,6
Possible values of x3 are 3, 4, 5,6,7
Hence answer is coefficient of x10 in (x+x2+x3+x4+x5) (x2+x3+x4+… x6)(x3+x4+x5…..x7)
= coefficient of x10 in x6(1+x+x2+x3+x4) (1+x+x2+x3+x4)( 1+x+x2+x3+x4)
= coefficient of x10 in x6(1+x+x2+x3+x4)3
= coefficient of x4 in (1+x+x2+x3+x4)3
= coefficient of x4 in (1+x+x2+x3+x4+x5+x6…..)

LALPUR Campus, Circular Road, Lalpur, Ranchi-834001. Ph. 7488408051, 8235071441 Page 49
DORANDA Campus, Opp. Eylex Cinemas, Hinoo, Ranchi-834002. Ph. 6201469038, 8092071442
www.brothersacademy.co.in Permutations and Combinations

= (Solving will be taught later.)

(4) x1 +x2 + x3 = 15{0 ≤xi ≤ i2, i=1,2,3}i.e. 0x11;0x24;0x39
According to the given condition
Possible values of x1 are 0,1
Possible values of x2 are 0,1,2,3,4
Possible values of x3 are 0,1,2,3,4,….9
Hence, number of solutions
= coefficient of x15 in (1+x)(1+x+x2+x3+x4)(1+x+x2+ x3…..x9)
(5) x1 + 2x2 + 3x3 = 20{xi ≥ 0, i=1,2,3}
Assume x1 = y1 , 2x2 = y2 and 3x3 = y3
Then the question becomes y1 + y2 + y3 = 20
Also xi0yi0
Possible values of y1 are 0,1,2,3,….20
Possible values of y2 are 0,2,4,6,8,…20
Possible values of y3 are 0,3,6,9,..18
Hence,number of solutions
= coefficient of x20 in (1+x+x2+x3+x4…..x20) (1+x2+x4+….. x20)(1+x3+x6+x9+…..x18).
= coefficient of x20 in (1+x+x2+x3+x4…..) (1+x2+x4+….. )(1+x3+x6+x9+…..).

Multinomial Theorem:
Let x1, x2,...,xm be integers. Then number of solutions to the equation
x1  x2  ...  xm  n …. (1)subject to the condition a1  x1  b1 , a2  x2  b2 , ..., am  xm  bm …. (2)
is equal to
   
coefficient of xn in x a1  x a1 1  ...  x b1 x a2  x a2 1  ...  x b2 ... x am  x am1  ...  x bm …. (3)
  

Bracket representing possible Bracket representing possible Bracket representing possible
values of x1 as powers of x values of x2 as powers of x values of x m as powers of x

This is because the number of ways, in which sum of m integers in (1) equals n,
is the same as
the number of times xn comes in (3).
– + −
A Result: coefficient of x in the expansion of 1– x is =
Explanation:
We know that
n(n − 1) (n)(n − 1)(n − 2)
(1 + x) = 1 + nx + x + x + ⋯ xC; nQ
2! 3!
Replacing x(x) and n(n), we get
(−n)(−n − 1) (−n)(−n − 1)(−n − 2)
(1 − x)−n = 1 + (−n)(−x) + (−x)2 + (−x)3 + ⋯
2! 3!
n(n + 1) n(n + 1)(n + 2) n(n + 1)(n + 2) … (n + r − 1)
= 1 + nx + x + x + ⋯…+ x +⋯
2! 3! r!

n+1
(1 − x) = 1 + nx + C2 x + n+2C3 x + ⋯ + n+r−1Cr x + ⋯ 
Illustration: Manideep, Vijayendhra and Lakshman have 6,7 and 8 one rupee coins respectively. In how many
ways can they collectively loan Rs.10 to their friend Viswavardhan?
Solution: The number of ways in which they can denote Rs. 10
is same as
Number of integral solutions of x1 + x2 + x3 = 10[x1∈ [0,6]x2 ∈ [0,7]x3∈ [0,8]]
 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

LALPUR Campus, Circular Road, Lalpur, Ranchi-834001. Ph. 7488408051, 8235071441 Page 50
DORANDA Campus, Opp. Eylex Cinemas, Hinoo, Ranchi-834002. Ph. 6201469038, 8092071442
www.brothersacademy.co.in Permutations and Combinations

= coefficient of x10 in (1 – x7 – x8 – x9) (1 + 3C1x + 4C2x2 + 5C3x3 + ... +12C10x10+…….)

= 12C2 – 5C3 – 4C2 – 3C1 (Neglecting powers of x higher than 10 as we are only interested in x 10)
= 66 – 10 – 6 – 3 = 47.
Different Cases of multinomial Theorem:

Case – I :If upper limit of a variable is more than or equal to the sum
required and lower limit of all the variables are non–negative, then
upper limit of that variable can be taken as infinity.
Illustration: In how many ways the sum of upper faces of four distinct dies can be six.
Solution: Required number of ways
is same as
The number of integral solutions of x1 + x2 + x3+ x4 = 6 [1  x1, x2, x3, x4 6]
The upper limit of each variable is 6, which is also equal to the sum required; hence it can be taken as infinity.
Hence, number of solutions = coefficient of t6 in (1 + t + t2 + …. )4
= coefficient of t6 in (1– t)–4 = 6 + 4 –1C4–1 = 9C3 = 84 .

Case– II: When coefficients of variables are not unity

The number of solutions of ax1 +bx2 +cx3 = n, [a1 x1b1 , a2 x2 b2 , a3 x3 b3]
= coefficient of tn in


 x    x   ......   x     x    x   ......   x     x    x   ......   x  
a
a1
a
a1  1
a
b1
b
a2

 
b
a2 1
b
b2
c
a3
c
a3 1
c
b3

Bracket representing possiblevaluesof ax1 Bracket representing possible valuesof bx 2 Bracket representing possible va luesof cx3

Illustration: Generate an equation to find the number of ways in which Nikhil can distribute 15 identical
blankets among six beggars such that each beggar gets at least one blanket and two particular beggars get equal
blankets and another three particular beggars get equal blankets.
Solution: The number of ways of distributing blankets
is same as
The number of integral solutions of the equation, 3a + 2b+ c = 15[a,b,c  1]
= coefficient of t15 in (t3 + t6 + t9 . . .)(t2 + t4 + . . .)( t + t2+ . . )
= coefficient of t9 in (1 + t3 + t6 + t9 . . .)(1 + t2 + t4 + . . .)(1 + t + t2+ . . )
[No need to calculate further]

Case – III: When variables are distinct

To remove distinctness, we introduce some new variables.

Illustration: Thrilok has 10 identical chocolates. Find the number of ways in which he can distribute them
among his friends Rahul, Jaswanth and Akhilesh such that no two of them get same number of chocolates given
that everyone gets at least one.
Solution: Let’s assume that Thrilok’s friends Rahul, Jaswanth and Akhileshget a, b and c chocolates
respectively.
a+ b +c = 10,[ a , b, c  1 and a, b and c are distinct]

Let a < b < c and x1 = a , x2 = b –a , x3 = c – b

a+ b +c = 10,[ a , b, c  1 and a, b and c are distinct]
 + ( + ) + ( + ) = 10

LALPUR Campus, Circular Road, Lalpur, Ranchi-834001. Ph. 7488408051, 8235071441 Page 51
DORANDA Campus, Opp. Eylex Cinemas, Hinoo, Ranchi-834002. Ph. 6201469038, 8092071442
www.brothersacademy.co.in Permutations and Combinations

3x1 +2x2 +x3 = 10, [x1, x2, x3 1]

The number of integral solutions
= coefficient of t10 in (t3 + t6 + t9 . . .)(t2 + t4 + . . .)( t + t2+ . . )
= coefficient of t4 in (1 + t3 + t6 + t9 . . .)(1 + t2 + t4 + . . .)(1 + t + t2+ . . )= 5
Since three distinct numbers can be assigned to three boys in 3! ways. So, corresponding to each solution, we
have six ways of distribution. (Because we assumed a < b < c)
Hence, final answer = 5×6=30

Case – IV: When required sum is not fixed

To find the number of solutions of the equation x1 + x2 + . . . . . + xm n..(1)
We introduce a dummy variable xm+1 so that x1 + x2 + . . . . + xm+1 = n, xm+1  0…(2)
The number of solutions of (1) and (2) will be same
Illustration: Srinivas throws a die thrice and Sampath throws another die thrice. They add all the six outcomes.
Find the number of ways to obtain a sum of at most 17?
Solution: Let x1, x2,.…, x6 be the numbers that appears on the six dice.
Number of ways to get the sum less than or equal to 17
is same as
Number of integral solutions to the inequality x 1 + x2 + x3 + ... + x6 17[1 ≤ xi ≤ 6]
To solve the above inequality, we introducing a dummy variable x7(x7  0),
The inequality becomes an equation x1 + x2 + ... + x6 + x7 = 17[1  x1,x2,…x6 6 and x7 0]
 No. of solutions
= coefficient of x17 in (x + x2 +...+x6)6 (1+ x + x2 + …)
= coefficient of x11 in (1 – x6)6 (1 – x)–7
= coefficient of x11 in (1 – 6x6) (1 – x)–7 [Neglecting powers of x which are greater than 11]
= 17C6 –6 11C5 .
Note: To find the number of solutions of x1 + x2 + …. + xn n, (when the values of x1, x2, ….,xn are restricted),
first find the number of solutions of x1 + x2 + …. + xn n – 1 and then subtract it from total number of
solutions.

Examples based on Multinomial Theorem:

Illustration: In how many ways we can get a sum greater than 17 by throwing six distinct dies.
Solution: Let x1, x2, .…,x6 be the number that appears on the six dice.
Number of ways to get the sum greater than or equal to 17
is same as
Number of integral solutions to the inequality x 1 + x2 + x3 + ... + x6 ≥ 17[1 ≤ xi ≤ 6]
Total number of cases = 66
We have already calculated the number of ways to get the sum less than or equal to 17[17C11 – 611C5]
Hence number of ways to get a sum greater than 17 is = 66 – (17C11 – 611C5).
Illustration: In how many can Krishna distribute 20 identical Re 1 coins to three beggars (B1, B2, B3) such that
(i)every beggar gets at least Re.1
(ii)at least one beggar doesn’t get any coin
(iii)Bi gets at least Rs i (i = 1,2,3)
(iv)No beggar gets more than Rs.10
(v)Every beggar gets a minimum of Rs.2 and a maximum of Rs.10
Solution : Let us assume that
The beggar B1 gets x1 coins
The beggar B2 gets x2 coins
The beggar B3 gets x3 coins
Total number of coins to be distributed=20
x1 + x2 + x3 = 20
(i)every beggar gets at least Re.1

LALPUR Campus, Circular Road, Lalpur, Ranchi-834001. Ph. 7488408051, 8235071441 Page 52
DORANDA Campus, Opp. Eylex Cinemas, Hinoo, Ranchi-834002. Ph. 6201469038, 8092071442
www.brothersacademy.co.in Permutations and Combinations

Number of ways when each beggar gets at least one coin

is same as
Number of integral solutions of x1  x2  x3  20  x1 , x2 , x3  1 
x i  1  y i  x i  1  0, i  1,2,3
 x1  x2  x3  20  y 1  y 2  y 3  17  y 1  0,i  1,2,3

 Number of ways =
17  2  !
=
17!2!

(ii)at least one beggar doesn’t get any coin

Total Ways = Number of integral solutions of x1  x2  x3  20 x i  0,i  1,2,3  22 C2
19
Number of ways when each beggar gets at least 1 coin = C2
 Number of ways such that at least one beggar doesn’t get any coin= 22 C2 19 C2

(iii)beggar Bi gets at least Rs i (i = 1,2,3)

Required number of ways
Is same as
Number of integral solutions of x1  x2  x3  20  x1  1, x2  2, x3  3
Put y1  x1  1  0
y2  x2  2  0
y3  x3  3  0
Hence y1  y 2  y3  14  y1 y2 y3  0
16
Number of integral solutions subject to given conditions = C2
(iv)No beggar gets more than Rs.10
Number of ways such that no beggar gets more than Rs10
is same as
Number of integral solutions of x1  x2  x3  20  x1 , x2 , x3  10

 
3
= coefficient of x20 in 1  x  x 2  ........  x10

in 1  x  1  x 
11 3 3
= coefficient of x20

in 1  3 x  3 x  x  1  x 
11 22 33 3
= coefficient of x20
3 201 C2  3391 C2  22 C2  3 11C2
(v)Every beggar gets a minimum of Rs.2 and a maximum of Rs.10
Required number of ways
is same as
Number of integral solutions of x1 + x2 + x3 = 20  2  x1 , x2 , x3  10 

 
3
= coefficient of x20 in x 2  x 3  x 4  ... x10

in 1  x  1  x 
9 3 3
= coefficient of x14
14 31 531
= C2  3 C2 16 C2  3 7C2

Illustration: 10 persons are sitting in a row. In how many ways can we select 4 persons such that
(i)no two of them are consecutive
(ii)exactly 2 of them are consecutive
Solution:

LALPUR Campus, Circular Road, Lalpur, Ranchi-834001. Ph. 7488408051, 8235071441 Page 53
DORANDA Campus, Opp. Eylex Cinemas, Hinoo, Ranchi-834002. Ph. 6201469038, 8092071442
www.brothersacademy.co.in Permutations and Combinations

(i)no two of them are consecutive

MethodI: MethodII:
Since the 10 persons are already sitting, we can’t Let four selected persons are S1, S2, S3, S4
arrange them. Now, we have to select 4 persons such
x1 S1 x2 S 2 x3 S3 x4 S 4 x5
that no two of them are consecutive.
So let’s take 4 S’s and 6 U’s, where S represents a There are 5 gaps around S1, S2, S3, S4
selected persons and U represents an unselected Let there are
person. x1 persons in 1st gap
Now, number of ways to select 4 persons such that x2 persons in 2nd gap and
no two of them are consecutive …… so on.
= Number of ways to arrange SSSSUUUUUU such If no two of S1, S2, S3 and S4 are consecutive, then
that no two S x2, x3, x4> 1 and x1, x5> 0
are consecutive  Number of ways
U U U U U U = Number of integral solutions of
= 7 C4 1 2 3 4 5 6 7
Since no two S’s shouldbe together we have to use x1  x2  ....  x5  6  x1 , x5  0, x2 , x3 , x4  1
GAP method. [Let x1 = y1, x2 = y2 + 1, x3 = y3 + 1, x4 = y4 + 1 and
x5 = y5 then (yi> 0, I = 1,2,3,4,5)]
 First of all 6 U’s can be arranged in 1 way, thus
 Number of ways
generating 7 gaps.
= Number of integral solutions of
 From these 7 gaps, 4 can be selected in 7 C4 ways y1  y 2  y3  y4  y5  3  yi  0, i  1, 2, 3, 4, 5 
and then 4 identical S’s can be placed in these
gaps in 1 way. = 7 C4

(ii)exactly 2 of them are consecutive

It is easier to solve this problem by method 1.
Here, exactly 2 persons selected should be consecutive. Hence we also have to keep two S’s together.
i.e. we have to arrange SS , S, S in 7 gaps generated by 6 U’s
3
 Number of ways = 7 C3
2
[As there are 7C3ways to select 3 gaps from 7 gaps and 3 ways to place SS , S, S in these gaps]
Illustration: 4 persons want to sit in a row containing 10 chairs. In how many ways can their seats be selected
such that
(i)no two of selected seats are consecutive
(ii)exactly two of the selected seats are consecutive
Solution: same as above illustration
Illustration: In how many ways can 5 and 15 boys sit in a row such that
(i)between any two girls there is at least one boy
(ii)between any two girls there are at least two boys
(iii)between any two girls there are at most 10 boys
(iv)between any two girls there are exactly 3 boys
(v)between any two girls there are at least 2 and at most 10 boys
Solution:
5 girls can sit in 5 ways, thus creating 6 gaps between and around them x1 G1 x2 G2 x3 G3 x4 G4 x5 G5 x6
Let x1, x2, x3, x4, x5 and x6 be the number of boys in these gaps respectively.

(i)between any two girls there is at least one boy

MethodI: MethodII:
Number of ways in which between any two girls, Number of ways to select 5 seats such that no two

LALPUR Campus, Circular Road, Lalpur, Ranchi-834001. Ph. 7488408051, 8235071441 Page 54
DORANDA Campus, Opp. Eylex Cinemas, Hinoo, Ranchi-834002. Ph. 6201469038, 8092071442
www.brothersacademy.co.in Permutations and Combinations

there is at least one boy of them are consecutive = Number of integral

is same as solutions of x1  x2  x3  x4  x5  x6  15 provided
Number of ways when no 2 girls are together(which
can be accomplished using GAP method)
[ x1 , x6  0 & x2 , x3 , x4 , x5  1]
16
 15 boys can sit in 15! ways (generating 16 gaps = C5
between them) Now 5 girls can be arranged in 5 ways and 15 boys
 In these 16 gaps, 5 girls can sit in 16P5 ways. can be arranged in 15 ways
 Number of ways = 15  16 P5  Final answer = 16 C5 5 15  15 16 P5
(ii)between any two girls there are at least two boys
Proceeding in same way, required number of ways
= 5 15 (Number of integral solutions of x1 + x2 + …+x6 = 15, (x1, x6> 0 and x2, x3, x4, x5> 2))
 5 15 10C5
(iii)between any two girls there are at most 10 boys
Again, required number of ways
 5 15 [Number of integral solutions of x1+x2+….+x6 = 15, x1, x6> 0 and 0 < x2, x3, x4, x5< 10]
  1  x  x 
2 4
= coefficient of x15 in 5 15 1  x  x 2  ..... 2
 .....  x10

5 15 1  x  1  x 
11 4 6
= coefficient of x15 in

 5 15  15 6 1
C5  4 4  6 1
C5 
 5 15  20
C5  4 9C5 
(iv)between any two girls there are exactly 3 boys
Required number of ways
 5 15 [Number of integral solutions of x1 + x2 + x3 + ….x6 = 15, x1, x6> 0 and x2, x3, x4, x5 = 3]
 4  5  15
(v)between any two girls there are at least 2 and at most 10 boys
Required number of ways
 5 15 [Number of integral solutions of x1 + x2 + …+x6 = 15, x1, x6> 0 and 2 < x2, x3, x4, x5< 10]
  
4
= coefficient of x15 in 5 15 1  x  x 2  .... x 2  x 3  ...x10

5 15 1  x  1  x 
9 4 6
= coefficient of x15 in

=coefficient of x7 in 5 15 1  x 
6

 5 15 12C5
Illustration: Find the number of distinct outcomes possible if n – identical dice are thrown?
Solution: If all the dice are distinct, then number of outcomes = 6 n
But, if the dice become identical, then we can’t arrange the outcomes.
i.e. we don’t care that a particular outcome (say 4) comes on which one of the dice(as all the dice are identical),
rather we just care how many times 4 comes.
 Let us assume that
1 comes on x1 of n dice
2 comes on x2 of n dice
3 comes on x3 of n dice
…….
6 comes on x6 of n dice
Number of different outcomes
= Number of non negative integral solutions of x1  x2  x3  x4  x5  x6  n

LALPUR Campus, Circular Road, Lalpur, Ranchi-834001. Ph. 7488408051, 8235071441 Page 55
DORANDA Campus, Opp. Eylex Cinemas, Hinoo, Ranchi-834002. Ph. 6201469038, 8092071442
www.brothersacademy.co.in Permutations and Combinations

 n 5 C5
Illustration: If x1 x2 x3  233254 then find the number of ordered triplets (x1, x2, x3) such that
(i)there is no condition
(ii)x1, x2, x3 all are even
(iii)x1 is even and x2 is odd
(iv)x1 is divisible by 3, x2 is divisible by 5 and x3 is divisible by 125
(v)all of x1, x2 and x3 are divisible by 5 but none of them is divisible by 125
Solution:
Let x1  2a1 3b1 5c1 ; x2  2a2 3b2 5c2 ; x3  2a3 3b3 5c3
 x1 x 2 x3  233254
 2a1  a2  a3 3b1  b2  b3 5c1  c2  c3  233254
 a1  a2  a3  3 & b1  b2  b3  2 & c1  c2  c3  4 a1 ,a2 ,a3 ,b1 ,b2 ,b3 ,c1 ,c2 ,c3  0

(i)there is no condition
 a1 ,a2 ,a3 ,b1 ,b2 ,b3 ,c1 ,c2 ,c3  0
Number of ways = 5 C2 4 C2 6 C2
(ii)x1, x2, x3 all are even
 a1 ,a2 ,a3  1; b1 ,b2 ,b3 ,c1 ,c2 ,c3  0
 Number of ways = 2 C2 4 C2 6 C 2

(iii) x1 is even and x2 is odd

  a1  1; a2  0; a3 ,b1 ,b2 ,b3 ,c1 ,c2 ,c3  0
 Number of ways = 3 C1  4 C 2 6 C2

(iv)x1 is divisible by 3, x2 is divisible by 5 and x3 is divisible by 125

  b1  1;c2  1;,c3  1;a1 ,a 2 ,a3 ,b2 ,b3 ,c1 ,  0
Number of ways = 5 C 2 .3 C 2 .2 C 2
(v)all of x1, x2 and x3 are divisible by 5 but none of them is divisible by 125
 1  c1 ,c2 ,c3 2; a1 ,a2 ,a3 ,b1 ,b2 ,b3  0
Number of ways = 5 C 2  4 C2 3 C2

Counting Number of ONTO functions:

Number of onto functions from a set A [m elements] another set B [n elements] (m > n)
is same as
Number of ways to fill m distinct balls into n distinct boxes, when no box can be empty.
 nm n C1  n  1  n C2  n  2 n C3  n  3 .......
m m m

= coefficient of xm in m  ex  1
n

Proof: We can prove it using m and n also, but it’s better to prove it using some specific values of m and n
because it is easier to visualize.
Suppose we have to find number of onto functions from A = {a, b, c, d, e, f} to B = {1, 2, 3, 4}
First, we must understand why the number of onto functions is same as number of ways to fill 6 different balls
in 4 different boxes, when no box should be empty
 a, b, c, d, e, f can be thought of 6 distinct balls and 1,2,3,4 can be thought of 4 distinct boxes[‘a’ can’t have
multiple images in B (a ball can’t be filled simultaneously in more than one box) but‘1’ in B can be image
of more than one element in A (a box can contain multiple balls)]

LALPUR Campus, Circular Road, Lalpur, Ranchi-834001. Ph. 7488408051, 8235071441 Page 56
DORANDA Campus, Opp. Eylex Cinemas, Hinoo, Ranchi-834002. Ph. 6201469038, 8092071442
www.brothersacademy.co.in Permutations and Combinations

Let’s count number of ways to fill 6 balls (distinct) into 4 distinct boxes under the condition that no box is
empty.Let us define the following events
A : Box 1 is empty B : Box 2 is empty
C : Box 3 is empty D : Box 4 is empty
Again we want that none of the boxes should be empty i.e. we want A  B  C  D
   
 Required number of ways = n A  B  C  D  n A  B  C  D  n  s   n  A  B  C  D 

 n  s    n  A    n  A  B    n  A  B  C   n  A  B  C  D , where

 n  s   total number of ways = 46

 n  A  = number of ways when box 1 is empty = 36
 Similarly , we can say that
 n  B   n  C   n  D  36
 n  A  B  n  B  C   n  C  D   n  D  A   n  B  D  n  A  C   26
 n  A  B  C   n  A  B  D  n  B  C  D  n  A  C  D   16 and
 n  A  B  C  D  0

 Required number of ways  46  4  36  6  26  4  16  46  4 C1  4  1   4 C2  4  2 4 C3  4  3

6 6 6

Note: Please try to generate a logical proof (not thoeretical) for

 
n
Number of onto functions = coefficient of xm in m ex  1

Summary: Number of functions

Functions are constructed from a set A containing m elements to another set B containing n elements.
(1)Total number of functions = nm
P n≥m
(2)Number of one one functions= n! n = m 
0 n<
(3)Number of many one functions = Total number of functions – Number of oneone functions
n − C (n − 1) + C (n − 2) − C (n − 3) + ⋯ … … m ≥ n
(4)Number of onto functions= n! m = n 
0 m<
(5)Number of into functions = Total number of functions – Number of onto functions

Division and Distribution:(Number of Objects in a group is not fixed)

(a)Distribution of n distinct balls in r distinct boxes when order is considered in the box
= n! n–1Cr–1, if blank (empty) boxes are not allowed.
= n! n+r–1Cr–1 if blank (empty) boxes are allowed.
(b)Distribution of n identical balls into r distinct boxes
= n–1Cr–1, if blank (empty) boxes are not allowed.
= n+r–1Cr–1 if blank (empty) boxes are allowed.
(c)Distribution of n distinct balls into r distinct boxes and order is not considered in the box
= rn, if blank (empty) boxes are allowed
= rn – rC1(r – 1)n + rC2(r – 2)n– rC3(r – 3)n+….. +(– 1)r–1rCr–1 , if blank (empty) boxes are not allowed.

LALPUR Campus, Circular Road, Lalpur, Ranchi-834001. Ph. 7488408051, 8235071441 Page 57
DORANDA Campus, Opp. Eylex Cinemas, Hinoo, Ranchi-834002. Ph. 6201469038, 8092071442
www.brothersacademy.co.in Permutations and Combinations

Illustration: Consider two sets A = {1,2,3,4} and B = {1,2,3,4,5,6,7}Find then number

of function f possible from A to B i.e. f : A B such that
(i)f is one–one function
(ii)f is many–one function
(iii)f is a strictly decreasing function
(iv)f is a not strictly increasing function
(v)f is a non decreasing monotonic function
Solution:
(i)f is one–one function
Number of one–one functions = 7 P4
It is same as number of ways to fill 4 distinct balls into 7 distinct boxes where each box can contain a maximum
of 1 ball
Also same as number of ways 4 persons can sit in 7 chairs
(ii)f is many–one function
Number of many–one function= Total number of functions – Number of one one functions  7 4  7 P4

(iii)f is a strictly decreasing function

For f to be a decreasing function f 1  f  2   f  3   f  4 
There are 7 outputs possible.
We have to selected 4 of them and assign them to f 1 , f  2  , f  3  and f  4  such that
f 1  f  2   f  3   f  4 
Number of ways = 7 C4  1  7 C4
We can select 4 distinct numbers from B in 7 C4 ways and then these 4 selected numbers can be arranged in
decreasing order in only 1 way.
(iv)f is a not strictly increasing function
Proceeding in same way as in (iii) number of functions which are not increasing
= Total number of functions – Number of Increasing functions
= 7 4  7 C4

(v)f is a non decreasing monotonic function

MethodI: MethodII:
For f to be non decreasing monotonic function, Effectively we must get 4 outcomes
the required condition is f 1 , f  2  , f  3  , f  4  , However
f 1  f  2   f  3   f  4 
 all outcomes may be distinct or
Condition No. of  some/all can be identical.
functions
f 1  f  2   f  3  f  4  7
C4 Since the outcomes can repeat (i.e. more than one
outcomes can be same), let us assume that
 1 becomes an outcome x1times
f 1  f  2   f  3   f  4  7
C3   2 becomes an outcome x2 times

f 1  f  2   f  3   f  4  7
C3  7C3  3  ………..
  7 becomes an outcome x7 times
f 1  f  2   f  3  f  4  7
C3 
Also, we must have exactly 4 outcomes
 x1  x2  x3  ...........  x7  4
f 1  f  2   f  3  f  4  7
C2  Every non negative integral solution of above equation

f 1  f  2   f  3  f  4  7
C2   7 C2  3 will correspond to exactly one function.
 Number of non negative integral solutions of the above
f 1  f  2   f  3  f  4  7
C2  equation is = 10C4

LALPUR Campus, Circular Road, Lalpur, Ranchi-834001. Ph. 7488408051, 8235071441 Page 58
DORANDA Campus, Opp. Eylex Cinemas, Hinoo, Ranchi-834002. Ph. 6201469038, 8092071442
www.brothersacademy.co.in Permutations and Combinations

f 1  f  2   f  3  f  4  7
C1 Let’s check out some sample solutions of
x1  x2  x3  ...........  x7  4 and their meanings

 7
C3 is multiplied by 3 because 1 ‘=’ sign and 1,1,1,1, 0, 0, 0  f 1  1, f  2   2, f  3  3, f  4   4
2 ‘<’ signs can be arranged in 3 ways.
 Similarly, 7C2 is also multiplied with 3.  2, 0,0,1,0,0,1 f 1  1, f  2   1, f  3  4, f  4   7
 Final answer = 7 C4  3  7C3  3 7  7 C7
= 3 C0 7 C4  3 C1 7 C3  3 C2 7C2 3 C3 7C1
 0, 0, 0,3, 0,1, 0  f 1  4  f  2   f  3 , f  4   6

10 C4
Illustration: Consider the sets A = {1,2,3,4,5,6,7,8} and B = {1,2,3,4,5}. Find the
number of functions f from set A to set B such that
(i)f is a many–one function
(ii)f is a onto function
(iii)f is an into function
(iv)range of f contains exactly 4 elements
(v)exactly 5 elements in a have same image in B
Solution:
(i)f is a many–one function
Total number of functions from A  B = 58
Number of one–one functions = 0
 Number of many–one functions = 58
(ii)f is an onto function
Number of onto functions
 58 5 C1  5  1 5 C2  5  2  5 C3  5  3  5 C4  5  4 
8 8 8 8

 58 5 C1 48 5 C2 38 5 C3 28  5 C4
(iii)f is an into function
Number of into functions
= Total number of functions – Number of onto functions
5 C1 48 5 C2 38 5 C3 28 5 C418
(iv)range of f contains exactly 4 elements
Range of f contains exactly 4 elements number of ways to select those 4 elements for Range = 5 C4
Now, make onto functions each one of 4 elements selected will be utilized
 Number of functions 5 C4  48 4 C1 38  4 C2 28  4 C3 
(v)exactly 5 elements in a have same image in B
First select the five elements which have same image.
Then, tie them with a string (treat as single element)
Now, make one–one functions
 Number of functions = 8 C5 .5 P4

Summary: Use of Series:

(a)If there are n1 objects of one kind, n2 objects of second kind and so on nk objects of kth kind; then the number
of ways of choosing r objects out of these objects is
= coefficient of xr in (1+x+x2+–––––+ x n1 )(1+x+x2+–––––+ x n 2 )–––––––––(1+x+x2+––––+ x nk )
(b)If at least one object of each kind is to be included in selection of (1) , then the number of ways of choosing r
objects is:

LALPUR Campus, Circular Road, Lalpur, Ranchi-834001. Ph. 7488408051, 8235071441 Page 59
DORANDA Campus, Opp. Eylex Cinemas, Hinoo, Ranchi-834002. Ph. 6201469038, 8092071442
www.brothersacademy.co.in Permutations and Combinations

= coefficient of xr in (x+x2+–––––+ x n1 )(x+x2+––––––+ x n 2 )––––––––––––––(x+x2+–––––+ x nk )

(c)The number of possible arrangements / permutations of p objects out of n1 identical objects of kind 1, n2
identical objects of kind 2 and so on
 x2 x n1   x2 x nk 
= p!  Coefficient of xp in the expansion 1  x   ...   ... 1  x   ...  
 2! n 1!   2! n k ! 
Illustration: Find the no. of 4 lettered words which can be made out of the letters of the word ARRANGEMENT.
4
 x2   17 
 1  x   4!.  30  24  4   1596 .
3
Solution: Number of words=coefficient of x4 in 4!  1  x 
 2!   2 
Explanation: There are 2 A’s. Now if they are selected and then a word is formed, then an extra 2! comes in
denominator because of identical A’s. This is taken care directly in the above method. Similarly there are 2 R’s,
2 N’s etc.
Illustration: r–sided polygons are formed by joining the vertices of an n–sided polygon. Find the number of
polygons that can be formed, none of whose sides coincide with those of the n–sided polygon.
Solution: One vertex of the polygon can be fixed in n ways. Rest of the (r – 1) vertices are fixed in such a way
that no two vertices (selected) are adjacent ones as we go along the n–sided polygon. It amounts to dividing the
rest of the vertices into r groups with xi elements such that x1 + x2 +……..+xr = n – r xi 0.
Number of ways of such a selection is n – r – 1Cr – 1 Total number of polygons = n n – r – 1Cr – 1.
In this counting, each of the polygons has been counted r times.
n nr 1 n n  r  1 !
Hence total number of possible r–sided polygons  Cr 1  .
r r!  n  2r  !
Illustration: In how many ways 2n identical black and 2n identical white balls can be arranged in a row such
that on picking any n consecutive balls from the arrangement we get at least a black ball.
Solution: Placing 2n black balls, we have 2n + 1 gaps in which we have to put 2n white balls such that no gap
has more than n – 1 white balls.
If xi is number of white ball in ith gap then, x1  x 2  ....  x 2n 1  2n ....(1)0  xi n–1
Number of solution of equation (1)
= co–efficient of x2n in (1  x  x 2  ....  xn1 )2n1
2n1
 1  xn 
= Co–efficient x2n in  
 1 x 
  1  x 
2n 1  ( 2n 1)
= Co–efficient x2n in 1  x n

= Co–efficient x2n in 1 2n 1

Cx  1 C x  1  x 
n 2n 1
2
2n (2n 1)
=  4n
C2n  (2n  1) 3n Cn  2n1C2 
Illustration: Pallavi won 2000 identical Rs.5 coins in a game. In how many ways she can distribute 999 of them
in 3 identical boxes (Distribution of identical things into identical groups).
Solution: If we take boxes to be distinct
Total number of solutions = 999+3–1C2 = 500500
Total solution (when each box have different number of balls) = 500500 – 3  499 – 1
= 499002 (where 3  499 are the number of solutions when exactly two boxes have same number of balls and
there is only one solution when each box have same number of balls)
Distribution
0,0,999
1,1,997
2,2,995
……….
499,499,1
Now, n such solutions for distinct boxes will correspond to solutions if boxes are identical.

LALPUR Campus, Circular Road, Lalpur, Ranchi-834001. Ph. 7488408051, 8235071441 Page 60
DORANDA Campus, Opp. Eylex Cinemas, Hinoo, Ranchi-834002. Ph. 6201469038, 8092071442
www.brothersacademy.co.in Permutations and Combinations

49002
Hence total number of solutions when boxes are identical = (when each box have different number of
6
balls) + 500 (at least two box have same number of balls) = 83667.
Illustration: There are mn balls, m each of n different colors (including Red, Blue, and Black)(n≥3). Find the
number of ways in which they can be arranged in a row so that no black ball appears before any red ball and no
red ball appears before any Blue ball. Discuss the cases when balls of same color are identical and also when
balls of same color are distinct.
Solution: As the order is fixed for blue, red and black balls consider them (3m balls) as identical.
Case I: When the balls of same color are identical. Case II: When the balls are distinct
 mn  ! mn !
  m! .
3
Required no. of arrangements = Required no. of arrangements =
m!  3m  !
n3
 3m  !

Derangements
Suppose there are four letters L1, L2, L3, L4 and four envelopes E1, E2, E3, E4.
 L1 is supposed to go in E1,
 L2 is supposed to go in E2
 …and so on.
Now, to derange means to commit a perfect blunder
i.e. fill the envelopes in such a way that none of the letters go to their corresponding envelopes.
Note: Derangement is not the exact opposite of correct arrangement.
Correct arrangement is that all the letters go to correct envelopes, then its opposite is that at least one of the
letters goes to wrong envelope.However, derangement is the way of arrangement when no letter goes to
correct envelope.
Illustration: Find number of ways to derange 4 letters into 4 envelopes
Solution:
Let us assume that
 A denotes the event that letter L1 goes to envelope E1
 B denotes the event that letter L2 goes to E2
 C denotes the event that letter L3 goes to E3
 D denotes the event that letter L4 goes to E4
Now we want that
 L1does not goes to E1i.e. A should not happen i.e. A should happen
 L2 does not goes to E2i.e. B should not happen i.e. B should happen
 L3 does not goes to E3i.e. C should not happen i.e. C should happen
 L4 does not goes to E4i.e. D should not happen i.e. D should happen
i.e. we want A  B  C  D to happen.

Favorable ways  n  A  B  C  D   n A  B  C  D 
 n  S   n  A  B  C  D  [S = Universal set and n(S) =total ways = 4 ]
By Principle of Inclusion–Exclusion:
n  A  B  C  D   n  A  n  B   n C   n  D 
  n  A  B   n  B  C   n  C  D   n  A  D   n  B  D   n  A  C  
  n  A  B  C   n  A  C  D   n  B  C  D   n  A  B  D  
n  A  B  C  D 

LALPUR Campus, Circular Road, Lalpur, Ranchi-834001. Ph. 7488408051, 8235071441 Page 61
DORANDA Campus, Opp. Eylex Cinemas, Hinoo, Ranchi-834002. Ph. 6201469038, 8092071442
www.brothersacademy.co.in Permutations and Combinations

 n  A  = Number of ways A should happen= Number of ways when L1 goes to E1 = 3

 Similarly
 n  B   n C   n  D  3
 n  A  B   n  B  c   .....  n  A  C   2
n A  B  C   n  A  C  D  nB  C  D  n A  B  D  1

n  A  B  C  D  0

 Favorable ways  n  s   n  A  B  C  D 
 n  s    n  A   n  A  B    n  A  B  C   n  A  B  C  D 
 4  4 3  6 2  4 1 0
 4 4 C1 3  4 C2 3 4 C3 1  4 C4 0
4 4 4 4  1 1 1 1
 4     4 1     
1 2 3 4  1 2 3 4

Generalisation:

 1 1 1  1 
n

Number of derangements of ‘n’ things in ‘n’ places is given by Dn  n  1     ........  

 1 2 3 n 
 
Illustration: There are 5 locks and 5 corresponding keys. All locks are tried simultaneously.In how many trials
will
(i)no locks open
(ii)at least 2 locks do not open
(iii)exactly 3 locks do not open
Solution:
(i)no locks open
If no locks should open, then number of ways = D 5
 1 1 1 1 1
 5 1        5  5  5  4  3  5  4  5  1 = 60 – 20 + 5 – 1= 44
 1 2 3 4 5
(ii)at least 2 locks do not open
Total trials = 5
Number of ways when O locks do not open i.e. all locks open = 1
Number of ways when 1 lock does not opens, 4 locks open and l remain unopened = 0
 Required number of ways = 5  1  0  120  1  119
Alternately:
Required number of ways = 5 C2 D2  5 C3 D3 5 C4 D4  5 C5 D5

(iii)exactly 3 locks do not open

Number of ways when exactly 3 locks do not open = 5 C3 D3
 1 1 1
 10  3 1      10 3  1  20
 1 2 3
Illustration: Consider A  1, 2, 3, 4,5, 6 and B  1, 2, 3, 4, 5, 6 , Find number of one–one functions from
A  B such that
(i) f  i   i  i  1, 2, 3, 4, 5, 6
(ii) f  i   i  1 i  1, 2, 3, 4, 5, and f(6) = 1

LALPUR Campus, Circular Road, Lalpur, Ranchi-834001. Ph. 7488408051, 8235071441 Page 62
DORANDA Campus, Opp. Eylex Cinemas, Hinoo, Ranchi-834002. Ph. 6201469038, 8092071442
www.brothersacademy.co.in Permutations and Combinations

(iii) f  i   2i  1  i  1, 2, 3
Solution :
(i) f  i   i  i  1, 2, 3, 4, 5, 6
Number of one–one functions such that f 1  1, f  2   2,....... f  6   6
 1 1 1 1 1 1
 D6  6 1       
 1 2 3 4 5 6
 6  6  6  5 4  3  6  5 4  6  5  6 1
 360  120  30  6  1 = 265
(ii) f 1  2, f  2   3, f  3   4, f  4   5, f  5   6 and f  6   1
Number of ways = D5 = 44
(iii) f 1  1, f  2   3, f  3   5
Let us assume that
 A denotes the event : Number of functions when f(1) = 1
 B denotes the event : Number of functions when f(2) = 3
 C denotes the event : Number of functions when f(3) = 5


Required ways = n A  B  C  n A  B  C   
 n s  n  A  B  C   S  Universal set 
 n  s    n  A  n  B   n  C     n  A  B   n  B  C   n  C  A    n  A  B  C 
 6  3  5  3  4  3  720  360  72  6  426

SOLVED EXAMPLES
Only one option is correct.

1. There are 3 sections in a question paper each containing 5 questions. A candidate has to solve only 5
question, choosing at least one question from each section. In how many ways can be make his choice?
(a) 15C5 (b) 3C1  12C4 (c) 2250 (d) 2253
Sol. Ans. (c), We observer that
Total number of ways of choosing at least one question from each section
= (Total number of ways of choosing 5 questions out of 15 questions)
 (Number of ways of selecting 5 question from 2 section only)
 (Number of ways of choosing 5 questions from one section only)
 15C5  3C2  10C5  2C1  5C5   3C1  5C5  15C5  3  10C5  6  3  2250

2. Two different packs of cards are shuffled together. Cards are dealt equally among 4 players, each getting
13 cards. The number of ways in which a player get his cards if no two cards are from the same suit with
the same denomination, is
(a) 52C13 (b) 213 (c) 52 P13 (d) 52C13  213
Sol. Ans. (d), Here, we have 52 cards, each card being 2 in number.
It is given that no two cards are to be of the same suit with the same denomination.
So, we first draw 13 cards from 52 cards. This can be done in 52C13 ways.
Now, each of 13 cards selected can be chosen in 2 ways either from first pack or from 2 nd pack.

LALPUR Campus, Circular Road, Lalpur, Ranchi-834001. Ph. 7488408051, 8235071441 Page 63
DORANDA Campus, Opp. Eylex Cinemas, Hinoo, Ranchi-834002. Ph. 6201469038, 8092071442
www.brothersacademy.co.in Permutations and Combinations

Hence, required number of ways  52C13  213 .

3. the total number of natural number lying between 20,000 and 60,000, the sum of whose digits is even, is
(a) 40000 (b) 20000 (c) 5000 (d) 25000
Sol. Ans. (b), The numbers lying between 20,000 and 60,000 will be five digit numbers having 2, 3, 4 or 5 at
ten thousands place. So, the ten thousands place can be filled in 4 ways.

T Th Th H T O

Each of thousands, hundreds and tens places can be filled in 10 ways.

So, the first four place can be filled in 4 ways  4  10 10 10 ways.
After filling these the sum of the digits at these four places is either even or odd.
Therefore, the units place can be filled by one of the digits 0, 2, 4, 6, 8 when the sum is even and if the sum
is odd, the units place can be filled by one of the digits 1, 3, 5, 7, 9.
In either case, the units place is filled in 5 ways.
Hence, the required number of numbers  4 10 10  10  5  20,000

4. The set S  1, 2, 3, ..., 12 is to be partitioned into three sets A, B, C of equal size. Thus,
A  B  C  S , A  B  B  C  A  C   . Then the number of ways of partition S is :
12! 12! 12! 12!
(a) (b) (c) (d)
 4!  3! 3! 4! 3! 3!
3 4 3 4

Sol. Ans. (a), The number of ways of partitioning S into three disjoint sets is same as the number of ways of
distributing 12 distinct items to three persons each getting same number of items.
12!
 Required number of ways  C4  C4  C4 
12 8 4

 4!
3

5. The number of ways in which seven persons can sit around a table so that all shall not have the same
neighbours in any two arrangements, is
(a) 720 (b) 360 (c) 1440 (d) None of these
Sol. Ans. (b), Clearly, 7 persons can sit a round table in  7  1!  6! ways.
But, in clockwise and anticlockwise arrangements, each person will have the same neighbours.
1
 Required number of ways   6!  360
2

6. The number of divisors of 10800 which are divisible by 15 is

(a) 10 (b) 20 (c) 15 (d) 30

Sol. Ans. (d), We have, n  10800  2 4  33  52

A divisor of n will be a multiple of 15, if it contains at least one 3 out of three 3’s and at least one 5 out of
two 5’s. Hence, the number of divisors which are multiples of 15 is equal to  4  1 3 2   30 .

7. If r , s, t are prime numbers and p, q are the positive integers such that LCM of p, q is r 2t 4 s 2 , then
the number of ordered pair  p, q  is
(a) 252 (b) 254 (c) 225 (d) 224
Sol. Ans. (d), Required number of ordered pairs   2  3  1 2  5  1 2  3  1  1  224

LALPUR Campus, Circular Road, Lalpur, Ranchi-834001. Ph. 7488408051, 8235071441 Page 64
DORANDA Campus, Opp. Eylex Cinemas, Hinoo, Ranchi-834002. Ph. 6201469038, 8092071442
www.brothersacademy.co.in Permutations and Combinations

8. The number of ways of distributing 5 identical balls into three boxes so that no box is empty (each box
being large enough to accommodate all balls), is
(a) 35 (b) 53 (c) 15 (d) 6
Sol. The required number of ways is the number of ways of distributing 5 items among 3 persons so that a
person receives at least one item  51C31  4C2  6 .

9. The number of ways in which n distinct objects can be put into two different boxes so that no box
remains empty, is
(a) 2 n  1 (b) n 2  1 (c) 2 n  2 (d) n 2  2

Sol. Ans. (c), Each object can be put either in box B1 (say) or in box B2 (say).
So, there are two choices for each of the n objects.
Therefore, the number of choices for n distinct objects is, 2
2 
..... 2  2n
n times
There choices correspond to either the first or the second box being empty.
Thus, there are 2 n  2 ways in which neither box is empty.

10. The number of possible outcomes in a throw of n ordinary dice in which at least one of the dice shows an
odd number is
(a) 6n  1 (b) 3n  1 (c) 6n  3n (d) None of these
Sol. Ans. (c), We have, Required number of outcomes
= (Total number of outcomes)  (Number of outcomes in which no die shows an odd number)
 6n  3n

11. The number of different seven digit numbers that can be written using only the three digits 1, 2 and 3
with condition that the digit 2 occurs twice in each number is
(a) 7 P2  25 (b) 7C2  25 (c) 7C2  52 (d) None of these
Sol. Ans. (b), Choose any two of the seven digits (in the seven digit number).
This may be done in 7C2 ways. Put 2 in these two digits.
The remaining 5 digits may be arranged using 1 and 3 in 2 5 ways.
So, required number of numbers  7C2  25

12. The number of triangles whose vertices are at the vertices of an octagon but none of whose sides happen
to come from the sides of the octagon is
(a) 24 (b) 52 (d) 48 (d) 16
Sol. Ans. (d), The number of triangles = Total number of triangles
 (No. of triangles having one side common with the octagon)
 (No. of triangles having two sides common with the octagon)
 8C3  8C1  4C1  8  16

13. There are 10 points in a plane of which no three points are collinear and 4 points are concyclic. The
number of different circles that can be drawn through at least 3 points of these points, is
(a) 116 (b) 117 (c) 120 (d) None of these
Sol. Ans. (b), Since any three non-collinear points are always concyclic.
 Required number of circles   C3  4C3   1  117 .
10

14. There are three coplanar parallel lines. If any n points are taken on each of the lines, the maximum
number of triangles with vertices at these points is
(a) 3n  n  1 (b) 3n  n  1  1 (c) n  4n  3
2 2 2
(d) None of these

LALPUR Campus, Circular Road, Lalpur, Ranchi-834001. Ph. 7488408051, 8235071441 Page 65
DORANDA Campus, Opp. Eylex Cinemas, Hinoo, Ranchi-834002. Ph. 6201469038, 8092071442
www.brothersacademy.co.in Permutations and Combinations

Sol. Ans. (c), The maximum number of triangles

 (Number of triangle with vertices on different lines) + (Number of triangles with 2 vertices on one
line and third vertex on any one of the remaining two lines)
 nC1  nC1  nC1  3C1  nC2  2 nC1   3n2  n  1

15. If PQRS is a convex quadrilateral with 3, 4, 5and 6 points marked on sides PQ, QR, RS and PS
respectively, then the number of triangles with vertices on different sides is
(a) 220 (b) 270 (c) 282 (d) 342
Sol. Ans. (d), Cleary, Total number of triangles
 (Number of triangles with vertices on sides PQ, QR and RS )
 (Number of triangles with vertices on sides QR, RS and PS )
 (Number of triangles with vertices on sides RS , PS and PQ )
 (Number of triangles with vertices on sides PS , PQ and QR )
 3C1  4C1  5C1  4C1  5C1  6C1  5C1  6C1  3C1  6C1  3C1  4C1  60  120  90  72  342

16. The number of ways in which we can select four numbers from 1 to 30 so as to exclude every selection of
four consecutive numbers is
(a) 27378 (b) 27405 (c) 27399 (d) None of these
Sol. Ans. (a), The number of ways of selecting any four numbers from 1 to 30 is 30C4 .
Four consecutive numbers can be chosen in the following ways :
1, 2,3, 4  ,  2, 3, 4, 5 ,......,  27, 28, 29, 30  .
Thus, required number of ways  30C4  27  27378.
17. The number of integer solutions for the equation x  y  z  t  20, where x, y , z , t are all  1 is
20 23
(a) C4 C3
(b) (c) 27C4 (d) 27C3
Sol. Ans. (d), Let u  x  1, v  y  1, w  z  1 and p  t  1.
Then, x  1, y  1, z  1, t  1  u , v, w, p  0 and u  v  w  p  24
24  4 1
So, required number of solutions  C41  27C3

18. The number of integral solutions of x  y  z  0, with x  5, y  5, z  5, is

(a) 135 (b) 136 (c) 455 (d) 105
Sol. Ans. (b), Let u  x  5, v  y  5 and w  z  5
Then, u, v, w  0 and x  y  z  0  u  v  w  15
15 31
The number of solutions of this equation is, C31  17C2  136

19. The number of non-negative integral solutions of x  y  z  n , where n  N is

n 3 n 4 n 5
(a) C3 (b) C4 (c) C5 (d) None of these
Sol. Ans. (a), Let u be a variable such that x  y  z  u  n. Then, x  y  z  n  u  0
The number of non-negative integral solutions of the given inequation is same as the number of non-
negative integral solutions of x  y  z  u  n .
n  41 n 3
Hence, The required number of solutions  C41  C3 .

20. The number of points in space, whose each coordinate is a negative integer such that x  y  z  12  0, is
(a) 385 (b) 55 (c) 110 (d) none of these

LALPUR Campus, Circular Road, Lalpur, Ranchi-834001. Ph. 7488408051, 8235071441 Page 66
DORANDA Campus, Opp. Eylex Cinemas, Hinoo, Ranchi-834002. Ph. 6201469038, 8092071442
www.brothersacademy.co.in Permutations and Combinations

Sol. Ans. (b), Let x  a, y  b and z  c. Then, x  y  z  12  0  a  b  c  12 …(i)

Hence, Required number of points  Number of solutions of (i) in N
11 10
 121C31   55  11C2
2

21. If x, y , z are integers such that x  0, y  1, z  2 and x  y  z  15, then the number of values of
ordered triplets  x, y, z  . is
(a) 91 (b) 455 (c) 17C15 (d) none of these
Sol. Ans. (a), Let y '  y  1and z '  z  2. Then, x  y  z  15
 x  y ' z '  12, where x  0, y '  0 and z '  0
12  31
The total number of solutions of this equation is, C31  14C2
Hence, required number of ordered triplets  x, y , z  is, 14C2  91.

22. The number of proper divisors of 2520, is

(a) 46 (b) 52 (c) 64 (d) none of these
Sol. Ans. (a), We have, 2520  2  3  5  7
3 2 1 1

 Total number of divisors of 2520   3  1 2  11  11  1  48

These divisors include 1 and the number itself as divisors.
Hence, required number of proper divisors  48  2  46.

23. The number of proper divisors of 2m  6n 15 p , is

(a)  m  n  1 n  p  1 p  1 (b)  m  n  1 n  p  1 p  1  2
(c)  m  n  n  p   2 (d) none of these
Sol. Ans. (b), We have, 2m  6n  15 p  2m n  3n  p  5 p
Hence, total number of proper divisors   m  n  1 n  p  1 p  1  2

24. The number of ways to give 16 different things to three persons A, B, C so that B gets 1 more than
A and C gets 2 more than B, is
16! 16!
(a) (b) 4!5!7! (c) (d) none of these
4!5!7! 3!5!8!
Sol. Ans. (a), Suppose A gets x things, then B gets x  1and C gets x  3 things.
 x  x  1  x  3  16  x  4.
Thus, we have to distribute 16 things to A, B and C in such a way that A gets 4 things, B gets 5 things
16!
and C gets 7 things. Required number of ways  C4  C5  C7 
16 12 7

4!5!7!

25. The number of ways in which one or more balls can be selected out of 10 white, 9 green and 7 blue balls,
is
(a) 892 (b)881 (c) 891 (d) 879
Sol. Ans. (d), We have, Required number of ways  10  1 9  1 7  1  1  879.

26. The sum of the divisors of 25  34  52 , is

(a) 32. 71. 112 (b) 32. 71. 112. 31 (c) 3.7.11.31 (d) none of these

LALPUR Campus, Circular Road, Lalpur, Ranchi-834001. Ph. 7488408051, 8235071441 Page 67
DORANDA Campus, Opp. Eylex Cinemas, Hinoo, Ranchi-834002. Ph. 6201469038, 8092071442
www.brothersacademy.co.in Permutations and Combinations

Sol. Ans. (b), Any divisors of 25  34  52 is of the form 2a  3b  5c , where 0  a  5, 0  b  4 and 0  c  2.

5 4 2
Thus, The sum of the divisors   2 a
3b 5c  1  2  .....  25 1  3  ....  34 1  5  52 
a 0 b 0 c  0

 2 1   3 1   5 1 
6 5 3
    63 121 31  3  7 11  31
2 2

 2 1   3 1   5 1 

27. The number of ways in which n different prizes can be distributed among m   n  persons if each is
entitled to receive at most  n  1 prizes, is
(a) n m  n (b) mn (c) m n (d) none of these
Sol. Ans. (d), Required number of ways
 (Total number of ways)  (Number of ways in which one gets all the prizes)  mn  m

28. The number of different pairs of words  ,  that can be made with the letters of the word STATICS , is
(a) 828 (b) 1260 (c) 396 (d) none of these
Sol. Ans. (b), We observe that in an arrangement of the 7 letters of the word STATICS if we put a comma ( , )
after letters, we obtain a pair of words.
Hence, required number of pairs  Number of arrangements of the letters if a word STATICS
7!
  1260
2!2!

29. In the decimal systems of numeration the number of 6-digit numbers in which the digit in any place is
greater than the digit to the left of it, is
(a) 210 (b) 84 (c) 126 (d) none of these
Sol. Ans. (b), Clearly, 0 cannot be at the left-most place.
Otherwise the number will be a five digit number. Also, 0 cannot be at any other place.
Let the required number of numbers be x.
Then, x  6!  Number of ways of arranging 9 non-zero digits taking 6 at a time
 x  6!  9C6  6!  x  9C6  84

30. There are 60 questions in a question paper. If no two students solve the same combination of questions
but solve equal number of questions, then the maximum number of students who appeared in the
examination, is
(a) 60C29 (b) 60C30 (c) 60C50 (d) none of these
Sol. Ans. (b), Let r questions be solved by each student.
Then, Number of students  60Cr [ Each student has solved different combinations of questions]
 Maximum number of students  maximum value of 60Cr  60C30

31. How many ways are there to arrange the letters in the word ' GARDEN ' with vowels in alphabetical
order?
(a) 480 (b) 240 (c) 360 (d) 120
Sol. Ans. (c), There are two vowels viz. A and E in the word GARDEN.
There are 6!  720 arrangements of the letters of the word GARDEN.
In half of these arrangements A occurs prior to E and in the remaining half E occurs prior to A. .
1
Hence, required number of arrangements   720  360
2

LALPUR Campus, Circular Road, Lalpur, Ranchi-834001. Ph. 7488408051, 8235071441 Page 68
DORANDA Campus, Opp. Eylex Cinemas, Hinoo, Ranchi-834002. Ph. 6201469038, 8092071442
www.brothersacademy.co.in Permutations and Combinations

32. Consider all possible permutations of the letters of the word ENDEANOEL. The number of
permutations containing the word ENDEA, is
(a) 5! (b) 2  5! (c) 7  5! (d) 21 5!
Sol. Ans. (a), Taking ENDEA as one letter we have four more letters N , O, E, and L.
These five letters can be arranged in 5! ways.
So, the number of permutations containing the word ENDEA is 5!.

33. Consider all possible permutations of the letters of the word ENDEANOEL. the number of permutations
in which the letter E occurs in the first and last positions, is
(a) 5! (b) 2  5! (c) 7  5! (d) 21 5!
Sol. Ans. (d), There are 3E ’s out of which two are fixed at first and last position.
7!
After fixing two E ’s 7 letters are left which can be permuted in ways i.e., 21 5! ways.
2!
 Required number of permutations  21 5!

34. A boy has 3 library tickets and 8 books of his interest in the library. Out of these 8, he does want to
borrow Chemistry part II, unless Chemistry part I is also borrowed. The number of ways in which he can
choose the three books to be borrowed is
(a) 41 (b) 32 (c) 51 (d) None of these
Sol. Ans. (a), The following are the different possibilities in which three books can be borrowed
(i) When Chemistry part II is selected, then Chemistry part I is also borrowed and the third book is
selected from the remaining 6 books  C  6, 1  6
(ii) When Chemistry part II is not selected, in this case he has to select the three books from the
765
remaining 7 books. First choice can be made in C  7, 3   35 ways.
1 2  3
Total number of ways in which he can choose the three books to be borrowed  6  35  41.
35. Three boys and three girls are to be seated around a table, in a circle. Among them, the boy X does not
want any girl neighbours and the girls Y does not want any boy neighbours. The number of such
arrangements possible is
(a) 4 (b) 6 (c) 8 (d) none of these
Sol. Ans. (a), As shown in figure 1, 2 and X are the three boys and 3, 4 andY are three girls.
Boy X will have neighbours as boys 1 and 2 and the girl Y will have x
neighbours as girls 3 and 4.
1 and 2 can be arranged in P  2, 2  ways
1 2
 2!  2  1  2 ways
Also, 3 and 4 can be arranged in P  2, 2  ways
4
 2!  2  1  2 ways 3
y
Hence, required number of permutations  2  2  4

36. There are n concurrent lines and another line parallel to one of them. The number of different triangles
that will be formed by the  n  1 lines, is

(a)
 n  1 n (b)
 n  1 n  2 (c)
n  n  1
(d)
 n  1 n  2
2 2 2 2
Sol. Ans. (b), The number of triangles  number of selections of 2 lines from  n  1 lines which are cut by

n 1  n  1!   n  1 n  2 
the last line  C2 
2! n  3 ! 2

LALPUR Campus, Circular Road, Lalpur, Ranchi-834001. Ph. 7488408051, 8235071441 Page 69
DORANDA Campus, Opp. Eylex Cinemas, Hinoo, Ranchi-834002. Ph. 6201469038, 8092071442
www.brothersacademy.co.in Permutations and Combinations

37. In a plane there are two sets of parallel lines, one of m lines and the other of n lines. If the lines of one set
cut those of the other, then the number of different parallelograms that can be formed is
mn  m  1 n  1 m  m  1 n  1 nm  m  1 n  1
(a) (b) (c) (d) none of these
2 6 4
Sol. Ans. (c), The number of parallelograms  number of selections of 4 lines, two from each set
[ Parallelogram has two sets of parallel sides]
n  n  1 m  m  1 mn  m  1 n  1
 nC2  mC2   
2 2 4

38. A parallelogram is a cut by two sets of m lines parallel to its sides. The number of parallelogram then
formed is
 C2   C2   C2 
m 2 m 1 2 m 2 2
(a) (b) (c) (d) None of these
Sol. Ans. (c), Each set is having m  2 parallel lines and each parallelogram is formed by choosing two
straight lines from the first set and two straight lines from the second set.
Two straight lines from the first set can be chosen in m 2C2 ways and two straight lines from the second
m 2
set can be chosen in C2 ways.
 C2  m  2C2    m  2C2 
m2 2
Hence, the total number of parallelograms formed 

39. Two straight line intersect at a point O. Points A1 , A2 , .... An are taken on one line and points
B1 , B2 , .....Bn on the other. If the point O is not to be used, the number of triangles that can be drawn
using these points as vertices, is
(a) n  n  1 (b) n  n  1 (c) n 2  n  1 (d) n2  n  1
2 2

Sol. Ans. (c), Number of triangles  2n

C3  nC3  nC3
2n  2n  1 2n  2  2n  n  1 n  2 1
   n  n  1 3n   n 2  n  1
6 6 3

40. The number of divisors of 9600 including 1 and 9600 are

(a) 60 (b) 58 (c) 48 (d) 46
Sol. Ans. (c),  9600  27  3  52  Number of divisors   7  1  1  1   2  1  48

41. The number of divisors of number 38808 can have, excluding 1 and the number of itself, is
(a) 70 (b) 72 (c) 71 (d) None of these
Sol. Ans. (a), Factorizing the given number, we have, 38808  2  3  7 11
3 2 2

Therefore, the total number of divisors   3  1 2  1 2  11  1  1  71, (excluding 1)
But this includes the division by the number itself.
Hence, the required number of divisors  71  1  70

42. The number of natural numbers less than or equal to 2985984, which are neither perfect squares nor
perfect cubes is [Note that 2985984  212.36 ]
(a) 2984124 (b) 2984244 (c) 2959595 (d) none of these
Sol. Ans. (a), Desired number  2985984   2985984  3 2985984  6 2985984 
 2985984  1860  2984124

LALPUR Campus, Circular Road, Lalpur, Ranchi-834001. Ph. 7488408051, 8235071441 Page 70
DORANDA Campus, Opp. Eylex Cinemas, Hinoo, Ranchi-834002. Ph. 6201469038, 8092071442
www.brothersacademy.co.in Permutations and Combinations

43. The number of prime numbers among the numbers 105!  2, 105!  3, 105! 4, ….., 105! 104 and
105! 105 is
(a) 31 (b) 32 (c) 33 (d) none of these
Sol. Ans. (d), 105! r is divisible by r r  2, 3, ....., 105
 All the given numbers are composite numbers.

44. Number of ways in which 3 boys and 3 girls (all are of different heights) can be arranged in a line so that
boys as well as girls among themselves are in decreasing order of height (form left to right), is
(a) 1 (b) 6! (c) 20 (d) none of these
6!
Sol. Ans. (c),  20
3! 3!

45. If two numbers are selected from numbers 1 to 25, then the number of ways that their difference does not
exceed 10 is
(a) 105 (b) 195 (c) 176 (d) None of these
Sol. Ans. (c), If x  1, y  1, 2,....., 11
x  2, y  1, 2,.......,12
……. …………………
x  11, y  1, 2,......, 21
 Number of values  11  12  ....  21  176

46. The number of ways in which a mixed double game can be arranged amongst 9 married couples if no
husband and wife play in the same game is
(a) 756 (b) 1512 (c) 3024 (d) None of these
9
Sol. Ans. (b), We can choose two men out of 9 in C2 ways. Since, no husband and wife are to play in the same
game, two women out of the remaining 7 can be chosen in 7C2 ways. If M 1 , M 2 , W1 and W2 are chosen,
then a team may consist of M 1 and W1 or M 1 and W2 .
98 7 6
Thus the number of ways of arranging the game is 2  9C2  7C2    2  1512 .
2 2

47. A match ends in a win or loss or draw for a team. A number of people forecast the result of each match
and no two people make the same forecast for the series of matches. The smallest group of people in
which one person forecasts correctly for all the matches will contain n people, where n is
(a) 81 (b) 243 (c) 486 (d) None of these
Sol. Ans. (b), The smallest number of people  Total number of possible forecast
 Total number of possible results  3  3  3  3  3  243

48. A class contains 3 girls and four boys. Every Saturday five students go on a picnic, a different group of
students is being sent each week. During the picnic, each girl in the group is given doll by the
accompanying teacher. All possible groups of five have gone once, the total number of dolls the girls have
got is
(a) 21 (b) 45 (c) 27 (d) 24
Sol. Ans. (b), The number of times, a particular girl goes on picnic  C4
6

6!
Total number of dolls given to the girls  C4  3   3  45
6

4!2!

LALPUR Campus, Circular Road, Lalpur, Ranchi-834001. Ph. 7488408051, 8235071441 Page 71
DORANDA Campus, Opp. Eylex Cinemas, Hinoo, Ranchi-834002. Ph. 6201469038, 8092071442
www.brothersacademy.co.in Permutations and Combinations

49. Total number of 3 letters words that can be formed from the letter of the word ' AAAHNPRRS ' is equal
to
(a) 210 (b) 237 (c) 247 (d) 227
Sol. Ans. (c), Coefficient of x3 in  x  x  x  x  x  x  x    x  x    247
0 1 2 3 0 1 2 0 1 4

50. The number of ways to give away 20 identical apples to 3 boys, each boy receiving atleast 4 apples, is
(a) 10C8 (b) 90 (c) 22C20 (d) none of these
Sol. Ans. (a), After giving away 4 apples to each boy, 8 apples are left to be distributed among 3 boys.
 The required number of ways
 The number of non-negative integral solutions of  x  y  z  8   10C8

51. Let A be the set of 4-digit numbers a1 a2 a3 a4 where a1  a2  a3  a4 , then n  A is equal to

(a) 126 (b) 84 (c) 210 (d) None of these
Sol. Ans. (a), Any selecting of four digits from the nine digits 1, 2, 3, ......, 9 give one such number.
So , the required number of numbers  9C4  126

52. 
If P  n n 2  12  n 2
 22  n2  32  ....  n 2  r 2  , n  r , n  N , then P is divisible by
(a)  2r  2  ! (b)  2r  1 ! (c)  2r  1 ! (d) None of these
Sol. Ans. (c), P   n  r  ...  n  2  n  1 n  n  1 n  2  ...  n  r  is multiplication of 2r  1 consecutive
integer which is divisible by  2r  1 !.

53. 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
(a) 360 (b) 192 (c) 96 (d) 48
Sol. Ans. (c), The number of words starting with CC  4!
The number of words starting with CH  4! ; The number of words starting with CI  4!
The number of words starting with CN  4!
COCHIN is the first word in the list of word beginning with CO.
 Number of words that appear before the word COCHIN = 96.

54. The number of different matrices that be formed with elements 0, 1, 2 or 3, each matrix having 4
elements, is
(a) 3  24 (b) 2  4 4 (c) 3  44 (d) None of these
Sol. Ans. (c), A matrix having 4 elements can be of the order 1 4 or 4  1 or, 2  2 .
Since each element can take 4 values viz. 0, 1, 2, 3.
 Number of different matrices of order 1 4 is equal to 4  4  4  4  4 4
Similarly, number of matrices of each order is 4 4 .
Hence, required number of matrices  44  44  44  3  44

55. The number of signals that can be generated by using 6 differently coloured flags, when any number of
then may be hoisted at a time is
(a) 1956 (b) 1957 (c) 1958 (d) 1959
Sol. Ans. (a), The signals can be made by using at a time one or more flags.
The total number of signals when r flags are used at a time from 6 flags is equal to the number of
arrangement of 6, taking r at a time i.e. 6Cr  r ! .
Since r can take values 1, 2, 3, 4, 5, 6.

LALPUR Campus, Circular Road, Lalpur, Ranchi-834001. Ph. 7488408051, 8235071441 Page 72
DORANDA Campus, Opp. Eylex Cinemas, Hinoo, Ranchi-834002. Ph. 6201469038, 8092071442
www.brothersacademy.co.in Permutations and Combinations

Hence, the number of different signals that can be generated is,

6

r 1
Cr  r !  6  30  120  360  720  720  1956
6

56. The sum of all five digit numbers that can be formed using the digits 1, 2, 3, 4, 5, when repetition of digits
is not allowed, is
(a) 366000 (b) 660000 (c) 360000 (d) 3999960
Sol. Ans. (d), We know that the sum of all n -digit numbers formed by using n digits from the digits 1, 2, 3, 4,
 10n  1 
5, 6, 7, 8, 9 is, (Sum of the digits)   n  1 ! 
 10  1 

Hence, required sum  1  2  3  4  5   4! 

 105  1  100000  1  3999960
  360 
 10  1  9

57. The number of 6 digit numbers that can be made with the digits 0, 1, 2, 3, 4 and 5 so that even digits
occupy odd places, is
(a) 24 (b) 36 (c) 48 (d) None of these
Sol. Ans. (a), There are 3 odd and 3 even places.
Three odd places viz. first, third and fifth can be occupied by even digits 0, 2 and 4 in 3! ways.
But, 0 cannot occupy the first place from the left.
Therefore, the number of ways in which 3 odd places can be filled is  3! 2! .
Three even places can be filled in 3! ways.
Hence, total number of six digit numbers   3! 2!  3!  24

58. Seven different lectures are to deliver lectures in seven periods of a class on a particular day. P, Q and
R are three of the lecturers. The number of ways in which a routine for the day can be made such that P
delivers his lectures before Q and Q before R , is
(a) 420 (b) 120 (c) 210 (d) None of these
Sol. Ans. (d), Let us consider the arrangements of 7 objects out of which three are identical and remaining
distinct. In each arrangement of these 7 objects, let us mark the first identical item as P , second as Q
and third as R .
7!
We find that in all the arrangements P will occur prior to Q and Q will occur prior to R .
3!
7!
In the given sum also the required number of ways   840
3!

59. Six boys and six girls sit along a line alternately in x ways; and along a circle (again alternatively in y
ways), then
(a) x  y (b) y  12 x (c) x  10 y (d) x  12 y
x
Sol. Ans. (d), We have, x  6! 6! 6! 6!  2  6! and y  5!  6! 
2
 2  6  x  12 y
y

60. The number of ways in which a mixed double game can be arranged from amongst 9 married couples if
no husband and wife play in the same game is
(a) 756 (b) 1512 (c) 3024 (d) None of these
Sol. Ans. (c), Out of 9 men can be chosen in 9C2 ways.
Since, no husband and wife are to play in the same game, so, we have to select two women from the
remaining 7 women. This can be done in 7C2 ways.

LALPUR Campus, Circular Road, Lalpur, Ranchi-834001. Ph. 7488408051, 8235071441 Page 73
DORANDA Campus, Opp. Eylex Cinemas, Hinoo, Ranchi-834002. Ph. 6201469038, 8092071442
www.brothersacademy.co.in Permutations and Combinations

If M 1 , M 2 and W1 , W2 are chosen, then a team can be constituted in 4 ways

viz., M1W2 , M 1W1 ; M 2W1 ; M 2W2 .
Thus, the number of ways of arranging the game  9C2  7C2  4  3024

61. The number of words of four letters containing equal number of vowels and consonants, repetition being
allowed, is
(a) 1052 (b) 210  243 (c) 105  243 (d) None of these
Sol. Ans. (b), A four letter word containing equal number of vowels and consonants may contain one vowel
and one consonant or two vowels and two consonants.
4!
The number of four letters words containing one vowel and one consonant  C1  C1 
5 21

2!2!
The number of four letter words containing two vowels and two consonants  5C2  21C2  4!
4! 5
Hence, required number of words  C1  C1   C2  21C2  4!
5 21

2!2!
 105  6  10  210  24  210  3  240   210  243

62. The number of 6-digit numbers that can be made with the digits 1, 2, 3 and 4 and having exactly two pairs
of digits, is
(a) 480 (b) 540 (c) 1080 (d) None of these
Sol. Ans. (c), The number of 6-digits has two pairs of digits and 2 different digits.
The number of ways of selecting 2 digits for two pairs and 2 other digits  4C2  2C2 .
Now, we arrange these six digits which consists of two pairs and 2 different digits.
6! 6!
ways.  Required number of numbers  C2  C2   1080 .
4 2
This can be done in
2!2! 2!2!

63. Total number of 6-digit numbers in which all the odd digits appear, is
5 1
(a)  6! (b) 6! (d)  6! (d) None of these
2 2
Sol. Ans. (a), There are five odd digits.
Therefore, in a 6 digit number of odd digits one of the odd digits will repeat.
One odd digit can be chosen in 5C1 ways.
6!
Now, we have 6 digits which can be arranged in .
2!
6! 5
 Required number of numbers  5C1    6!
2! 2

64. The number of numbers divisible by 3 that can be formed by four different even digits is
(a) 18 (b) 36 (c) 24 (d) 48
Sol. Ans. (b), There are 6 even digits viz. 0, 2, 4, 6, 8.
We know that a number is divisible by 3 if the sum of its digits is divisible by 3.
Therefore, numbers must be formed by the digits 0, 2, 4, 6 or by 0, 4, 6, 8.
 Required number of numbers   4! 2!   4! 3!  36

65. If n objects are arranged in a row, then the number of ways of selecting three of these objects so that no
two of them are next to each other is
(a) n2C3 (b) n3C2 (c) n3C3 (d) none of these

LALPUR Campus, Circular Road, Lalpur, Ranchi-834001. Ph. 7488408051, 8235071441 Page 74
DORANDA Campus, Opp. Eylex Cinemas, Hinoo, Ranchi-834002. Ph. 6201469038, 8092071442
www.brothersacademy.co.in Permutations and Combinations

Sol. Ans. (a), Let x be the number of objects to the left of the first object chosen, y the number of objects
between the first and the second, z the number of objects between the second and the third and u the
number of objects to the right of the third object.
Then, x, u  0; y, z  1 and x  y  z  u  n  3
Let y1  y  1 and z1  z  1 . Then, y1  0, z  0 such that x  y1  z1  u  n  5.
n 5 4 1 n2
The total number of non-negative integral solutions of this equation is C41  C3 .

66. There are three piles of identical red, blue and green balls and each pile contains at least 10 bolls. The
number of ways of selecting 10 balls if twice as many red balls as green balls are to be selected is
(a) 3 (b) 4 (c) 6 (d) 8
Sol. Ans. (b), Let the number of green balls be x. Then, the number of red balls is 2 x.
Let the number of blue balls be y. Then, x  2 x  y  10  3x  y  10  y  10  3x
Clearly, x can taken values 0, 1, 2, 3.
The corresponding values of y are 10, 7, 4 and 1.
Thus, the possibilities are  0, 10, 0  ,  2, 7, 1 ,  4, 4, 2  and  6, 1, 3 , where  r , b, g  denotes the
number of red, blue and green balls.

67. The number of ways is which an examiner can assign 30 marks to 8 questions, giving not less than 2
marks to any question, is
(a) 21C7 (b) 21C8 (c) 21C9 (d) none of these
Sol. Ans. (a), Let xi denotes the marks assigned to the i th question.
Then, x1  x2  x3  x4  x5  x6  x7  x8  30, where xi  2, i  1, 2, ..., 8.
Let yi  xi  2, i  1, 2, ....., 8. Then, x1  x2  x3  .....  x8  30  y1  y2  y3  .....  y8  14
14 81
The total number of solutions of this equation is, C81  21C7 .

68. If x, y, z, t are odd natural numbers such that x  y  z  t  20, then the number of values of ordered
quadruplet  x, y, z , t  is
(a) 165 (b) 455 (c) 310 (d) none of these
Sol. Ans. (a), Let x  2l  1, y  2m  1, z  2n  1 and t  2 p  1, where l , m, n, p are integers such that
l  0, m  0, n  0 and p  0.
 x  y  z  t  20  2  l  m  n  p   16  l mn p 8
8 4 1
The total number of solutions of this equation is, C41  11C3  165
Hence, required number of quadruplet is 165.

69. The number of proper divisors of 1800 which are also divisible by 10, is
(a) 18 (b) 34 (c) 27 (d) none of these
Sol. Ans. (a), We have, 1800  23  32  52
Clearly, the required number of proper divisors is same as the number of ways of selecting at least one 2
and at least one 5 out 3 identical 2’s , 2 identical 3’s and 2 identical 5’s.
 Required number of proper divisors  3   2  1  2  18

70. The number of even proper divisors of 5040, is

(a) 48 (b) 47 (c) 46 (d) none of these

LALPUR Campus, Circular Road, Lalpur, Ranchi-834001. Ph. 7488408051, 8235071441 Page 75
DORANDA Campus, Opp. Eylex Cinemas, Hinoo, Ranchi-834002. Ph. 6201469038, 8092071442
www.brothersacademy.co.in Permutations and Combinations

Sol. Ans. (b), We have, 5040  24  32  5  7

 Number of even proper divisors
 Number of ways of selecting at least one, 2 and any number of 3’s, 5’s and 7.
  4    2  1  1  1  1  1  1  47.

71. The number of odd proper divisors of 5040, is

(a) 12 (b) 10 (c) 11 (d) none of these
Sol. Ans. (c), We have, 5040  2  3  5  7
4 2

 Number of odd proper divisors

 Number of ways of selecting any number of 3’s out two 3’s any number of 5’s and 7’s.
  2  11  11  1  1  11

72. The number of odd proper divisors of 3m  6n  21p , is

(a)  m  1 n  1 p  1  1 (b)  m  n  p  1 p  1  1
(c)  m  1 n  1 p  1  2 (d) none of these
Sol. Ans. (b), We have, 3m  6n  21p  3m  2n  3 p  7 p  2n  3m  n  p  7 p
Clearly, Number of odd proper divisors  Number of ways of selecting any number of 3’s and 7’s from
 m  n  p  identical 3’s and p identical 7’s   m  n  p  1 p  1  1

73. The number of divisors of the sum 4n  2  n  0  of the integer 240, is

(a) 4 (b) 8 (c) 10 (d) 3
Sol. Ans. (a), We have, 240  24  3  5 and, 4n  2  2  2n  1  2  An odd natural number
Hence, number of divisors of the from 4n  2
 Number of ways of selecting one 2 out of four 2’s and any number of 3’s and 5’s
 1 1  1  1  1  4.

74. The number of divisors of 24  33  52 having two prime factors, is

(a) 3 (b) 24 (c) 26 (d) 60
Sol. Ans. (c), The required number of ways is the number of ways of selecting at least one 2 and least one
three or at least one 3 and at least one 5 or at least one 2 and at least one 5 out of four 2’s, three 3’s and
two 5’s. Hence, required number of ways  4  3  3  2  2  4  12  6  8  26

75. Let A be a set of n   3 distinct elements. The number of triplets  a, b, c  of the elements of A in
which at least two coordinates are equal, is
(a) nC3  3! (b) n 3  nC3  3! (c) 3n 2  2n (d) 3n 2  n  1
Sol. Ans. (b), We have, Required number of triplets  Total number of triplets
 (Number of triplets in which no two coordinates are equal)
 n3  nC3  3!

76. Consider all possible permutations of the letters of the word ENDEANOEL. The number of
permutations in which none of the letters D, L, N occurs in the last five positions, is
(a) 5! (b) 2  5! (c) 7  5! (d) 21 5!

LALPUR Campus, Circular Road, Lalpur, Ranchi-834001. Ph. 7488408051, 8235071441 Page 76
DORANDA Campus, Opp. Eylex Cinemas, Hinoo, Ranchi-834002. Ph. 6201469038, 8092071442
www.brothersacademy.co.in Permutations and Combinations

4!
Sol. Ans. (b), Letters D, L, N , N occur in first four positions in ways.
2!
5!
Corresponding to each arrangement of D, L, N , N in first positions there are arrangements of
3!
remaining 5 letters in last five positions.
4! 5!
 Required number of arrangements    2  5!
2! 3!

77. Consider all possible permutations of the letters of the word ENDEANOEL. The number of
permutations in which letters A, E , O occur only in odd positions, is
(a) 5! (b) 2  5! (c) 7  5! (d) 21 5!
5!
Sol. Ans. (b), There are 5 odd and 4 even positions. Five odd positions can be filled with A, E , E , E , O in
3!
4!
ways and four even positions can be filled with D, N , N , L in ways.
2!
5! 4!
 Required number of permutations    2  5!
3! 2!

78. Let S  1, 2, 3, 4 . The total number of unordered pairs of disjoint subsets of S is equal to
(a) 25 (b) 34 (c) 42 (d) 41
Sol. Ans. (d), The total number of ordered pairs of disjoint subsets of S , except ordered pair  ,   is

 4
C0  24  4C1  23  4C2  2 2  4C3  21  4C4  2 0   1  1  2   1  80
4

80
 Total number of unordered pairs of disjoint subsets of S is equal to  1  41
2

79. In a certain test, ai students gave wrong answers to atleast i questions where i  1, 2, 3, ...., k. No
student gave more than k wrong answers. The total number of wrong answers given is
(a) a1  a2  ......  ak (b) a1  a2  ......  ak 1 (c) a1  a2  ......  ak 1 (d) None of these
Sol. Ans. (a), Total no. of wrong answers
 1  a1  a2   2   a2  a3   .....   k  1 ak 1  ak   kak  a1  a2  a3  ....ak

80. The number of rectangles excluding squares from a rectangle of size 9  6, is

(a) 391 (b) 791 (c) 842 (d) None of these
Sol. Ans. (b), Here, n  6and p  9
69 6
 Number of rectangles excluding square   6  1 9  1    7  r 10  r 
4 r 1
6
 945    70  17r  r 2   945  154  791
r 1

81. The number of ways of arranging m numbers out of 1, 2, 3, …., n so that maximum is  n  2  and
minimum is 2 (repetitions of numbers is allowed) such that maximum and minimum both occur exactly
once,  n  5, m  3 is
(b) mC2  n  3  (c) m  m  1 n  5 
n 3 m2 m2
(a) Cm  2 (d) nC2  nCm

LALPUR Campus, Circular Road, Lalpur, Ranchi-834001. Ph. 7488408051, 8235071441 Page 77
DORANDA Campus, Opp. Eylex Cinemas, Hinoo, Ranchi-834002. Ph. 6201469038, 8092071442
www.brothersacademy.co.in Permutations and Combinations

Sol. Ans. (c), First we take one number as 2 and one as  n  2  and put then in m  m  1 ways.
Now, remaining  m  2  , numbers can be any one from, 3, 4, …..,  n  4  ,  n  3 , which we can do in

 n  5 
m  2
.  Total number of ways  m  m  1 n  5 
m2

1 2 3 4 30 31
82. If E     .....   8 x , then value of x is
4 6 8 10 62 64
(a) 7 (b) 9 (c) 10 (d) 12
31! 1 1
 236   23   812 . Thus, x  12
12
Sol. Ans. (d), We have, E  31  
2  32! 231  32  236

83. The number of rational numbers lying in the interval  2002, 2003  all whose digits after the decimal
point are non-zero and are in decreasing order is
9 10
(a) 
i 1
9
Pi (b) 
i 1
9
Pi (c) 29  1 (d) 210  1

Sol. Ans. (c), A rational number of the desired category is of the form 2002, x1 x2 ........xk , where 1  k  9
and 9  x1  x2  ....  xk  1
We can choose k digits out 9 in 9Ck ways and arrange them in decreasing order in just one ways.
Thus, the desired number of rational numbers is, 9C1  9C2  .....  9C9  29  1

84. If the number of ways of selecting K coupons out of an unlimited number of coupons bearing the letters
A, T , M so that they cannot be used to spell the word MAT is 93, then K is equal to
(a) 3 (b) 5 (c) 7 (d) None of these
Sol. Ans. (b), Here, A, T , M bears unlimited number of coupons. Thus, selecting k in which word MAT is
not spelled  If atleast one letters is not selected. i.e. 3C1 …(i)
From the remaining two we have to select k i.e., for each selection of k coupons, we have two ways, for
k coupons, we have 2 k ways, but to select atleast one  2k  1 …(ii)
 Words cannot be used to spell MAT  3  2 K  1  93  K  5

85. The sum of the factors of 8! which are odd and are the form 3m  2 , where m is a natural number is
(a) 40 (b) 8 (c) 45 (d) 35
Sol. Ans. (a), Here, 8!  27  32  51  71 .
Obviously, the factors are not multiple of either 2 or 3.
So, the factors may be 1, 5, 7, 35 of which 5 and 35 are of the form 3m  2 . Sum = 40

86. f : 1, 2, 3, 4, 5  1, 2, 3, 4, 5 that are onto and f  i   i, is equal to

(a) 9 (b) 44 (c) 16 (d) none of these
Sol. Ans. (b), Total number of required functions  Number of dearrangement of 5 objects
1 1 1 1
 5!      44
 2! 3! 4! 5! 

87. A seven-digit number made up of all distinct digits 8, 7, 6, 4, 2, x and y is divisible by 3. Then possible
number of order pair  x, y  is
(a) 4 (b) 8 (c) 2 (d) None of these

LALPUR Campus, Circular Road, Lalpur, Ranchi-834001. Ph. 7488408051, 8235071441 Page 78
DORANDA Campus, Opp. Eylex Cinemas, Hinoo, Ranchi-834002. Ph. 6201469038, 8092071442
www.brothersacademy.co.in Permutations and Combinations

Sol. Ans. (b), Given distinct digits are 8, 7, 6, 4, 2, x and y

Any number is divisible by 3, if sum of digits is divisible by 3, i.e., x  y  27 is divisible by 3
x and y can take values from 0, 1, 3, 5, 9.
Possible pairs  5, 1 ,  3, 0  ,  9, 0  ,  9, 3 and 1, 5  ,  0, 3 ,  0, 9  ,  3, 9  .

88. A delegation of five students is to be formed from a group of 10 students. If three particular students want
to remain together whereas two particular students do not want to remain together then the number of
selections is
(a) 10 (b) 20 (c) 30 (d) None of these
Sol. Ans. (b), Let A, B, C want to remain together and D, E do not want to remain together.
In Out Number of selections

A, B, C , D E 5
C1  5
A, B, C , E D 5
C1  5
D A, B, C , E 5
C4  5
E A, B, C , D 5
C4  5

Required number of selections is, 5C1  5C1  5C4  5C4  20

89. n locks and n corresponding keys are available. But the actual combination is not know. The maximum
numbers of trials that are needed to assign the keys to their corresponding locks are
(a) nC2 (b) nCn 1 (c) n ! (d) n1C2
Sol. Ans. (a), First key will be tried for atmost  n  1 locks. Second key will be tried for atmost  n  2  locks
and so no.
n  n  1 n
Thus, the maximum number of trials needed   n  1   n  2   .....   C2
2

90. Total number of numbers that are less than 3 108 and can be formed using the digits 1, 2, 3 is equal to
1 9 1 9 1 1 9
(a)
2
 3  4.38  (b)
2
 3  3 (c)
2
 7  38  3  (d)
2
 3  3  38 
Sol. Ans. (c), Formed number can be atmost of nine digits.
Total number of such numbers  3  32  33  ...  38  2.38
3  38  139  3  4.38 7  38  3
  2.38  
3 1 2 2
91. Two players P1 and P2 plays a series of '2n ' games. Each game can result in either a win or loss for P1.
Total number of ways in which P1 can win the series of these games, is equal to
1 1 1 1
(a)  22 n  2 nCn  (b)  2 2 n  2  2 nCn  (c)  2 n  2 nCn  (d)  2 n  2  2 nCn 
2 2 2 2
n
1
Sol. Ans. (a), Total ways   Cn  r  Cn 1  ....  C2 n   2 2 n  2 nCn 
2n 2n 2n

r 1 2

92. In the decimal system of numeration the number of 6-digit numbers in which the sum of the digits is
divisible by 5 is
(a) 180000 (b) 540000 (c) 5  105 (d) None of these

LALPUR Campus, Circular Road, Lalpur, Ranchi-834001. Ph. 7488408051, 8235071441 Page 79
DORANDA Campus, Opp. Eylex Cinemas, Hinoo, Ranchi-834002. Ph. 6201469038, 8092071442
www.brothersacademy.co.in Permutations and Combinations

Sol. Ans. (a), Ways :      

9 10 10 10 10 2
0 cannot be placed in the first place. In the other four places any digit can go.
After filling the first five places, the last place can be filled by 0 to 5.
 The required number of numbers  9 104  2  180000

93. Four couples (husband and wife) decide to form a committee of four members. The number of different
committees that can be formed in which no couple finds a place is
(a) 10 (b) 12 (c) 14 (d) 16
Sol. Ans. (d), The number of committees of 4 gentlemen  4C4  1 .
The number of committees of 3 gentlemen, 1 wife  4C3  1C1
[ After selecting 3 gentlemen, only wife is left who can be included.]
The number of committees of 2 gentlemen, 2 wives  4C2  2C2 .
The number of committees of 1 gentlemen, 3 wives  4C1  3C3
The number of committees of 4 wives  1
 The required number of committees  1  4  6  4  1  16

94. A shopkeeper sells three varieties of perfumes and he has a large number of bottles of the same size of
each variety in his stock. There are 5 places in a row in his showcase.
The number of different ways of displaying the three varieties of perfumes in the showcase is
(a) 6 (b) 50 (c) 150 (d) None of these
Sol. Ans. (c),
Possibilities Selections Arrangements
5!
One triplet, two different 3
C1  2C2 C1  2C2 
3
 60
3!
5!
Two pairs, one different 3C2  1C1
3
C2  1C1   90
2!2!
 Required number of ways  150

95. The number of times of the digits 3 will be written when listing the integer from 1 to 1000 is
(a) 269 (b) 300 (c) 271 (d) 302
Sol. Ans. (b), Since, 3 does not occur in 1000, we have to count the number of times 3 occurs when we list the
integers from 1 to 999. Any number between 1 and 999 is of the from xyz where 0  x, y, z  9.
Let us first count the numbers in which 3 occurs exactly once.
Since, 3 can occur at one place in 3C1 ways, there are 3C1  9  9   3  92 such numbers.
Next, 3 can occur exactly two places in  C   9   3  9 such numbers.
3
2

Lastly, 3 can occur in all three digits in one number only

 
Hence, the number of times 3 occurs is, 1 3  9 2  2   3  9   3  1  300
96. Five balls of different colours are to be placed in three boxes of different sizes. Each box can hold all five
balls. The number of ways in which we can place the balls in the boxes (order is not considered in the
box) so that no box remains empty is
(a) 150 (b) 300 (c) 200 (d) none of these
Sol. Ans. (a), One possible arrangements is, 2 2 1
 
Three such arrangements are possible. Therefore, the number of ways is 5C2 3C2 1C1  3  90  
The other possible arrangements is, 1 1 2
Three such arrangements are possible. In this case, the number of ways is  C  C  C   3  60
5
1
4
1
3
3

Hence, the total number of ways is 90  60  150

LALPUR Campus, Circular Road, Lalpur, Ranchi-834001. Ph. 7488408051, 8235071441 Page 80
DORANDA Campus, Opp. Eylex Cinemas, Hinoo, Ranchi-834002. Ph. 6201469038, 8092071442
www.brothersacademy.co.in Permutations and Combinations

97. In the next word cup of cricket there will be 12 teams, divided equally in two groups. Teams of each group
will play a match against each other. From each group 3 top teams will qualify for the next round. In this
round each team will play against others once. Four top teams of this round will qualify for the semifinal
round, where each team will play against the other three. Two top teams of this round will go to the final
round, where they will play the best of three matches. The minimum number of matches in the next world
cup will be
(a) 54 (b) 53 (c) 38 (d) None of these
Sol. Ans. (b), The number of matches in the first round  6
C 2  6
C 2

The number of matches in the next round  6C2

The number of matches in the semifinal round  4C2
So, the required number of matches  6C2  6C2  6C2  4C2  2  53
[Note : For “best of there” atleast two matches are played]

98. A class has 30 students. We have to form a team of the students including atleast two students and also
excluding atleast two students. The number of ways of forming the team is
(a) 2n  2n (b) 2n  2n  2 (c) 2n  2n  4 (d) None of these
Sol. Ans. (b), Required number of ways  C2  C3  ... Cn3  Cn  2
n n n n

 2n   nC0  nC1  nCn 1  nCn   2n  1  n  n  1  2n  2  n  1 .

99. Line L1 contains l1 points and line L2 contains l2 points. If the points on L1 are joined to the points on
L2 then maximum number of points of intersection of new lines, is
(a) l1 C2  l2 C2 (b) 4  l1C2  l2 C2 (c) 2  l1C2  l2 C2 (d) None of these
Sol. Ans. (c),
1 2 3 4 5 l1
L1

L2
1 2 3 4 5 l2
Required number of points on intersection of new lines
 2  number of choosing 1 point on L1 and 2 points on L2  2  l1 C1  l2 C2

100. In the figure, two 4-digit numbers are to be formed by filing the places with digits. The number of
different ways in which the places can be filled by digits so that the sum of the numbers formed in also a
4-digit number and in no place the addition is with carrying, is
Th H T U
(b) 36   55 
3
(a) 554
(c) 454 (d) None of these 
Sol. Ans. (b), If 0 is placed in the units place of the upper number, then the units place of the lower number
can be filled in 10 ways (filling by any one of 0, 1, 2,...., 9).
If 1 is placed in the units place of the upper number, then the units place of the lower number can be filled
in 9 ways (filling by any one of 0, 1, 2,...., 8), etc.
 The units column can be filled in 10  9  8  ...  1, i.e., 55 ways.
Similarly, for the second and the third columns, the number of ways for the fourth column
 8  7  .....  1  36
 The required number of ways  55  55  55  36  36  553

LALPUR Campus, Circular Road, Lalpur, Ranchi-834001. Ph. 7488408051, 8235071441 Page 81
DORANDA Campus, Opp. Eylex Cinemas, Hinoo, Ranchi-834002. Ph. 6201469038, 8092071442
www.brothersacademy.co.in Permutations and Combinations

101. If a, b, c are three natural numbers in AP and a  b  c  21, then the possible number of values of the
ordered triplet  a, b, c  is
(a) 15 (b) 14 (c) 13 (d) None of these
Sol. Ans. (c), a  a  d  a  2d  21or a  d  7  a  c  14 and b  7 .
The number of positive integral solutions of  a  c  14  is 13.

102. If a, b, c, d are odd natural numbers such that a  b  c  d  20, then the number of values of the
ordered 4-tuple  a, b, c, d  is
(a) 165 (b) 455 (c) 310 (d) None of these
Sol. Ans. (a), Let a  2 p  1, b  2q  1, c  2r  1, d  2s  1 where p, q, r are non-negative integer.
 2 p  1  2q  1  2r  1  2 s  1  20 or p  q  r  s  8
The required number of solutions
 The number of non-negative integral solutions of  p  q  r  s  8


8  3 8  2  8  1  165
6

103. If x, y , z are integers and x  0, y  1, z  2, x  y  z  15 then the number of values of the ordered
triplet  x, y, z  is
(a) 91 (b) 455 (c) 17C15 (d) None of these
Sol. Ans. (a), Let y  p  1, z  q  2. Then x  0, p  0, q  0 and x  y  z  15 implies x  p  q  12
 The required of values of  x, y, z  and hence of  x, p, q  .
 The number of non-negative integral solutions of  x  p  q  12 
14! 14 13
 14C2    91
12!2! 2

104. The number of arrangements of the letters of the word ' BHARAT ' taking 3 at a time is
(a) 72 (b) 120 (c) 14 (d) None of these

Sol. Ans. (a),

Possibilities Selections Arrangements
3!
One pair, one different C1  4C1
1 1
C1  4C1   12
2!
Three different 5
C3 5
C3  3!  60
 The required number of ways  72

105. The number of ways of selecting 10 balls out of an unlimited number of white, red, blue and green balls is
(a) 270 (b) 84 (c) 286 (d) 86
Sol. Ans. (c), Let x1 , x2 , x3 , x4 be the number of white, red, blue, green balls respectively that are selected.
Then, x1  x2  x3  x4  10.
The required number of ways  No of whole number solutions of above equation.
13  12  11
 
 Coefficient of y10 in 1  4C1  5C2 y 2  6C3 y 3  ....  13C3 
23
 286

LALPUR Campus, Circular Road, Lalpur, Ranchi-834001. Ph. 7488408051, 8235071441 Page 82
DORANDA Campus, Opp. Eylex Cinemas, Hinoo, Ranchi-834002. Ph. 6201469038, 8092071442
www.brothersacademy.co.in Permutations and Combinations

IITAdvanced Level Solved Examples

106. The total number of integral solutions of the equation x  y  z  t  29 where x  1, y  2, z  3 and
t  0 , is
(a) 26C4 (b) 26C3 (c) 22C3 (c) 29C3
Sol. Ans. (b), Here, upper limit of all the variables is more than 29 and the lower limit is non-negative.
So, the upper limit of each variable can be taken as infinity.
Hence, required number of solutions
   
= Coefficient of x 29 in x1  x 2  x 3  ... x 2  x 3  .... x 3  x 4  .... x 0  x  x 2  .... 
  ....
4
= Coefficient of x 29 in x 6 1  x  x 2

= Coefficient of x 23 in 1  x 
4 23 4 1
 C41  26C3
Alternatively : We have, x  1, y  2, z  3 and t  0 . Let u  x  1,   y  2, w  z  3
Then, x  1  u  0, y  2    0, z  3  w  0
Thus, we have u  1    2  w  3  t  29  u    w  t  23 , where u  0,   0, w  0, t  0
The total number of solution of this equation is, 23 41C41  26C3
107. The number of ways in which 16 sovereigns can be distributed among three applicants such that each
applicant does not receive less than 3 sovereigns, is
(a) 16C3 (b) 9C2 (c) 9C3 (d) 10C2
Sol. Ans. (b), Let x, y, z be the number of sovereigns received by the three applicants.
Then, x  3, y  3, z  3 and x  y  z  16 .
Thus, the required number of ways is equal to the number of solution of the equation x  y  z  16 ,
where x  3, y  3 , z  3 .
Clearly, when x and y take their minimum values, z will assume its maximum value.
Therefore, the maximum value of z is given by 3  3  z  16  z  10
Similarly, the maximum values of x and y are each equal to 10.
Thus, the required number of ways is same as the number of solution of the equation x  y  z  16 ,
where 3  x , y , z  10 .

 
3
Hence, required number of ways = Coefficient of x16 in x 3  x 4  ... 10
3
 1  x8 
7

= Coefficient of x in 1  x  ...  x 
7 3
= Coefficient of x in  7

 1 x 
= Coefficient of x 7 in 1  x 
3 7 31
 C31  9C2  36
Alternatively : Let x, y, z be the number of sovereigns received by the three applicants.
Then, x  3, y  3, z  3 and x  y  z  16 . Let u  x  3,   y  3 and w  z  3 .
Then. u  0,   0, w  0 and u  3    3  w  3  16  u    w  7
7  31
The total number of solutions of this equation is, C31  9C2  36
108. Total number of integral solution of the system of equations x1  x2  x3  x4  x5  20 and
x1  x2  x3  5 when xk  0 , is
(a) 335 (b) 336 (c) 338 (d) 340
Sol. Ans. (b), We have, x1  x2  x3  x4  x5  20 and x1  x2  x3  5
These two equations reduce to x4  x5  15 …(i) and x1  x2  x3  5 …(ii)
Since corresponding to each solution of (i) there are solutions of equation (ii).
So, total number of solutions of the given system of equations

LALPUR Campus, Circular Road, Lalpur, Ranchi-834001. Ph. 7488408051, 8235071441 Page 83
DORANDA Campus, Opp. Eylex Cinemas, Hinoo, Ranchi-834002. Ph. 6201469038, 8092071442
www.brothersacademy.co.in Permutations and Combinations

 [No. of solutions of (i)]  [No. of solutions of (ii)]

 15 21C21  531C31  16C1  7C2  336
109. In how many ways can four persons, each throwing a dice once, make a sum of 6?
(a) 9C2 (b) 10C3 (c) 8C3 (d) 9C3
Sol. Ans. (d), Let x1 , x2 , x3 , x4 be the numbers obtained by the four persons on the upper faces of their
respective dice. Then, the required number of ways will be equal to the number of solutions of the
equation x1  x2  x3  x4  6 , where 1  x1 , x2 , x3 , x4  6
Since, the upper limit is six which is equal to the sum required.
So, the upper limit for each variable can be taken as infinite.
 
4
Hence, required number of ways = Coefficient of x 6 in 1  x  x 2  ....

= Coefficient of x 6 in 1  x 
4 6  4 1
 C41  9C3  84
110. In how many ways can four persons, each throwing a dice once, make a sum of 13?
(a) 220 (b) 180 (c) 140 (d) 80
Sol. Ans. (c), Let x1 , x2 , x3 and x4 be the numbers on the upper faces of the four dice.
Then, the required number of ways is equal to the number of solutions of
x1  x2  x3  x4  13 , where 1  x1 , x2 , x3 , x4  6
 
4
The number of solutions of this equation is equal to the coefficient of x13 in x1  x 2  ....  x 6
4
 1  x6 
13

= Coefficient of x in x 1  x  x  .....  x
4 4

5 4 9
= Coefficient of x in  
 1 x 
  1  x  C  4C1 x 6  4C2 x12  ... 1  x 
4 4 4
= Coefficient of x 9 in 1  x 6 = Coefficient of x 9 in 4
0

= Coefficient of x 9 in 4C0 1  x   Coefficient of x 9 in 4C1 x 6 1  x 

4 4

 4C0  (Coefficient of x 9 in 1  x   4C1  Coefficient of x 3 in 1  x  )

4 4

 4C0  9  41C41  4C1  3 41C41   12C3  4  6C3  220  80  140

111. Between two junction stations A and B there are 12 intermediate stations. The total number of ways in
which a train can be made to stop at 4 of these stations so that no two of these halting stations are
consecutive, is
(a) 9C5 (b) 9C4 (c) 10C4 (d) 10C5
Sol. Ans. (b), Let x1 be the number of stations before the first halting station, x2 between first and second, x3
between second and third, x4 between third and fourth and x5 on the right of the 4th stations.
Then, x1  0, x5  0, x2 , x3 , x4  1 such that x1  x2  x3  x4  x5  8 …(i)
Junction:A Junction:B
S1 S2 S3 S11 S12
The total number of ways is the number of solutions of the above equation.
Let y2  x2  1, y3  x3  1, y4  x4  1 .
Then, (i) reduces to x1  y2  y3  y4  x5  5 , where y2 , y3 , y4  0 .
5 51
The number of solution of this equation is C51  9C4 .
112. The number of ways in which n distinct objects can be put into two identical boxes so that no box
remains empty, is
(a) 2n  2 (b) 2n  1 (c) 2 n1  1 (d) n 2  2
Sol. Ans. (c), Let us first label the boxes B1 and B2 . Now, each object can be put either in B1 or in B2 .
So, there are two ways to deal with each of the n objects.

LALPUR Campus, Circular Road, Lalpur, Ranchi-834001. Ph. 7488408051, 8235071441 Page 84
DORANDA Campus, Opp. Eylex Cinemas, Hinoo, Ranchi-834002. Ph. 6201469038, 8092071442
www.brothersacademy.co.in Permutations and Combinations

Consequently, n objects can be deal with 2 n ways. Out of these are 2 n ways, there are two ways
(i) when all objects are put in box B1 (ii) when all objects are put in box B2 .
Thus, there 2n  2 ways in which neither box is empty.
If we now remove the labels from the boxes so that they become identical, this number must be divided
by 2 to get the required number of ways.
1 n
 Required number of ways 
2
 2  2   2n1  1
m
113. The number of distinct rational numbers x such that 0  x  1 and x  , where m, n 
n
1, 2, 3, 4, 5, 6 , is
(a) 15 (b) 13 (c) 12 (d) 11
Sol. Ans. (d), We have, 0  x  1 . Therefore, m  n .
Clearly, n can take any of the five values 2, 3, 4, 5 and 6.
If n takes one of these values say i , then corresponding to i , m can take  i  1 values.
6
 Number of ways of selecting m and n    i  1  15
i2
Thus, total number of rational numbers = 15.
But, these 15 rational numbers also include those rational numbers which are counted more than once.
1 2 3 2 4 1 2
For example,   ,  , 
2 4 6 3 6 3 6
1 2 1
This means that is counted thrice, is counted twice and is also counted twice.
2 3 3
Hence, total umber of distinct rational numbers  15  4  11 .

114. The total number of 5 digit number of different digits in which the digit in the middle is the largest is
9
(a) 30  3! (b) 33  3! (c) 
n4
C4  4!
n
(d) None of these

Sol. Ans. (d), The largest digit in the middle of the five digit number can be 4 (when numbers are formed with
digits 0, 1, 2, 3, 4), 5 (when 0, 1, 2, 3, 4, 5 are used), …., 9 (when 0, 1, 2, …, 9 are used).

 Number of five digit numbers with largest digit 4 in the middle  4C4  4! 3C3  3! 
Number of five digit numbers with largest digit 5 in the middle  C
5
4  4! C3  3! and so on.
4

Hence, required number of numbers  C

5
4  4!  3C3  3!   5C4  4!  4C3  3!
  6C4  4! 5C3  3!  .....   9C4  4!  8C3  3!
115. The number of times the digit 3 will be written when listing the integers from 1 to 1000 is
(a) 269 (b) 300 (c) 271 (d) 302
Sol. Ans. (b), Since 3 does not occur in 1000.
So, we have to count the number of times 3 occurs when we list the integers from 1 to 999.
Any number between 1 and 999 is of the form abc , where 0  a , b, c  9 .
Clearly, Number of times 3 occurs
= (No. of numbers in which 3 occurs exactly at one place)
+ 2 (No. of numbers in which 3 occurs exactly at two places)
+ 3 (No. of numbers in which 3 occurs exactly at three places)
Now, No. of numbers in which 3 occurs exactly at one place : Since 3 can occur at one place in 3C1 ways
and each of the remaining two places can be filled in 9 ways.

LALPUR Campus, Circular Road, Lalpur, Ranchi-834001. Ph. 7488408051, 8235071441 Page 85
DORANDA Campus, Opp. Eylex Cinemas, Hinoo, Ranchi-834002. Ph. 6201469038, 8092071442
www.brothersacademy.co.in Permutations and Combinations

So, number of numbers in which 3 occurs exactly at one place  3C1  9  9

No. of numbers in which 3 occurs exactly at two place : Since 3 can occur exactly at two places in 3C2
ways and the remaining place can be filled in 9 ways.
So, number of numbers in which 3 occurs exactly at two places  3C2  9 .
No. of numbers in which 3 occurs at all the three places : Since 3 can occur in all the three digits in one
way only. So, number of numbers in which 3 occurs all the three places in one.

Hence, numbers of times 3 occurs  3C1  9  9  2 3C2  9  3  1  300 
116. If n objects are arranged in a row, then the number of ways of selecting three of these objects so that no
two of them are next to each other is
(a) n 3C3 (b) n3C2 (c) n2C3 (d) None of these
Sol. Ans. (c), Let x1 be the number of objects to the left of first objects, x2 the number of objects between the
first and second, x3 the number objects between second and third and x4 the number of objects to the
right of the third object. Then, x1  0, x2  1, x3  1 and x4  0 such that
x1  x2  x3  x4  n  3 …(i)
Clearly, the total number of ways is the total number of solutions of (i).
Let y2  x2  1 and y3  x3  1 .
Then, equation (i) reduces to x1  y2  y3  x4  n  5, where x1 , x4  0, y2 , y3  0
The number of solutions of this equation is, n 5 4 1C41  n  2C3
117. Between two junction stations A and B there are 12 intermediate stations. The number of ways in which
a train can be made to stop at 4 of these stations so that no two of these halting stations are consecutive,
is
(a) 8C4 (b) 9C4 (c) 12C4  4 (d) none of these
Sol. Ans. (b), Let x1 be the number of stations before the first halting station, x2 between first and second, x3
between second and third, x4 between third and fourth and x5 on the right of the 4th station.
Then, x1  0, x5  0, x2 , x3 , x4  1 such that x1  x2  x3  x4  x5  8 …(i)
The total number of ways is the number of solutions of the above equation.
Let y2  x2  1, y3  x3  1, y4  x4  1.
Then, equation (i) reduces to x1  y2  y3  y4  x5  5, where y2 , y3 , y4  0.
The number of solutions of this equation is 551C51  9C4 .
118. The number of ways in which a score of 11 can be made from a throw by three persons, each throwing a
single die once, is
(a) 45 (b) 18 (c) 27 (d) none of these
Sol. Ans. (c), We have, Required number of ways
   
3 3
 Coeff. of x11 in x  x 2  .....  x 6  Coeff. of x 8 in 1  x  x 2  ..... x 5
3
 1  x6 
  Coeff. of x in 1  x  1  x 
6 3 3
 Coeff. of x in 
8 8

 1 x 
 
 Coeff. of x 8 in 1  3C1 x 6  ..... 1  x 
3

 831C31  3C1. 2  31

C31  10C2  3  4C2  27
119. The sum of all the numbers of four different digits that can be made by using the digits 0, 1, 2 and 3, is
(a) 26664 (b) 39996 (c) 38664 (d) none of these
Sol. Ans. (c), We have, Required sum
 (Sum of all the numbers formed by the digits 0, 1, 2, 3 )
 (Sum of all numbers having 0 at thousand place)

LALPUR Campus, Circular Road, Lalpur, Ranchi-834001. Ph. 7488408051, 8235071441 Page 86
DORANDA Campus, Opp. Eylex Cinemas, Hinoo, Ranchi-834002. Ph. 6201469038, 8092071442
www.brothersacademy.co.in Permutations and Combinations

 104  1   103  1 
  0  1  2  3   4  1 !    1  2  3  3  1 !  
 10  1   10  1 
 104  1   103  1  4
 6  3!       4 10  1   999  40000  4  1332  38664.
4
 6 2! 
 9   9  3
Alternatively : We have, Number of numbers with 0 in the unit’s place  3!  6
Number of numbers with 1 or 2 or 3 in the units place  3! 2!  4.
 Sum of the digits in unit’s place  6  0  4 1  4  2  4  3  24.
Similarly, Sum of the digits in ten’s place  24
Sum of the digits in hundred’s place  24.
Number of numbers with 1or 2 or 3 in the thousands place  3!  6
 Sum of the digits in the thousands place  6 1  6  2  6  3  36
Hence, the required sum  36 1000  24 100  24 10  24  38664.
120. Five distinct letters are to be transmitted through a communication channel. A total number of 15 blanks
is to be inserted between the two letters with atleast three between every two. The number of ways in
which this can be done is :
(a) 1200 (b) 1800 (c) 2400 (d) 3000
Sol. Ans. (a), For 1  i  4 , let xi   3 be the number of blanks between i th and  i  1 th letters.
Then, x1  x2  x3  x4  15 …(i)

 
4
The number of solutions of (i) = Coeff. of t 15 in t 3  t 4  .....

= Coeff. of t 3 in 1  t 
4
= Coeff. of t 3 in 1  4C1t  5C2t 2  6C3t 3  .....  6C3  20
But 5 letters can be permuted in 5!  120 ways.
Thus, the required number of arrangements  120  20   2400
121. Ajay writes letters to his five friends and addresses the corresponding. The number of ways can the
letters be placed in the envelopes so that atleast two of them are in the wrong envelopes are
(a) 120 (b) 125 (c) 119 (d) None of these
5
Sol. Ans. (c), Required number of ways  
r 2
C5 r D  r 
5

 1 1 1  1  5 5!  1 1  1 
r r
5
5!
 r !1     .....      ...  
r  2 r ! 5  r  !  r !  r  2  5  r  !  2! 3!
 1! 2! 3! r ! 
5!  1  5!  1 1  5!  1 1 1  5!  1 1 1 1 
              
5!  2!  2!  2! 3!  1!  2! 3! 4!  0!  2! 3! 4! 5! 
 10  20   60  20  5    60  20  5  1  10  20  45  44 = 119
122. The number of ways of selecting n objects out of 3n objects, of which n are alike and rest are different is

(a) 2 2 n 1 
 2n  1! (b) 2 2 n 1 
 2n  1! (c) 2 2 n 1 
 2n  1! (d) None of these
n ! n  1 ! n ! n  1! n ! n  1 !

  x  x
2n
Sol. Ans. (a), The required number of ways  Coefficient of x n in x 0  x1  x 2  ....  x n 0

 2 nCn  2 nCn1  ....  2 nC1  2 nC0

1
  2 nCn   2 nC0  2 nC1  ...  2 nC n  2 nCn 1  ...  2 nC 2 n   nCr  nCr  r 
2


1 2n 1  2n !
 Cn  2 2 n   

 22 n   22 n 1 
 2n  1!
2 2  n !n !  n ! n  1 !

LALPUR Campus, Circular Road, Lalpur, Ranchi-834001. Ph. 7488408051, 8235071441 Page 87
DORANDA Campus, Opp. Eylex Cinemas, Hinoo, Ranchi-834002. Ph. 6201469038, 8092071442
www.brothersacademy.co.in Permutations and Combinations

123. There are three papers of 100 marks each in an examination. Then the number of ways can a student get
150 marks such that he gets atleast 60% in two papers
(a) 3C2  32C2 (b) 3C4  32C2 (c) 3C4  36C2 (d) 3C4  36C3
Sol. Ans. (a), Suppose the student gets atleast 60% marks in first two papers, then the he just get at most 30
marks in the third paper to make a total of 150 marks.
So, the required number of ways
= Coefficient of x150 in  x  x  ....  x  1  x  x  ....  x 
60 61 100 2 2 30

= Coefficient of x 30 in 1  x  ...  x  1  x  ...  x 

40 2 30

2
 1  x 41   1  x31 
30
= Coefficient of x in    
 1 x   1 x 
= Coefficient of x30 in 1  x 
3 30  31
 C31  32C2
32
Thus, the student gets atleast 60% marks in first two papers to get 150 marks as total in C2 ways.
3
But the two papers, of atleast 60% marks, can be chosen out of 3 papers in C2 ways.
Hence, the required number of ways  3C2  32C2
124. The number of ways in which 16 identical things can be distributed among 4 persons if each person gets
atleast 3 things, is
(a) 33 (b) 35 (c) 38 (d) None of these
 
4
Sol. Ans. (b), Required number = Coefficient of x16 in x 3  x 4  .....  x 7

 
4
= Coefficient of x 4 in x12 1  x  ....  x 4
4
 1  x5 
 = coefficient of x in 1  x  1  x  
4
= Coefficient of x in  4  5 4 4 

 1  x 
= coefficient of x 4 in 1  4 x5  6 x10  ... 1  x  
4
 
4567
= coefficient of x 4 in 1  x   7C4 
4
 35
4!
Alternatively : x1  x2  x3  x4  16 ,
where, x1 , x2 , x3 , x4  3 or x1  3  a1 , x2  3  a2 , x3  3  a3 , x4  3  a4
 a1 , a2 , a3 , a4  0 or a1  a2  a3  a4  8  Number of solution  4  4 1
C41  7C3  35
125. The number of ways in which 30 marks can be allotted to 8 questions if each question carries atleast 2
marks, is
(a) 115280 (b) 117280 (c) 116280 (d) None of these
 
8
Sol. Ans. (c), Required number = Coefficient of x30 in x 2  x 3  ....  x16
8
 1  x15 
= Coefficient of x 30
in x16
1  x  ....  x  14 8
= Coefficient of x in  14

 1 x 
= coefficient of x14 in 1  x 
8
 21C14  116280
Alternatively : Let the marks given in each question be x1 , x2 , x3 ,....., x8
where xi  2 , i  1, 2, 3,...., 8
and x1  x2  x3  .....  x8  30 , let x1  2  a1 , x2  2  a2 , x3  2  a3 ,....., x8  2  a8
 a1  a2  a3  .....  a8  30  16  14
Hence, number of solutions  1481C81  21C7  116280

LALPUR Campus, Circular Road, Lalpur, Ranchi-834001. Ph. 7488408051, 8235071441 Page 88
DORANDA Campus, Opp. Eylex Cinemas, Hinoo, Ranchi-834002. Ph. 6201469038, 8092071442
www.brothersacademy.co.in Permutations and Combinations

126. In a shooting competition a man can score 5, 4, 3, 2 or 0 points for each shot. Then the number of different
ways in which he can score 30 in seven shots is
(a) 419 (b) 418 (c) 420 (d) 421
Sol. Ans. (c), Number of ways of making 30 in 7 shots is,
 
7
Coefficient of x30 in x 0  x 2  x 3  x 4  x5

 x  x 2  x 3   x 4  x  1 
7
 Coefficient of x30 in 0


 Coefficient of x30 in x 28  x  1  7C1 x 24   x  1  1  x 2  x 3   7C2 x 20  x  1  x3  x  1  ....
7 6 5 2

 7C5  7C1  7C3  6C2  6C0   7C2  5C1  2   21  252  147  420
127. How many number of ways in which the sum of upper faces of four distinct dices can be six?
(a) 10 (b) 4 (c) 6 (d) 7
Sol. Ans. (a), The number of required ways will be equal to the number of solutions of
x1  x2  x3  x4  6 …(i)
where x1 , x2 , x3 , x4  1 and x1  1  a1 , x2  1  a2 , x3  1  a3 , x4  1  a4  0
  a1  1 a2  1   a3  1   a4  1  6 , where a1 , a2 , a3 , a4  0
 a1  a2  a3  a4  2 .  Number of solutions  2 41C41  5C3  10
128. Total number of positive integral solution of 15  x1  x2  x3  20 , is equal to
(a) 1125 (b) 1150 (c) 1245 (d) 685
Sol. Ans. (d), 15  x1  x2  x3  20  x1  x2  x3  16  r , where r  0, 1, 2, 3, 4 .
13 r  31 15 r
Now, number of positive integral solution of x1  x2  x3  16  r is C13 r i.e., C13 r  15 r C2
4
Thus, total solutions  
r 0
15 r
C2  15C2  16C2  17C2  18C2  19C2  20C3  15C3  685

129. Let S  1, 2, 3, ....., n . If X denote the set of all subsets of S containing exactly two elements, then the
value of   min A  is
A X
n 1
(a) C3 (b) nC3 (c) nC2 (d) None of these
Sol. Ans. (a), There are exactly  n  1 subsets of S containing two elements having 1 as least element;
exactly  n  2  subsets of S having 2 as least elements and so on,
Thus,
A X
 min  A  1 n  1  2  n  2   ....   n  11
n 1 n 1 n 1
1  1
  r  n  r   n r  r 2  n  n  n  1   n  n  1 2n  1
r 1 r 1 r 1 2  6
1 1
 n  n  13n  2n  1   n  1 n  n  1  n 1C3
6 6
130. The number of positive integral solutions of the equation x1 x2 x3 x4 x5  420 is
(a) 1875 (b) 1600 (c) 1250 (d) None of these
Sol. Ans. (a), Since, x1 x2 x3 x4 x5  420  x1 x2 x3 x4 x5  22  3  5  7
Each of 3, 5 or 7 can take 5 places and 2 2 can be disposed in 15 ways.

So, required no. of solutions  53 5C1  5C2  53  15  1875 
Alternatively : x1 x2 x3 x4 x5  2  3  5  7 . Here, 2 2 can be assigned to a1 , a2 , a3 , a4 , a5
2

2  5 1
 a1  a2  a3  a4  a5  2  C51  6C4  15
Also, 31 can be assigned to b1 , b2 , b3 , b4 , b5

LALPUR Campus, Circular Road, Lalpur, Ranchi-834001. Ph. 7488408051, 8235071441 Page 89
DORANDA Campus, Opp. Eylex Cinemas, Hinoo, Ranchi-834002. Ph. 6201469038, 8092071442
www.brothersacademy.co.in Permutations and Combinations

 b1  b2  b3  b4  b5  1  151C51  5C4  5 . Similarly, for 5 and 7.

 Total number of positive integral solutions  15  5  5  5  1875
131. The number of numbers lying in  2, 3 when all the digits after decimal are non-zero and in increasing
order is
9 10
(a) 
i 1
9
Pi (b) 511 (c) i 1
10
Pi (d) 1023

Sol. Ans. (d), Since, the digits required is non-zero.

 To select amongst 1, 2, 3, 4, 5, 6, 7, 8, 9
Thus, any number is of the form 2 x1 , x2 , ......xk 3 , where 1  x1  x2  x3  .....  x9  9
i.e., number of numbers lying between  2, 3  9C1  9C2  9C3  ......  9C9  29  1  1023
132. Let f  n  denote the number of different ways the positive integer ' n ' can be expressed as the sum of
1's and 2 ' s . For example f  4   5, since 4  1  1  1  1, 1  1  2, 1  2  1, 2  1  1, 2  2
(Note : that order of 1’s and 2’s is important) then f  f  6   is
(a) f  6  (b) f 12  (c) f 13 (d) None of these

Sol. Ans. (c), As f  4   5 given

 f  6  can be written using 1' s and 2 ' s as

Number of 1’s Number of 2’s No. of arrangements

3!
0 3 1
3!
4!
2 2 6
2!2!
5!
4 1 5
4!
6!
6 0 1
6!
Total  13

 f  6   13  f  f  6    f 13
133. The number of numbers from 1 to 100, which are neither divisible by 3 nor by 5 nor by 7 is
(a) 67 (b) 55 (c) 45 (d) 33
Sol. Ans. (c), A : set of numbers which are divisible by 3.
B : Set of numbers which are divisible by 5.
C : Set of numbers which are divisible by 7.
Number of numbers which are divisible by atleast one of 3 or 5 or 7
 n  A  B  C   n  A   n  B   n  C   n  A  B   n  B  C   n  C  A  n  A  B  C 
100  100  100  100  100  100  100 
        55
 3   5   7   15   21   35  105 
 Desired number  100  55  45

LALPUR Campus, Circular Road, Lalpur, Ranchi-834001. Ph. 7488408051, 8235071441 Page 90
DORANDA Campus, Opp. Eylex Cinemas, Hinoo, Ranchi-834002. Ph. 6201469038, 8092071442
www.brothersacademy.co.in Permutations and Combinations

134. A six letters word is formed using the letters of the word ALMIGHTY with or without repetition. The
number of words that contain exactly three different letters is
(a) 15600 (b) 30240 (c) 8 P6  8 P3 (d) none of these
Sol. Ans. (b), We can select three different letters in 8C3 ways. Suppose we select A, L , M .
Let X : set of words in which A is absent, Y : set of words in which L is absent
and Z : set of words in which M is absent.
   
Then, n  X  Y  Z   26  26  2 6  16  16  16  0  189
So, the number of six letter words formed by using A, L and M  36  189  540
 The desired number of words  8C3  540  30240
135. The number of permutations of the letters of the word HINDUSTAN such that neither the pattern ' HIN '
nor ' DUS ' nor ' TAN ' appears, are
(a) 166674 (b) 169194 (c) 166680 (d) 181434
9!
Sol. Ans. (b), Total number of permutations 
2!
7!
Number of those containing ‘HIN’  7!; Number of those containing ‘DUS’ 
2!
Number of those containing ‘TAN’  7!; Number of those containing ‘HIN’ and ‘DUS’  5!
Number of those containing ‘HIN’ and ‘TAN’  5!
Number of those containing ‘TAN’ and ‘DUS’  5!
Number of those containing ‘HIN’, ‘DUS’ and ‘TAN’  3!
9!  7! 
Required number    7! 7!   3  5! 3!  169194
2!  2
136. If n objects are arranged in a row, then the number of ways of selecting three objects so that no two of
them are next to each other is

(a)
 n  2 n  3 n  4  (b) n2C3
3
(c) n  2C3  n 3C2 (d) None of these
Sol. Ans. (b), Let x0 be the number of objects to the left of the first object chosen, x1 the number of objects
between the first and the second, x2 the number of objects between the second and the third and x3 the
number of objects to the right of the third object.
We have, x0 , x3  0, x1 , x2  1 and x0  x1  x2  x3  n  3 …(i)
The number of solutions of Eq. (i). Let x0  x0  1, & x3  x3  1
 The given equation becomes x0  x1  x2  x3  x  1 which has n 11
C41  n 2
C3 number of natural
solutions.
137. Total number of positive integral solution of x1  x2  2 x2  15 is equal to
(a) 42 (b) 70 (c) 32 (d) None of these
Sol. Ans. (a), x1  x2  2 x2  15  x1  x2  15  2 x2 where x2 can be 1, 2, ..., 7.
Let x2  r  x1  x2  15  2r
Number of positive integral solutions of this equation  14  2r 
7
7  8
 Total no. of solutions   14  2r   14  7  2     42
r 1  2 
138. Total number of ways in which 15 identical blankets can be distributed among 4 persons so that each of
them gets atleast two blankets, is equal to
(a) 10C3 (b) 9C3 (c) 11C3 (d) None of these

LALPUR Campus, Circular Road, Lalpur, Ranchi-834001. Ph. 7488408051, 8235071441 Page 91
DORANDA Campus, Opp. Eylex Cinemas, Hinoo, Ranchi-834002. Ph. 6201469038, 8092071442
www.brothersacademy.co.in Permutations and Combinations

Sol. Ans. (a), x1  x2  x3  x4  15 and xi  2   x1  2    x2  2    x3  2    x4  2   7

 y1  y2  y3  y4  7, where yi  xi  2  0  10C7  10C3 are number of non-negative.

IITMains Level - I

1. If 12
Pr  1320 , then r is equal to :
(a) 5 (b) 4 (c) 3 (d) 2
2. If C12  C6 , then C2 
n n n

(a) 72 (b) 153 (c) 306 (d) 2256

3. If 8Cr  7C3  7C2 , then r is equal to :
(a) 3 (b) 4 (c) 8 (d) 6
n
4. The value of Pr is equal to :
(a) n 1
Pr  r . n 1Pr 1 (b) n . n 1Pr  n 1
Pr 1 (c) n  n 1
Pr  n 1Pr 1  (d) n 1
Pr 1  n1Pr
5. If nCr  nCr 1 and n Pr  n Pr 1 , then the value of n is :
(a) 3 (b) 4 (c) 2 (d) 5
6. The number of permutations by taking all letters and keeping the vowels of the word COMBINE in the odd
places is :
(a) 96 (b) 144 (c) 512 (d) 576
7. The number of ways of arranging letters of the word HAVANA so that V and N do not appear together is :
(a) 60 (b) 80 (c) 100 (d) 120
8. 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 chair marked 1 to 4; and then the men select the chairs from
amongst the remaining. The number of possible arrangements is :
(a) 6C3  4C2 (b) 4 P2  6 P3 (c) 4C2  4 P3 (d) none of these
9. How many numbers lying between 999 and 10000 can be formed with the help of the digit 0, 2, 3, 6, 7, 8
when the digits are not be replaced?
(a) 100 (b) 200 (c) 300 (d) 400
10. In how many different ways can be letters of the word ‘MATHEMATICS’ be arranged?
(c) 11! 2! (d) 11!/  2!
2 3
(a) 11! (b) 11!/ 2!
11. How many numbers of 6 digits can be formed from the digits of the number 112233?
(a) 30 (b) 60 (c) 90 (d) 120
12. How many 4 digit numbers greater than 4000 can be formed from the digits 2, 4, 5, 5, 7?
(a) 12 (b) 24 (c) 36 (d) 48
13. The number of words that can be formed out of the letters of the word ‘ARTICLE’ so that the vowels
occupy even places, is :
(a) 574 (b) 36 (c) 754 (d) 144
14. The number of different words that can be formed from the letters of the word ‘PENCIL’ so that no two
vowels are together, is :
(a) 120 (b) 260 (c) 240 (d) 480
15. How many four digit numbers can be formed using the digits 1, 2, 3, 4, 5 such that at least one of the digit
is repeated?
(a) 4 4  5! (b) 45  4! (c) 54  4! (d) 54  5!
16. If there are n number of seats and m number of people have to be seated, then how many ways are
possible to do this  m  n  ?

LALPUR Campus, Circular Road, Lalpur, Ranchi-834001. Ph. 7488408051, 8235071441 Page 92
DORANDA Campus, Opp. Eylex Cinemas, Hinoo, Ranchi-834002. Ph. 6201469038, 8092071442
www.brothersacademy.co.in Permutations and Combinations

(a) n Pm (b) nCm (c) nCn   m  1 ! (d) n 1

Pm1
17. The number of signals that can be sent using 5 flags of different colours, taking one or more at a time, is :
(a) 300 (b) 225 (c) 450 (d) 325
18. Let 1, 2, 3, 4 are four digits. How many numbers can be made using all four numbers repetition of digits
not allowed :
(a) 1 (b) 3 (c) 2 (d) 64
19. From 12 books, the difference between number of ways a selection of 5 books when one specified book is
always excluded and one specified book is always included, is :
(a) 64 (b) 118 (c) 132 (d) 330
20. The set S  1, 2, 3, ..., 12 is to be partitioned into three sets A, B, C of equal size.
Thus A  B  C  S , A  B  B  C  A  C   . The number of ways to partition S is :
(a) 12!/ 3! 4! (b) 12!/ 3! 3! (c) 12!/  4! (d) 12!/  3!
3 4 3 4

21. There are 10 lams in a hall. Each one of them can be switched on independently. The number of ways in
which the hall can be illuminated, is :
(a) 210 (b) 10! (c) 1023 (d) 10 2
22. The number of ways in which 6 rings can be worn on four fingers of one hand, is :
(a) 4 6 (b) 6C4 (c) 6 4 (d) 24
23. There is a set of m parallel lines intersecting a set of another n parallel lines in a plane. The number of
parallelograms formed, is :
(a) m1C2 . n 1C2 (b) mC2 . nC2 (c) m1C2 . nC2 (d) mC2 . n 1C2
24. The number of rectangles in the adjoining figure is :
(a) 5  5
(b) 5 P2  5 P2
(c) 5C2  5C2
(d) none of these
25. The number of rectangles which can be formed on a chessboard is :
(a) 81 (b) 1296 (c) 648 (d) none of these
26. The number of ways in which we can be choose a committee from 4 men and 6 women so that the
committee includes at least two men and exactly twice as many women as men is :
(a) 94 (b) 126 (c) 128 (d) none of these
27. A father with 8 children takes 3 at a time to the Zoological Garden, as often as he can without taking the
same 3 children together more than once. The number of times he will go to the garden is :
(a) 336 (b) 112 (c) 56 (d) none of these
28. The maximum population of a country in which no two persons have an identical set of teeth (Disregard
the shape and size of the teeth. Take only the positioning of the teeth in consideration. Also, assume that
there is no person without a tooth and no person has more than 32 teeth) is :
(a) 232 (b) 232  1 (c) 3232 (d) 32!
29. If out of p  q  r things p are alike, q are alike, then the number of arrangements equals :
(a)  p  q  r !/ p !q ! (b)  p  1 q  1 r  1 (c) 2 p  q  2 r  1 (d)  p  q  1 r  1  1
30. There are 10 points in a plane, out of these 6 are collinear. The number of triangles formed by joining
these points is :
(a) 100 (b) 120 (c) 150 (d) none of these
31. In an examination, a candidate is required to pass four different subjects. The number of ways he can fail
is :
(a) 4 (b) 10 (c) 15 (d) 24
32. How many words can be formed from the letters of the word ‘COMMITTEE’?
9! 9! 9!
(a) (b) (c) (d) 9!
 2!  2!
2 3
2!

LALPUR Campus, Circular Road, Lalpur, Ranchi-834001. Ph. 7488408051, 8235071441 Page 93
DORANDA Campus, Opp. Eylex Cinemas, Hinoo, Ranchi-834002. Ph. 6201469038, 8092071442
www.brothersacademy.co.in Permutations and Combinations

33. There are n distinct points on a circle. The number of pentagons that can be formed with these points as
vertices is equal to the number of possible triangles. Then the value of n is :
(a) 7 (b) 8 (c) 15 (d) 30
34. A student is to answer 10 out of 13 questions in an examination such that he must choose atleast 4 from
the first five questions. The number of choices available to him is :
(a) 346 (b) 140 (c) 196 (d) 280
35. In how many ways can 5 prizes be distributed among four students when every student can take zero or
one more prizes:
(a) 1024 (b) 625 (c) 120 (d) 600
36. How many numbers, lying between 99 and 1000 be made from the digits 2, 3, 7, 0, 8, 6 when the digits
occur only once in each number:
(a) 100 (b) 90 (c) 120 (d) 80
37. The number of ways in which 5 boys and 3 girls can be seated in a row so that no two girls are together
(a) 2880 (b) 1880 (c) 3800 (d) 2800
38. The number of words that can be formed out of the letters of the word ARTICES so that the vowels occupy
even places is:
(a) 36 (b) 574 (c) 144 (d) 754
39. In how many ways can 6 persons be selected from 4 officers and 8 constables, if atleast one officer is to be
included :
(a) 224 (b) 672 (c) 896 (d) None of these
40. Number of divisors of n  38808 (except 1 and h ) is:
(a) 70 (b) 68 (c) 72 (d) 74
41. How many numbers can be made with the help of the digits 0, 1, 2, 3, 4, 5 which are grater than 3000
(repetition is not allowed):
(a) 180 (b) 360 (c) 1380 (d) 1500
42. How many words can be made from the letters of the word INSRANCE, if all vowels come together:
(a) 18270 (b) 17280 (c) 12780 (d) None of these
43. A father with 8 children takes 3 at a time to the zoological gardens, as often as he can without taking the
same 3 children together more than once. The number of times he will go to the garden is:
(a) 336 (b) 112 (c) 56 (d) None of these
44. If the  n  1 numbers a, b, c, d ,..., be all different and each of them a prime number, then the number
of different factors (other than 1) of a m .b.c.d ... is:
(a) m  2n (b)  m  1 2 n (c)  m  1 2 n  1 (d) none of these
45. In a circus there are ten cages for accommodating ten animals. Out of these four cages are so small that
five out of 10 animals cannot enter into them. In how many ways will it be possible to accommodate ten
animals in these ten cages:
(a) 66400 (b) 86400 (c) 96400 (d) None of these
46. Eight chairs are numbered 1 to 8. Two women and three men wish to occupy one chair each. First the
women choose the chairs form amongst the chairs marked 1 to 4 and then men select the chairs from
amongst the remaining. The number of possible arrangements is:
(a) 6 C3 4 C2 (b) 4 C2  4 P3 (c) 4 P2  4 P3 (d) None of these
47. How many numbers divisible by 5 and lying between 3000 and 4000 that can be formed from the digits 1,
2, 3, 4, 5, 6 (repetition of digits is not allowed)?
(a) 6 P2 (b) 5P2 (c) 4 P2 (d) 6 P3
48. The number of numbers of 4 digits which are not divisible by 5, are :
(a) 7200 (b) 3600 (c) 14400 (d) 1800
49. The number of divisors of 9600 including 1 and 9600 are :
(a) 60 (b) 58 (c) 48 (d) 46
50. The maximum number of points of intersection of 6 circles is :
(a) 25 (b) 24 (c) 50 (d) 30

LALPUR Campus, Circular Road, Lalpur, Ranchi-834001. Ph. 7488408051, 8235071441 Page 94
DORANDA Campus, Opp. Eylex Cinemas, Hinoo, Ranchi-834002. Ph. 6201469038, 8092071442
www.brothersacademy.co.in Permutations and Combinations

51. A total number of words which can be formed out the letters a, b, c, d , e, f taken 3 together such that
each word contains at least one vowel, is :
(a) 72 (b) 48 (c) 96 (d) none of these
52. If a polygon has 44 diagonal, then the number of its sides are :
(a) 11 (b) 7 (c) 8 (d) none of these
53. The number of parallelograms that can be formed from a set of four parallel lines intersecting another set
of three parallel lines, is :
(a) 6 (b) 18 (c) 12 (d) 9
54. In a football championship, there were played 153 matches. Every team played one match with each
other. The number of teams participating in the championship is :
(a) 17 (b) 18 (c) 9 (d) 13
55. In how many nights may a watch of 4 men be arranged by a security agency from a crew of 16 so that no
two watches are identical? On how many of these nights would a particular person be off-duty?
(a) 1820 (b) 455 (c) 1365 (d) none of these
56. The number of five-letter words containing 3 vowels and 2 consonants that can be formed using the
letters of the word ' EQUATION ' so that the two consonants occur together, is
(a) 720 (b) 1440 (c) 240 (d) 480
57. The number of ways in which 7 plus (+) signs and 5 minus ( ) signs can be arranged in a row so that no
two minus signs are together, is
(a) 8C5  5! (b) 7C5  5! (c) 8C5 (d) 7!
58. The number of ways in which a pack of 52 cards can be divided equally into four groups, is
52! 52! 52! 52!
(a) (b) (c) (d)
13!
4
13!
4
4! 13!
4
4 13!  4!
59. The number of ways in which 8 distinct toys can be distributed among 5 children is
(a) 58 (b) 85 (c) 8 P5 (d) 40
60. The number of arrangements of the letters of the word BANANA in which two N ' s do not appear
adjacently is
(a) 40 (b) 60 (c) 80 (d) 100

61. How many different 9 digit numbers can be formed from the number 223355888 by rearranging its
digits so that the odd digits occupy even positions?
(a) 16 (b) 36 (c) 60 (d) 180
62. The number of 4-digit numbers that can be made with the digits 1,2,3,4 and 5 in which at least two digits
are identical, is
(a) 45  5! (b) 505 (c) 600 (d) None of these
63. There are n white and n black balls marked 1, 2, 3, …, n . The number of ways in which we can arrange
we can arrange these balls in a row so that neighbouring balls are of different colours is

(a) n ! (b)  2n  ! (c) 2  n !

2
(d)
 2n !
 n !
2

64. There are 5 mangoes, 3 oranges and 4 bananas. The number of ways of selecting at least one fruit of each
kind, is
5!
(a) (b) 5! (c) 5! 2! (d) 3!
2!
65. There are 4 mangoes, 3 apples, 2 oranges and 1 each of 3 other varieties of fruits. The number of ways of
selecting at least one fruit of each kind, is
(a) 10! (b) 9! (c) 4! (d) None of these
66. If x, y, z , ….are  m  1 distinct prime numbers, the number of factors of x n y z …., is
(a) m  n  1 (c)  n  1 2
n
(b) 2n m (d) n 2m

LALPUR Campus, Circular Road, Lalpur, Ranchi-834001. Ph. 7488408051, 8235071441 Page 95
DORANDA Campus, Opp. Eylex Cinemas, Hinoo, Ranchi-834002. Ph. 6201469038, 8092071442
www.brothersacademy.co.in Permutations and Combinations

67. The number of all three element subsets of the set a1 , a2 , a3 , ..., an  which contains a3 , is
n 1 n 1
(a) nC3 (b) C3 (c) C2 (d) None of these
68. Seven different lecturers are to deliver lectures in seven periods of a class on a particular day. A, B and
C are three of the lecturers. The number of ways in which a routine for the day can be made such that A
delivers his lecture before B and B before C , is
(a) 420 (b) 120 (c) 210 (d) None of these
69. Let S be the set of all functions from the set A to the set A. If n  A  k , then n  S  is
(a) k ! (b) k k (d) 2 k  1 (d) 2 k
70. Let A be the set of 4-digits numbers a1 a2 a3 a4 where a1  a2  a3  a4 , then n  A is equal to
(a) 126 (b) 84 (c) 210 (d) None of these
71. A person predicts the outcome of 20 cricket matches of his home team. Each match can result either in a
win, loss or tie for the home team. Total number of ways in which he can make the predictions so that
exactly 20 predictions are correct, is equal to
(a) 20C10  210 (b) 20C10  320 (c) 20C10  310 (d) 20C10  220
72. A team of four students is to be selected from a total of 12 students. Total number of ways in which team
can be selected such that two particular students refuse to be together and other two particular students
wish to be together only, is equal to
(a) 220 (b) 182 (c) 226 (d) none of these
73. In an examination of 9 papers a candidate has to pass in more papers than the number of papers in which
he fails in order to be successful. The number of ways in which the can be unsuccessful is
(a) 255 (b) 256 (c) 193 (d) 319
74. The number of ways in which a couple can sit around a table with 6 guests if the couple take consecutive
seats is
(a) 1440 (b) 720 (c) 5040 (d) None of these
75. The number of words of four letters containing equal number of vowels and consonants, repetition
allowed, is
(a) 1052 (b) 210  243 (c) 105  243 (d) None of these

76. From 4 gentlemen and 6 ladies a committee of five is to be selected. The number of ways, in which the
committee can be formed so that gentlemen are in majority, is
(a) 66 (b) 156 (c) 60 (d) none of these

77. If a polygon has 44 diagonals then the number of its sides are
(a) 11 (b) 7 (c) 8 (d) none of these
78. The ten’s digit in 1! 4! 7! 10! 12! 13! 15! 16! 17! is divisible by :
(a) 4 (b) 3! (c) 5 (d) 7
79. All the words that can be formed using alphabets A, H, L, U, R are written as in a dictionary (no alphabet is
repeated). Then, the rank of the word RAHUL is :
(a) 70 (b) 71 (c) 72 (d) 74
80. Eight different letters of an alphabet are given. Words of four letters from these are formed. The number
of such words with at least one letter repeated is :
8 8 8
(a)    P4 (b) 8    (c) 84  8 P4 (d) 8   
8 4 4

 4  4  4
81. The number of natural numbers less than 1000, in which no two digits are repeated, is :
(a) 738 (b) 792 (c) 837 (d) 720
82. The sum of all five digit numbers that can be formed using the digits 1, 2, 3, 4, 5 when repetition of digits
is not allowed, is :
(a) 366000 (b) 660000 (c) 360000 (d) 3999960

LALPUR Campus, Circular Road, Lalpur, Ranchi-834001. Ph. 7488408051, 8235071441 Page 96
DORANDA Campus, Opp. Eylex Cinemas, Hinoo, Ranchi-834002. Ph. 6201469038, 8092071442
www.brothersacademy.co.in Permutations and Combinations

83. If the letters of the word ‘SACHIN’ are arranged in all possible ways and these words are written out as in
dictionary, then the word ‘SACHIN’ appears at serial number :
(a) 602 (b) 603 (c) 600 (d) 601
84. If all permutations of the letters of the word AGAIN are arranged as in dictionary, then fifteen word is
(a) NAAGI (b) NAGAI (c) NAAIG (d) NAIAG
85. Assuming that no two consecutive digit are same. The number of n digit numbers is :
(a) n ! (b) 9! (c) 9n (d) n 9
86. Number of number greater than 1000 but not greater than 4000 which can be formed with the digits 0, 1,
2, 3, 4, are :
(a) 350 (b) 375 (c) 450 (d) 576
87. The number of ways in which 5 ladies and 7 gentlemen can be seated in a round table so that no two
ladies sit together, is :
7
 720  (b) 7  360  (c)  720 
2 2 2
(a) (d) 720
2
88. The number of ways of arraigning 8 men and 4 women around a circular table such that no two women
can sit together, is :
(a) 8! (b) 4! (c) 8!4! (d) 7! 8 P4
89. 20 persons are invited for a party. In how many different ways can they and the host be seated at circular
table, if the two particular persons are to be seated on either side of the host?
(a) 20! (b) 2! 18! (c) 18! (d) none of these
90. Four dice are rolled. The number of possible outcomes in which at least one dice shows 2 is :
(a) 625 (b) 671 (c) 1023 (d) 1296
91. The number of ways in which one can select three distinct integers between 1 and 30, both inclusive,
whose sum is even, is :
(a) 455 (b) 1575 (c) 1120 (d) 2030
92. A student is to answer 10 out of 13 questions in an examination such that he must choose at least 4 from
the first five questions. The number of choices available to him is :
(a) 140 (b) 196 (c) 280 (d) 346
93. In how many ways can 21 English and 19 Hindi books be placed in a row so that no two Hindi books are
together?
(a) 1540 (b) 1450 (c) 1504 (d) 1405
94. A lady gives a dinner party for six guest. The number of ways in which they may be selected from among
ten friends, if two of the friends will not, attends the party together is :
(a) 112 (b) 140 (c) 164 (d) none of these
95. If a man and his wife enter in a bus, in which five seats are vacant, then the number of different ways in
which they can be seated, is :
(a) 2 (b) 5 (c) 20 (d) 40
96. There are 4 letters and 4 directed envelopes. The number of ways in which all letters are not inserted in
correct envelopes is :
(a) 23 (b) 24 (c) 16 (d) none of these
97. The number of permutations that can be formed by arranging all the letters of the word ‘NINETEEN’ in
which no two E’s occur together is :
8! 5! 5! 6 8! 6
(a) (b) (c)  C3 (d)  C3
3!3! 3! 6C2 3! 5!
98. The maximum number of points into which 4 circle and 4 straight lines intersect is :
(a) 26 (b) 50 (c) 56 (d) 72
99. Every body in a room shakes hand with every body else. The total number of hand shakes is 66. The total
number of persons in the room is :
(a) 11 (b) 12 (c) 13 (d) 14
100. The number of 5-digit telephone numbers having at least one of their digits repeated is (supposing first
can be zero also) :
(a) 90000 (b) 10000 (c) 30240 (d) 69760

LALPUR Campus, Circular Road, Lalpur, Ranchi-834001. Ph. 7488408051, 8235071441 Page 97
DORANDA Campus, Opp. Eylex Cinemas, Hinoo, Ranchi-834002. Ph. 6201469038, 8092071442
www.brothersacademy.co.in Permutations and Combinations

IITMains Level - II
01. The number of ways in which a mixed doubles tennis game be arranged between 10 players consisting of
6 men and 4 women :
(a) 180 (b) 90 (c) 48 (d) 12
02. There were two women participating in a chess tournament. Every participant played two games with the
other participants. The number of games that the men played between themselves proved to exceed by
66 the number of games that the men played with the women. The number of participants is :
(a) 6 (b) 11 (c) 13 (d) none of these
03. The number of all the possible selections which a student can make for answering one or more questions
out of the eight given questions in a paper, when each question has an alternative is :
(a) 256 (b) 6560 (c) 6561 (d) none of these
04. If the permutations of A, B, C, D, E taken all together be written down in alphabetical order as in
dictionary and numbered, then the rank of the permutation DEBAC is :
(a) 90 (b) 91 (c) 92 (d) 93
05. In a plane there are 37 straight liens, of which 13 pass through the point A and 11 pass through the point
B . Besides, no three lines pass through one point, no line passes through both point A and B , and no
two are parallel. Then the number of intersection points the lines have is equal to :
(a) 535 (b) 601 (c) 728 (d) none of these
06. All the letters of the word EAMCET are arranged in all possible ways. The number of such arrangements
in which no two vowels are adjacent to each other is :
(a) 360 (b) 144 (c) 72 (d) 54
07. The sum of the digits at the unit place of all the numbers formed with the help of 3, 4, 5, 6 taken all at a
time is :
(a) 432 (b) 108 (c) 36 (d) 18
08. 12 persons are to be arranged on a round table. If two particular persons among them are not to sit side
by side, the number of arrangements is :
(a) 9 10! (b) 2 10! (c) 45  8! (d) 10!
09. The sum of the digits at the ten’s place of all the numbers formed with the help of 3, 4, 5, 6 taken all at a
time is :
(a) 432 (b) 108 (c) 36 (d) 18
10. A fruit basket contains 4 identical oranges, 5 identical apples and 6 identical mangoes. The number of
ways a person make selection of fruits from among the fruits in the basket is :
(a) 210 (b) 209 (c) 208 (d) none of these
11. How many numbers between 5000 and 10000 can be formed using the digits 1, 2, 3, 4, 5, 6, 7, 8, 9 each
digit appearing not more than once in each number?
(a) 5  8 P3 (b) 5  8C8 (c) 5! 8 P3 (d) 5! 8C3
12. A box contains 2 white balls, 3 black balls and 4 red balls. The number of ways in which three balls can be
drawn from the box so that at least one of the balls is black is :
(a) 74 (b) 84 (c) 64 (d) 20
13. The number of ways in which 5 boys and 3 girls be seated in a row so that each girl is between two boys is
:
(a) 2880 (b) 1880 (c) 3800 (d) 2800
14. The number of ways in which a committee of 6 members can be formed from 8 gentlemen and 4 ladies so
that the committee contains atleast 3 ladies is :
(a) 252 (b) 672 (c) 444 (d) 420
15. Let N be the number of quadratic equations with coefficients from  0, 1, 2, 3, ..., 9  such that 0 is a
solution of each question. Then the value of N is :
(a) 29 (b) infinite (c) 90 (d) 900
16. The number of words that can be formed out of the letters of the word “ARTICLE” so that the vowels
occupy even places is :
(a) 574 (b) 36 (c) 754 (d) 144

LALPUR Campus, Circular Road, Lalpur, Ranchi-834001. Ph. 7488408051, 8235071441 Page 98
DORANDA Campus, Opp. Eylex Cinemas, Hinoo, Ranchi-834002. Ph. 6201469038, 8092071442
www.brothersacademy.co.in Permutations and Combinations

17. Let l1 and l2 be two lines intersecting at P . If A1 , B1 , C1 are points on l1 and A2 , B2 , C2 , D2 , E2 are
points on l2 and if none of then coincides with P , then the number of triangles formed by these eight
points is :
(a) 56 (b) 55 (c) 46 (d) 45
18. In how many ways can 5 different beads be arranged to form a necklace?
(a) 12 (b) 120 (c) 60 (d) 24
19. In how many ways a team of 10 players out of 22 can be made if 6 particular players are always to be
included and 4 particular players are always excluded?
(a) 22C10 (b) 18C3 (c) 12C4 (d) 18C4
20. There are 10 points in space; no four of which lie in the same plane with the exception of 5, which are in
the same plane. The number of planes, each containing three of them is :
(a) 111 (b) 112 (c) 120 (d) 121
21. The number of numbers that can be formed by using all of the digits 1, 2, 3, 4, 5 (repetition of digits is not
permissible), such that tens digit is greater than thousands digit, is :
(a) 60 (b) 45 (c) 30 (d) none of these
22. The number of committees of 5, consisting of at least one female number, that can be formed by 6 males
and 4 females is :
(a) 246 (b) 252 (c) 6 (d) none of these
23. Number of numbers greater than 1000 but less than 4000 that can be formed by using the digits 0, 1, 2, 3,
4 when repetition is allowed is :
(a) 125 (b) 105 (c) 375 (d) 625
24. In a plane, there are 37 straight lines, of which 13 pass through the point A and 11 pass through the
point B . Besides, no three liens pass through one point, no line passes through both points A and B
and no two are parallel. Then the number of intersection points the lines have is equal to :
(a) 535 (b) 601 (c) 728 (d) none of these
25. The sides AB, BC , CA of a triangle ABC have 3, 4 and 5 interior points respectively on them. The
number of triangles that can be constructed using these points as vertices is :
(a) 220 (b) 210 (c) 205 (d) 200
26. A lady gives a dinner party for six guests. The number of ways in which they may be selected from among
ten friends if two of the friends will not attend the party together is :
(a) 112 (b) 140 (c) 164 (d) none of these
27. The number of ways in which we can select four numbers from 1 to 30 so as to exclude every selection of
four consecutive numbers is :
(a) 27378 (b) 27405 (c) 27399 (d) none of these
28. A candidate is required to answer 6 out of 10 questions which are divided into two groups each
containing 5 questions and he is not permitted to attempt more than 4 from each group. The number of
ways be can make up his choice is :
(a) 150 (b) 200 (c) 250 (d) 300
29. The number of 4 digit even number that can be formed using 0, 1, 2, 3, 5, 6 without repetition is:
(a) 120 (b) 300 (c) 420 (d) none of these
30. 20 persons are invited for a party. In how many different ways can they and the host be seated at a
circular table, if the two particular persons are to be seated on either side of the host:
(a) 20! (b) 2.18! (c) 18! (d) None of these
31. In how many ways a team of 11 players can be formed out of 25 players, if 6 out of them are always to be
included and 5 are always to be exclude:
(a) 2020 (b) 2002 (c) 2008 (d) 8002
32. The number of ways in which 10 persons can go in two boats so that there may be 5 on each boat,
supposing that two particular persons will not go in the same boat is:
1 1
(a)
2
 10
C5  (b) 2  8
C4  (c)
2
 8
C5  (d) None of these

33. The number of ways in which a committee of 6 members can be formed form 8 gentlemen and 4 ladies so
that the committee contains at least 3 ladies is:
(a) 252 (b) 672 (c) 444 (d) 420

LALPUR Campus, Circular Road, Lalpur, Ranchi-834001. Ph. 7488408051, 8235071441 Page 99
DORANDA Campus, Opp. Eylex Cinemas, Hinoo, Ranchi-834002. Ph. 6201469038, 8092071442
www.brothersacademy.co.in Permutations and Combinations

34. Six points in a plane be joined in all possible ways by indefinite straight lines, and if no two of them be
coincident or parallel, and no three pass though the same point (with the exception of the original 6
points). The number of distinct points of intersection is equal to:
(a) 105 (b) 45 (c) 51 (d) None of these
35. A parallelogram is cut by two sets of m lines parallel to its sides. The number of parallelograms thus
formed is:
     
m 2 m 1 2 m2 2
(a) C2 (b) C2 (c) C2 (d) None of these
36. There are 16 points in a plane, no three of which are in a straight line except 8 which are all a straight
line. The number of triangles that can be formed by joining them equals:
(a) 504 (b) 552 (c) 560 (d) 1120
37. The number of straight lines that can be formed by joining 20 points no three of which are in the same
straight line except 4 of them which are in the same line:
(a) 183 (b) 186 (c) 197 (d) 185
38. A question paper is divided into two parts A and B and each parts contains 5 questions. The number of
ways in which a candidate can answer 6 questions selecting at least two questions form each part is:
(a) 80 (b) 100 (c) 200 (d) None of these
39. The number of ways in which five identical balls can be distributed among ten identical boxes such that
no box contains more than one ball, is:
10! 10!
(a) 10! (b) (c) (d) None of these
 5!
2
5!
40. A committee of 12 is to be formed from 9 women and 8 men in which at least 5 women have to be
included in a committee. Then the number of committees in which the women are in majority and men
are in majority are respectively:
(a) 4784, 1008 (b) 2702, 3360 (c) 6062, 2702 (d) 2702, 1008
41. The total number of ways in which 9 different toys can be distributed among three different children, so
that the youngest gets 4, the middle gets 3 and the oldest gets 2, is:
(a) 137 (b) 236 (c) 1240 (d) 1260
42. In an examination there are three multiple choice questions and each question has 4 choices of answers
in which only one is correct. The total number of ways in which an examinee can fail to get all answers
correct is:
(a) 11 (b) 12 (c) 27 (d) 63
43. Two straight lines intersect at a point O. Points A1 , A2 ,...., An are taken on one line and points
B1 , B2 , ..., Bn on the other. If the point O is not to be used, the number of triangles that can be drawn
using these points as vertices, is:
(a) n  n  1 (b) n  n  1 (c) n2  n  1 (d) n 2  n  1
2 2

44. The number of triangles whose vertices are the vertices of an octagon but none of whose sides happen to
come from the octagon is:
(a) 16 (b) 28 (c) 56 (d) 70
45. In a plane there are 37 straight line, of which 13 pass through the point A and 11 pass through the point
B. Besides, no three lines pass through one point, no lines passes through both point A and B, and no
two are parallel, then the number of intersection points the lines have is equal to:
(a) 535 (b) 601 (c) 728 (d) 963
46. Two lines intersect at O. Points A1 , A2 , ...., An are taken on one of them and B1 , B2 ,..., Bn on the other
the number of triangles that can be drawn with the help of these  2n  1 points is:
(a) n (b) n 2 (c) n3 (d) n 4
47. 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:
(a) 64 (b) 45 (c) 46 (d) None of these

LALPUR Campus, Circular Road, Lalpur, Ranchi-834001. Ph. 7488408051, 8235071441 Page 100
DORANDA Campus, Opp. Eylex Cinemas, Hinoo, Ranchi-834002. Ph. 6201469038, 8092071442
www.brothersacademy.co.in Permutations and Combinations

48. All the letters of the word ‘EAMCET’ are arranged in all possible ways. The number of such arrangements
in which tow vowels are not adjacent to each other is:
(a) 360 (b) 114 (c) 72 (d) 54
49. The number of 5 digit telephone number having at least one of their digits repeated is (supposing no
telephone number starts with 0) :
(a) 90,000 (b) 100,000 (c) 30,240 (d) 69,760
50. Ten different letters of an alphabet are given. Words with five letters are formed from these given letters.
Then the number of words which have at least one letters repeated is:
(a) 69760 (b) 30240 (c) 99748 (d) None of these

IITAdvanced Expertise Level exercise

1. There are 2 identical white balls, 3 identical red balls and 4 green balls of different
shades. The number of ways in which they can be arranged in a row so that atleast
one ball is separated from the balls of the same colour, is:
(A) 6 (7 !  4 ! ) (B) 7 (6 !  4 ! ) (C) 8 !  5 ! (D) none
2. The number of permutations that can be formed by arranging all the letters of the word
‘NINETEEN’ in which no two E’s occur together is
8! 5! 5! 8! 6
(A) (B) (C) × 6C 3 (D) × C3.
3! 3! 3!  6 C2 3! 5!
3. The number of ways in which n different things can be given to r persons when there is
no restriction as to the number of things each may receive is:
(A) n C r (B) n P r (C) n r (D) r n

4. The number of divisors of a p b q c r d s where a, b, c, d are primes & p, q, r, s  N,

excluding 1 and the number itself is:
(A) p q r s (B) (p + 1) (q + 1) (r + 1) (s + 1)  4
(C) p q r s  2 (D) (p + 1) (q + 1) (r + 1) (s + 1)  2
5. The number of ordered triplets of positive integers which are solutions of the equation
x + y + z = 100 is:
(A) 3125 (B) 5081 (C) 6005 (D) 4851
6. Number of ways in which 7 people can occupy six seats, 3 seats on each side in a first
class railway compartment if two specified persons are to be always included and
occupy adjacent seats on the same side, is (k). 5 ! then k has the value equal to:
(A) 2 (B) 4 (C) 8 (D) none
7. Number of different words that can be formed using all the letters of the word
"DEEPMALA" if two vowels are together and the other two are also together but
separated from the first two is:
(A) 960 (B) 1200 (C) 2160 (D) 1440
8. Six persons A, B, C, D, E and F are to be seated at a circular table. The number of
ways this can be done if A must have either B or C on his right and B must have either
C or D on his right is:
(A) 36 (B) 12 (C) 24 (D) 18
9. The number of ways in which 15 apples & 10 oranges can be distributed among three
persons, each receiving none, one or more is:
(A) 5670 (B) 7200 (C) 8976 (D) none of these
10. The number of permutations which can be formed out of the letters of the word
"SERIES" taking three letters together is:
(A) 120 (B) 60 (C) 42 (D) none

LALPUR Campus, Circular Road, Lalpur, Ranchi-834001. Ph. 7488408051, 8235071441 Page 101
DORANDA Campus, Opp. Eylex Cinemas, Hinoo, Ranchi-834002. Ph. 6201469038, 8092071442
www.brothersacademy.co.in Permutations and Combinations

11. Seven different coins are to be divided amongst three persons. If no two of the
persons receive the same number of coins but each receives atleast one coin & none
is left over, then the number of ways in which the division may be made is:
(A) 420 (B) 630 (C) 710 (D) none
12. The streets of a city are arranged like the lines of a chess board. There are m streets
running North to South & 'n' streets running East to W est. The number of ways in
which a man can travel from NW to SE corner going the shortest possible distance is:
(m  n) ! (m  n  2) !
(A) m 2  n2 (B) (m 1)2 . (n  1)2 (C) (D)
m! . n! (m  1) ! . (n  1) !

13. In a conference 10 speakers are present. If S 1 wants to speak before S 2 & S 2 wants to
speak after
S 3 , then the number of ways all the 10 speakers can give their speeches with the
above restriction if the remaining seven speakers have no objection to speak at any
number is:
10 !
(A) 10
C3 (B) 10
P8 (C) 10
P3 (D)
3

14. Two variants of a test paper are distributed among 12 students. Number of ways of
seating of the students in two rows so that the students sitting side by side do not
have identical papers & those sitting in the same column have the same paper is:
12! (12)!
(A) (B) (C) (6 ! ) 2 . 2 (D) 12 ! × 2
6! 6! 25 . 6!
15. Sum of all the numbers that can be formed using all the digits 2, 3, 3, 4, 4, 4 is:
(A) 22222200 (B) 11111100 (C) 55555500 (D) 20333280
16. There are m apples and n oranges to be placed in a line such that the two extreme
fruits being both oranges. Let P denotes the number of arrangements if the fruits of the
same species are different and Q the corresponding figure when the fruits of the same
species are alike, then the ratio P/Q has the value equal to:
(A) n P 2 . m P m . (n  2) ! (B) m P 2 . n P n . (n  2) ! (C) n P 2 . n P n . (m  2) ! (D) none
17. The number of integers which lie between 1 and 10 6 and which have the sum of the
digits equal to 12 is:
(A) 8550 (B) 5382 (C) 6062 (D) 8055
18. Number of ways in which a pack of 52 playing cards be distributed equally among four
players so that each may have the Ace, King, Queen and Jack of the same suit is:
36 ! 36 ! . 4 ! 36 !
(A) (B) (C) (D) none
 9 !
4
 9 !  9 !
4 4
. 4!
19. A five letter word is to be formed such that the letters appearing in the odd numbered
positions are taken from the letters which appear without repetition in the word
"MATHEMATICS". Further the letters appearing in the even numbered positions are
taken from the letters which appear with repetition in the same word "MATHEMATICS".
The number of ways in which the five letter word can be formed is:
(A) 720 (B) 540 (C) 360 (D) none
20. Number of ways of selecting 5 coins from coins three each of Rs. 1, Rs. 2 and Rs. 5 if
coins of the same denomination are alike, is:
(A) 9 (B) 12 (C) 21 (D) none
21. Number of ways in which all the letters of the word " ALASKA " can be arranged in a
circle distinguishing between the clockwise and anticlockwise arrangement , is:
(A) 60 (B) 40 (C) 20 (D) none of these
22. If r, s, t are prime numbers and p, q are the positive integers such that the LCM of p, q is r2 t4s2, then
the number of ordered pair (p, q) is
(A) 252 (B) 254 (C) 225 (D) 224

LALPUR Campus, Circular Road, Lalpur, Ranchi-834001. Ph. 7488408051, 8235071441 Page 102
DORANDA Campus, Opp. Eylex Cinemas, Hinoo, Ranchi-834002. Ph. 6201469038, 8092071442
www.brothersacademy.co.in Permutations and Combinations

IITAdvanced Expertise Level Multiple Currect:

01. C 6 + n C 4 > n + 2 C 5  n C 5 for all ' n ' greater than:

n + 1

(A) 8 (B) 9 (C) 10 (D) 11

02. In an examination, a candidate is required to pass in all the four subjects he is
studying. The number of ways in which he can fail is
(A) 4 P 1 + 4 P 2 + 4 P 3 + 4 P 4 (B) 4 4 – 1
(C) 2 – 1
4
(D) 4 C 1 + 4 C 2 + 4 C 3 + 4 C 4
03. The kindergarten teacher has 25 kids in her class. She takes 5 of them at a time, to
zoological garden as often as she can, without taking the same 5 kids more than once.
Then the number of visits, the teacher makes to the garden exceeds that of a kid by:
(A) 2 5 C 5  2 4 C 4 (B) 2 4 C 5 (C) 2 5 C 5  2 4 C 5 (D) 2 4 C 4
04. The number of ways of arranging the letters AAAAA, BBB, CCC, D, EE & F in a row if
the letter C are separated from one another is:
12! 13 ! 14 ! 13 !
(A) 13
C3. (B) (C) (D) 11.
5! 3! 2! 5 ! 3 ! 3 ! 2! 3 ! 3 ! 2! 6 !

05. There are 10 points P 1 , P 2 ,...., P 1 0 in a plane, no three of which are collinear. Number
of straight lines which can be determined by these points which do not pass through
the points P 1 or P 2 is:
(A) 1 0 C 2  2. 9 C 1 (B) 27 (C) 8 C 2 (D) 1 0 C 2  2. 9 C 1 + 1
06. Number of quadrilaterals which can be constructed by joining the vertices of a convex
polygon of
20 sides if none of the side of the polygon is also the side of the quadrilateral is:
15
C3 . 20
(A) 17
C4  15
C2 (B) (C) 2275 (D) 2125
4
07. You are given 8 balls of different colour (black, white,...). The number of ways in which
these balls can be arranged in a row so that the two balls of particular colour (say red
& white) may never come together is:
(A) 8 !  2.7 ! (B) 6. 7 ! (C) 2. 6 ! . 7 C 2 (D) none
08. A man is dealt a poker hand (consisting of 5 cards) from an ordinary pack of 52
playing cards. The number of ways in which he can be dealt a "straight" (a straight is
five consecutive values not of the same suit, eg. {Ace , 2 , 3 , 4 , 5}, {2, 3, 4, 5,
6}.......................... & {10 , J , Q , K , Ace}) is
(A) 10 (4 5  4) (B) 4 ! . 2 1 0 (C) 10 . 2 1 0 (D) 10200
09. Number of ways in which 3 numbers in A.P. can be selected from 1, 2, 3,...... n is:
2
n n  2 
(A)  n  1  if n is even (B) if n is odd
 2  4
 n  1
2
n n  2
(C) if n is odd (D) if n is even
4 4

32. Consider the expansion , (a 1 + a 2 + a 3 +....... + a p ) n where n  N and n  p. The correct

statement(s) is/are:
(A) number of different terms in the expansion is , n + p  1 C n
(B) co-efficient of any term in which none of the variables a 1 , a 2 ..., a p occur more than
once is ' n '
(C) co-efficient of any term in which none of the variables a 1 , a 2 , ..., a p occur more
than once is n ! if n = p
(D) Number of terms in which none of the variables a 1 , a 2 , ......, a p occur m ore than once
p
is   .
n

LALPUR Campus, Circular Road, Lalpur, Ranchi-834001. Ph. 7488408051, 8235071441 Page 103
DORANDA Campus, Opp. Eylex Cinemas, Hinoo, Ranchi-834002. Ph. 6201469038, 8092071442
www.brothersacademy.co.in Permutations and Combinations

Answers to Exercises

IITMains Level-I
1. c 2. b 3. a 4. a 5. a IITAdvanced Expertise Level
6. d
11. c
7. b
12. d
8. b
13. d
9. c
14. d
10. d
15. d
exercise
16. a 17. d 18. d 19. c 20. c 1. a 2. c 3. d 4. d 5. d
21. c 22. a 23. b 24. c 25. b
26. a 27. c 28. b 29. a 30. a 6. c 7. d 8. d 9. c 10. C
31. c 32. b 33. b 34. c 35. a
36. a 37. a 38. c 39. c 40. a 11. b 12. d 13. d 14. d 15. a
41. c 42. d 43. c 44. c 45. b
46. d 47. c 48. a 49. c 50. d 16. a 17. c 18. b 19. b 20. b
51. c 52. a 53. b 54. b 55. c
56. b 57. c 58. b 59. a 60. a 21. c 22. C
61. c 62. b 63. c 64. a 65. c
66. c 67. c 68. d 69. b 70. c
71. a 72. c 73. b 74. a 75. b
76. a 77. a 78. b 79. d 80. c
81. a 82. d 83. d 84. c 85. c IITAdvanced Expertise Level
86. b
91. d
87. a
92. b
88. d
93. a
89. b
94. b
90. b
95. c
exercise
96. a 97. c 98. b 99. b 100. d
Multiple Correct :

IITMains Level - II 1. bcd 2. cd 3. ab 4. ad 5. cd

1. a 2. c 3. b 4. d 5. a
6. ab 7. abc 8. ad 9. cd 10. acd
6. c 7. b 8. a 9. b 10. b
11. a 12. c 13. a 14. a 15. c
16. d 17. d 18. a 19. c 20. a
21. a 22. a 23. c 24. a 25. c
26. b 27. a 28. b 29. d 30. d
31. b 32. b 33. a 34. c 35. c
36. a 37. a 38. c 39. c 40. d
41. d 42. d 43. c 44. a 45. a
46. c 47. a 48. c 49. d 50. a

LALPUR Campus, Circular Road, Lalpur, Ranchi-834001. Ph. 7488408051, 8235071441 Page 104
DORANDA Campus, Opp. Eylex Cinemas, Hinoo, Ranchi-834002. Ph. 6201469038, 8092071442