{

O t *.
tb g
2+2 o

G
4 B
&<
io & c
,e
a

e
€,
o r0

?
.lt
b9 3
L
I o o/o

C tASS
C MPANION
i-t

GI a ss xl
Permutation and Combination
P,frl mARATHon
ACADEMY
[Yety proDlem ItIeeIs Solution!
 mABATHOn
[Link]..
ACAD€
JEE ADVANCEO - 2022 WBJEE-2O22 = TOP RANKERS
tr.o- ie|.t [Link]{r..! TOP RANKERS Heartiest Gongratulatlons to All Achieverst

aE.&,s,R(F,9.
r.659
^r715
rn 7i12 rI1136
^rrlao ^.1288
ar'1292
S,3,f,fllA? .*zo irr 23 r.i 32
m i.r 3a

.[Link] &gni0_1f, R.A.g-RB.f,&

s $.;-&#se
M1384 An16?1 i'* 70 r.d 71 i'i 75 .d 78
^n1:l1rl ^n1678 ^n1864 ^n2097 ^n2211

RILq-&3 f,[.
-&&l .Hrl
-fl.-.

E-$" ,.f n.f I

^rR1788
ari 1898 AiRn519 ArR{;08 arF 55ll J,,'.,i'
^ralllll ^n5717

.&si osr
!$. 06. r,nF td
53116
rdil
^dr?117 ^||r1a31idr
ra 1858{dlI cr.. l;.' a,"r )r-; l6 F,{ 11 rrd riii rrm11. @
^|li
JEE ADVANCEO - 2021 TC,P RANKERS WBJEE-2O24 = T(O P RANIr(ERS

.3.&-R_&I F *"-@.@g.t -lr\/

Bt
&6ltR ia. [Link].r Or-ql Arnlrdiht $!!n vePo [Link].. [Link]'io 16, l'[ r{rr,r Shu$.y.. Px Aylih nrd.r. L6.r, [Link],
957 t6a7 ar2037 4i2896 R.6r 19 36 39 i..r 52 I
A 6) 6
R..r Rrir R..r 53
^!1317

9 B &" .f.g.
^r ^lr

[Link].m & . &1t (6a{ l!-a, tdfi

,a270 &dto Ol'.rh &6lt Oi6n Si{, Srm,i!,
J ' ila ra, a
Ar 291 6 an 381 8 4327 aa{r8

A<lrtt a3*aort / Regaatiatao"r

^lR
lopGn
for Class lX, X, Xl, Xll E Xll Pass€d tor JEE A NEET
^|i I^r
Salt Lako : AA-'12, Flist Floor, Soctor.1, Noar
contact : 4961655910, 7940534344, 7980857065
PNB or.,
@
Kolkata 700064 e
F
m mARATHon Heartiest Gongratulations lo
[Iest Benga
0ther [Link] 2023
(Jan)Top Scorers
ri
ACADEMY
tYery pmDlem lleels solullon! 0
#t
DebarunPatra 99,69%ile
99.66%ile
$hirshendu Sengupta
Aniket Dutta 99.64%ile
Aishik Banerjee 99.62%ile
Soham Da ShibashisDas 99.60%ile
(2 Yr Regulr Student) Aritra Chatterjee 99.58%ile
SourashmiShil 99.55%ile

100o/oile ir
l' Aryaan Sinha 99.55%ile
DebanshuGhosh 99.50%ile
Arghadeep Ghosh 99.44%ile
JEE-MA|I{ 2023 (January Session} 6
rt
\
Ariha Ghosh 99.38%ile
ChandraliDas 99.34%ile
Soham Das is one of lhe 20 students across
lhe country who scored 100 percenlile and the I v
I NakulDhanani
AratrikaGupta 99.31%ile
99.03%ile
ONLY candidate from West Bengal ,N crcrtrE
Admlaslon / Reglstratlon Open Center:AA {2 Saltlake PtlB More, Kolkata.700064
for Class lX, X, Xl, Xll & Xll Passed for JEE & I{EET Contact 8951655910 7980538344, 7980857065
Permutation and
Gombination
@ 2022 Cengage Leaming India Prt. Ltd.

ALL RIGHTS RESERVED. No part ofthis work covered by the copyright herein may be reproduced, transmitted, stored, or used
in any form or by any means graphic, electronic, or mechanical, including but not limited to photocopying, recording, scanning,
digitizing, taping, Web distribution, information networks, or information storage and retrieval systems, without the prior written
permission of the publisher.
 I
Permutation and Combination

1. FUNDAMENTAL PRINCIPLE OT COUNTING

1.1 MuttiplicationRule
Ifawork,4canbedoneinzwaysandanotherworkBcanbedoneinzwaysandCisaworkwhichisdoneonlywhenboth,4and
I are done, the number ofways of doing the work C is m x z. In other words, ifan operation can be performed in m different ways
and if corresponding to each of these there are n different ways of performing another op€ration then both the operations can be
performed in m x z differert ways.

Suppose there are three stations P, O and R and we have three routes to go from P to 0 and two routes to go from O to 8. We
want to lqlow the number of routes to go from P to R.
2
PLoaR a R
Pt A h R
)
a
PLQLR P2 QLR
ForeachpathfiomPtop,[Link],forgoingfromPtoRvia0,therewillbe3+3:
2x3=6paths.
Proof:
Lel the first operation can be performed in any one ofthe z ways and for each ofthese ways ofperforming the first operation,
there are n ways of performing the second operation. Thus, if the first operation could have been performed only in this one way,
there would have been I x r = a ways ofperforming both the operations. But it is given that first operation can be performed in ra
ways and for each way ofperforming the first operation, second can be performed in n ways.

Totalnumberofwaysofperformingboththeoperations=rl+tt+n+...uptomterns=rxm.

Notel
. If thr€e operations can be separately performed in z. n and p ways, respectively, then the tkee operations together can be
performed in nr x n xp ways. Similar result holds for any number ofoperations.

1.2 Addition Rute

Ifa work I can be done in m ways and another work 8 can be done in n ways and C is a work which is done only when either I or
B is done, then the number of ways ofdoing the work C is (z + n).

Let us understand this with the help of an example.

2 Pennutalion and Combination

Suppose there are 5 doors in a room; 2 on one side and 3 on the other. A man has to go out
ofthe room. The man can go out from any one of the 5 doors. Thus, the number ofways in which
c
th€ man can go out is 5. Here, the work ofgoing out through tlte doors on one side will be done in D€
2 ways and the work of going out through the doors on other side will be done in 3 ways. The work
ofgoing out will be done when the man goes out from side I or side II. Thus, the work ofgoing out E
can be done in (2 + 3) = 5 ways.

@@ How many 3-digit numbers can be formed using the digits t, 2, 3,4 and 5 assuming that
(i) repetition ofthe digits is atlowed? (ii) repetition ofthe digits is not allowed?

Solution
There are as many numbers as there are ways of filling 3 vacant places !!! with thc given condition.
(i) Since rcpetition is allowed, cach placc can be filled in 5 ways. Thercfore. the units place can be filled in by any ofthe given
five digits. Similarly. tens and hundrcds digits can be filled in by any ofthc gircn tivc digits.
Thus. by the multiplication principlc. the number of rvays in *hich 3-digit numbers can be formed from the givcn digits is
5x5x5=125.
(ii) [n this case. repelition ofdigits is not allou,ed. Here. ifunits place is filled in tjrst. then it can be fillcd by any ofthe givcn five
digits, Therefore. the number ofways of filling the units piace ofthc -l iigit numbers is 5.
Then. thc tcns placc can be filled with any ofthe remaining four digits and the hundreds place can be filled with any ofthe
remaining threc digits.
Thus, by the multiplication principle. the number ofways in rvhich 3-digit numbcrs can be formed without repeating the given
digitsis5x4x3=60.

Illustration 2 How many lbur-letter codes can be formed using the first l0 letters of English alphabet, if no letter can be
repeated?

Solution
There are as many codes as there are ways of filling 4 vacant places !!!f in succession by the first l0 letters of the English
alphabet, keeping in mind that the repetition ofletters is not allowed.
The frst place can be filled in l0 different ra-ays by any ofthe first l0 letters ofthe English alphabet following with, the second
place can be filled in by any ofthe remaining letters in 9 different ways. The third place can be filled in by any of the remaining
8 letters in 8 different ways and the fourth place can be filled in by any ofthe remaining T leners in 7 different ways.

Therefore. by multiplication principle, the required numbers ofways in which 4 vacantplaces canbe filled is l0x9x E x7=5040
Hence, 5040 four-letter codes can be formed.

Illustration 3 How many s-digit telephone numbers can bc formed using the digits 0 to 9 ifeach number stans with 67 and
no digit appears more than once'?

Solution
It is given that the required 5-digit telephonc numbers should always start with 67.

88trtrtr
Therefore, there will be as many phone numbers as there are ways of filling 3 vacant places by the digits 0-9, keeping in mind
that the digits cannot be rcpeated.
The units place can be filled by any of the digits from 0-9. except digits 6 and 7. Therefore. the units place can be filled in
1ldifferent ways following which, the tens place can be filled in by any of the remaining 7 digits in in 7 different ways, and the
hundreds place can be filled in by any ofthe remaining 6 digits in 6 different ways.
Therefore. by multiplication principte, thc required number of rvays in uhich 5-digit telephone numbers can be lormed is
8x7x6=336.
 Peftnutation and Combination 3

Find the number of distinct rational numbers r such that 0 < .r < | and x = !,wherep,qe {1,2,3,4,5,6}
q
Solution
As 0<,r< [Link]<q
The number ofrational numbers:5 +4+3 +2+ 1= 15
Whenp and 4 have a common factor. we get some rational numbcrs which are not different from those already counted. There are
4 such numbers:
223 4
4'i'i'i
.'. Required number ofrational numbers - 15 4=II

Iltustration 5 Find the number ofpossible outcornes in a throw'ofr ordinary dice in which at least one ofthe dice shows an
odd number

Solutlon
Total number of outcomes without any restriction = 6 x 6 x... up to r teEns = 6'.
Total number of outcomes to show only even numbers = 3 x 3 x ... up to n terms = 3,.
No. ofoutcomes in which at least one ofthe dice shows an odd number
= Total number of outcomes - Number of outcomess in which no dice shows odd number
=6'_3'

IUustration 6 Poor Tommy's TV has only 4 channels; all ofthem are quite boring, hence, it is not surprising that he desires
to switch (change) channel after every one minute. Find the number ofways in which he can change the channels so that he is
back to his original channel for the first time after 4 minutes.

Solution
Let there be 4 channels Ct C2 q and Ca
At , = 0 minute, he is watching channel Cr.
So, after lst minute, he has 3 choices to switch the channel (C2, Cr , C4)
After 2nd minute, he has 2 choices to switch the channel.
After 3rd mhute, he has 2 choices to switch the channel.
But after the 4th minute, he has only I choice lo switch the channel i.e., Cl
.'. Total number ofways = 3 x 2 x 2 = 12

Itlustration 7 A flag is to be designed with six vertical strips using somc or all of the colours yellow, green, blue and red.
Find the number ofways to do this such that no two adjacent strips have the same colour.

Solution
I st place can be filled in .1 rvays (yellou,. green. blul or red)
2nd placc can be fillcd in 3 rvays (other than th!' lst placc colour)
3rd place can bc filled in 3 ways and similarly.4th. 5th and 6th cach can bc fillc-d in,1 ways.
.. Total nurnber ol ways - 4 r 3s 072

@[s@ Ten different letters ofan alphabet are given. Words with 5 letters are formed from these given leners. Find
the number ofwords which have at least one lctter rcpcatcd.

Solution
Number ofwords when repctition is allorved = l{) x l0 x l0 x l0 x l0 l0'
Numberof lv'ords when rcpetilion is not allowcd l0 x 9 x ll x 7 x 6 .102'10
Hence, rcquired number ofrvords in wtich at lcast onc lcttcr is rcpcatcd 100000 302'10 - 697(t0
4 Permulation and Combination

Illustration 9 Find the number of functions fiom I to B if set ,4 has ,, elements and set B has ,? elements.

Solution
Let .setA: lapa2,...,a-l
and setB= (byb2,...,a,\
Now preimage a1 can be assigned any one ofthe images from set B.
Thus, a, can be assigned image in z ways
Similarly, for each ofthe pre-images ar, a3, ... , a,tthete are n ways.
Hence, total number of functions: rl x nxnx...n times: r'
Note:
. This is equivalent to distribution olz distinct objects inlo nr different boxes if in any box any number ofobjects can go.

Itlustratiofl 10 There are 'r' locks and 'n' matching keys. lfall the locks and keys are to be pedectly matched then find the
maximum numtrer of trials.

Solution
For the first key, maximum number oftrials needed is z.
For second key it will be (r l).
In general, for rth key, maximum number oftrials needed is (n - r + l).
.'. Required uumber of trials -r, +(, - l)+... * r:
"n)"

Illustration 11 There are ten points in a plane, no three of rvhich are collinear. How many different liles can be drawn
points?

Solution
There are ten points P I Pt .. ., P
n.
For one line, two points are required.
Through point P,, there will be 9 lines when P, is joined with any of the nine other points.
Similarly, there will be nine lines passing through each point.
So. number oflines is 9 x 10 or 90.
But there is double counting in above answer. One ofthe nine lines passing through point P, is P, Pr. But P, P, is also one ofthe
lines passing through point P"
Thus, line P,P, and similarly each line is counted twice.

Therefore. actual number oflines l, a : +S.

2

Note:
Double counting erlor occurs when things are selected one by one. When things are selected one by one, order in which they
are selected is also counted. Obviously, when things are to be selected, order of selection should not be counted.

Iltustration 12 Find the total number ofthree-digit numbers, the sum ofwhose digits is even.

Solution
Let the required numbers be ofthe formp4r.
 Permutalion and Combination 5

Since p + 4 + 7 i3 gvgn, there are following cases:

(l) p, 4 and r all are even
Total numbers =4 x 5 x 5 = 100
(ti) p is even but q and rare odd
Total numbers : 4 x 5 x 5 = 100
(iii) p is odd but g and r are even
Total numbers = 5 x 5 x 5 : 125
(iv) p r is odd
is odd" 4 is even and
Total numben = 5 x 5 x 5 = 125
Total number ofrequired three-digit numbers = 100 + 100 + 125 + 125:450

2. FACTORIAL NOTATION

The product offint n natural numbers is denoted by rr! and is read as 'fsctorial r'.
Thus, nl = [Link]- ... . (a l) n
: n.(n - l't.h - 2\. ... 3.2. I
e.g., 5l: [Link].5: 120.
4t:[Link]:24
o nt:1.2.3.... .(n l) n = {I.2.3. ... .Qr - l)} z
Hence, r! = (z l)! .r:n.(r l)!
Similarly, (n - l)! = (z- l).(z-2)!
Thusz! =n.(n-l)! =2.(n l).(n 2)l=n.(n t).(n 2)(r-3)! andsoon
o lfn and r are positive integers, then
nt 1 2.3.....n
rt 1.2.3.....r
- l).r.(r + l).(r + 2). ... .(z - l).2
1.2.3....(r
1.2.3.....(r - l).r
= (7+ l).(r+2).....(n -l).n
: n.(n-l).(n-Z). ... . ( r+ l)
Note:
.0! =l
Illustration 13 Prove that the inequalities (n!)2 ( z'.r ! < (22)! holds for all positive integers z.

Solution
We have
(r!!)r: (r!) (r!) = 1.2.3.....(n- t).2 (a!)
Now, I ( 2,2 ( n,3 <n....,n<n

= 1.23...(n l\.n!n n.n.....n

+ nllnn
+ (z!) (n!) < (r!) z'
(nl)2 ! n' (nll ...(t)
=
Also, (2n\l= l-2- ....n.(n + l). ... (2n l\'(2n)
Now, n+ l> n, n +2> n,n + 3> n,..-,n+ n> n
(n + l\ (n + 2) (n + 3\ ... (2" - l) (2n)> n'
=
6 Permutation and Conbinalion

+ n'!(n+ l)(n+2)... (2n-l)(2n)> nl n'

+ (2n)l > nl n'
+ nt n'<(2n)| (2)

From (l) and (2), we get

(nl\2 < n' (nl) < (2n)!

2.1 Exponent of Prime in rl!

p present a ,, ,, .
Let p be a given prime and n be any positive integer. Then the maximum power of
[O] [+ l.[;]
ln1
+

where [.] denotes the greatest integer function. The proof ofthe above formula can be obtained using the fact that l-lsrv es the
l,)-
number of integral multiples of m in 1, 2, ..., n for any positive integers a and m.

The above formula does not work for composite numbers. For example, if we have to find the maximum power of6 present in 32!,

then the answer is n, +...:5,asintegralmultiplesof6inl,2,...,32canbeobtainedonmultiplying2and3also.

[*]. [#]
Hence, for the requted number, we find the maximum powers of2 and 3 (say r and s) present in 32!. Using the above formula, we
get r: :
31 and s 14. Hence, 2 and 3 will be combined (to form 6) l4 times. Thus, the maximum power of 6 present is 32! is 14.

Iltustration 14 Find the exponent of3 in l00l

Solution
I rool Iroo]
Exponent 3 in'*' = .L:'].1,-]
[Y]-[y
=33+ll+3+ I =48

Itlustration 15 Find the number ofzeros in the end of 130!

Sotution
Number ofzeros in the end of 130! is equal to the exponent of l0 in 130!.
Now, exponent of l0 is equal to exponent of5 as exponent of2 is higher than exponent of5

Now. exoonenr or5 - l1l9l-[ry]-[4] = * -s+l = 32

Lsl Ls'l Ls'l
So, exponent of l0 is also 32 and hence, there are 32 zeros in the end of 130!

Illustration 16 Find the remainder when l!+21 +3 !+... +n! (z S 4) is divided by 5

Solution
ln ll+2! +3! +4! +5! ... + r!, values 5!, 6!, ... , z! are divisible by 5.
Hence, we have to find the remainder when t ! + 2l + 3! + 4l = 33 is divided by 5
Tbe remainder thus found is 3.

Concept Application Exercise 1

I. Three dice are rolled. Find the number ofpossible outcomes in which at least one die shows 5.
2. Four buses run between Bhopal and Gwalior. If a man goes from Gwalior to Bhopal by a bus and comes back to Gwalior
by another bus, then find the total possible ways to do so.
3. Find the tolal nunber of ways of answering 5 objective type questions, each question having 4 cboices.
 Permutalion and Combination 7

4. In how many ways, fust and second ranks in Mathematics. first and second ranks in Physics, fust rank in Chemistry and
first rank in English be given away to a class of30 students.
5, Find the number of three-digit numbers having only two coDsecutive digits identical.
6, Ofgiven 5 flags ofdifferent colours, how many different signals can be generated ifeach signal requires the use of2 flags,
one below the other?
7. A variable name in certain computer language must be either an alphabet or an alphabet followed by a decimal digit. Find
the total number ofdifferent variable names that can exist in that language.
8. Find the total number ofr-digit numbers (rr > I ), having the property that no two consecutive digits are the same.
9. Five persons entered the litt cabin on the ground floor ofan 8-floor building. Suppose each of them can leave the cabin
independenlly al any floor beginning with the first. Find the total number of ways in which each ofthe five persons can
leave the cabin (i) at any one ofthe 7 floors (ii) at different floors.
10. Find r, ifQr + l)! : 12x(z-l)!.
11. Find the exponent of20 in 200!

3. PERMUTATION

Each ofthe different arrangemcnts $ hich can be made by taking some or all ofa number ofgiven things or objects at a time is callcd
a permutation. [n pcrmutation. ordcr ofappearancc ofthings is taken into account.
The six arrangcments can be made rvith three distinct objects o. b. r' taking trvo al a time arc ab, ha. bc. cb. q.. ca. Each ofthcse
arrangements is called a permutation.

3.1 The Number of Permutations of n Different Things Taken r at a Time

Number ofpermutations ofr different things taken r at a time is given by

'r'= a>'t
Proof:
,\
'P, = number of permutations of r things out of ,r different things.
: numbers ofways offrlling up r vacant places with z different thiogs (in each place exactly one object is put)

Let the z different thilgsbe a1, a2, a3, ..., an

I 2 l
4 t + l
n n-1 n 2 n r+l
First place can be filled up by any one of the n things a,, ar, qt, ..., a,ir n ways.
Number ofthings left after frlling up the first place : ,, I

Second place can be filled up by any one ofthe remaining (z - I ) things in (z - I) ways.
Number ofthings left after filling up the fimt and second places = n - 2
Third place can be filled up by any one ofthe remaining (n - 2) things in (r 2) ways.
Number ofways offilling up third place = z - 2 and so on.
Finally, number ofways of filling up lth place = n - (r- l) = z - r+ I
By the multiplication rule ofcounting, first, second, third, ... . rth places can be together filled up in z (n- t).(n 2)
(z-r + l)ways
Hence,'P,:z - l). (n -2).... . (z-r+ l)
. (n

fn (n-l).(n-2).....(n-r+ l)].(r - r) 3.2.1 nl

(n - r).(n -r -l). ....3.2.1 (n - r\l
nl.
Thus 'P,
8 Pemutation and Combination

3.2 The Number of Permutations of n Different Things Taken A[[ at a Time

Proof:

I
+ i 3
+ +

n h I n2 I

By multiplication rule, we get

Number ofways offilling up first, second,third,..., and rth place together: r(n l) (n 2)...2.1=nt
Thus, 'P,= rl
Note:
. aPn= t'P,, t=.nt

3.3 The Number of Permutations ofrt Different Things Taken r at a Time when
Each Thing can be Repeated r Times

I ) l
+ 4 A

By muttiplicalion rule of fundamental principle of counting, number of ways in which first, second, third, . .., and ,1h places can be
together filled up by n x n x n x... x r times : z'

lllustration 17 (i) IfroP. = 5M0. then the value ofr. (ii) If56P.-6 :
54P.-, = 30800 : l, then find the value ofr..

Sotution
(D '?=5M0
=10x504
=l0x9x8x7
l0o
-- .4

(fi) s6P,*6ts4P,*3= 3o8oo : I

56!(sl-r)! =30800
(50-r)!54!
56 x 55 x (51 r):30800
r= 4l

Itlustration 18 How many 3-digit numbers can be formed by using the digils I to 9 ifno digit is repeated?

Solution
3-digit numbers have to be formed using the digit I to 9.
Here, the order ofthe digits matters.
Therefore, there will be as many 3-digit nurnbers as there are permutations of9 different digits taken 3 at a time.

Required number of 3-digit numbers - uP, 9! 9! 9x8x7x6! = 504

(9-3)! 6! 6!
 Pefinutation and Combination I

lltustration 19 From a committee of 8 persons, ia how many ways can we choose a chairman and a vice chaimran assuming
one person caonot hold more than one position?

Solution
From a committee of 8 persons, a chairman and a vice chairman arc to be chosen in such a way that one person cannot hold more
than one position.
Here, the numbcr ofu'ays ofchoosing a chairman and a vice chairman is the permutation of8 different objects taken 2 at a time.

Thus. requted number ofways ='o.= -*= !l6!='" 6!]."0' =to

- (8-2)!

@LettheeleYenlettersl,B....,r(denoteanarbitrarypermutationoftheintegers(l,2,...,ll).Thenprove
that (,4 - l) (8 - 2) (C - 3) ... (X - I l) is always even.

Sotution
Given set olnumbers is I l. 2. . .. . I I i in which live nurnbcrs arc even and six nurlbers are odd, which demands that in the given
product. it is not possible to anangc to subtract only evcn numbcr tiom odd numbers. There must be at least onc factor involving
subtraction of an odd number tbrm anothcr odd number. So. at least one ofthe factors is even. Hence. product is always even.

Itlustration 21 Find the number ofwords which can be made out of the letters ofthe word MOBILE when consonants always
occupy odd places.

Solution
The word MOBILE has three even places and three odd places. Also, the word has 3 consonan6 and 3 vowels. Lr three odd places,
3P, ways.
we have to fix up 3 consonants which can be done in
Now, in remaining three places, we have to frx up remaining three vowels, which can be done in
lP, ways.

.'. Totat number ofways : lP, x rP, : 36

Itlustration 22 How many words, with or without meaning, can be made from the letters of the word MONDAY, assuming
that no lefter is repeated, if
(i) 4letters are used at a time? (ii) all letters are used at a time?
(iii) all letters are used but first letter is a vowel?

Solutlon
There are 6 different letters in the word MONDAY.
(i) Number of4Jetter words that can be formed from the letters ofthe word MONDAY, without repetition of letters, is the number
of permutations of 6 different objects taken 4 at a time, which is 6&.
Thus, requ ed number of words tlat can be formed using 4 letters at a time

=up.= 6
' (6-4)!-6!2l-6x5x4x3x2!-360
2l
(ii) Number of words that can be formed by using all the letters of the word MONDAY at a time is the number of permutations
of6 different objects tak€n 6 at a time, which is 6fu = 6t.
Thus, required number ofwords =6! =6x 5 x4x3 x2xl=720
(iii) ln the given word, there are 2 different vowels, which have to occupy the leftmost place ofthe words formed. This can be one
only in 2 ways.
Since the letters cannot be repeated and the leftmost place is already occupied with a letter (which is a vowel), the remaining
five places are to be filled by the remaining 5 letters. This can be done in 5! ways.
Thus, in this case, required number ofwords that can be formed = 5! x 2: 120x2 =24O
10 Permutation and Combination

Illustration 23 Let ,,1 be a set of r (> 3) distinct elements. Then find the number of triplets (.x, y, z) of the elements of .4 in
which at least two elements are equal.

5olution
Tolal number of triplets without restriction = n x n x n
Number of triplets with all different elements = 'P3
.'. Required number of triplets = z3 - n(n - l)(n -2)
Illustration 24 Eleven animals ofa circus have to be placed in eleven cages, one in each cage. If4 ofthe cages are too small
for 6 of the animals, then find the number ofthe ways of caging all the animals.

Solution
Let the 6 animals be placed in 7 of larger cages.
?Pu
This can be done in ways.
ln each of these ways, one larger cage is left vacant.
The remaining five animals can be placed in the remaining five cages in 5! ways
By the fundamental lbeorem. we get
7Pu
Required number of ways: x 5! = 6M800

Itlustration 25 The letters ofword ZENITH are written in all possible ways. Ifall these words are written out as in adictionary.
then hnd the rank ofthe word ZENITH.

Solution
Total number of words = 6! = 720
Writing the lcftcrs of the word ZENITH alphabetically, we get EHINTZ
Words starting with Number of words
E 5!

H 5!

I 5l
N 5I

T 5l
ZI:.H ll
3I

ZENH t!
ZENIH I

Total number ofrords before 7-EllITH 615

Hence, there are 615 words before ZENITH, then rank ofZENITH is 616.

Find the sum ofall 4 digit numben that can be formed by using the digits 2, 4, 6. 8 (rcpetition ofdigits not allowed).
@@@[!
Solutlon
Numbers ending with 2 are 3! as after fxing 2 in the unit place, other tbree places can be filled by 3! ways
Thus, 2 appears in the unit place for 3! times.
Similarly, all other digits 4, 6 and 8 also appears 3! times.
Then sum of the digits in the unit place : 6(2 + 4 + 6 + 8) : 120 units
 Pamutation and Coilbination 11

Similarly, sum ofdigits in ten place is 120 tens and in hundredth place is 120 hundreds etc
Sumofallthe24numbers: 120(l + l0+ 102+ lO3): l2Ox llll = 133320

@ Find the total number ofpermutations

may be repeated any number of times.
ofn different things not taken more than r at a time, when each thing

Solutlon
Here, we have to arrangep things out ofz, I (p ( r, and repetition is allowed.
Whenp = I, number of permutations : z
Whenp:2, number ofpermutations : nxn:n2
(As first thing can be taken in z ways, and the second can also be taken in r ways, since repetition is allowed)
Whenp : 3, numberof permutations = n x n x n : n3

When p : r, number of permutations = n x n x n x ... r times = n'

,( r' -tl
Hence, total permutations = r, + 12 +r1r + ... + { = -}----J
(r-l)
3.4 The Number of Permutations ofrl Things Taken all Together, when the Things are not Al[ Different
The number ofpermutations ofz things taken all at a time whenp ofthem are similar and are ofone type, q ofthem are similar and

r of them arc similar and are of third type and rest are all different is given by
are of second type, ' -lf
Pt ql rt'
.

Proof:
Total number ofthings = n
Let the required number of permutations be x.
p different things can be arranged among themselves inp! ways. So, ifwe replace p identical things byp different things which are
also different fiom the rest thiags, then number ofpermutations will become rp!.
Again, if we replace q identical things by q different things, then number ofpermutations will become (xpl) q!.
Again, if we replace r identical things by r different things which are different from rest, then number ofpermutations will become
(x pl ql) rl.

Now, all the z things are dilferent and therefore, number ofpermutations should be z!.
Thus, xp! g! rl : z!
nl
p! ql rl

Il[ustration 28 How many words can be formed with the letters of the word MATHEMATICS by rearranging them?

Solution
Since there are 2 .rif s, 2 ,4's and 2?'s, we have
I l!
Reouired number of*"u. =
2l2t2l

Itlustration 29 In how many ofthe distinct permutations ofthe letters in MISSISSIPPI do thc tbur I's not come together'l

Solution
InthegivenwordMISSISSIPPI,/appears4times,Sappears4times,Pappears2times,andMappea$justonce
Therefore, number of distinct permutations ofthe letters in the given word
'12 Permutation and Combination

lt!
4t4t2l
llxl0x9xEx7x6x5x4!
4!x4x3x2xlx2xl
!l x l0x9x 8x7 x 6x5
4x3x2xlx2xl
: 34650
There ar€ 4 '.1" in the given word. When they occur together, they are treated as a single object for the time being. This single
object together with the remaining 7 objects will account for 8 objects.

There are E objects in which there are 4 ,fs and 2 P's which can be arranged in
' *uy, i..., 840 ways.
4l2l
Number of arrangements where all lFs occur together = 840 -Jl
Thus, number ofdistinct permutations ofthe letters in MISSISSIPPI in which four fs do not come together = 34650 - 8zl0 = 33810

Illustration 30 Find the number ofdifferent words that can be formed using all the letters ofthe rvord 'SHASHANK' such
that in any wor4 the vowels are sepamted by at least two consonants.

Sotution

,,r,4 *urr. in
The letters other than vowels are SHSHNK which can be arranged

Now,ineachcase, [Link]-.,[Link].toplacerhe2ndAuillbe(7 r l)
So, the total number ofways = ^-[Link]-ry= x(5+4+3 .2 | t)-ziw
2l2ta' =fl
212!

Illustration 31 find the number ofways in which the lettes ofthe wo.d ARRANGE can be aranged so that
(i) the two X's are never togethel (ii) the t\!.o,4's are together but not the twoR's,
(iii) neither the two I's nor the two n's are together.

Solution
The letters of ARRANGE can be rewritten as:
ARNGE
AR
So, we have 2,4's, 2R's and total of7 letters.
1t
(il
'' Total number of words - ------
2t 2l
=
g
Number ofwords in which 2 R's are together [consider (R R; as one unrtl
i.e., (R R), A, A, N, G, E
Note that permutation ofR, R gives nothing extra.

.'. :SOO
2t2l-l 2l
Number of words in whichthetwoR's are never together: ^^a

(ii) Number of words in which both l's t = \ = lOO

are together i.e., ( A A). R, R. N, C.

And number ofwords in which bothl's and both R's are together i.e., (l l),iR R ), N, G, E = 5l: l2o
.'. Number ofwords in which both.,l's are together but the two R's are not together = 360 120 = 240
(iii) Thereareinall 900 words in each of which the two .R's are never together. Consider any one such word. Either the two I's are
together or the two,4's are not together. But the number of all such arrangements in which the two ,4's are together is 240.
Hence, the number ofall such arrangements in which the two ,4's are not together = 900 - 240 = 660
 Permutation and Combination 13

Itlustration 32 Find the number ofpermutations ofthe letters ofthe word HINDUSTAN such that none ofthe pattems HIN,
DUS and TAN appears.

Solution
Let A. B ar,d C be the sets or words in which HIN. DUS and TAN pattems appear, respectively
We have to find n (,{' w R' w C).
n{A' B' C\ = n((A uB u C)')
^ ^
= n(S) n(AuBuCl
?t ol
Now, n(Al= 7l,n(B\= andz($= jj
,.,n(C)=7t
Also, n(A n B) : n (B a C) = n(A.1 C) = 5l
And, n(AaBaC):31
qt(
nlA'.\B'.\r-l:1-l ,t
7l+1: +71-3xst+31 = 169194
z: I
\ 2l

@Sixcardsaredrawnonebyonefromasetofunlimitednumberofcards,eachcardismartedwithnumbers
0 or t Find the number ofdifferent ways in which they can be drawn ifthe sum ofthe numbers shov,,n by them vanishes.

Solution
Hcre the sum ofthc numbers on six cards vanishcs.
Case I: 3 cards ofeach ofthc numbers I and I are selected.
-1,
Number of arrangements = + =20
3!3!
Case II: 2 cards ofeach ofthc numbers 1.0 and I are selected.

Number of arrangem.n,. = = ,o
=j!.
2t 1t 2l

Case lll: Onc card ofeach ofthe numben -l and I is selected and 4 cards of0 are selected.

Number .f arrangem"n, = : 3n
l!l!4!
Case lV: If all the cards selected are --!l
ofnumber 0.

So no. ofarrangcment =
q = I
6!
Hence, total number ofarrangemcnts is 20 + 90 + -10 + I = l4l.

3.5 Permutations Under Restrictions

3.5.1 When Particular objects are Never Together (Gap Method)
Let us understand this with the help offew illustrations.

Ittustration 34 Find the number ofways in which 5 girls and 5 boys can be arranged in a row ifno two boys are together

Solution
In the question, there is no any condition for arranging the girls.
Now, 5 girls can be an-anged in 5! ways.
xGxGxGxGxGx
When girls are arranged, six gaps are generated as shown in diagram with .x,
14 Permutation and Combination

Boys must occupy the places marked with 'x' so that no two boys are together.
6P, ways.
Five boys can be arranged in these six gaps in
6Pr.
Hence, total number of arrangements is 5! x

Illustration 35 Find thc number ofways in which 5 girls and 5 boys can be arranged in a row ifboys and girls are alternately
placcd.

Solution
First, five gils can be arranged in 5! ways.
><GxGxGxGxG
or GxGxGxGxGx
Since girls and boys are to be placed altemately, boys can occupy places with 'x' mark in the diagram.
Hence, total number of arrangements = 5! x 5! + 5! x 5! :2(51 x 5!)

3.5.2 When Particutar 0bJects are Always Together

Illustration 36 Ifthe best and the worst paper never appear together, theo in how many ways six examination papers can be
arranged?

Sotutlon
If the best and worst appear always together, the number of\ ays is 5!x 2.
Therefore. requted number ofways
: Total nrmber of ways without any restrictions - Number of ways when best and worst papeE are together
:6! -5! x2:480

@FindthenumberofarrangementsoftheletterSofthewordSALooN,ifthetwoo,sdonotcometogether.
Solution

Total number ofarranqements

-21 = ! -ruo.
Number of ways in which 0's come togethet (5, A, L, (OO), I) : 5 ! : 120

Hence, required number ofways : 360 - 120 = 240.

3.6 Circular Permutations

CB ,1 D

l) R C A R D ,1 C

A D (' B

.--.H H lH }....H
.4BCD DA BC CDA B BCI).1
(i) ( ii) (iii) (iv)

Let us consider that persons l, B, C and D are sitting around a round table as shown in Fig. (i). Ifall of,4, 8, C and
D are shifted
(ii). if D in anticlockwise order, then we will get
one place in anticlockwise order, then we will get Fig. Again, we shift ,4, -8, C and
Fig. (iii). Ifwe shift again, we will get Fig. (iv). lf we again shift, then we will get Fig (i)'
thus obtained
Thus, we see that if4 persons are sitting at a round tabl€, then they can be shifted four times and four arrangements
will be same because anticlockwise order of A, B, C and D does not change'

C and D are sitting in a row and they are shifted such that the last occupies the place offirst'
g, then the four arangements
But if,4,
will be different.
 Peinutation and Combination 15

Thus, ifthere are 4 things, then for each circular arrangement, number oflinear arrangements : 4.
Similarly, ifr different things are arranged along a circle, then for each circular arangement, numb€r of linear arrangements : ,r

.'. Number oflinear arrangements ofz diflerent things = n x (Number ofcircular arangements ofz different things)
.'. Number ofcircular arrangements ofa different things

:l x (Number of linear arrangements of a different tbings) : 1

n
x z! = (r - l)!
3.6.1 Clockwise and Anticlockwise Arrangements
C c Y v

D B B D R G G B

A A n R

Let the four personsl, E, C and D sit around a circular table in anticlockwise and clockwise directions. These two arrangements are two
different arrangements. But iffour flowers n (red), G (green), I(yellow) and I (blue) be arranged to fonn a garland in anticlockwise
and in clockwise orders, then the two arrangements are same because if we see the garland fiom one side, the four flowers R, G, I
and B will appear in anticlockwise direction and ifseen from the other side the four flowers will appear in the clockwise direction.
Here, the two arrangements will be considered as one arrangement because the order of flowers is not changing rather only side of
observation is changing. Here, two permutations will be counted as one.

Therefore, when clockwise and anticlockwise arrangements are not different i.e., when obseration can be made fiom both sides,

then number of circular anangements ofn different things i, giu.n by

gjJI.
2

I[[ustration 38 Find the number ofways in which 5 boys and 5 girls sit altemately amund a round table.

Solution
b5

b\

Five boys can be arranged in a circle in 4! ways.

After that 5 girls can be arranged in the five gaps shown as 'x' in 5! ways
Hence, total number ofways : 4! x 5! = 2880

Ittustration 39 Find the number ofways in which n persons can be seated at a round table, so that all shall not have the same
neighbours ln any two aralgements_

Sotution
Since a persons are to be seated at a round table, so that all shall not have the same neighbours in any
two arrangements, clockwise
and anticlockwise arrangements are considered to be the same.
('-l)!
So. number of arr-ann"[Link],
-2 i.
16 Permulation and Cofibination

Itlustration 40 Find the number ofways in which l0 different diamonds can be arranged to from a oecklace.

Sotutlon
Since diamonds do not have natural order of left and right so clockwise and anticlockwise arrangements are taken as identical.

.'. Number of arrangements of l0 differcnt diamonds to fiom a necklace = ]x9! = l8l.ta0

2

Iltustration 41 Twenty persons, of which two are brothers, are to be seated around a circular table. Find the number of
arrangements in which there will be at least tfuee peEons between the brothers-

Sotution
Ifone ofthe brothers is made refcrence point then remaining l8 persons lexcluding the sccond brother) can be seated in llt! ways
For the second brolher. we have only l9 6 = l3 places.
So. total number of u'a1,s = 13 x l8i

Concept Apptication Exercise 2

l. Find r if" .tP3,nPr= 1 ' 9.

2. Seven athletes are participating in a race. In how many ways can the first three prizes be won?
3. Find the sum ofthe digits in the unit place ofall numbers formed with the help of3,4, 5, 6 taken all at a time-
4' Find the number of 9-digit numbers formed by using non-zero digits such that all th€ digits in the first four places are less
than the digit in the middlc and all the digits in the last four places are grcater than that in the middle.
5. How many 6-digit numbers can be formed form the digits 0. l, 3, 5, 7 and 9 which are divisible by l0 and no digit is
repeated?
6. It is required to seat 5 men and 4 women in a row so that the women occupy the even places. How many such arrangements
are possible?
7. Find number ofpositive integers which can be formed by using any number ofdigits from 0, l, 2, 3, 4, 5 but using each
digit not more than once in each number. How many ofthese integers are greater than 3000? What \ rill happen ifrepetition
is allowed?
8. Ln how many ways can the lefters of the word ASSASSINATION be arranged so that all the S's are together?
9. Find the number of words with or without meaning which can be made using all the letters of the word AGAIN. If these
words are wriften as in a dictionary, what will be fie 50th word?
10. How many words, with or without meaning, can be fomred using all the lettets of the word EQUATION at a time so thal
the vowels and consonants occur together?
ll. A shelfcontains 20 different books of which 4 are in single volume and the others form sets of8, 5 and 3 volumes. Find
the number ofways in which the books may be arranged on the shelf, if the volumes of each set are together and in their
due order.
12. Find the number ofways in which 6 boys and 6 girls be seated in a row so that
(r) no two girls may sit togelher
(b) boys and gids sit alternately
(c) all the girls are never togetler
13, A round table conference is to be held between 20 delegates of20 counties. In how many ways can they be seated iftwo
particular delegates are (a) always to sit together (b) never to sit together?
14. In how many ways can 15 members ofa council sit around a circular table, when the Secretary is to sit on one side ofthe
Chairman and the Deputy Secretary on tbe other side?
15. Find the number ofways in ll,hich 8 differsnt flowers can be strung to form a garland so that 4 particular flowers are never
separated.
 Permutation and Combination 17

16. ln an examination hall, there are 4 rows ofchairs. Each row has 8 chairs one behind the other. Thsre are 2 classes sitting
for the examination with l6 students in each class. [t is desired that in each row. all students must be ofthe same class and
that no two adjaceEt rows are allotted to the same class. In how mary ways can these 32 students be seated?
17. Find the number ofsays in which 6 gentlcmen and 3 ladies be seated aroutrd a table so that evcry gentleman may have a
lady by his sidc.

4. COMBINATION

Each ofthe different groups or selections which can be made by taking some or all ofa number ofgiven things or objects' al a time
is called a combination. In combination, order of appearance of things is not laken into account. Tkee groups can be made with
three different objects a, b, c taking two at a time are aD, bc and ac. Herc, ab atl.d ba are the same group. Here, it is also clear that for
each combination (selection or group) oftwo things, number of permutations (arrangements) is 21. For example, for combination
aD, there arc two permutations aD and Da. Four groups which can be made with 4 different things a, D, c, d taking three at a time are
abc, abd, acd, Dcd. Now, for each combination (group) of three things, number of perrnutations is 3 ! i.e., 6. For example, for the
group aDc, there are 6 permutations (arangemels) abc, acb, bqc, bca, cab, cba.

4.1 The Number of Combinations of, Different Things Taken r at a Tine (r < n)
The number ofcombinations ofz dilferent things taken r(3 a) at a time is given by'C,.
nl
t - ,tl , - ,ll
Proof:
kt the number of combinations of ,r different things taken r at a time be 'Cr.
Now, each combination consists ofr different tbings and these r things can be aranged among themselves in rl ways.
Thus, for one combination ofr different thilgs, number ofarrangements: r!
So, for 'C, combinations, number of arrangements : r! 'C. . . . (I )
But number ofpermutations of t different things taken r at a time: nP, ... (2)
From (l) and (2), we get

(n - r)l
- ,-- n!
' rl (n - r)l
4.2 Properties of "C,
l. "C,-'C,-,
2. lf'C,='9r,1tr"n either x: y or x + y: z
3. "C,+ nC, | ='* tc,
4. r''C,:n'n-tC"-|
,C, ,*,C. *,
5.
r+l n+l
.C, n-/+l
6.
'c,t r
7. Maximum value of 'C
We can observe that in the list of6C0, 6C r,6Cr,6Cr,6Cn,6Cr, 6Co, the maximum value is 6C,
AIso, in the list of 7Co,7 Ct,1Cz,1 Ca,1 C4,7 Cr,7cu,1cr,the maximum value is 7C, or 7Co.
In general,
When z is even, maximum value ,C. = ,6
,.
When n is odd, maximum value of,C,: nC,_, or,Co*,
18 Pemutation and Combination

8. The oroduct of /r consecutive positive integers is divisible by &!

Proof: Let the t consecutive integers lte m, m * I, m + 2, ...,(m + k- l).
We have rz(z+ l)(n+2\...(n+ k-l)

"'(,,Jlr! -'"', rt
(rr -t)!z(z+ r)...(zr+t -r) _(n+r-t\t _
-_ ------G:rr --G_rr - o,(n+k-t)t:rrr)(,+* r)c.

Since('+l r)C*is an integer, it follows that t! dividesrz(z+l)...(z+t l).

4.3 Restricted Combinations

4.3.1 Number of Combinations of r Different Things Taken r at a Time when p Particutar Things are Atways
Included
Alreadyp things are selected. Then remaining r p things from the remaining n -pthingscanbe selecled in */C.
r ways.
4.3.2 Number of (ombinations of n Different lhings Taken r at a Time when p Particular Things are Always to
be Exctuded
Sincep particular things are always to be excluded, we have to select rthings out ofremaining (n p) different things. Thiscanbe
done in'-PC ways.

lllustration 42 If'C'. = "C.. find'C..

Solution
lf 'C.='Cbtheta= bot n= a+b
Therefore,
1C2=+
CE= n:8 + 2: l0
l0! _ l0l lox x Sl
q
2- to,-
\:- ,,;.to1lt- }s! - 2-lr8! _-",.

Illustration 43 Determine fl if 2'C. :"C,: 12 , 1.

Solution
c,
'n t2
,Cl

(Znlt .. 3!(n - 3)! l2

3l(2n - 3\l nt I

2(2n -l -2)
(n-l\(n-2) =t2
4 (2n - t) (n- t)
(r-l)(r-2)
(2n -l\
(n-2)
n:5
 Pemulation and Conbination 19

@ff"C,=g4',g,-,=36and,C'*r:126,thenfindthevalueofn.
Solutioon
"c, n-r+l 84 7
n
c,_t 363
and
' c,*t n-r 126 3

'C, r+l 84 2

! r-1:r-r= 1g* 6
3 2'
l4r-6:9r+9orr=3.
n=9

Itlustration 45 How many chords can be drawn through 21 points on a circle?

Solution
For drawing one chord oD a circle, only 2 points are required.
To know the number of chords that can be drawn tkough the given 2l poiDts on a circle, the number ofcombinations have to
be determined.
Therefore, there will be as many chords as there are combinations of2l points taken 2 at a time.

.'. 2'c, = l^20

Required number of chords = = *,=21 =zto
' =^1
2l(21- 2lt'
- 2ll9l 2

@Howmanywords,withorwithoutmeaning,eachof2vowelsand3consonantScanbeformedformthe|etters
ofthe word DAUGHTER?

Sotution
ln the word DAUGHTER, there are 3 vowels namely, l, U, and E, and 5 consonants namely, D, G, H, T, arld R
3C: 3
Number ofways ofselecting 2 vowels out of3 vowels = =
Number ofways ofselecting 3 consonants out of5 consonants : 5C3 : l0
Therefore, number ofselection of2 vowels and 3 consonants:3 x l0 = 30
Each ofthese 30 words of2 vowels and 3 consonants can be rearranged in itself in 5! ways.
Hence, required number ofdifferent words : 30 x 5! = 3600

Illustration 47 A committee of 7 has to be formed fonn 9 boys and 4 girls. ln how many \yays can this be done when the
committee coDsists of
(i) exactly 3 girls? (ti) at teast 3 girls? (iil) at most 3 girls?

Solution
A committee of 7 has to be lbrmed fomr 9 boys and 4 girls.
(i) Since exactly 3 girls are to be therc in every committee. each committee must consist of4 boys only
.. q'-l1l' ijsl
Rcqurrednumberorways-{c,,oc{-
i;, ;?; -4, -564
(ii) Since at least 3 girls are to be there in every committee, the committee can consists of
(a) 3 girls and 4 boys or (b) 4 girls and 3 boys
qq
-j girls and 4 boys can be selected in lC., x ways.
.l girls and 3 boys can be selected in 4C{ x ecr u,ays.
.. Required number ofways = rC, x ec.r++C1x eq:504 + g4 = 5gg
20 Pennutation and Combination

(iii) Since at most 3 girls are to be there in every committee, the committee can consists of
(a) 3 girls and 4boys (b) 2 girls and 5 boys (c) I girl and 6 boys (d) No girl and 7 boys
3 girls and 4 boys can be selected in 4q x eco ways.
4C2 eC,
2 girls and 5 boys can be selected in x ways.
I girl and6 boys can be selected in aC, x eC6 ways.
No girl and 7 boys can be selected in aC, x eC, ways.
.'. Required number ofways = 4C, xgco+ acrxec, + oC, xncu + tcoxng,
4! 9t 4t x-+-x-+-x-
9t 4t 9! 4! 9l
3!l! 4l5l 2t2t 5!4! l!3! 6!3! 0!4! '7t2!

= 5M + 756 + 336 + 36 = 1632

Itlustration 48 A committee of6 is to be chosen from l0 men and 7 women so as to contain at least 3 men and 2 women. In
how many different ways can this be done iftwo panicular women refuse to serve in the same committee?

Solution
We have I 0 men and 7 women to form a committee of 6 containing at least 3 men and 2 women
Thus the following cases arise:

M(to') w (7') \umber of selections

Casr I 3 3
'oqt'cr=4269
[Link]= 4419
Casc Il 4 2

.'. Number ofselections without any restriction = 4200 + zl4l0 = 8610 ...(l)
Now let us consider the case when 2 particular women are always there in the same committee, so we have to make a selection
of4 from l0 men and 5 women. In this case to comply the initial condition ofat least 3 men and at least 2 women, we have the
following cases:

M(f0) W(5) Number of s€lectioor

Crse I 4 o locrx'Co=21o
Crse II 3 I loc,,t6,=6gg

.'. Number ofselections in this case = 210 + 600: 810 ... (2)
Hence, the number of committees when two particular women arc never together = 8610 - 810 : 7800

IUustration 49 Find the number of 3{igit numbers in which the digit at hundredth place is greater than the othe, two digits

Solution
lst 2nd 3rd
xyz
When all 3 digits are distinct (largest being at the lst place and the remaining two can be arranged in two ways), then
Required number ornu-6"o: loq x 2
When y = z (largest on the lst place and remaining two being equal on the 2nd and 3rd place)' then
loCz xI
Required number of numbers =
.'. Total number ofnumbes = 285

Itlustration 50 I
Ten persons amongst whom ar€ ,4, and C are to speak at a function. Find the number ofways in which it
can be done ifl wants to speak before B and B wants to speak before C.

Sotution
roq ways.
Places for,{, I and C can be chosen in
Remaining 7 persons can speak in 7! ways.
Hence. the number ofways in which they can speak is (r0C3) x 7! = t0l/6
 Perrnutation and Conbihation 21

@[Link]
sane nurnber offriends. How mary should be invited at a time'l

Solutlon
Let him invite r fiiends at a time.
Then the number of parties : 20C, which is maximum when r : I 0
Then he must invite l0 friends at time in party.

@Findthenumberofwaysinwhich2lidenticalwhiteballsandl9identicalblackballscanbearrangedina
row so lhat no two black balls are together.

Sotution
I x x x ...x x x ]
Lct 'x' denote the place for white ball then possible placcs for black balls are represented by ' '.
Since uhitc balls arc 21. possible placcs for blacks ( )are22.
Number of sclections tbr l9 places for black balls from 22 possible places =
r:C,,
Since all whitc balls arc identical and all black balls are also identical, total number ofarrangcments:
llC,n

Itlustration 53 Find the total number of six-digit numbers that can be formed, having the property that cvery succeeding
digit is greater than the preceding digit.

Sotution
-(1 < .rr < -r1 < .r.{ < r( < -16, when the number is .(l ,r,,rl.!.r(.16.
Clearly, no digit can be zero.
eCoways
Also, all the digits are distinct. So, let us tirst select six digits &om the list ofdigits l. 2, 3,4, 5, 6, 7, 8, 9 which can be done in
After selecting these digits they can be put only in one order.
eC6
Thus. total number ofsuch numbers = x I = eC6

Illustration 54 Find the total number ofsix-digit natural numbers that can be made rvith digits l. 2, 3 and 4, ifatl the digits
are to appear in the same number at least once.

Solution
There can be two types of numbers
(i) Ary one ofthe digits l. 2, 3 and 4 appears
thrice and the remaining digits appear only once i.e., ofthe type 123444 etc.
Number ofways ofselection ofdigit which appears thrice = aC,
6l^ tr'.
.. Number ofnumbers ofthrs tvo"
'' - l! = +lo
(ii) Any two of the digits I, 2, 3 and 4 appear twice each and the remaining two appear only once i.c.. ofthe type 123344, etc
Number ofways ofselection of two digits each ofwhich appears rwice = rC,

.. Numbcr of numbers of this gp. - r ta -tO*o

,,ra
'l'herelbre.
thc required number ofnumU.r, li +-gO * 1080 = 1560.

Illustration 55 Find the number of ways in which a la$,n-tennis mixed double sets can be made from 7 maried couples
if
no husband and wife play in the same set.

5otution
7c2
ou( of 7 in ways. Now we exclude the wives of these two selectedmen and so select2 ladies
)I:ff^t,:gt'_::l
from remaining
ladres m'(2 ways.
22 Permutation and Combinalion

Letl,8 be two men andX, fbe the women playing in one set, then we can have
(i) ,4 and Xplaying against I and L
(ii) ,a and lplaying against I andX
Then total number of ways = 7C, x 5C, x 2 : 2l x lO x 2 : 420

Illustration 56 Find the number ofwords of four letters can be formed fiom the leften ofthe word EXAMINATION

Solutlon
There are I 1 lette,rs; A, A; I, I; N, N; E, X, M, T, O
For the selection of4 letters, we have the following possibilities:
(i) 2 alike, 2 alike
(ii) 2 alike, 2 different
(iii) All four different
(i) There are 3 pain of2letters, so selection of2 pairs can be donr in 3C, ways.
Also, permutation of these 4 letters is .
2l2l
--1.1-
Therefore, number of words in this case ='9t 11' : r, .(t)
2l x?t
(ii) We have to select one pair from 3 pairs and 2 distinct letteas from rernaining 7 distinct letters.
For illustration, let us select both,{'s. Then wehave I, N, E, X, M, L O. i.e., 7 as remaining distinct letters.
.'. Number ofselections = 3Cr.7Cz

The 4 letten (2 same, 2 distinct) can be permuted in 4!/2! ways.

.'. Number of words = 3cr.7C:.4! l2'!=3x2lxlz:is6 (2)
(iti) There are 8 distinct letters.
.'. Number ofwords of4 letters = 8C0.4! = 1680 (3)
By sum rule, number of words = I 8 + 756 + 1680 2454 :
Iltustration 57 A father with eigbt children takes three at a time to the zoological garden. without hking the same three
childrcn togeth€r more than once- Then find the number of times each child will go.

Solution
Maximum number ofgroups consisting of3 chitdren each : Eq = 56
So, the father visits zoological garden 56 times.
Number of times a particular child will go to zoo
= Number ofways other 2 children can be selected for the zoo
: :
7cz 2l times

Iuustration 58 Find the number ofall six-digit numbers using digits l, 2, 3, 4, 5 such that any digit that appears in the number
appears at least twice.

Solution
Case I: All six digits alike.
i.e., l l l l l l, 222222 ... etc.
Total numbers = 5
Case II: 2 digits alike + 2 other digits alike + 2 other digits alike.
5C, ways (i.e., 1,2, 3 and take ll'22,33)
Select any three in
 Pemulation and Combination 23

For each such selection, number of way ,: ]a. : ,o

.'. Total numbers = l0 x 90:900
Case III: 2 digits alike + 4 other digits alike.
i.e.- 112222 or 221111 etc.
Number ofways selecting 2 digits = (5C2X2) : 20

For each selection. number ofways = rt

h:
.'. Total numbers = 20 x l5:300
Case lV: 3 digits alike + 3 other digits alike.
5C,
Select any two in = l0 ways.
u'
For each selection. number ofwavs - - 3!.3! = ,o
.'. Total numbers = l0 x 20 = 200
Hence. total numbers or required type = 5 + 900 + 300 + 200 : 1405

4.4 Combination based on Geometry

1. Number ofdiaeonals in convex polygon ofn sides:
For diagonal, we mustjoin any two vertices but not adjacent vertices.
Hence, number of diagonals : 'C2 - n
2. Number ofrectangles in chess board:
There are 9 vertical lines and t horizontal lines on the chess board. For rectangle, we require two horizontal lines and two
vertical lines, which can be selected in eC, x eC, ways.
3. Nurtber of lines joiniag n points on the plane when r poins are collinear (r 2 r):
Number of lines is equivalent to number ofways in which two points can be selected which is'C, but ofthese'C, selection
gives the same line, which must be considered once-
Hence, number oflines ='C: 'Cz +I

@[Link]
number ofdiffercnt circles tlrat can be drawn through at least 3 points ofthesc points.

Solution
Number ofpoints required for the fixed circle is 3.
So, first select any three points from the l0 points in IoC, rvays.

In this way, circle with four concyclic poinls is selected in {C, ways. But it should be taken once
.'. Total number of circles = (roC: -
oq) * t

I[lustration 60 In a plane. there are 5 straight lines which pass through a given point. Io the same planc.6 other lines pass
through another given poxlt and 7 otheN pass through a third given point. Supposing no othcr three intersect at any common pornt
and no two are parallel, find the number of triangles fonned by the irtcrsection of these straight lines.

Sotutlon
Let the 5 straight lines pass through l, the 6 pass tkough 8 and the 7 pass through C. In all, therc are l8 straight lines.
To find the number of triangles is equivalent to find the number of selection of3 lines from these 18 lines keeping
in mind that
selection of 3 lines from the lines passing through ,rl, I or C will not give any triargle.
Hence, required number of triangles = l8C, + 6C, +
- 15C,
7
e) = 751.
24 Peinutation and Conbination

Iltustration 61 ln a convex polygon, no lhree diagonals are concurr€nt. Ifthe total number ofpoints ofintersection ofdiagonals
interior to the polygon be 70 then find the number ofdiagonals ofthe polygon

Solution
Lel the number ofsides be ,,
A selection offour vertices ofthr: polygon gives an interior interseclion.
=) 'Ct = 7O
= n(n l)(n 2\(n 3):24x70
=8x7x6x5
= n=8
= Numbcr ofdiagonals: EC, l{
=20

Iuustration 62 In a polygon. the number ofdiagonals is 54. Find the number ofsides ofthe polygon

Solution
Let number ofsides ofpolygon be a.
Now, number of diagonals of polygon = 'C, a
So, 'C" n=54
n(n - ll
2
-n=54
n1 3n 162=o
(n-12)(n+9)=0
2

Iltustration 63 Find the number ofways ofchogsing 3 squares from a chess board so that they have exactly one common vertex.

Solution
Consider squareof2 x 2, in which we have '4' triplets of squares (in shape 'I') which have common vertex.
We have such 7 x 7 squares of size 2 x 2.
So, number ofways of choosing 3 squares fiom a chess bobrd so that they have exactly one corrunon [Link]= 7 x 7 x 4

Concept Application Exercise 3

I' lf '5q. = lsC.' r, then hnd the value ofr.

2. Find tbe ratio of 20C,. and 25q when each of them has the greatest possible value.
3. Determine the number of5-cards combinations out ofa deck of52 cards ifthere is exactly one ace in each combination.
4. ln how many ways can a team of3 boys and 3 girls be selected &om 5 boys and 4 girls?
5, In an examination, a question paper consists of l2 questions divided into two parts viz., Part I and Part II, containing 5
and 7 questions, respectively. A student is required to attempt 8 questions in all, selecting at least 3 from each part. ln how
many ways can a student s€lect the questions?
6. Find the number of ways in which ten candidates 1,,,,1,. ..., .4 16 can be ranked such that,4 | is always above,4 ro. ,
7. On the occasion ifDeepawali festival. each student ofa class sends greetiag cards to the othea. lfthere are 20 students in
the class, lhen ltnd the total number of greeting cards exchanged by the studentt' - ,- -
g. In how many of the permutations of, things taken r at a time witl three given things always occur?

9. A committee of l2 is to be fonned fiom how many of these committees the women are in majority?
9 women and 8 men- In
vowels?
10. out of l0 consonants and 4 vowels, how many words can be formed each containing 3 consonants and 2
 Pennutalion and Combination 25

ll. Find the numberofways in which 7 people can occupy six seats.3 seats on each side in a first class railway compartmenl
if mo specified persons are to be alu'ays included and occupy adjaceot s€ats on the same side
12. Find the number ofwords which can be form€d with two different consonants and one vowel out of7 different consonants
and 3 different vowels. the vowel should be between the two consonants.
13. Find the maximum number ofpoints ofintersection of6 circles.
14. For a game in which two partners oppose two olher partners, 8 men are available. If every possible pair must play with
every other pair, then find the number ofgames played.
15. A team of fow students is to be selecled from a total of [2 students. Find the total number ofways in which team can be
selected such thal t\.r,o particular students refuse to be together and other two particular srudents wish to be together only.
16. Find the nurnber of rectangles that can be obtained by joining four of the twelve vertices of a l2-sided regular polygon.
17. Consider the five points comprising ofthe yertices ofa square and the intersection point ofits diagonals. How many triangles
can be formed using these points'l
18. Out of 8 sailors on a boat, 3 can work only on one particular side and 2 only on the other side. Find the number of ways in
which the sailors can be arranged on the boat.
19. The interior angles of a regular polygon measure 150' each. Find the number of diagonals oflhe polygon.
20, lf a line segment be cut at 'rr' points, then find the number of line seg,ments formed joining these points.

5. ALL POSSIBLE SELECTIONS

5.1 The Total Number of Combinations of rl Different Things Taken One or ilore at a Time
For each thing there are 2 possibilities, whether it is selected or oot selected.
H€nce, total number ofways: Total possibilities ofatl the things:2 x 2 x 2 x ... n times:2'
But this includes one case in which nothing is selected.
Hence, total number ofways ofselecting one or more ofn different things = 2'- I
r things from n different things can be selected in 'C,, 'C2.'C3, .. -,nC,ways, respectively.
Also, one, two, three, ...,
Hence,totalnumberofwaysofselectingatleastonething=nCinC2+.-.+'C,:(Co+^Ct+...+nC)-aco=2n-l

5.2 The Totat Number of Setections of One or More Things from p ldentical Things of One Type. g
Identical Things of Another Type, r Identicat Things of the Third Type and n Different Things
Number ofways ofselecting l things out ofn identical things : I for all r I a.
Hence, number of ways of selecting zero or more things out ofp idcntical things
: l+ l+ I +... +(p+ l)times
=P+l
Similarly. numbers of ways of selecting zero or more things out of ./ and r identical things are 4 + I and r + l. respectivcly.
Also. number ofways of selecting zcro or morc things out ofrr different things = 2 x 2 x2 x... r times = 2,,
Therefore, number of ways of selecting zero or morc things out of given things = (p * l\ kt * l)(r+ 1)2,
But numbcr of ways of selecting zero thing oul of given things = I x I x I x I,, = I
Thus. total number ofways ofsclecting onc or more things out ofgi\€n things = (p + l)(4+ l)(r+ l)2,, I

5.3 Number of divisors of /V

' Every natural number N can always be pur in the form ,v = pi'xpi.x...xp[^ wherep,,pr....,7.r7,are distinct primes and
or. d: . ....aa are non-ncgarire intcgers.

' IfN: pi'x pi'x...xpi^. then thc number of divisors of .Vis equivalent ro the numbcr of u,ays of selecting zero or more
objects from the groups ofidcntical objects,(/[Link].... rrr timcs). (1t .
trt.. ... a, rimcs), ,. .(pt pp... ar times)
= (ar + l) (4. + l) ... (0.k+ l): rvhich includes I and,Valso
Note:
o AII the divisors excluding I and Nare called proper divisors.
26 Permutation and Combination

. Also, number of divisors of lf can be seen as number of different terms in the expansion of
1p! + pl + pl + ... + p?t) x @f + il + pl + ... + pf1 x ... x (pt + p] + pi + ... + pf*)
Hence, sum ofthe divisors ofN
= (t + pr+ p! +... +pf') (l + pr+ p]+ ...+ p?) .... (r + pk+ pl + ... + pff)
a, +l
_ pi,*' _l -r oi,.t -,
pr-l p:-l p*-1
o The number ofways ofputting N as a product of two natural numbers is
I
*
1 ta, l1,o= l- l)... (dr- l) ifN is not a perfect square.
tflu is a pirfect square then this is
I t,o, * ,,,* + l)... (ar+ l)+ll.

@Findthenumberofwaysinwhichtheselectionofoneormoreballscanbemadeourofl0white,9black
and 7 red balts (balls ofthe same colour are identical).

Solution
Number ofuays ofselecting zcro or more white balls: (10 + l)
Number ofways ofselecting zero or more black balls: (9 + l)
Number ofu'ays ofselecting zero or more red balls = (7 - 1)
.. Rcquirednumbcrofways:(10+ 1)(9 + l) (7 + l) I =879

There are 3 books ofmathematics,4 ofscience, and 5 of literature. Hou,many different collections can be
made such that each collection consists of
(a) one book ofeach subject
(b) at least one book ofeach subject
(c) at least one book of literature

Solution
(a) One book of each subject is selected.
So, number of ways of selections =
3C 4 s
I x C.t x C | = 3 x 4 x 5 : 60
(b) At least one book ofeach subject is selected.
Number of ways of selection of at least one mathematics book = 23 - | : 'l
Number of ways ofselection ofat least one science | = 15 book: 24 -
Number of ways ofselection ofat least one literature book = 25 - I = 3l
So, total number ofways ofselection = 7 x l5 x 3l = 3255
(c) At least one book of literature is selected.
So, we can select any number ofmathematics and science books including zero selection.
So, number ofways ofselection = 23 x 2a x(25 - 1)= 128 x 3l:3968

Illustration 66 Find the number ofodd proper divisors of !' 6^ 21".

Sotution
v'^".7'
.. the required number ofproper divisors
= Number of selections ofany number of 3's and 7's ['-' For odd divisors 2 must not be selected]
=(p+m+n+ 1)(z+ l)- I
 Permutation and Combination 27

Itlustration 67 There are 5 historical monurnents, 6 gardens and 7 shopping malls in the city. In how many ways a tourist
can visit the city ifvisit at least one shopping malls.

Solution
For each historical monument there are two possibility. either he visits or hc does not visit.
Then number ofways in which he can visit 5 historical monuments is 25.
Similarly- he can \ isit 6 gardens in 26 ways.
But he visits at least one shopping mall. then hc can visit at lcast onc oul of 7 malls in Jr I uays.
Then total number ofways he can visit the city is 25 .26 .(21 l\

Concept Application Exercise 4

1. Find the tolal number of ways ofselections ofat least one red ball from a bag containing 4 ted balls and 5 black balls, balls
ofthe same colour being identical.
2. The total number of [Link] of at least one but at most n things ftom (2,l + I ) different things is 63. Find the value ofrr.
3. Find the number of groups that can be made from 5 different green balls, 4 different blue balls and 3 different red balls, if
at least I green and I btue ball is to be inctuded.
4. There are p copies each of a diff€rent books. Find the number of different ways in which a non-empty selcction can bc
made from them.

6. DIVISION AND DISTRIBUTION OF DISNNCT OBJECTS

6.1 Division and Distribution of ,r, + ,, Distinct 0bjects into Two Groups of the Size m and n (m * n)
Number ofways m + a distinct objects divided into two goups ofthe size m and n is equivalent to number ofways nr objects selected
*
out ofa + r objects to form one ofthe groups, which can be done in '' "(',,, ways. The another group ofn objects is fbrmed by thc
remaining z objects,

+
So, total number of ways of division = ' * 'C. = ml nt

Now, number ofways of distributing r'l + ,! distinct objects between two persons if one gets m and the
other gets z objecs
= Number ofways ofdivision ofzr + a objects into two groups x Number ofways these
two groups can be distributed to two persons

: (. + r)l * 2,t
mt n!

6.2 Division and llistribution ofm +rl +p Distinct 0bjects into Ihree Groups ofthe Siz e m, n and p (m * n+ p)
For this division, let us frnt select rz objects for frst group which can be done in ^
* * pC^ways.
"
Now, from remaining r
+ p objects, select ,r objects for second group which can be done in m+n+p
'*PC ways. The third group is formed from the remaining p objects.

Hence, total Dumber of ways of divisio n = (^'n * PC^)(,. PC,):

+##
Now, number ofways ofdistributing
:
,, +n +p objects among
three persons ifthey get ,,, r and p objects
Number ofways ofdivision ofzr + r +p objects into three groups x Number ofways
these three groups can be distributed to three persons
o
_ (n+n+ p)l [Link]
mr. n! p!
28 Pennltation and Cornbination

6.2.1 Division and Distribution of x, + x, + x3 + ... + x, Distinct Objects into n Groups of the Size xr, x2, x3, ..,,
xi (xt*x2+ -.. * xn)
xt + x2 +...+ xn
Gr +12 +."'+{")!
Total number ofways ofdivision = .
xr| x2l-..xnt
Now, number of ways of distributing these n groups;ong n persons

r, ! x, !...x, !

6.3 Division of 0bjects into Groups of Equal Size

Consider distribution of4 distinct objects a, 6, c and d into two groups of size 2.

One may count number of ways as !- : 6 *u!r.

But this is not the corect answer.
Tbe division chan for this answer is:
S. No. Group I Group 2
I cd
2.
.l

4 b.
5 bd

In the above chan, way numbers I and 6; 2 and 5; and 3 and 4 are same divisions.
4t
tr.r :
Then acrual number of ways is a 3 as in each division way, say a6 and cd, the groups can be arranged in 2! ways.

(2n\\

Then number ofways ofdivision of2n distinct objects into two groups ofequal size:
+=##
(?,'lrl
Now, number ofways ofdistributing these two groups between two persons = 111!!, zt=
nt nt 2l. nt nl.

(3r) !

(3n)!
Number of ways of division of 3z distinct objects into three groups of equal sue z is 4$4 =
nt n! nl3l

Now, number ofways of distributing these 3 groups among 3 persons = ,(',''l^,r:r=

nl nl3t
nt.
13',)!
nl nl nt
,

6.4 Division of Distinct 0bjects into Multiple Equal Groups

(r2n)l
(2n)t (2n)t (zn)t (3n) !(3n )!
Number ofways ofdivision of l2a distinct objects into 5 groups of2r. 22. 22, 3rr. 3r size =
3t 2t

(t2n)l
)! (2r)! (22)! (34)! (3r)l
Number ofways ofdistribution ofthese 5 groups among 5 persons
: x5!
3t 2l
 Pennutation and Combination 29

6.5 Distribution of n Distinct Objects in r Different Boxes if in Any Box, Any Number of Objects are
Ptaced (Empty Boxes are Attowed)
Consider distribution of a distinct objects into two different boxes of any size.
Number ofobjects in box I Number ofobjects itl box 2 Number of r sys
0 ,Co

I nl
2 n2

0 ,C,

Then total number of ways = 'Co + nC, +rC2+........+nCn:2d

Altematively, each object has two possibilities- either it can enter in box I or box 2. Then total number of possibilities for
z objects is 2 .2 2 ... n times = 2".
Consider the distribution ofrr distinct objects into three groups of any size.
Foreachobject,therearethreepossibilities.Thentotalnurnberofpossibilitiesfornobjectsis3.3.3....ntimes=3'.
Now, consider distribution ofr distinct objects into r different boxes if in any box, any number of objects can be placed.
For each object, there are r possibilities. Then total number of possibilities for z objects is r. r. r. .. . r times : /.

6.6 Distribution of rl Distinct Objects into r Different Boxes if Emptyr Boxes are not Allowed or in Each
Box at least One Object is Put (n ,
r)
The number ofways are given by /- 'Clr - l)' +'C2O 2\/ 'C.l(r 3)" +... + ( ly r'q. r1. This formula can be derived from
the principal ofinclusion and exclusion using set theory.

i; il;;;t*ays, l0 different objects can be distributed among 3 children so that each child receives at
least 2 objects and the number ofobjects received by each child is inversely proportional to its age?

Solution
The only possibility is that nurnber ofobjecls rcceived by children is 5, 3 and 2.

.. l0!
Numbcr ofll,uv.
- = 2!3!51 = 1520

Iltustration 69 Five different objects are to be distributed among 3 persons such that no two persons get the same number of
objects. Find the number ofways this can be done.

Solution
Way of division of objects can be (0. I, 4) or (0. 2. 3 ).

So, total number ofways ofdistribution = ..1 ^:l* , 5! .,.J! =10+60=90

0! t!.4! 0! r! :l!

Illustration 70 Find the number ofways in which r diffcrentprizes can be distributed among zr(< n) persons ifeach is entitled
to receive atmosta-lprizes
Solution
Total number ofways: m x m x ... n times = m,
Number ofways in which one gets all the prizes = ar
.'. Required number ofways = zr'- rz
30 Permutation and Combination

toys can be distributed so that exactly one child gets no toy.

Solution
Ifexactly one child gets no toy then exactly one child must get two toys and rest r- 2
gets one toy each.
Then division tree is as shown in the adjacent figure
Number ways ofdivision in the groups as shown in the tree
nl. ttl. ncz
0! 2! 0!r (/,-2\t
2
2l(, - z)l
r .' 2 times
Distribution ofthese n groups among n children can be done in rl ways
Then total number of ways of distributions oftoys = 'C, x a!

Illustration 72 Sixteen players S,, S., .!, ... , Sr,, play in a toumament. Find lhc number ofways in which they can be grouped
into eight pairs so that S, and 52 are in ditTerent pairs.

Solution
Requircd number ofways
: (number of ways in rvhich I 6 players can bc divided in 8 pairs ) (numberofwaysuhenS, andS, are in the same pair)

16! (14)! 16 -15 .14! (14)! (14)! Iro ts ,l_ o4) (r4)! (r4)!
28.8! z7 .71 2.27 .8.71 27 .71-
-'l-
z7 .71 L to la1u', r' -7"

7. DIVISION AND DISTRIBUTION OF IDENTICAL OBJECTS

7.1 Distribution of ,, Identical Objects into r Different Boxes if Empty Boxes are not Allowed

3
@l
Let rr idcntical objects be put on the floor in a line. Now to form r groups we require to put r - t identical partitions. If empty boxes
are not allowed, we cannot put partition to the left of lst object and to the right of nth object. Hence, there are I gaps available lt
toputr I partitions. Now, I gaps can be selected ftom n - I gaps in rC. ,ways. This is equivalent to number ofways of
r '
distributing rl objects in r boxes if empty boxes are not allowed.

7.1.1 Number of Positive Integral Solutions of the Equation xl + xa + ... + xr . n

This is equivalent to number ofways of distributing r identical objects into r different boxes if emPty boxes are not allowed which
lC,
is ' r.

7,2 Distribution of,, Identical objects in r Different Boxes If Empty Boxes are Allowed

o@ o lt
Here, the requircd number of ways is equivalent to arranging r identical objects and r - I identical partitions, which automatically
takes care of empty boxes.

- (n+r-l)l _,*,' t-
Then required number ofways = -" 'L, I
ffi
7.2.1 l{umber of Non-negative Integrat Solutions of the Equatlon xr + xz + "' + x. - n
if empty boxes are allowed which is
This is equivalent to number of ways of distributing n identical objects into / different boxes
n+rtC, tCn
t:r+t
 Permutation and Combination 31

Il]ustration 73 Find the number of ways in which 13 ideutical apples can be distributed among 3 persons so that no two
persons receive equal number ofapples and each one can receive any number ofapples.

Solution
Totalnumberofwaysofdistributingappleswithoutanyr€strictions:""ttCr,=lsCz=105
But it will also contain the ways wben exactly two persons reccive equal nurnber ofapples and those cases are as follows
0 0 t3
I I ll
661
Number of such ways = 7 x 3 = 2l
+ Required number ofways = 105 - 2l = 84 ways

Illustration 74 Find the number ofways in which l5 identical apples and l0 identical oranges can be distributed among three
persons, each rcceivirg none, one or more.

Solution
Number ofways ofdistribution of l5 identical apples among three persons: "
* t
Number of rvays of distribution of I 0 irtentical oranges among three persons ='o
* t''C,,a,o
So,totalnumberofways= l5-r lC,.x l0*r lC,o
= ITcl x l:cl
17x16 12xll
=
22
-x-
= 8976

Iltustration 75 Find the number of non-negative integral solutions of the equalisn 'x+y + z + 2w = 20.

Sotution
If w:0, tben the equation reduces to.r +-y + z = 20.
Number ofnon-negative integral solutions : 20 a - IC+ r = 23Ct
*

lf w = l, then equation reduces to r +), + 18. z:

Number of non-negative integral solutiont = t8 *lC+r = 2lCr
t

Similarly we can check for rv = 2, 3, ... , l0

Then total number ofsolutions 23C: + 2lC, + lec, + ... *
=
tq +'q
Itlustration 765 Find the number of non-negative integral solutions ofx +-y + z + u, !20
Solution
Given inequation i5 v +,y +; + *'( 20.
Letx+y+z+w+t=20 (l)
Where l 2 0 is dummy variable
Now, we have to find non-negative integral solutions ofequation (I ), which is
20 - 5 rcr,=2ag.,

Illustration 77 Find the total number ofways ofselecting l0 balls out of an unlimited number ofidentical white, red and blue balls.

Solution
I*l xy, xx atd xsbe the numbers of white balls, red balls and blue balls, respectively, being selected
We must have r,. + rr + ra = l0
Required number of ways = Number of non-negative integral solutions [Link] + rx + rs = I 0
- 3,lG I-Llo- 12^
Llo 12^
L2
32 Perrnulation and Combination

Ittustration 78 Find the number ofpositive integral solutions ofry; : 120.

Solutlon
ryz:120+ry2:23x3x5
Now number ofsolutions is equivalent to distribution of2, 2, 2, 3, 5 in three different boxes -r, y and z.
When none ofthe factor is assigned to any variable then the value ofthat variable wilt be considered as I
Now,3 can be distributed in three boxes in 3 ways, similarly 5 in 3 ways.
Now, 2, 2, 2 are three identical objects which can be distributed in I
+ I lC , :5C, : l0 ways.
Hence, total number of solutions : 3 x 3 x l0 = 90

Itlustration 79 Four different movies are runing in a town. Ter students go to watch these four movies. Find the number
ofways in which every movie is watched by at least one student (Assume each way diffen only by number of students watching
a movie).

Solutlon
Let four different movies be watched by x, /, z and w students.
.'- x+y+z+w=10 ...( I )
Since each movie is watched by at least one student,
Required number of ways = Number of positive integral solutions of equation (I )
= lo,lc4 l :94

Iltustration 80 Ten identical balls are placed in 5 different boxes kept itr a row and labelled,4, 8, C, D and E.. Find the number
ofways in which the balls can be placed in the boxes ifno two adjacent boxes remain empty.

Sotution
Case l: When no box remains empty.
Number of ways of distribution = r0 - |
Cs r:eCo,= 126
Case Il: When exactly one box is empty.
Number ofways of dis[ibution
= Number of ways of selecting one box which is empty

5 e x Number ofways ofdistributing l0 objects in remaining 4 boxes

=Cl3 C =420
Case III: When exactly two boxes remain empty.
Number of ways of distribution
= Number ofways ofselecting two boxes which are empty but not consecutive
x Number ofways ofdistributing l0 objects in remairing boxes
eC,
= (Number of ways of selecting any two boxes - Number ofways of selecting two adjacent boxes) x
= CC2 4)x Cr
=6x36=216
Case lV: When exactly three boxes are empty.
There is only I way to select three empty boxes if no two are adjacent.
Hence, numberof ways : I .'C. : 9
Thus, total number ofways: n)A + +ZO + Zta + g = ltt
 Peinutation and Combination 33

8. APPLICATION OF MULNNOMIAL THEOREM IN PERMUTANON AND COMBINAIION

a * LC, uC. : 15.
Consider the equation,r +-r +; :4. W€ know that the number of non-negative solutions of this equation is ,=
Each of the variables -r, I and z can take non-[egative integral values from 0 to 4. Let us take their values as exponent of some
constantp. So, for each variable, the set oftenns with different exponents ofp is lpo,p',p',pt,pol. We write these terms as series
i.e., po + pt + p2 + p3 + p+.
Now, number of all possible triplets (r, r,, z) is equal to number of terms in the product.

1p0+pt+p2+p3+pa1x1p0+pt+p1 + p3 + p4\x(p0 + pt + p2 + p3 + pa1

for r for r for :
Total number of terms in the above product after expansion will be 5 x 5 x 5. So. there will be 125 triplets (r,,v, :).
But we need triplets (x,.v, z) in which the sum ofthe exponents is 4.
So, number ofsuch triplets is equal to coefficient ofpa in above product.
.. Number ofnon-negative integral solutions ofgiven equation
= coefficient ofpa it Qto + pt + p2 + p1 + p4)r

/r P -s \l
= coefficient ofpa in | ',-
\ t- P )
1

= coefficient ofpa in 1t p5;l1t -p;J

: coefficient ofpa in ( I -p)-3
6Cc
- = 15

Now, to use this method we n€ed to understand expansion ( I - x) ", where n eM

Let /(x):(t r)':ao+ arx). a-? + arx3 + oo*0...

Now. /(0) : I =ao

Differentiating.l (-r) w.r.t.,r, we get
fG)= n(l --r) " l:ar +).s*y+)srf +4,ai?...
:. f(0)=n:al
Differentiating/(x) w.r.t. r, we get
2
f(x):n(n+ lXl -x)- =2ar+6urx+l2an?....
.'. f'(0\ : n(n + t) - 2aa
(n + l)n .*1-
ot L"
'2
Differentiating/'(.r) w.r.t. -r, we get
f'(x) = n(n + l)(n+2)(l -x)r 3 :6a, + 24a;r + ...
.'. f'(0): l\(n+2):6a3
n(n +
(n + 2)(n +l\tt ,*1-
or ol- = al
6
Similarly. we get other coeflicienls.
From above results, we establish that
(l -r)-'' = | +'ctx + tc2? + t + 2c{r + r + )cit +
" ...

This series has infinite terms for which lxl < l.

Coefficient of./ in (l -r) ' is'*' 'C,.
34 Pemutation and Combination

@[nhowmanywaysthesumofupperfacesoffourdistinctdicecanbesix?
Solution
Let the numbers on the upper faces of four distinct dice be xl,,r2, -rt and n4.
The sum ofthe numbers is 6.
,'. rl +r. *.rr +.\ - 6l where I S r,, ,r,. ,ri, xo S 6
.'. Number ofways the surn ofthe upper faces ofdice is six
= coefficient ofp6 in Q) + p2 + p3 + p4+ p5 + p6)4
= coeflcient ofp6 in pall + p + p1 + p, * po * pt\o
= coefficient ofp: n(l +p+p2 +i+p4 p\4 +
= coellicient of/.r: in (l + p + p1 + ... infinite terms){
(terms with higher powers ofp are not considered while calculating coefficient ofp2)

-.' ( r )
= coe lctent ol D. tn | |

\r-p)
-
: coeflicient ofp2 in ( I -p)r
4+) l^
C 0

Il]ustration 82 In an examination, the maximum marks for each olthe three papers are 50. Maximum marks for the founh
paper are 100. Find the number ofways in which the candidate can score 60% marks in aggregate.

Solution
Let thc marks scored by the candidate in four papers be -r,, J., jrr and.r+.
Then .rr + .r. + ,rr + .ri - 60% of 250 = 150
Here, 0 ( r1,,r2, x1 (50and0(xo( 100.
.. Number ofways candidate can score 60 9'o marks
= coefficienr ofplso in (l * p + p2 +... *pro), (l + p+p2+...*p'*)
(ln cach bracket. series is not extended 1o infinite terms as uppcr limit ofeach variable is less than 100)

l pt' r_zi)
'
= coefficient of zr50 io f - )' f
Ir-p)\t-p)
: (l -p5t)3(l -p'o') (l -p)*
coefticient ofprso in
= coefiicient ofprso in (1 - 3p5l + 3p102- pt0t1 1l +
a
c 6, + s g*? + 6ci + ...)
:'t'c, - 3, to2c, + 3 x st cr - s2c,

Iltustration 83 In how many ways can we get a sum ofat most l7 by throlring six distinct dice? In how many ways can we
get a sum greater than l7?

Solution
Let -r1. .(", ...,,16 be the numbers that appear on the six dice.
According to thc question,
,rl +11 +rl f... +ro( 17, where I Sr,S6 ..(l)
Now. we can remove the inequality sign by introducing one dummy variable rr, such that
rt - r.. * r1 1 ... l ,ro .r, IT. where xr ( 0 ..(2)
So, the number of solutions of inequality ( I ) and equation (2) are same.
.'. Required number ofsolutions
= coefficient ofprT in (p + p2 +... *pu)u ( | + p+p2+...)
=qoeflicientofplTinp6ll +p+... *pt)o(l + p+ p2 +...)
= coefficient ofpll rn (l + p + ... +p,)u (l + p + p2 + ...\
 Pemutation and Combination 35

t
= coeflicient ofDtr "'l['-")tI
,"
t-, )\r-o))
= coelficient ofprr rn (l - 6p6) (l d7
t'cr'
= ''c,,-6
Number ofways in which we caD get a sum greater than [7
: total number ofcases - number of cases in which the sum is at most l7
= 6u - ('7c,, 6"q)

Illustration 84 ln how many ways, 30 marts can be allotted to 8 questions such that each question carries at [Link] 2 marks.

Solutlon
Required number : coeff. ofp30 in 1p2 + p3 + ... + pt6\E
= coeff. ofp30 inpl6 1l + p + ... + ptalE

l- Ptt
: coeff. ofpra in

= coeff. ofpra in (l
i
l- p
-pf
- " C.,0

9. DERANGEMENT

There are ll leners and r corresponding envelopes. The number ofways that all the lefters can be placed in the envelopes (one letter
in each envelope) so that no letter is placed in correct envelope is given by

,1f1- 1* I -.. *t-rl'l

L l! 2! ,! .l

Illustration 85 Find the number ofways that all the letters ofthe word SWORD cau be ananged such that no letter is in its
original position.

Solution
Clearly, it is the example ofderangement.

So reouired number ofwavs = ,,[, -l* I - I + I - l] =44

L r! 2t 3t 4! 5rl
Iltustration 86 LetJ:A-AbeaninvertiblefunctionwhereI={l,2,3,4,5,6}.Findthenumberofthefunctiontiinwhich
at least tkee elements have self-image.

Solution
Ifexactly r elements have self-image then
Number of firnctions = fNumber of ways ofselecting r elements) x (Derangement ofremaining elements)

=,c,rl r -1*1-
| 2'!
Required number of functions

: 6cr x 3!
: (' - i . ,1 -* ) . ".. " z, (, - | * j) .'c,, L (r - | ) .'c.
r

:40+15+0+t
:56
38 Permutelion end Combinelion

Concept Apptication Exercise 5

l. Find the number ofways that five people can be divided into tkee groups.
2. Find the number ofways that birthdays of six different persons will fall in exactly two calendar months.
3. Find the number ofonto functions from,4 to I ifl has 4 elements and I has 3 elements.
4. Find the number of non-negative integral solutions of the equation r + _y
+ : : [ 0.
5. Find the number ofpositive integral solutions ofthe equation.r +-y + z = [2.
6. Find the total number of ways in which I 5 identical blankets can be distributed among 4 persons so that each of them gets
at least two blankets.
7. lfa.b,canddareoddnaturalnumberssuchthata+D+c+d=20thenfindthenumberofvaluesoftheorderedquadruplet
(a, b, c, d).
8. Find the number of homogenous products of degree 3 from 4 variables.
9.
Find the number ofintegers betwe€n 1 and 100000 having the sum ofthe digits 18.
10. Find the number of positive integral solutions ofthe inequality 3x + l, + z < 30.
I l. Five distinct lefters are to be transmitted through a communication channel. A total number of l5 blanks are to be inserted
between these leners with at least three between eyery two. Find the number ofways in which this can be done.
 Peinutation and Combination 37

SOLVED EXAMPLES
Mlscrluurous PnosLrus Bmro or 0rr on Mone Solution
rnrr Oxr Concem Problern is same as dividing 17 identical things in two groups.
+ n=(17+l)/2:9
I Total number of ways in which three distinct
No effect if two diamonds are differenl as necklace can be
numbers in A.P. can be selected from the set {1,2,3, ... , 24}
is equal to flipped over.
(r) 66 O) 132 + n= m=9
(c) 198 (d) None ofthese Hence, the correct option is O).

Sotution I A chss has three teachers, Mr..(, Ms. I/ and

Let the selected numbers be r,, r. and x.,.
Mn. Z and six students l, 8, C D, E and F. Number of ways
in which they can be seated in a line of9 chairs, ifbetween any
We must have 2r1 =,t, r, +
two teachers there are exactly two students, is
= xr *x: = even (e) 18.6! (b) 12.6!
i.e., rl and -rl both are odd orboth are even. (c) 24.6t (d) 6.6!
lfx, and r, both are even, we can select them in l2C, ways.
Solutlon
Similarly, ifx, and x, both are odd, we can again select them
in l:C, ways. The possible arrangements of teachen and students can be as
t'Cz= follows:
Thus lotal ways = 2 . 132
(i) TSSTSSTSS
Hence, the correct option is (b).
(ii) STSSTSSTS
rc The total numberof5-digit numbers ofdifferent (iID SSTSSTSST
digits in which the digit in the middle is the largest is Hence, total number ofways = 3 ' (3!)61 = (18)6!
9
Hence, the correct option is (r).
tr) I'Po O) 33(3!)
n=4 out of ofwhich some are white and
8 t 15 balls,
the rest are black, how many should be white so that the number
(c) 30(3!) (d) f rJP,
of ways in which the balls can be arranged in a row may be lhe
greatest possible?
Sotution
(a) 8,9 (b) 9, l0
Middle Digits available for Number of*rys of frlliog (c) 7,8 (d) None ofthese
digit remaining four places remaitriog four plrces
Solution
.l 0, 1,2,3 3x?,
Let therc be r white and (I 5 - r) black balls.
5 0,r,2,3,4 4xaPl
Then permutation ofthese balls
6 0. [Link].5 5"'& : 15 ! /r ! (15 -r)! = rsq
7 0,r,2,3,4,5,6 6t6Pl Since / white balls are alike and (15 - r) black balls are alike,
we have
8 0. t,2.3.4,5,6.7 7 x1P3
Number ofarrangemeals = lsqwhich is max., when r= ( l5 - ty2
9 0, r,2, 3,4, 5,6, 7, 8 8"'4 or (15 + I )/2

Ilence, the correct option is (d).

i.e., r=7 or I
Hencg the correct option is (c).
I If n is the number of necklaces which can be
formed using 17 identical pearls and 2 identical diamonds and In the decimal system ofnumeratio4 the number
similarly, m is the number of necklaces which can be formed of 6-digit numbem in which the sum of the digits is divisible
using l7 identical pearls and different diamonds, then by5is
(a) n=9,r2=18 (bl n=n=9 - (a) 180000 O) 540000
(c) n:z=18 (d) None ofthese (c) 5xld (d) None ofthese
38 Pernutation and Combination

Solution Total number of ways:ecr - i Cr. scr. 3l

xxxxxx ot 1l {t
Ways i 9 l0 l0 l0 l0 2 21.71 2t.51 zt.3l
First place from left cannot be filled with 0. _91_9.8.7t_g.71
Next four places can be filled with any one ofthe ten digir. 88
After filling the first five places, the last place can be filled by HeDce, the correct option is (a),
0 or 5, I or 6, 2 or 7, 3 or 8, 4 or 9 depending upon whether the
Number ofways in which 7 green bottles and 8
sum ofthe five digits lilled is ofthe form 5rz. 5z + 4,5m + 3,
blue bottles can be arranged in a row, if exactly I pair ofgreen
5m + 2 or 5m + l, respectively.
bottles is side by side, is (Assume all bottles to be alike except
Thus, in any case last place can be filled in two ways.
for the colour)
Hence the required number ofnumbers : 9 x 104 x2 (c) 84 (b) 360
Hence, the correct option is (a). (c) 504 (d) None

re Total number ofways ofselecting two numbers Sotution

ll, 2, 3, 4...., 3n) so that their sum is divisible
from the set
First, arrange 8 blue alike bottles.
is
by 3 equal to
Number ofways = I
2n2 -n
lal (b) 3n2 -n Now. select one gap out of9 gaps created to put two $een bottles.
2 2
Number ofways = eC,
(c) 2n2 - n (d) 3n2 -n Now, select 5 more gaps for other green bottles from remaining
Solution 8 gaps.

Given numbers can b€ categorized as Number ofways : 8C.

1,4,7,...,3n-2-r31+ | Hence. total number ofways: eC, 8C.

2,5,8,...,3n -l +3).a
3,6,9,.,.,3n -+ 3),
2
-n- 8.'7.6
r.H
That means we must take 2 numbers from last row or one number =72.7=504
each from frrst and second row. Hence, the correct option is (c).
Total number ofways='Cz+'Ct .'Cr
A person predicts the outcome of 20 cricket
.l
n(n_l\+n 2 5n -n
= ' )
matches ofhis home team. Eachmatch canresult either in a win,
2 a loss or a tie for the home team. Total numberofways in which

Hence, the correct option is O). he can make the predictions so that exactly l0 predictions are
correct, is equal to
m Number ofpermutatiom of l, 2, 3, 4, 5, 6, 7, 8, (e) 2ocro.2ro (b) 2ocro.32o
digit I appearing somewhere
and 9 taken all at a time are such that
(c) 2ocro . 3lo (d) 2ocrc.z2o
to the left of2, 3 appearing to the left of4 and 5 somewhere to
the left of6, is (e.g., 815723946 would be one such permutation) Solution
(a) 9.7! O) 8! Matches whose predictions are correct can be selected in loC,o
(c) s!.4! (d) 8!.4! ways. Now, each wrong prediction can be made in 2 ways.
Thus. total number of ways = 20C, o . 2 | 0
Solution
Number of digits : 9
Ifence, the correct option is (a).

Select 2 places for the digits I and 2 in eC2 ways. There are two bags each containing m balls. A
From the remaining 7 places, select any two places for 3 and 4 man has to select equals number ofballs from both the bags. Then
in 7C, ways. the number ofways in which he can do so, if he must choose at
And from the remaining 5 places, select any two for 5 and 6 in least one ball from each bag, is
sc, ways. (a) zr2 2'C^
@)
Now, the remaining 3 digis can be filled in 3! Ways. G) 2^c-- I (d) None ofthese
 Pemutation and Combination 39

Solutlon lhllte of& \blue ofl'.

The number ofways ofselecting r(0 S r S nr) balls out ofm is 'C, 0 0, 1.2, ... ,9
So, the number ofways ofselecting r balls from each ofthe bag I 0, 1,2, ... ,8
is ('C.)'?. 2 0, t,2, ... ,1
Further, the number of ways of selecting equal number of balls 3 0,t,2,3,4,5,6
from each ofthe two bags, choosing at least one fiom each bag J o, I,2,3,4,5
is (-Cr)2 + ('C2)2 + ... + (^C^'t1 = 1'C.
5 0, t,2,3,4
I - 6 0, 1,2,3
Ilence, th€ correct option is (c). 7 0. 1.2
8 0,
The number of ordered pairs (a, z) where 1

m, n e 11,2,3, ,50), such that 6'+ I is a multipte of5 is

0

(a) Thus xr and y, can be selected collectively in l0 + 9 + 8 + ...

1250 o) 2500
+l:55ways.
(c) 62s (d) s00
Similarly, each pat (xa, .ya), 93, y), (x2, y) can be selected in
Sotutlon 55 ways.
6'+9' But the pair (rt,/r) can be selected in I +2 + 1+... + 8:36
Unit digit of 6' is = 6 ways as in this pat we caonot have 0 or 9-
Unit digit of 9'will be : 9 or I Thus, total number ofways : 36(55)a
For being multiple of5, unit digit of9' must be 9, which occurs Hence, the correct option is (a).
when n is odd-
Total number of ordered pain : 50 x 25 : 1250 Total number of times, the digit 3 will be
written, when the positive integerS having less than 4 digits are
Hence, the correct option is (r).
liste4 is equal to
The number of shortest ways in which we (r) 300 O) 310
can reach from the point (0, 0, 0) to point (3, 7, I t) in space (c) 302 (d) 306
where the movement is possible only along the r-axis, -y-axis
and z-axis or parallel to them and change of axes is permitted Solution
only at integral points is (An integral point is one which has its Number of Tlpe of Numb€rs of Numberoftime
co-ordinates as integers) times 3 appeers number this type 3 appears

(r) 2lqxl8c7 (b) 2lcr x lscl I --3 3x9x9 l(3x9x9)

(c) 2'C, x l8C, (d) None ofthese
-3-
3--
2 -33 3x9 2(3 x 9)
Solution 33
To'tal distance to be covered = 3 + 7 + I I J_J
units = 2l I l
'Ibtal
A person can choose 3 units in x-direction 2lC, ways. -100

A person can choose 7 units from remaiaing l8 units in Any place other than 3 is fitled by 9 ways as '0' can appear
y-direction in 186, ways. anywhere which gives allt pes ofnumbers including single-digit
The rest I I rmits in z-direction can be chosen in I way. and two-digit numbers.
.'. Totat number of shortest ways : 2lC3 x IECT x I Hence, the correct option is (a).
Ecnce, the corrfft optiotr is (r).
[n Consider a convex polygon of r sides.
I n, and r, are fivedigit numbers. Total numbers Triangles are forrned byjoining the vertices ofthe polygon. Then
ofways offonning z, and n, so that these numbers can be added which ofthe following in not rue?
without carrying at any stage, is equal to (a) Total number oftriangles is 'C3.
(e) 36.(ss)a o) 4s.(5sy (b) Number oftriangles in which exactly one side is common
(c) (55)s (d) None ofthese with that ofthe polygon is z(z 4).
(c) Number oftriangles in which two sides are cornmon with
Solutlon
that oflhe polygon is a.
nt = XtX2X3X4X5,
(d) Number oftriangles in which no side is common with that
nz= !rfzlzfq!s
n, and z, can be added without carrying at any stage ifxr +/r < 9 of the polygon is
!r1, -+1 1, -01.
40 Pemutation and Combination

Solution Sotutlon
Let the n-sided polygon be A 1 A2... A,,
^ --12 --n-144=n=14
l2nm
Ak
We need to find here total number ofdivisors of 144.
Now, l,l4 = 2a ' 32

Total number of divisors is (4 + l) (2 + l) : 15.

A3 Since pairs with negative integers are also possible, total number
ofdivisors is 30.
Hence, the correct option is (a).

Number oftriangles (i.e., selection of3 vertices from n vertices) setl = 11,2,3,5,6,
II Let), be an element ofthe
=,c,:1,1,-r11,-2ll ...(r) 10, 15, 30). Also, letxt, x, and
Then the number ofpositive integral solutions
r, be integers such that.r1x2x3 =y.
ofxr.r2.x3:y is
The number ofaiangles having only one side common with the (r) 8l O) 64
polygon=a(r-4) (c) 72 (d) 90
For illustration. consider side ,4, r{,, since two points ,43 and l"
are adjacent. 3rd point should be chosen fiom remaining (z - 4) Solution
points which can be done in (n - 4) ways. Since l,2,3,5,6, 10, l 5 are divisors of 30, number of solutions
Next, the number of triangles with two sides common with the ofthe equation rr .r2 r, =y is the same as the number ofsolutions
polygon ofequation
= Numbq of ways of choosing 3 consecutive vertices x1x24x4= 30 = 2x 3 x 5; where xo is dummy variable.
(i.e., ArA2A3, ArA.A4,4A4As, ... A,A1A): n Now, number ofsolutions: number ofways ofdistinct integers
Hence, the requked number oftriangles none ofwhose sides is 2, 3 and 5 can be placed in four boxes.r p x2, x3 and x4: 43 :64
common with the polygon
Hence, the correct optior is (b).
:'Q n(n-4)-n
n Number of permutations of letters a, D, c, d e,/
=l6 ln - t)(n - -
(n z) an (n - 4) - 6nf and g taken all together ifneither 'beg' nor 'cad' pattem appear is

:1 z(r-+)(a-s) (s) 7! -2 +3!5! (b) 7! -2.5! -3!

6 (c) 7! - 5! + 3! (d) None ofthese
Ilence, the correct option is (d). Solution

E Letl be a set containing n different elem€nts Total number ofperrnutations without any restrictions are 7!.
A subset P of,4 is chosen. The setl replacing
is reconstructed by
the elements ofP. A subset O ofl is again chosen. The number
@acdf
of ways of choosing P and Q so that P rt 0 contains exacdy Number of permutations in which 'beg' pattem always appear
two elements is is 5!. In these pemrutations, there are some cases;n which 'cad'
(s)'Crx2' (b)'Crx3'-2 pattem also appear.
(c) 3' I (d) none ofthese @t"yg
Solution Number of permutations in which 'cad' pattem always appear
Two elements for set P n p can be selected in nG ways. is 5!. In these permutations, there are some cases in which 'beg'

(fl pattem also appear.

Each ofthe remaining 2) elements can be put from any of
the three sets (P n /
), (P Q) and (P w Q)' .
So, total numberof ru6r",r ^='q x 3' 2
Number of permutations in which both 'beg' and 'cad' pattem
Hence, the correct option is O). appear : 3 !

How many ordered pairs (2, z) of integers Then total trumber of permutations in which 'beg' and 'cad'
.- m 12- pattem do not appear: 5! -5! + 3! 7!
sattsfy
-=-1 Hence, the correct option is (a).
(a) 30 (b) ls
(c) l2 (d) l0
 Perfiutation and Combination 41

NCERT TEVEL EXERCISE

I . From given 4 flags ofdifferent coloun. how many different 15. Find the number ofways of selecting 9 balls from 6 red
signals can be generated, ifa signal requires the use of2 balls. 5 white balls and 5 blue balls. if each selection
flags one below the other? consists of3 balls ofeach colour.
2. How many 2-digit even numbers can be formed fiom the 16. In how many ways can one select a crick€t team of I I
digits 1,2,3,4 and 5 ifthe digits can be repeated? from l7 players in which only 5 players can bowl, ifeach
3. Find the number ofdifferent signals that can be generated cricket team of I I must include exactly 4 bowlers?
by arrarging at least 2 flags in order (one below the other) I 7. A bag contains 5 black and 6 red balls. Determine the number
on a vertical staff, iffive different flags are available. ofways in which 2 black and 3 red balls can be selected.
4. Find the number ofpermutations ofthe letters ofthe word lE. ln how many ways can a student choose a program of5
ALLAHABAD. courses if9 courses are available and 2 specific counes
5. How many numben lying between I 00 and I 000 can be are compulsory for eYery student?
fomred with the digits 0, l, 2, 3, 4 and 5, if the repetition 19. What is the number ofways of choosing 4 cards Aom a
of the digits is not allowed? pack of52 playing cards? ln how many ofthese
6. In how many ways can 4 red,3 yellow and 2 green discs (i) four cards are ofthe same suit?
be arranged in a row. if the discs of the same colour are (ii) four cards belong to four different suits?
indistinguishable? (iii) are face cards?

7. Find the number ofarrangements ofthe letters ofthe word

(iv) two are red cards and two are black cards?
INDEPEN'DENCE. In how many ofthese arangements
(v) all are ofthe same colour?
(i) do the words stan with P? 20. A coin is tossed 3 times and the outcomes are recorded.
(ii) do all the vowels always occur together? How many possible outcomes are there?
(iii) do the vowels never occur together? 21. In the different permutations ofall the letters ofthe world
(iv) do the words begin with,l and end in P? EXAMINATION, how many words are listed before dre
E. How many 3-digit even numbers can be formed form the words which start with I?
digits l, 2, 3,4, 5 and 6, ifthe digits can be repeated? 22. The English alphabet has 5 vowels and 2l consonants.
9. How many 4-digit numbers are there with no digit How many words with two different vowels and 2 different
repeated? consonants can be formed form the alphabet?
10. Find the number of 4-digit numbers that can be formed 23. Determine the number of s-card combinations out of a
using the digits t,2,3,4 and 5, ifno digit is repeated. How deck of 52 cards if each selection of 5 cards has exactly
many ofthese will be even? one king.
11, Find r if(i) 5P, = 26 P, r (i)sP,=6P,-l 24. From a class of 25 students, l0 are to be chosen for an
12. How many words, with or without meaning, can be formed excursion party. Th€re are 3 students who decide that
using all the letters of the word EQUATION, using each either all of them will join or none of them will join. ln
letter exactly once? how many ways can the excursion pary be chosen?

I3. If'Ce ='CE. find the value ofz. 25. How many numbers greater than 1000000 can be formed
by using the digis 1,2,O,2,4,2and4?
14. Determine n if "Cr,'Cr= 11 ,1.
42 Permutation and Combination

STATE LEVEL EXERCISES

Srrele Connrcr Arswrn Tvpr (r) 5040 (b) 720
(c) 168l (d) 2520
I . How many numbers divisible by 5 and lying between 3000 II . A question paper is divided into two pars A and B and each
and 4000 can be formed from the digits I , 2, 3 , 4, 5 ard 6 part contains 5 questions. The number of ways in which
(repetition is not allowed)? a candidate can answer 6 questions selecting st least two
(a)
n+r-l
l1:-' t& questions fiom each part is
O)
(r) 80 (b) 100
(c) aPz (d) 6P: (c) 200 (d) None of these
2. In how many ways can zz letters be posted ir z letter-boxes? 12, Fournotes ofRs. 100 and five notes in which first is ofRe.
(mn)'
(al (b) m^' I, second is ofRs. 2, third is ofRs. 5, fourth is ofRs.20
(c) n^' (d) None ofthese and fiffh one is ofRs. 50, are distributed among 3 chil&en
3. lf'P , *t
r: 9 Po, then the value of n is such that each child receives at least one note ofRs. 100.
(e) 6 O)8 The total number ofways ofdistribution is
(c) s (d) 9 (a) 3x55 (b) 5x35
4. Four dice (six faced) are rolled. The number of possible (c) 36 (d) None ofthese
outcomes io which at least one die shows 2 is 13. In how many ways a garland can be made &om exactly 10
(r) 1296 (b) 62s flowers?
(c) 671 (d) None ofthese (r) l0! (b) 9!
5. There are three girls in a class of l0 studens. The number
ofdifferent ways in which they can be seated in a row such
(c) 2(e!) -'2 I
(O
that no two of the three girls are together is
14. lf2'C,:'C z: 44: 3, then for which ofthe following values
(8) x6P3
7! G) 7! x
EP'
ofr, the value of'C. will be l5?
(c) 7! x 3l (d) (r) r=3 O) r=4
' ' ---!!l
3t7l (c) r:6 (d) r= s
6, In how many ways can l0 balls be distributed to two boys, 15. If loc = loc",r, then 5c, equals
one receiving two and the other eight balls? (a) 120 (b) l0
(a) 45 (b) 75 (c) 360 (d) 5
(c) 90 (d) None ofthese
16. In an election, there are 8 candidates, out ofwhich 5 are to
7. The number of ways in which the letters of the word be chosen. If a voter may vote for any number ofcandidates
TRIANGLE can be aranged such that two vowels do not but not greater than the number to be chosen, then in how
occur together is many ways can a Yotet vote?
(a) 1200 O) 2400 (a) 216 (b) ll4
(c) 14400 (d) None ofthese (c) 218 (d) None ofthese
t. The number ofwords which can be formed from the letters
17. In how many ways can 2l English and 19 Hindi books be
of the word MAXIMUM, if two consonants cannot occur placed in a row so that no two Hindi books are together?
together, is (e) t540 (b) 1450
(a) 4l (b) 3! x 4! (c) 1504 (d) 1405
(c) 7! (d) None ofthese
lE. How many words can be formed by taking 3 consonants
9. How many words can be made from the letters ofthe word
and 2 vowels out of 5 consonants and 4 vowels?
COMMITTEE? 5c,
9! qr rC.,xaC, xoc.
(a) ------= (b) -+ (a) (b)
(2t), (2 !r
5cr x 4cr
(c) (O (5c3 x 4c2) (5)!
ol -
"2l :
(c) (d) 9! 19. In bow many ways a team of I I players can be formed out
of 25 players, if 6 out of them are always to be included
10. The letters of the word MODESry are rritten in all and 5 are always to be excluded?
possible orders and these words are w netr out as in a (e) 2020 (b) 2002
dictionary. The rank of the word MODESTY is (c) 2008 (d) 8002
 Pefiutation and Combination 43

20. Number ofways ofselection of8 letters from 24 letten of (a) 5x8P, (b) 5x6Pl
which 8 are a, 8 are 6 and the rest are unlike, is given by (c) 5!x8P3 (d) 5!x8P3
(a) 27 O) 8.28 lKsrnatlka CET 19931
(c) 10.27 (d) None of these 3. 12 persons are to be arranged to a round table. If two
21. The number ofpermutations ofn things taken / at a time, particular persons among them are not to be side by side,
whenp things are always included, is the total number ofarrangements is
(a) 'C,pt (b)'aC,r'! (a) 9(10!) (b) 2( l0 !)
(c) ' PC,_rrl (d) None ofthese (c) !)
45(8 (d) l0!
22. lf 'P3+'Cn 2= l4z, thenz: JEAMCET T994I
(r) 5 (b)6 4. The sum ofall positive divisors of960 is
(c) 8 (d) l0 (r) 3048 (b) 3087
23. In how many way,s can 6 penons be selected fiom 4 officen (c) 3047 (d) 2180
and 8 constables, ifat least one oflicer is to be included? IKarnataka CET 20(X)1
(s) 224 (b) 672 5. All the letters of the word 'EAMCET' are arranged in all
(c) 896 (d) None ofthese possible ways. The number ofsuch arrangements in which
24. There are 9 chain in a room on which 6 persons are to two vowels are not adjacent lo each other is
be seate4 out ofwhich one is the guest with one specific (&) 360 (b) ll4
chair. In how many ways they can sit? (cl 72 (d) s4 [DCE 20001
(t\ 6720 (b) 60480 6. The number of4 digit even numbers that can be formed
(c) 30 (d) 346 using 0, l, 2, 3, 4, 5, 6 without repetition is
25. A total number ofwords which can be formed out ofthe (i) 120 O) 300
letters a, D, c, d, e and. ftaken 3 together such that each (c) 420 (d) 20
word contairs at least one yowel, is IKerlla (Engg.) 2001|
(N) '12 (b) 48 7. lf'P4:24.'C5, then the value ofz is
(c) 96 (d) None ofthese (r) l0 (b) 15
26. The number of ways in which any four letters can be (c) 9 (d) 5
selected from the word 'CORGOO' is lKarurtaka cET 20011
(a) ls O) ll E. lf'P4:720. 'C, then r is equal to
(c) 7 (d) None ofthese (o) 6 (b) 5
27. The number oftriangles that can be formed by 5 points in (c) 4 (d) 7
a line and 3 points on a parallel line is lKeral! (Engg.) 20011
(a) 8cr 8C3
O)
5c3
- 9, The straight lines 11,12,13 are parallel and lie in the same
(c) *q -'C, - I (d) None ofthese plane. A total number ofz poiots are taken [Link], n points
28. Given six line segments oflengths 2, 3, 4, 5, 6 and 7 units, on 1r, & points on .Ir. The maximum number of triargles
the number ofEiangles that can be formed by these lines is formed with vertices at these points is
(r) 6q-7 o) 6q-6 @)
n+r+kcr
(c) 6c3-5 (d) 6q-4 (b) '*'*ic3 - 'c3 - 'cr - *cl
29. A man has l0 friends. In how many ways he can invite
(c) ac3 +'c3 + ic3
one or more ofthem to a party?
(d) None ofthese [UPSEAT 200f1
(e) l0! O) 2ro 10. The number ofpositive integral solutions ofaDc = 30 is
(c) l0!-l (d) 2ro- I (a) 30 (b) 27
(c) 8 (d) None ofthese
Ancxrvs [UPSEAT 2OOI I
11. How many different nine-digit numbers can be formed
I . In a football championship, there were played I 53 matches.
from the digits ofthe number 223355888 by reanangement
Every team played one march with each other. The number
ofthe digits so that the odd digits occupy even places?
ofteams participating in the championship is
(a) l7 (b) l8
(r) t6 (b) 36
(c) 60 (d) 180
(c) 9 (d) 13 FltsJEE 19921
[Karnataka CET 2fi)21
2. How many numbers between 5000 and 10,000 can be
12. There are n points in a plane ofwhichp points are collinear.
formed using the digits l, 2, 3, 4, 5, 6, 7, 8, 9 each digit
How many lines can be formed from these points?
appearing not more than once in each number?
44 Padnutation and Combination

(t) aotCz (b)'Cz-PCz 22. How many numbers of 6-digis can be fonned fiom the
(cYCr-tCr+ I (d) 'Cz-PCz- | digits ofthe number 112233?
lKarnataka CET 20021 (r) 30 O) 60
13. The number ofstraight lines that can be formed byjoining (c) 90 (d) 120
20 points no thrce of which are in the same straight line IKarnatake CET 2(Ml
except 4 ofthem which are in the same line is 23. lf rC rr= rQu,lhgn 16r=
(a) 183 (b) 186 (r) 72 (b) ls3
(c) 197 (d) 185 (c) 306 (d) 2ss6
lKenh (Engg.) 20021 [Karnstrkr cET 20051
14. The number ofways in which a comrniftee of6 members 24. Nine balls are to be placed in 9 boxes and 5 of the balls
can be formed from 8 gentlemen and 4 ladies so that lhe cannot fit into 3 small boxes. The number of ways of
committee contains at least 3 ladies is arranging one ball in each ofthe boxes is
(r) 252 (b) 672 (r) 18720 (b) 18270
(c) 444 (d) 420 (c) 17280 (d) 12780
[Kerale @ngg.) 2fi121 (BTTSAT 2008)
15. In how many ways 7 men and 7 women can be seated arowd 25. lf ^P, = 30240 and 'C,: 252, then the ordered pair (n, r)
a round table such that no two women can sit together? is equal to
(e) (7!)'? (b) 7!x6! (a) (12,6) (b) (10, s)
(c) (6!)': (d) 7! (c) (9,4) (d) (16,7)
IITPSEAT 20021 (BTTSAT 2008)
16. If o = acr, then "C, is equal to 26. In how many ways can 5 prizes be distributed among four
(.) '*1co O)'-rc. students when every shrdent can take one or more prizes?
(cl 3.-*2c4 (d) 3 .'*rC4 (r) 1024 (b) 625
17. The least value of natural number r satisfying (c) 120 (d) 600
C(n, 5) + C(n, 6) > C(a + l, 5) is (BTTSAT 2011)
(a) ll O) 10 27. A bag contains n white and n black balls. Pairs ofballs are
(c) 12 (d) 13 drawn at random without replacement successively, until
[EAMCET 20021 the bag is empty. If the number of ways in which each
I E. A dictionary is printed consisting of 7 lettered words only pair consists of one white and one black ball is 14,400
thal can be made with the letters of the word CRICKET. then n =
If the words are printed at the alphabetical order, as in an (r) 6 (b) 5
ordinary dictionary, then the number of word before the (c) 4 (d) 3 [EAMCET 20111
word CRICKET is 2E. The number of five digit numbers divisible by 5 that can be
(a) 530 (b) 480 formed using the numben 0, 1,2,3,4,5 without repetition is
(c) s3l (d) 481 (a) 240 (b) 216
[Orissa JEE 2(X)31 (c) 120 (d) 96
19. The number ofwords that can be formed out ofthe letters IEAMCET 20r11
of the word ARTICLE so that the vowels occupy even 29. tsPE:A+8-taPr+A:
places is (a) r? G) '?
(a) 36 O) s74 (c) (d) 'u&
(c) 144 (d) 7s4 'tPr
IEAMCET 20111
[Karnatak! CET 20031
30. A regular polygon of n sides has I 70 diagonals. Then z =
20. The number ofways in which 9 persons can be divided (r) 12 (b) 17
into thr€e equal groups is
(c) 20 (d) 2s
(a) 1680 O) 840
[EAMCET 20121
(c) 560 (d) 280
31. A committee of 12 members is to be formed from 9 women
[Orissa JEE 2ffi31
and 8 men. The number of committees itr which the women
21. Assuming that no two consecutive digits are same, the
are in majority is
number ofa-digit numben, is
(a) r! O) 9!
(e\ 2720 (b) 2702
(c) e' (d) ,e
(c) 2270 (d\ 2278
IEAMCET 20121
[Orissa JEO 20041
 Permutation and Combination 45

32. The number ofways in which a team of I I players can be 36. Ifl, denotes the number oftriangles fom,ed with n points
selected fiom 22 players including 2 ofthem and excluding in a plane no three of which are collinear and if l, * , - l,
4 of them is : 36, then r =
(a) r6c,r (b) '6c, (s)7 (b) 8
(c) 16Cs (d) 2ocr (c) 9 (d) I0IEAMCET 20141
lBrTsAT 20r21 37. Ifa is an integer with 0 < ,t < I I then the minimum value
33. The number of ways four boys can be seated around a ofz!( t I - r)! is attained when a value ofn :
round tablc in four chairs ofdifferent colours is (a) ll (b) 5
(t) 24 (b) 12 (c) 7 (d) 9 [EAMCET 20141
(c\ 23 (d) 64 3t. The remainder obtained when l!+ 2! + 3! + ... + ll! is
lBrTsAT 20r21 divided by 12 is
34. Four boys picked up 30 mangoes. ln how many ways can (a) 9 (b) 8
they divide them, if all mangoes be indentical? (c) 7 (d) 6
(a) 33cr o) "c, lKarnataka CET 20151
(c) 5456 (d) None ofthe above 39. The number of four digit numbers fonned by using the
IBTTSAT 20131 digits 0, 2, 4, 5 and which are not divisible by 5, is
35. l0 men and 6 wometr are to be seated in a row so that no (r) I0 O) 8
two women sit together. The number ofways they can be (c) 6 (d) 4 IEAMCET 20lsl
seated is 40. The set ,{ has 4 elements and the set .8 has 5 elements then
the number ofinjective mappings that can be defrned fiom
(a) lll l0! .,
O) 6!5! AtoBis

(c) r0!9!
st
(o l#
--Lll (e) lzl4
(c) 60
(b)
(d)
72
120
lKarnatoka CET 20151
IEA\rcET 20131
46 Petmutation and Combinalion

JEE LEVEL EXERCISES

Srrelr Connro Answrn Tvprs 11. Numbers grater than 1000 but not geaterthan 21000 which
can be formed with the digits 0, 1, 2, 3 and 4 (repetition of
Level 1 digits is allowed). are
1. lf l5q,: I5c *r : I I :3 then the value ofris (a) 3s0 O) 375
(a) I (b) 2 (c) 450 (d) s76
(c) 3 (d) 4 12. Let A = {r | .r is a prime number and x < 30}. The number
2. How many six-digit numbers are there in which no digit of different rational numbers whose numerator and
is repeated, even digits appear at even places, odd digits denominator belong to ,4 is
appear at odd places and the number is divisible by 4? (s) e0 O) 180
(a) 3600 (b) 2700 (c) 9l (d) None ofthese
(c) 2160 (d) l,+40
s. t'4t ,D' , i."ou"[,o
a -'1='4*'.,n"o
3. The number ofways in which 5 rings can be wom on the
four fingers ofone hand is b c alb+c)
(a) 45 (b) 5c+ (a) I O)2
(c) 5a (d) None ofthese I
4. In how many ways can l0 true-false questions be (c) (d) None ofthese
;
replied? 14. In how many ways can 5 boys and 3 girls sit in a row so
({) 20 (b) 100 that no two girls are together?
(c) 512 (d) 1024 (a) 5! x3! O)?xsl
5. The number of 5-digit numbers that can be made using the (c) 6Pr x 5! 5Pj
(O x 3!
digits I and 2 and in which at least one digit is different,
15. The number of 4-digit numben that can be formed Aom
is
the digits 0, l, 2, 3, 4, 5, 6, 7 so that each number contains
(a) 30 (b) 3l
digit I is
(c) 32 (d) None ofthese
(s) 1225 (b) l2s2
6. ln a room, there are 12 bulbs of the same wattage, each
(c\ ts2z (d) 480
having a separate switch. The number ofways to light the
room with different amounts of illumination is 16. There are 'n' numbered seats around a round table. Total
(a) 122 I (b) 2t2 numberofways il
which a,(n, <n) persons can sit around
(c) 2r2- I (d) 122 the round table, is equal to

7. Total number of9-digit numbers that are divisible by 5, is

(e) "C,r O)'P,r
equal to
(c) ?r-r (d)'P*r
(a) tOE (b) 9. t07 17. Ifa denotes the number of permutations ofx + 2 things
(c) 9 to8 (d) l8.lo7 D the number ofpermutations ofx things
taken all at a time,
E, There are 3 candidates for a post and one is to be selected taken I I at a time and c the number of permutations of
by the votes of7 men. The numberofways in which votes - :
r I I things taken all at a time such that a l82bc, then
can be given is the value ofx is
(s) 7) (b) 37 (a) ls (b) 12
(c) 7Cr (d) None ofthese (c) l0 (d) 18
9. In a city, no two persons have identical set ofteeth and 18. We are required to form different words with the help of
there is no persons without a tooth. Also, no person has the letters of the word INTEGER. Let m I be the number
more than 32 teeth. lf we disregard the shape and size of of words in which 1 and N are never together and m2 be
tooth and consider only the positioning ofthe teeth, then the number of words which beiin with / and end with X.
the maximum population of the city is
(t) 232 (b) (32)2 t Then 4 is given by
m1
(c) 232 - I (d) 322
10, The number of3-digit odd numbers, that can be formed
(a) 42 (b) 30
by using the digits l, 2, 3,4,5 and 6 when the repetition
(c) 6 (d) l/30
is allowed, is 19. The total number of flags with three horizontal strips, in
(a) 60 (b) 108 order, that can be formed using 2 identical red, 2 identical
(c) 36 (d) 30 green and 2 identical white strips, is equal to
 Petmulation and Combination 47

(r) 4! (b) 3 x (41) 29. Three boys ofclass X,4 boys ofclass XI and 5 boys of
(c) 2x (4!) (d) None ofthese class XII, sit in a row. Total number ofways in which these
20, How many of the 900 three-digit numbers have at least boys can sit so that all the boys ofsame class sit together,
one even digit? is equal to
(N) 7'7s O) 875 (a) (3!F (4!) (5!) (b) (31) (4!F(5!)
(c) 450 (d) 750 (c) (3!) (a!) (s!) (d) (3!) (4!) (5!)'?
21. A s-digit number divisibte by 3 is to be formed using the 30. A library has 'a' copies of one book, '6' copies each of
digits 0, 1,2, 3,4 and 5 without repetition. The total number two books, 'c' copies each ofthree books, an single copy
of ways in which this can be done is of 'd' books. The total number of ways in which these
(r) 216 (b) 600 books can be arranged in a shelf, is equal to
(c) 240 (d) 3l2s (a+2b+3c+ d)l (a+b+<+d)l
(a) (b)
22. Number of one-one functions from ,4 to 8, if set I has ,n al(bt'12 1cr.13 at(b')2 kD3
elements and set I has z elements, is (z 2 rz)
(a+b+3c+d)t (a+2b+3c+ d)l
(a) n' (b)'P. (c) (d)
(c) n' (d) None ofthese (c !)3 a!(2b)l(3cll
sum ofall the numbers formed using the digits I, 3, 5,
23. The number of 6{igit numben that can be made with the @ The are smaller than 10,000 ifrepetition ofdigits is
digits 0, l, 2,3, 4 and 5 so that even digits occupy odd 7, 9 which
places, is not allowed, is (S being the sum ofsingle digit numbers)
(t) 24 (b) 36 (s) (28011)s (b) (28041)s
(c) 48 (d) None ofthese (c) (28121)s (d) (2els2)s
24. The number of numbers that are less than 1000 that can The sum ofall the numbers offour different digits that can
be formed using the digits 0, 1,2,3,4,5 no digit being be made by using the digits 0, 1,2 and 3 is
repeated in the formed number, is equal to (a) 266@ (b) 39996
(a) 130 (b) I3l (c) 38664 (d) None ofthese
(c) 156 (d) 155 The t 20 permutations ofMAHES are arranged in dictionary
25. The number of 4-digit numb€rs that can be made with order, as ifeach were an ordinary fiveletter word. The last
the digits I , 2, 3 , 4 and 5 in which at least two digits are letter ofthe 86th word in the list is
identical, is (L) A (b) Il
(r) 45-s! (b) 505 (c) s (d) E
(c) 600 (d) None ofthese 34. A group ofbasketball trainees consists of t2 pairs oftwin
@ Six people are going to sit in a row on a bench. and I I brothers. On the first day of taining all 24 players stand
are adjacent, C does not want lo sit adjacent to D. E'and in a circle in such a way that all pairs of twin brothers are
F can sit anywhere. Number of ways in which these six neighbours. Number ofways this can be done is
people can be seated, is (a) (12)! x 2rr (b) (l l)! x 2'2
(a) 200 O) 144 (c) (12)! x 2r: (d) (l l)! x 2r'
(c) 120 (d) s6 35, Twenty eight games were played in a football toumament
27. The number of arrangements of the letters of the word with each team playing once against each of the others.
SALOON, if the rwo O's do not come together, is Then the number of teams participated is
(a) 360 (b) 720 (a) 7 (b) 9
(c) 240 (d) 120 (c) 6 (d) 8
28. A round table conference is to be held between 20 delegates 36. There are l0 different books in a shelf. The number of
of20 countries. The number ofways they can b€ seated if ways in which 3 books can be selected so that exactly two
two particular delegates ofthem are consecutive is
(i) are always to sit together is ( l8)! (a) 60 (b) 56
(ii) never to sit together is 17x l8! (cl 42 (d) 36
Now, choose the correct option. 37. ln an election, number ofcandidates exceeds the number
(e) Only (i) is correct to be elected by 2. A man can vote in 56 ways. Then,the
(b) Only (ii) is correct number of candidates is
(c) Both (i) and (ii) are correct
(d) Both (i) and (ii) are wrong
(o) 5 (b) 6
(c) 7 (d) 8
#
Encircled questions a.e trickier/tougher than non-cncircled ones.
48 Permulalion and Combination

38. 5 Indian and 5 American couples meet at a party and shake 46. A candidate is required to answer 7 out of l0 questions.
hand. If no wife shakes hand with her own husband and which are divided into two groups, each containing 5
no Indian wife shakes hand with a male, then the number questions. He is not permitted to attempt mor€ than 4
ofhandshakes that takes place in the party is question fiom each group. Total number ofdifferent ways
(a) es O) l0 I in which the candidate can answer the papel is equal to
(c) 135 (d) 150 (a) 2 .5q.5ci (b) 2.5P3.5P4
39. For an examination, a candidate has to select 7 subjects (c) 5c3 5c4 (d) rPr.5P4
from 3 different groups,,l, I and C which contain 4, 5 and @ Acoins
person is permitted to select at least one and at most ,,
6 subjects, respectively. The number ofdifferent ways in from a collection of (2n + l) distinct coins. If the
which a candidate can make his selection, ifhe has to select total number ofways in whicb he can select coins is 255,
at least 2 subjects ftom each group. is then r equals
(a) 2500 (b) 2600 (a) 4 (b) 8
(c) 2700 (d) 2800 (c) 16 (d) 32
40. ln the l3 oicket players, 4 are bowlers. [n how many ways 48. n-similar balls each ofweight w when weighed in pairs, the
can a cricket teamof t I players in which at least 2 bowlers sum ofthe weights ofall the possible pairs is [20 and when
are included be formed? they are weighed in triplets, the sum ofthe weights comes
(a) 55 (b) 72 out to be 480 for all possible triplets. Then n is equal to
(c) 78 (d) None ofthese (a) 5 O) l0
41. To fi ll l2 vacancies. there are 25 candidates ofwhich 5 are
(c) 15 (d) 20
from scheduled caste. If3 ofthe vacancies are reserved 49. There are 2 identical white balls, 3 identical red balls and
for scheduled caste candidates while the rest are open to 4 green balls of different shades. The number ofways in
all, then the number ofways in which the selection can be which they can be arranged in a rou/ so that at least one
made is ball is separated from the balls of the same colour, is
(a) 5q x 2:ce (b) 22cn-sCt (e) 6 (7! - a!) (b) 7 (6! - 4!)
(c) 2:q + 5cr (d) None ofthese (c) 8! 5l (d) None of these
42. The number ofways in which l0 persons can go in two
50. I have tiled my square bathroom wall with congnrent
square tiles. All the tiles are red, except those along the
boats so that there may be 5 on each boat, supposing that
two diagonals, which are all blue. IfI used 12l blue tiles,
two particular persons will not go in the same boat is
then the number ofred tiles, I used is
(r)
" lr'ocr (b) 2(Ec4) (r) 900 (b) 1800
2' (c) 3600 (d) 7200
I
(c) Ccr) (d) None ofthese Level 2
1
Number of ways in which the letters of the word
43. A student is to answer l0 out of 13 questions in an
'ABBCABBC' can be arranged such that the word ABBC
examination such that he must choose at least 4 from the
does not appear in any word, is
first five questions. The number of choices available to
him is
(a) 2s6 (b) 391
(a) 140
(c) 361 (d) 498
O) 196
(c) 280 (d) 346 52. The number ofways in which l0 different diamonds can
be arranged to from a necklace is
44. Given I I points, ofwhich 5 lie on one circle, other than
(e) 181,140 O) 16 t400
these 5, no 4 lie on one circle. Then the maximum number
(c) 261460 (d) None ofthese
ofcircles that can be drawn so that each contains at least
three ofthe given points is
53. The number ofways in which fouf persons can be seated at
round table, so that all shall not have the same neighboun
(r) 216 (b) 156 a
in any two arrangements is
(c) 172 (d) None ofthese
(e) 24 (b) 6
45. There are 12 books on Algebra and Calculus in a library,
(c) 3 (d) 4
the books ofthe same subject being different. Ifthe number
of seleclions each of which consists of 3 books on each @ The number ofwords that can be made by writing down
the letters ofthe word CALCULATE such that each word
topic is the greatest then the number ofbooks ofAlgebra
sta{ts and ends with a consonant, is
and Calculus in the library are, respectively,
(a) 3 and9 O) 4and8 (8) 5(7!) ftt 3(7D

(c) 5 and 7 (d) 6 and 6 2"2

(c) 2(7!) (d) None ofthese
" Encircled questions are trickier/tougher than non-encircled ones
 Permutation and Combination 49

55. Total number ofwords that can be formed using all letters toumament is equal to 84. then total number ofparticipants
of the word 'BRIJESH' that neither begins with 'i" oor in the beginning was
ends with 'B' is equal to (a) l0 O) ls
(a) 3720 (b) 4920 (c) 12 (d) 14
(c) 3600 (d) 4800 65. A class contains 3 girls and four boys. Every Saturday
56. Total number of5digit numbers having all different digits five go on a picnic, a different group ofstudents is being
and divisible by 4 that can be formed using the digits sent each neek. During the picnic, each girl in the group
{1,3,2,6,8,9} is equal to is given a dotl by the accompanying teacher. All possible
(a) le2 (b) 32 groups of five have gone once, the total number of dolls
(c) Ils2 (d) 384 the girls have got is
57. Total number of6-digit numbers in which all the odd digits (a) 2l (b) 45
and only odd digits appear, is (c) 27 (d) 24
5 66. Two packs of52 cards are shuffled together. The number of
(a) 6 (b) 6!
,( ways in which a man can be dealt 26 cards so that he does
I not get two cards ofthe same suit and same denomination is
(d) None ofthese
O) *C:o
(c) -( (r\
2
6 s2
226
c26 .
(c1 2 .s2cro
'
(d) None ofthese
58. The number ofways that 8 beads of different colours be
string as a necklace is
67. Two teams are to play a series of5 matches between them.
2520 (b) 2880 A match ends in a win or a loss or a draw for a team. A
<r) number ofpeople forecast the result ofeach match and no
(c) 5040 (d) 4320
two people make the same forecast for the series ofmatches.
59. The number of ways in which 8 different flowers can be
The smallest group ofpeople in which one person forecasts
snung to form a gadand so that 4 panicular flowers are
correctly for all the matches will contain n people, where z is
never separates is
(a) 8l (b) 243
(r) 4! 4! (b)
fr
(c) 486 (d) None ofthese
Let ,4 be the set of 4-digit numbers cr a" a, ao where
@ ot>
(c) 288 (d) 298 a2> a3> a4lhen n(a) is equal to
60. Twenty persons are setting in a particular arrangement (a) t26 (b) 84
around a circular table. Tbree persons are to be selected for (c) 210 (d) None ofthese
leaders. The number ofways ofselection ofthree persons
such that no two were sitting adjacent to each otier is @ Atimeteacher takes 3 children from her class to the zoo at a
as often as she can, but she does not take the same
(r) 600 (b) 900 thee children to the zoo more than once. She finds that
(c) 800 (d) None ofthese she goes to the zoo 84 times more than a particular child
61. Among the 8! permutations of the digits l, 2, 3, ..., 8, goes to the zoo. The number ofchildren in her class is
consider those arrangements which have the following (a) 12 (b) l0
property-If we take any five consecutive positions, the (c) 60 (d) Non€ ofthese
product ofthe digits in these positions is divisible by 5. 70. Number of ways of selecting 2 numbers form integers
The number of such arrangements is equal to I to 100 iftheir sum is divisible by 5 is
(a) 7! (b)2.(7!) (a) 980 (b) 990
(c) 'Co (d) None ofthese (c) 1000 (d) None ofthese
62. Number of9-letter words that can be formed using all the 71. A man has 7 relatives. 4 of them are ladies and 3 are
letten of the word 'MEENANSHU' if alike letters are gentlemen. His wife has 7 relatives, 3 of them are ladies
never adjacent, is and 4 are gentlemen. The number ofways in which they
(a) .6!
12 (b) I I . 7! can invite a dinner party of 3 ladies and 3 gentlemen so that
(c) 13.6! (d) [Link].6! there are 3 of men's relatives and 3 of wife's relatives is

@ The number of 4-digit natural numbers such that the (r) 455 O) s65
product oftheir digits is 12, is (c) 485 (d) None ofthese
(t) 24 O) 36 72. n1 atdn2 are four digit numbers. Total number ofways
(c't 42 (d) 48 of forming n1 and n, so that 12 can be subtracted from z,
@ game
In a class toumament, irll panicipants were to play one
with the other. Two playen fell ill after having
without bonowing at any stage, is equal to
(e) (36) (s5)3 O) (45) (ss)l
played 3 games each. Iftotal number ofgames played in the (c) (55)a (d) None ofthese
+
Encircled questions are trickier/tougher than non-encircled ones
50 Pemutalion and Cofibihation

73, The number of different permutations of all the letters of (a) 3700 (b) 3720
the word 'PERMLITATION' such that any two consecutive (c) 4340 (d) None ofthese
letters inthe arrangement are neitherboth vowels nor both t3. Total number of divisors of 5880 is equal to
identical is (a) 48 (b) 24
(a) 63x6! x5! (b) 57x51 x5! (c) 96 (d) 16
(c) 33 x 6! x 5! (d) 7 x7l x5l E4. A bag contains 3 black, 4 white and 2 red balls, all the
74, The total number ofways ofselecting five letters from the balls being different. The number of selections ofat most
letters of the word INDEPENDENT is 6 balls containing balls ofall the colours is
(r) 72 (b) 64 @) azgt) 1b) 26 x 4!
(c) 56 (d) None of these (c) (26 - l) (4!) (d) None ofthese
75. I 16 people participated in a knockout tennis toumament. 85. [n an examination of9 papers, a candidate has to pass in
The players are paired up in the first round, the winners of more papers than the number ofpapen in which he fails
the fust rormd are paired up in the second round, and so in order to be successful. The number of ways in which
on till the hnal is played between two players. Ifafter any he can be unsuccessful is
round, there is odd number ofplayers, one player is given (a) 2ss (b) 2s6
a bye. i.e., he skips that round and plays the next round (c) 193 (d) 319
with the winners. The total number of matches played in
E6. Two players P, and P, plays a series of'2r' games. Each
the toumament is
game can result in either a win or loss for Pl, Total number
(a) ll5 (b) 53
of ways in which P, can win the series ofthese games, is
(c) 232 (d) 116
equal to
76. The maximum number ofpoints ofintersection of5 lines
and 4 circles is ''
@) !e2'-'z"c,l
2' "' b\
' ' !e2'-2.2"c^l
2'
(a) 60 (b) 72
(c) 62 (d) None ofthese
77. lf m parallel lines in a plane are intersected by a family
rc)
" 2 lrz"-':"c-t
" @t !e'-2.'1"c-t
2'
ofr parallel lines, then the number ofparallelograms that t7. A bag contains four Re.l coins, two 25 paise coins and
can be formed is five l0 paise coins. ln how many ways can an amount not
I I be taken out from the bag? Consider coins
(a) nn(n-r)(n-t) O) -nn (z-t)(r-t)
less than Re.
4 of the same denominations to be identical.
(c)
I 22 (d) None of these
(a) 7l (b) 72
4 (c) 73 (d) 80
7t. ABCD is a convex quadrilateral. 3, 4, 5 and 6 points are 8t. Total number ofways, in which 22 different books can be
marked on the sides AB,BC,CDafiDA, respectively. The given to 5 students, so that two students get 5 books each
number oftriangles with vertices on differenl sides is and all the remaining students get 4 books each, is equal
(a) 270 (b) 220 to
(c) 282 (d) 342 22! 22t
1., tD, ------.i-
79. The number ofkiangles that can be formed with l0 points 3!2!s!(4r)',
-----------
(3!)',2!5!4!
as vertices, z of them being collinear, is I 10. Then n is
(8) 3 (b) 4
221
(") :tZISt4!- (d) None ofthese
(c) 5 (d) 6
80. There are three coplanar parallel lines. If any p points t9. In how many ways can 8 different books be distributed
are taken on each of the lines, the maximum number of among 3 students ifeach receives at least 2 books?
triangles with vertices as these points is
(a) 3p2(p - l) + I O) 3p'(p - l) (a)
8! 8!
xl
(c) p2(4p -3) (d) None ofthese eD2 4t2! (3'!f 2t2l
8l . The interior angles ofa regular polygon measure I 5f each. 8! 7!
The number ofdiagonals of the polygon is (b) x -l
(a) 35 O) 44 e\2 zt2!' Gr2 ztzl
(c) 54 (d) 78 7t 8!
(c) X3
82. The number of groups that can be made from 5 different e\:212!' (3!)r 4!2!
green balls, 4 different blue balls and 3 different red balls,
ifat least I green and I blue ball arc to be included is
(d) None ofthese
 Pemutalion and Combination 51

90. The total number of ways of selecting six coins out of 20 (16)! (16)!
one rupee coins, l0 hfty paise coins and 7 twenty five paise (r) -- (b) +
coins is 8!(2r" (2 !)"
(o) 28 O) s6 (16)l
(c) 3'Cu (d) None ofthese (c) * (d) Nooe ofthese
(8 !)-
91. There are 3 copies each of4 different books. The number
of ways in which they can be arranged in a shelf is
lfi). Total number of ways in which n2 number of identical
balls can b€ put in x numbered boxes (1, 2, 3, ..., n) such
(a) t2t
-----= (b) t2l
that fth box contains at least i number ofballs is
(3!f (4r)'
,
(r)
2lt "c,, o) " 'q '
(c)
'' . (d) l2t.
" a!+n-2
(3rr4r (4!r 3! (c) ' cn-, (d) None ol thcse
92. The number of ways in which 12 books can be put in 3
t 01. In how many ways can Rs. 16 be divided into 4 persons
shelves, 4 on each, is
when none ofthem gets less than Rs. 3?
121
(a) --- (b) 12!
(a) 70 (b) 35
,
(4!) (3!X4!)' (c) 64 (d\ 192
l2t r02. Total number of divisors of 4E0. that are of the form
(c) --=- (d) None of these 4n + 2, n>_O, is equal to
(3!f 4r
(\) 2 (b) 3
93. The total number of ways in which 2n persons can be (c) 4 (d) None ofthese
divided into n couples is
r03. The total number of integral solutions for (x, y, z) such that
(r) 2nl (b)
2nl
xyz : 24 is
,!z!- (2')' (a) 36 (b) e0
(c) t20 (d) None ofthese
(c) : 2nl (d) None ofthese
'' nl(21\" tM. The number ofn-digit numbers which cootain the digits 2
and 7, but not the digits 0, l,8,9 is
94. The number ofways in which 35 apples can be distributed
amongst 3 boys so that each can have any number ofapples, is
(t) 6' -2.s'+ 4' (b) 61 -sr+4n
(e) 1332 O) 666
(c) 6' - 5' - 4r (d) None of these
(c) 333 (d) None ofthese 105, There are 4 letters are 4 directed envelopes. The number
of ways in which all the letters can be put in the wrong
95. Numberofways in which Rs. 18 can be distributedamongst
envelope is
four persons such that nobody receives less than Rs. 4 is
(a) 8 (b) 9
@) 4 (D24
(c) 16 (d) None ofthese
(c) 4! (d) None ofthese
106. Total number of tunction/: {1, 2, 3, 4, 5} --) tl,2,3,4,
96. The number ofways ofpartitioning the set {a,r,c,d} into 5) that arc onto and/(i) * i is equal to
one or more non-empty subsets is
(a) 9 (b\ 44
(a) 14 O) 15
(c) 16 (d) None ofthese
(c) 16 (d) 17
97. l5 identical balls have to be put in 5 different boxes. Each
Nuurnrcll Vllur Tvpr
box can contain any number ofballs. Total number ofways
ofputting the balls into boxes so that each box contains at l. There are r distinct while and n distinct black balls. lf
least 2 balls, is equal to the number of ways of ananging them in a row so that
(r) eq O)rocs neighbouring balls are of different colous is ll52 then
(c) 6c5 (d)rocu 'r'equals_.
98. Number ofways in which 5 distinct balls can be placed in 2. There are two sets of parallel lines, their equations being
3 different boxes ifno box remains empty is r cos a =_r,'sin a=p andx sin a y cos a: p; p= 1,2.3,
(a) 175 O) 150 ..., r and a € (0, /2). Ifthe number ofrectangles formed
(c) 210 (d) 210 by these two sets oflines is 225 then the value ofn is equal
99, Number ofways in which 16 constables can be assigned to
to patrol 8 villages such that 2 constables are assigned to 3, If 'P, = nP,*, and'C,='C,, then the value of I +r
each village, is IS
52 Permutalion and Combination

4. Number ofnumbers fiom I to 1000 which are divisible by 21. The number of ways in which all the letters of the word
60 but not by 24 is_. "COCONUT"' can be ananged such that at least one 'C'
5. Number of ways in which the letters of the word comes at odd place is _.
ABBCABBC can be arranged such that the word ABBC 22. The number of three-digit numbers try': abc such that
does not appear is any word. is _. aSD>c,isequalto_.
6. A class has three teachers, Mr. P, Ms. Q and Mrs. R and 23. Ifthree different dice are rolled, then the number ofways
six students,4,.B, C D, E and F. Number of ways in which in which the largest of three numbers is not 4 is equal to
they can be seated in a line of9 chairs, ifbetween any two
teachers there are exactly two students, is 24. Number of surjective functions / I -;
: .8, where set ,.{

7. Number ofselections of6 different letters that can be made contains 4 elements and set I contains 3 elements, is _.
fiom the words SUMAN and DIWA so that each selection 25. Number of ways of selection of 4 letters of the word
contains 3 letters from each word is _. PERFECT is
8, The number ofr-digit numben which consist ofthe digits
26. The position vector ofa point P is r =xi+yj+zk,where
I and only ifeach digit is to be used at leasl once, is equal
2
to 510 then n is eq ual to x,y,; e Nand a = i + j + k. If r. a: 10,thenthenumber
9. There are 720 permutations ofthe digits l,2,3,4,5 and of possible position ofP is
6. Suppose that these permutations are arranged from 27, The number of ways in which a committee of 5 can be
smallest to largest numerical values, beginning fiom I 2 chosen from l0 candidates so as to exclude the youngest
3 4 5 6 and ending with 6 5 4 3 2 l. Then the digit in unit if it includes the oldest. is
place of number at 267th position ir_. 28. The number ofways in which eightdigit number can be
10. A man has 3 friends. The number ofways he can invite formed using the digits fiom I to 9 without repetition such
one friend everyday for dimer on 6 successive nights so that first four places ofthe number are in increasing order
that no friend is invited more than 3 times is_. and last four places are in decreasing order is _.

lI. The number ofways in which 3 distinct numbers can be 29. The number of ways in which the letters of word
selected from the set {31, 32, 33, ... , 310) so that they form MEDICAL can be arranged such that.4 and Eare together
a G.P. is
but all the vowels never come together ir _.

t2, Ifthe number ofways in which a different things can be 30. Number of non-empty subsets of { |,2,3, ..., l2} having
the property that sum ofthe largest and smallest element
distributed among n persons so that at least on€ person
does not get anything is 232. Then n is equal to_. is 13 is _.
13. If20% ofthree elements subsets ofth e set A: la b a2, .. ., q ) Mur-uplr Connrcr AHswrns Tvpr
contain a,. then value n is_.
14. The number of arrangements of the letters of the word t. tf p= n (n2 -t)@2 -qOt2 -\... (n2 100),r€ lthen
FORTUNE such that the order of vowels is unaltered is P is always divi:ible by
x, the order of consonants is unaltered is y and the order
(a) 2! 3! 4! 5! 6! (b) (5!f
(c) (r0!)2 (d) l0! ll!
of vowels and consonants is unaltered is ,, then I 2. Number of ways in which the letters of the word 'BULBUL'
equals 2
can be arranged in a line in a definite order is also equal to the
15. Number ofdivisors of5400 which are divisible by 6 but (e) number of ways in which 2 alike apples and 4 alike
not by 9 is equal to_. mangoes can be distributed to 3 childrcn so that each
16. The number of triplets (r, "y, of positive integers, child receives any number of fruits.
satisfying 2i + 2j + 2' = 2336
")
is-. (b) number of ways in which 6 different books can be
17. The number ofonto functions which are non-decreasing tied up into 3 bundles, ifeach bundle is to have equal
from A = itl,2,3,4,5) to a: {7, 8.9} is_. number ofbooks.

lE. The number offive-lener words formed with the letters of (c) coefficient ofly2l
in the expansion of(r +y + z)6.
(d) number of ways in which 6 different prizes can be
the word CALCULUS is _. distributed equally to thee children.
19. Let X = l, 2, 3, 4, 5). Number of bijective mappings,
/: X, Xsuch that .f (l): I and/Q) * 2, is _. 3. The number ofways ofarranging the lefiers AAAAA, BBB,
CCC, D, EE and F in a row ifthe all Cs are separated fiom
20. Number ofways in which 3 boys and 3 girls can be seated in
one another is:
a row where two particular girls do not want to sit adjacent
121
to a panicular boy is _. (") "c,
5!3!2!
 Pefinulation and Combination 53

l3! 10. Suppose a lot contains 2z objects ofwhich z are identical.

(b) The number of ways to select z objects out of these 2n
5 ! 3r3t 2!
objects must be
l4! (a) 2"
(c)
3l3t2t (b) (h*rco + 2*lc t+ ..... +Ntc,)tt2
l5! 13! t2! (c) the number ofpossible subsets |ar,a.7,...,a,|
(d) B
C" (d) none ofthese
5t(3t)2 2! 5!3!2! 5 !3!
11. The number ofselections of4 letters taken Aom the word
4. Ten persons numbered 1,2,..., l0 playtoumament,
a chess 'COLLEGE' must b€
each player playing against every other player exactly one (a) 18
game. It is known that no game ends in a draw. Let w,,
o) 22
w2, ..., w16 be the number of games won by players 1,2, (c) coefficient [Link] in the expansion of(l +r)l ( I +r+l)2
3, ..., l0 respectively ara,d It,1r,..., /,0 be the number of (d) coefficient [Link] in the expansion of( I +x)2 ( I +x+;)l
games lost by the players 1, 2, ..., 10, respectively. Then 12. The number ofways in which l0 studens can be divided
(e) !w,=!/-=+5 (b) wi+li=9 into three teams, one containing 4 and others 3 each, is
(c) > l.r/r2 = 8l +: /r2 (d) > lr,'? : I /i
5. Number of ways in which 200 people can be divided into
(r)
" ;9!
4!3!3!
o) 2roo
100 couples is
(2oo'l (c) roc4 5c2 (d)
' ' --!ol I
! 613131 2
(r) (b)1.3 5....199
2ro 0 00)"r---r------L Llxrro CorpnsrEilsroN TYPE

(c) rr0r)rr02l r200.l ,r, !200J' For Questions 1 to 3

" \ 2 /\ 2 / |\ 2 / " (loo)!
There are 8 events that can be scheduled in a week, then
6. Kanchan has l0 friends among whom two are married to l. The total number of ways in which the events can be
each other. She wishes to invite 5 ofthem for a party. lfthe scheduled is
married couple refuses to aftend sepamtely then the number (a) 87 O) 7t
ofdifferent ways in which she can invite five friends is (c) 7! (d) 8
(a) Ecs o) 2x 8q 2. The total number ofways thit the schedule has at least one
(c) loc5 - 2 x 8C4 (d) None ofrhese event in each day ofthe week is
(s) 28 x 5040 (b) 7! x 8!
7. Number of ways of selecting three integers from { I, 2, 3.
(c) 7! x t5! (d) None ofthese
... , z) if thet sum is divisible by 3 is 3. The total number ofways that these 8 events are scheduled
(r) 3('i3cj) + (n/3)3 if n: 3k, k e N on exactly 6 days of a week is
O) 2(- rv3q) + ((z + 2)i3cr) + ((r - t)t3)2(n + 2), (a) 210 x 6! (b) 7t x 266
(c) 56 x 7! (d) 210 x 7!
if n= 3k+ l,ke N
(c) 2(* )/3q) + (r + 2v3
q) For Questions 4 to 6
f
+ ((n - t)t3)2( + 2),
rf n:3k+2,ke N There are m seats in the first row ofa theatre, ofwhich n are to
be occupied.
(d) independent ofn
4. The number of ways of ananging r persons if no two
t. All the five-digit numbers in which each successive digit persons sit side by side is
exceeds its predecessor are arranged in the increasing
(n-n +t)l (m-n +t)l
order. The [05th number does not contain the digit (a) (b)
(a) I (b) 3 (n4n +t)l (m-2n)r
(c) 4 (d) 5 (m-n +r)r (m-n +2)l
(c) (d)
9. The number of ways ofselecting two I x I squares from (m-2n +l)r. (n-zn -t)l
a chess board such that they 5. Ifn ofways ofarranging n persons
is even, then the number
(a) have a common vertex is 98 such that each penon has exactly one neighbour is
(b) have a common side is I 12 (a) ("p"tz)('-tp,/) (b) ('p,)('-".tp,/11
(c) neither have a common vertex nor have a common (c) ("Pd(' '.tP) (d) None ofthese
side is 1806
6. The number of ways of arranging n persons, if out of any
(d) none ofthese
two seats located symmetrically about the middle of the
row, at least one is empty, is
54 Perrnulation and Combination

(a) ('t2c,r(2') | (b) ^'2P, (c) Tbree ladies have each brought thet (r) € (50, I l0)
(c) (^12P^)(2'-t) @) (12P,)(2',) one child for admission to a school.
The pdncipal wants to interview
For Questions 7 to 9 the six persons oDe by oBe subj€ct
Five balls are to be placed in three boxes so that no box remains to the condition that no mother is
interviewed before her child. The
empty. Also, each box can hold all the five balls.
number ofways in which interviews
7. Number ofways ifballs are different but boxes are identical is can be arranged is
(a) 30 (b) 25
(d) The digits 4, 5. 6, 7 and 8 are written (s) e (40, 70)
(c) 2l (d) 35
in every possible order. The number
8. Number ofways ifballs and boxes are identical is ofnumbers greater than 56000 is
(a) 3 O)l
(c) 2 (d) none oflhese
4. LetS: { l, 2, 3, 4, 5, 6, 7, 8}. Tv,/o subsets P and Q of .lare
randomly constructed (P and O need not be different).
9. Number ofways ifballs as well as boxes are identical but
Match the condition for the number ofways ofconstructing
boxes are kept in a row is
P and Q given List / with the number given in List 11and then
(a) l0 O) ls
(c) 20 (d) choose the correct option from amongst the given codes.
6
List I List ll
Marnrx Mnrcx Tvpr (p) n(P\>n(Q) (l) 65640

t, Consider the convex polygon which has 35 diagonals. 28 + t6c,

(q) r(Pu0)=8andr(Pn0)=0 (2)
Now, match the following columns. )
Column I Column II (r) n(P v Q)= 6 a neetQ)=2 (3) 256

(a) Number oftriangles joining the vertices (p) 210 (s) An onto mapping exists fiom P to p (4) 6120
ofthe polygon is
Codes
(b) Number of points of intersections (q) t20 (p) (q) (r) G)
of diagonals which lie inside the (r) (a) (3) (2) (l)
polygon is
(b) (2) (l) (4) (3)
(c) Number of triangles irl which exactly (r) l0 (c) (3) (l) (a) (2)
one side is common with that of (d) (2) (3) (4) (2)
polygon is
5. Consider all possible permutations of the letters of the
(d) Number of triangles in which exactly (s) 60
WOrd INDIANOIL.
two sidcs are common with that of
Now, match the following lists and then choose the corr€ct
polygon is
option from amongst the given codes.
2 . A function f is defined as f : lar. a1, q3, a4, qs, a6l ) List I l,ist ll
(p) The number of permutations which (l) 28866
{b1, b,,63}. Now, match the following columns.
contair the word INDIA is
Column I Column Il (q) The numbcr of permutations which t2) t374
(a) Number of surjective functions (p) is divisible bv 9 conlain the word OIL is
(0 The number of permutations which (3) lt60
(b) Number of functions in which (c) is divisible by 5
contains neither the word OIL no. the
.fla), bi word INDIA is
(c) Number of invenible fu nctions (r) is divisible bv 4 (s) The number of pelmutations which (4) I20
(d) contains at lcasr one of the words OIL
Number of many-one functions (s) is divisible by 3
and INDIA is
3. Match the following columls Codes
Column I Column Il (P) (q) (r) G)
(a) The number of live-digit numbers (p) >70 (a) (4) (3) (l) (2)
having the product ofdigits 20 is (b) (2) (l) (4) (3)
(b) A closet has 5 pain of shoes. The (q) <60 (c) (3) (l) (4) (2)
number ofways ir which 4 shoes can (d) (2) (3) (4) (2)
be drawn fiom it such that therc will
be no complete pair is
 Petmutation ancl Cornbination 55

JEE ARCHIVES

JEE (Mnrx) 2021 Qurmols (Ar-r- Foun Srssroxs) 8. Ifthe sides,48, BC,andCA of a triangle lBC have 3,5
and 6 interior points respectively, then the total number
Single Comct Ansrver Type of triangles that can be constructed using these points as
l. A scientific comnittee is to be formed from 6 Indian and vertices, is equal to:
8 foreigners, which includes at least 2 Indians and double (r) 364 (b) 240
lhe number of foreigners as Indians. Then the number of (c) 333 (d) 360
ways the committee can be formed is: 9. The sum ofall4-digit distinct numbers that can be formed
(a) l62s (b) 575 with the digits l, 2, 2 and 3 is:
(c) 560 (d) l0s0 (t) 26664 (b) t2269
2. The total number ofpositive integral solutions (x,12) such 122234
(c) (d) 222@
that xyz: 24 is: t0. If ? : ?* I and'C, :'C, -,, then the value of r is equal to
(r) 36 (bl 24 (r) 3 O)2
(c) 45 (d) 30 (c) I (Or
3. Let r denote the total number of one-one functions from ll. Let Pf, P2, ..., P5 be 15 points on a circle. The number
a set I with 3 elements to a set ,B with 5 elements and y of distinct triangles formed by points P,, Pr, P* such that
denote the total number ofone-one functions from the set i+J+t*15,is
I
,4 to the set x 8. Then: (e) 455 (b) 419
(t) y -- 273x (b) 2y: 9tx (c) l2 (d) M3
(c) y : 9lr (d) 2y : 273x
Numerical Value Type
4. The numberofseven digit integers with sum ofthe digits
equal to l0 and formed by using the digits l, 2 and 3 l. The numberoftimes the digit 3 witl be wriften when listing

only is: lhe integers from I to 1000 is _.

(t) 42 (b) 82 2. The missing value in the following figure is_.
(c) 77 (d) 3s
5. A nalural number has prime factorization given by
n = 2'!5', where y and z are such that.}, + : 5 and
y-t + at = I,
6
-y
t ,. Th"n
"
the number of odd divisors of
nx
z, including l, is:
(r) ll (b)6
\
\
+t'
7
(c) 6x (d) 12
6. Consider a rectan gle ABCD havng 5, 7, 6, 9 points in the
interior ofthe I ine se gr/Inents A B , CD, BC, D,4 respectively.
3. The students St, S,, ...., S,o are to be divided into 3 groups
,,1, B and C such that each group has at least one student and
Let d be the number of triangles having these points
from different sides as vertices and p be the number of the group C has at most 3 students. Then the total number

quadrilaterals having these points ftom different sides as of possibilities of forming such groups is _.
vertices. Then (B- cr) is equal lo: 4. The total number of numbers, lying between 100 and
(r) 79s (b) 1173 I 000 that can be formed with the digits l, 2, 3, 4, 5, if the
1890
(c) (d) 717 repetition ofdigits is not allowed and numbers are divisible
7. Team 'l' consists of7 boys and r girls and Team'8' has by either 3 or 5, is _.
4 boys and 6 girls. lf a total of 52 single matches can be
5. The total number of two digit number'r', such that 3'+
arranged between these two teams when a boy plays against
7" is a multiple of 10, is
a boy and a girl plays against a girl, then z is equal to:
(r) 5 (b) 2 6. The total number of 4-digit numbers whose greatest
(c) 4 (d) 6 common divisor with l8 is 3, is
SO Permutation and Combination

7. There are 15 players in a cricket tearD, out of which 6 21. All the an"angements, with or without meaning, of the word
are bowlers, 7 are batsmen and 2 are wicketkeepers. The FARMER are written excluding any word that has two -R

number of ways, a team of t I players be selected fiom appearing together. The arrangements are listed serially
them so as to include at least 4 bowlers,5 batsmen and I in the alphabetic order as in the English dictionary. Then
wicketkeeper, is_. the serial number of the word FARMER in this tist is

[Link] I
E. Fort€ =S'*.
a(d + l) (d + 2\ ...(a + 201 Eod + k JEE (Aovrncro) Quesnoxs (2OIO-2O271
ll4 + 115
where d > 0. Then rhe value of l00f l' [Link] Single Conect Answer Type
ro \ 1t, ) l. Let,t:{.1,2,3,4\. The total number of unordered pairs
ofdisjoint subsets of
^lis equal to
9. The sum ofall the elemeDts in the set {n € {1,2,..., 100}l (a) 2s O) 34
H.C.F. of r and 2(X0 is I ) is equal to _. (c) 42 (d) 4l (IITJEE, 2010)
10. Let,4 : {0, l, 2, 3, 4, 5. 6, 7}. Then the number of bUective 2. Six cards and six envelopes are numbered 1,2, 3, 4, 5,
tunctions/:l -Jl such that /(1) + /(2):3 -/(3) is equal 6 and cards are to be placed in envelopes so that each
to _. envelope contains exactly one card and no card is placed
ll. Ifthe digits are not allowed to repeat in any number formed in the envelope bearing the same number and moreover the

by using the digits 0, 2, 4, 6, 8, then the number of all card numbered I is always placed in envelope numbered
2. Then the number ofways it can be done is
numbeE gr€ater than 10,000 is equal to _. (r) 264
12. There are 5 students in class 10, 6 students in class I I and
(b) 265
8 students in class 12. Ifthe number ofways, in which l0
(c) 53 (dl 67
(JEE Advrnced 2014)
students can be selected fiom them so as to include at least
2 students fiom each class and at most 5 students &om the 3. A debate club consists of 6 gids and 4 boys. A team of
lotal I I students ofclass l0 and I I is 100 i, then tis equal 4 members is to be selected fiom this club including the
selection ofa captain (from among these 4 members) for
to _. the team. If the team has to include at most one boy, then
13. Let.t: t\\,2,3,4,5,6,7|. Then the number ofpossible
the number of ways ofselecting the team is
functions/: S -+ S suchthatf(m . n) --f(n) f(n) for every
380
-

(a) (b) 320

€ Sandm' r
l,,, n € Sisequal to_.
14. Let n be a non-negative integer. Then the number of
(c) 260 (d) e5
(JEE Advlnced 2016)
divisors ofthe form "4n + l " ofthe number (10)10. (l I )rl
4. LetS:{1,2,3,...,9}.Fort=1,2,...,5, let /Vr be the
. ( l3)r3 is equal to_. number of subsets of S, each containing five elements
15. If rPr +2.2P2+3.3Pr+ ... + 15.r5Prs:qP, out of which exactly k are odd. Then Nr + N2 + N1 + A/4
",
0 !0SsS l, tbene*'C. . is equal to
16, The number of three-digit even numbers, formed by the (a) 125 (b) 252
digits 0. 1, 3,4, 6. 7 ifthe repetition ofdigits is not allowed, (c) 210 (d) 126
it (JEE Advanced 2017)
17. A number is called a palindrome if it reads the same
Ittuttiple Correct Answerc Type
backward as well as forward. For example, 285582 is a
six-digit patindrome. The number of six-digit palindromes, l. Lets,: \(i,j,k):i,j,ke {1,2,..., l0}},
which are divisible by 55, is Sz: {(r,;):1<i<j+Z< l0,r,je {1,2, ..., l0} },
-. s: : {(ij, e, 0 : I < i <j < k < I, i,j, k,/e {1, 2, ..., l0}}and
18, Let S = { l, 2, 3, 4, 5, 6, 9}. Then the number of elements in
the set f = {Ae S i A * 0 ardthe sum of all the elements So: lQ, j, k, t): i,j, tand / are distinct elements in {1,2,
ofl is not a multipte of3 | is ..., l0) l.
Ifthe total number of elements in the set S. is r, r = l, 2, 3,
19. The number ofsix letter words (with or without meaning),
4, then which ofthe following statements h (arc) True ?
formed using all the letten ofthe word 'VOWELS', so that
1000
(e) z, = (b) nz=4
all the consonants n€ver come together, is _.
20. The number of4-digit numben which are neither multiple
(cl n1=220 "12?= czo
@)
of 7 nor multiple of 3 is _. (JEE Advanced 202t)
 Pomutation and Combination 57

Linked Comprehension Type 2. Let n > 2 be an nteger. Take r distinct points on a circle
For Problems I rnd 2 andjoin each pair of points by a line segment. Color the
tine segmentjoining every pair ofadjacent points by blue
Let z denote the number ofall rdigit positive intege$ formed by
the digits 0, I or both such that no consecutive digits in them are 0.
and the rest by red. If the number of red and blue line
segments are equal, then the yalue of ll is _.
Let ,n= the number of such n-digit integers ending with digit I
(JEE Advanced 2014)
and co= the number ofsuch z-digit integers ending with digit 0.
(IlT JEE 3. Lel n, < n2< n3 < no < z5 be positive integers such that n I
2012)
+ n2+ n3+ n4+ n5:20. Then the number ofsuch distinct
l. The value ofbu is
arrangements (r1, n2, r\, n4, n5) is _.
(r) 7 O)8 (JEE Advsnced 2014)
(c) 9 (d) tl
4, Let n be the number ofways in which 5 boys and 5 girls
2. Wlich of the following is conect?
can stand in a queue in such a way that all the girls stand
(t) an- qrc+ ats O) cl7 * cl6 + ct5 consecutively in the queue. Let m be the number ofways
(c, b.n * bft+ crc (d) arr=crr+bru
in which 5 boys and 5 girls can stand in a queue in such
Itlatrix Match Type a way that exactly four girls stand consecutively in the

l. In a high school, a committee has to be formed fiom a queue. Then the value of a is
group of 6 boys Mv My My Mt, M, Mu and 5 girls G,, ' 1rr" norroced 2ol5)
G2, Gb G4, G5.
5. Words of length l0 are formed using the letters l, B, C, D,
(i) Let dr be the lotal number of ways in which the
E. F. G, H, I. J. Let r be the number ofsuch words where
committee can be formed such that the committeehas
5 members, having exactly 3 boys and 2 girls. no letter is repeatedt and let y be the numberofsuch words
(ii) Let 02 be the total number of ways in which the where exactly one letter is repeated twice and no other
committee can be formed such that the committee I
has at least 2 members, and having an equal number '
letter is reDeated. Then,
9r=
ofboys and girls. (.lre lorrn."o zotz)
(iii) Let ol be the total number of ways in which the 6. The number of5 digit numbers which are divisible by 4,
committee can be formed such that the committee has with digits from the set l.1.2,3,4.5) and fie repetition
5 members, al least 2 ofthem being girls.
of digits is allowed, i" _. (JEE Adyanced 20IE)
(iv) Let oa be the total number of ways in which the
committee can be formed such that the commineehas 7. Let Xbe a set with exactly 5 elements and ybe a set with
4 members, having at least 2 girls and such that both exactly 7 elements. If,4 is the number ofone-one functions
M, and G1 are NOT in the committee together. from Xto I/ and I is the number of onto function form y

List [Link] ll to X. then the value of ' -

a) rs
-f t0
I
(i) The value of a, is (p) t36 5!
(JEE Advanced 20lt)
ii) (q) I89
( The value of a" is
t. Five persons A, B, C, D ar,d E are seated in a circular
iii) arrangement. Ifeach of them is given a -.
( The value of is (r) t92
or3 hat ofone ofthe
(iv) The vahe of d. is (s) 100 three colours red, blue and green, then the number of
(r) 381 ways of disebuting the hats such that the person seated
(u) 461
in adjacent seats get differenl coloured hats is_.
The correct option is
(JEE Advanced 2019)
(a) (i) -+ (s); (ii) -+ (u); (iii) --l (q); (iv) -+ (p) 9. An engineer is required to visit a factory for exactly four
(b) (i) -+ (p); (ii) -+ (s); (iii) -+ (q); (iv) -+ (r) days during the first 15 days of every month and it is
(c) (i) -+ (s); (ii) + (u); (iii) -+ (t); (iv) --) (q) mandatory that no two visits take place on consecutive
(d) (i) + (s); (ii) -+ (q); (iii) -+ (r); (iv) -+ (p) days. Then the number ofall possible ways in which such
visits to the factory can be made by the engineer during
(JEE Advanced 2018)
Numerical Value Type
l-15 June 2021 it _. (JEE Advanced 2020)
10. In a hotel, four rooms are available. Six persons are to be
l. Consider the set of eight vectors ,/ + + ci:
= 1ai ti accommodated in these four rooms in such a way that each
a, b, c e l-l,l)|. Three non-coplanar vectors can be ofthese rooms contains at least one person and at most two
chosen from V in 2P ways. Then p is _. persons. Then the number of all possible ways in which
(JEE Advanced 2013) this can be done is _. (JEE Advanced 2020)
58 Petmutalion and Combinalion

ANSWERS

Coucepr [Link] Exrncrsr 1 NCERT LEVEL EXERCISE

I 9l 2. 12 t. l2 2. r0
3 4s 4. 301 x 29r 3. 320 4.'1560
5 t62 6. 20 s. roo 6.
;,2.
7 286 E. 9',
I . (i) 75 (ii) 2s20 10.3 7. (i) 138600. (ii) 16800, (iii) 1646400, (iv) 12600
lt .49 108
8. 9. 4536
r0. 48 ll. (i)3. (ii) 4
Corcrpr Appr-rcenor Exrncrsr 2 t2. 40320 13. 17

t4. 6 15. 2000

l. 9 2.210
16. 3960 17. 200
3. lo8 4. 4P4x4P4
5. 120 6. 2880 tE. 35

7. I380,46007 8. 151200
1630, t9. 270725. (i) 2860. (ii) r31, (iii) 49s.
9. NAAIG 10. 1440 (iv):6c:r6c2 1v)4 x llc.
ll. 8! 20. 8 21. 907200
12. (a)7 | x 6!, (b) 2 x (6!)2, (c) (12)! ?! x 6! 22. 50400 23. 4C1 x 48Cl
13. (a) 2 x l8!, (b) 17 x 18! 24. 22Cr+ 2)crc 25. 360
14. l2tx2 15. 288
16. 2 x (16!)2 t7. Uq
STATE LEVEL EXERCISES

Corcrpr AppucmoN ExERcrsE 3 Slttclr Conntcr Auswen Tvpr

t. 3 2. t43/4025 l.
(c) 2.( c 3. (d) 4. (c) b
3.'778320 4. 40 6.
(c) 7. (c 8. (a) e.(b) 10. ( c
ll. (c) 12. ( c t3. (d) r4. (b) ls. (d
5.420 o. fnorr 16. (c) t7. (. a 18. (d) 19. (b) 20. ( c
2
7, 2.2oc2 E. (' r)q, i)x/! 21. (c) 22. (a 23. (c) 24. (a) 25. ( c
26. (c) 27. (c 28. (b) 29. (d)
9. 2702 10.86400
ll. 8x5! 12. 126 Ancxrvrs
13.30 14.210
15.226 16. l5
l. (b) 2. (a 3. (a) 4. (a) 5. (c)
6. (c) 7. (c 8. (a) 9. (b) 10. (b)
17.8 18. 1728 I l. (c) 12. (c 13. (d) 14. (a) ls. (b)
19.
(n+2)(n+l) t6. (d) 17. (a r8. (a) 19. (c) 20. (a)
5"1 20
2 21. (a) 22. (c 23. (b) 24. (cl 2s. (b)
Concrpr AprucanoN ExERcrsE 4
26. (a) 27. {b 28. (b) 2e. (b) 30. (c)
3r. (b) 32. (c 33. (a) 34. (c) 3s. (d)
t. 24 2.3 36. (c) 37. (b 38. (d) 3e. (b) 40. (d)
3. 3720 4. (p+
JEE LEVEL EXERCISES
Corcrpr ApplrcruoN ExERcrsE 5
t. z. t2c2x (26 Srnele Connrcr Alswen Tvpr
25 -2)
3. 36 4. trC, Level 1
5. 55 6. ,oq l. (c) 2. (d) 3. (a) 4. (d) 5. (a)
7. 165 8. 20 6.
(c) 7. (d) E. (b) 9. (c) r0. (b)
9. llcs 6 x l3cs 10. r2 r5 ll. (b) 2. (c) 13. (a) 14. (c) ls. (d)
ll. 2400 16. (b) 7. (b) 18. (b) 19. (a) 20. (a)
 Permutation and Combination 59

21. (a) 22. (b) 23. (a 24. (b) 25. b Mnrnrx Mrrcr Tvpr
26. (b) 27. (c') 28. ( b 29. (a) 30. a
3r. (b) 32. (c) 33. (d) 34. (b) 35. d l. (a) - (q); (b) - (p); (c) - (s); (d) - G)
36. (b) 37. (b) 38. ( c) 39. (c) 40. c 2. (a) - (p, q, 1 s); (b) - (p, 1 s); (c) - (q, r, s); (d) - (s)
41. (a) 42. (b) 43. ( a) 44. (b) 45 d 3. (a) - (q, s); (b) - (p, r);(c) (p, r); (d) - (p, r)
46. (al 47. (a) 48. ( b) 49. (a\ 50. c 4. (d)
s. (a)
Level 2
5t. (c) 52 (a) 53. (c) 54. (a) 55. a) JEE ARCHIVES
56. (a) s7. (a) s8. (a) 59. (c) 60. c)
6r. (b) 62. (b) 63. (b) 64. (b) 65. b) JEE (Mrn)
66. (a) 67. (b) 6E. (c) 69. (b) 70. b)
71. (c) 72. b 73. (b) 74. (a) 75. a) Single Correct Answer Type
76. (c) '7'7 il 78. (d) 79. c 80. c) l. (a) 2. (d) 3. (b) 4. (c) s.
(d)
81. (c) 82. b 83. (a) 8,1. a E5. b) 6. (d) 7. (c) 8. (c) 9. (a) 10. (b)
86. (b) 87. c t8. (a) 89. t 90. a) lr. (d)
91. (a) 92. 93. (c) 94. b 95. d)
96. (b) 97. a eE. (b) ee. (b) 100. (c) NumericaI Value Type
l0r. (b) I 02. c I 03. (c) 104. (a) 105. (b) r. (300) 2. (4) 3. (31650) 4. (32) s. (45)
106. (b) 6. (1000\ 7. (777\ r. (9) 9. (125r) r0. (720)
rl. (96) 12. (238) 13. (490) t4. (924\ rs. (136)
Nuurucal Vrr-ur Tvpr 16. (52) 17. ( 100) rE. (80) 19. (576) 20. (5143)
21. (7',7)
1.(4) 2.(6) 3. (s) 4. (8)
5. (36r) 6. ( 12960) 7. (641 t. (9)
JEE (Aovancro)
9. (6) r0. (510) l r. (20) 12. (4)
13. (r5) r4. (30) rs. (9) 16. (6) Single Correct Answer Type
r7. (6) rE. (r l l0) r9. ( I8) 20. (288)
2r. ( r 080) 22. (285) 23. (17e) 24. (36) l. (d) 2. (c) 3. (a) 4. (d)

zs. (2s) 26. (36) 27. (te6) 28. (630) Muttiple Conect Answers Type
29. (960) 30. ( 1365)
l. (a). (b). (d)

Mumplr Connrcr Auswens TYpr Linked Comprehension Type

l. a). (b (c). (d) 2. (a), (c), (d) l. (b) 2. (a)
3. a), (d a. (a), (b), (d)
5. a), (b c 6. (b), (c) Matrix Match Type
1 a), (b c E. (a), (b), (c), (d) l. (c)
9. a), (b c t0. (a), (b), (c)
!. a). (c 12. (b). (c) NumericaI Value Type
l. (5) 2. (5) 3. (7) 4. (s) s. (5)
Lrxxro CoNpneuENsroN TYPE 6. (625) 7. (l le) E. (30.00) 9. (495.00)
10. ( r080.00)
l. (b) 2. (a\ 3. (b) .t (c) 5. (a)
6.(d) 7. (b) 8.(c) 9 (d)
Testimonials
When ljoined Shatru sir's class, ln the beginning I wasn't too sure ofwhat my shortcomings were in Maths. sir not only identified them but
also help me fix them. Allthistook quite some time, but sir was always there to constantly motivate me. He was more like a friend than a
teacher and this made the process oflearning very interesting. The variety of problems he provided me with was commendable. His efforts
helped me develop speed and accuracy. He also often discussed with me the different strategies during an exam, and as a result I was able
to choosethe best one for mysell
-Avinandan Bose, WBJEE Rank fl 1, JEE-Adv Rank # 104, llT Kanpur

always dreamt of being in the best institute in the best branch. And here I am today pursuing Computer Science (BTech) in llT-Bombay. A
I

large reason for this dream coming true is Shatru 5ir. From oay one of his coaching he was very interactive with the class. His motive is to
make every student understand before moving on. This helped me cover a lot in the coaching itsell And in case of doubts he was always
available for clarifying them. He used to keep the atmosphere joyous while teaching which clearly showed his passion towards teaching.
This also enabled everyone to be involved in the class lecture. His friendly behavior enables the students to interact more in class and I used
to enjoy attending his classes. Until the very last day before the exams he kept us motivated by giving us ideas on how to approach the
papers and not to panic under any circumstance. lt were his vital inputs because of which I can pursue my dream today. I am very thankful
to him for all he has done and wish him allthe best for his futu re endeavors.
-NavneetAgarwal, llT-Bombay (computer science)

It was in class 11when lAaronyak Dewanjigot enrolled in Shatrudha sir's classes. He is a very mo6vationaland persistent teacher, and was
not perturbed by teaching virtually. ln fact, I never noticed any di_erence between Sir's o_ine and online classes, I even felt I was sitting in a
classroom sometimes. Sir would encourage each and everyone in the class to participate and speak up and he gave individual ca re to each
student's strength and weaknesses. He made sure that every minute ofthose Zoom meetings was put to use, and his daily assignments
were very helpful. When JEE Advanced got postponed Sir took extra classes and made sure that all his students were not forgetting the
concept. My mother frequently told me that I am not llT material. (And I agreed.) she also used to callShatrudha sir on the phone and told
him about how I didn't want to study and always played video games. Sir was always very patient in hearing out. Sir convinced my mother
that I had the capacity to go to llT. His exact words were'llT bhejhna hai usko' (We have to send him to llT). He started pushing me very hard
and often called to keep track of how everything wasgoing on. And finally allthe motivation and persistence was fruitful .
Thank you sir.
-Aaronyak Dewanii, llT KGP

ljoined Shatru sir in class 12 as a confused and unsure 17 y/o. He is literally one ofthe best teachers I have ever met. He knew exactly what I
was capable of and would go above and beyond in terms of e_ort to help me acheive my true potential. Not only an extremely amazing
teacher who made you fall in love with the concepts(one ofthe BEST lectu res ofJEE combinatorics in my opinion I have ever attended was
his class!!) but also a big brother with whom you can share your life's personal problems and alsojoke about things. I would literally call him
at random times regarding various "fears" and "stress factors" of mine and he would always give me just the right advice I need in that
moment! ltruly feel extremely luckyto have met such an amazingteacher/guidefriend !!
Thank you for everything sir!!
-0ebadrito Roy, llSc Banglore

A "teacher" is an understatement for Shatru Sir. He is a three dimensional being - A teacher, a friend and a guide. lioined 5ir's institute in
class 11with the hopes ofioining an llT. And now after 2.5 years offun-filled classes, where having fun went at par with academics, it's safe
to say I have been able to fulfillthat dream. Sir's fluid technique ofteachingthe concepts, innumerable sums ofall levels of di_culty, various
tricks, exam strategies and doubt-clearing sessions were certainly of the upmost help. All-in-all sir is the perfect teacher a JEE aspirant
[Link] to mention sir's motivational speeches which helped us immensely wheneverwe felt down or were nervous before exams.
-Srinjoy Ghosh, llT Roorkee

shatru sir is a brilliant teacher and he makes a complex subiect like mathematics easy and enjoyable. He kept us motivated
throughout
and never hesitated in clearing our any of doubts. under his guidance we practiced a lot of problems from each topic within
a time
which helped us a lot in competitive exams. Being his student was truly a great experience.
-Areesh-UlEimaan, tsl l(olkata

shatru slr has always been a great mentor, friend and teacher. Treating the class to some patties
after a long class or cracking some
iokes in the middle, he always manages to lift the student's spirits. He explains complex topics very intuitiv;ly
and makes sure every
student has understood the concept well. sometimes the class would become so interesting
that i would lose track of time. shatru sir
always kept motivating us and pushed us to achieve our best. He has made
me fafl in rove with math.
-Dewang Kr Agarwal, All lndia Topper, tSC-2019
 ABOUT MATHS FACULTY

-_
Shatrudha Prasad
a
started a teaching stint when he was himself
A graduate of llT Madras' the ground
This exPerience oinis Urougnt him to terms with
student. potent combi-
of real problems t;;;t;";' ; aspirant faces' He is a
reality
two thinss' He ;; ?'9it:Ylq ?::'use
of his age and
nation of
old because of nis tong'';;'*
yea'rs in[ teacning' His classes
in Maths are Kinetic
end in any
He t'**tiit"'
can end-of the spectrum to the
Energy replete.
*" p'ntnl' p"*tr.' t'ntbly calibrated quantities deftly
tooic seamlessfy' '^ t perspective' lt's about
and effectively, making n* pJi"tit'"'n 't'i*,t the country'
that his services to every nook and corner of
time,
being
'""i"o"
;;;;;illcLries
the shatrudha regularlv holds
with students A perfect
sessions pli*"
for and is a great driving force'
counselling
t"O Motiv]ator' Hundreds of testimonials
combination of Teacher'[u'0"
all the above claims'
*r'n"" UV n,t ex-students strengthen

mABATHOn
ACA DEMY
Dvery Probl em lleets solution!

BRAITICH: SAITLAKC
8q6r 6s'stolzqSolrSr 44lt7g8o8lzo6t
coNTAcT No.- rsBN 978-93_5573-167_l
lsBN 9&5573-167- 1
www'marathonacademy'co'in
SEPARATELY
NOT TO BE SOLD ]\I\\NI\\\N