PERMUTATI()N AND COMBINATI()N

Concept Application Exercise 1 8.

l. When a dice is rolled there arc six possiblc outcomes.

The digit'rr'car be s€lected in 9 ways as'0'cannot be
Then total nunber of outclmes whcn thrcc dice are rclled selected.
is6x6x6=63 The digit '-rr' can be selected in 9 ways as '0' can selected
Now number ofpossible outcrmes in which at least one die but digit in position xr cannot sel€cted.
shows 5
Similally all thc remaining digis can also be selected io 9
= Total number of possible outcomes ways each"
- Numbff of possible outcomes in which
Thus total number ofsuch numbers = 9n.
5 docs not appear on aty dico.
=61-53
9. Let Ab A2, 43, Aa,lr are live persons.

=91 (i) lr can leave the cabia at any ofthe seven floors. So,lr
can leave the cabin in 7 ways. Similarly, each o f A2,43, A r,,
2. The man can go in 4 ways and can come back in 3 ways. A5 can leave the cabin in 7 ways. Thus, the total number
Thereforc total number ofways = 4 x 3 : l2 ofways in which each ofthe five persons can leave the
3. Sinc€ each question can be a[swered in 4 ways. cabin at any ofthe seven ffools is ? x 7 x 7 x7x7= 75

So, the total number ofways ofanswering 5 questioN is (ii) .4, can leave the cabin at any ofthe seven floors. So,,{ r can
4\4x4x4x4=45 leave the cabin in 7 ways. Now,,.{2 can leave the cabil al
any ofthe remaining 6 floors. So,,{2 cao leave the cabin
4. First and second ralks can bc given ill Mathematics iII
in 6 ways. Similady,,43, .4a, and,{5 cao leave the cabin
(30 x 29) ways.
in 5,4 and 3 ways respectively. Thus, the total number
First and s€cord rank can be given in Physics in (30 x 29) of ways in which each of the f,ve persons can leave the
ways. cabin atdifferent floors is 7 x 6 x 5 x4 x 3 = 2520
First raok can be given in Chemistry in 30 ways.
10. (, + l)! =12x(n-l)!
First raok can be given in Engtish in 30 ways.
+ (z+l)xnx(n-l)!=12x(n-l)!
Hence, the number of ways to give ianks in all the four
subjects = n(n+I)=12
= (30 x 29) x (30 x 29) x 30 x 30 = 304 x 292 = ,2*n-12=o
= (r+4)(r-3)=0
5. when two consecutive digits are I l, 22, etc.,

wegct9x9=81numbers. ll. 80=24x5

0 0 when two consecutive digits are 0 0, we get To fnd the expo[€nt of 20 in 2001, we need to find the
exponent of2 and 5.
9 numbers.
Exponent of2 is
when two consecutive digits are I l. 22. 33. [200] [200] [200] 12001 lzool Izoo] lzool
weget9xS=72numbers. L , l.L r'l.L;tl-L;-l.L;-l-L/ l.L7l
Total numbers = 8l +9 +72= 162, :100+5d+25 + 12+6+3+ |
=
6. Each signal requires the use of 2 flags. = 197

There will be as many flags as there are ways of filling in

'
Exponenror5,, ll99l-l4l-l+l
L5l Lyl15, I
no***, =n,
2 vacant places
different colours
! io suc""ssion by the given 5 flags of
The upper vacant place can be filled in 5 different ways by No\\ c\oonenr of
' 16 i' roo! i, []ll | = Je
any oneofthe 5 flags followingwhich, the l6wer vacant place
L4l
Hence coefficicnt of 80 is 49.
can be filed in 4 different ways by any one ofthe remaining 4
differentflags. Thus, by multiplication principle, the number
ofdifferent signals that cao be generated is 5 x 4 = 20. Concept Application Exercise 2
7. Tolal variables if only one alphabet is used :26 1. "rPr:"Pr=I 9.
Total variablos ifalphabets and digits both are used = 26 x l0
+ t "'P.=!
Total [Link] = 26(l 10) = 286 = 'Po 9
s.220 Molhemotics

(/,-t)!
(r-l-3)! I I ,l
L Ll
+ +

9
5P.,
(z-4)! Can be filled with
3,4 or 5
(r-l)! (n-4)l t
AU the 6 digit and 5 digit numbers arc g€ater thao 3000.
(n-4)l nl 9
Now for 4 digit numb€rs > 3000 :
(n-l !l
-x-=_ Hence number gr€ater than 3000 startitrg with 4 are
nx(z-l)! 9 3x5Pr=136
It .. Total numbers > 3000 = 180 + 600 + 600 = 1380.
+ .'. n=9 When repetition is allowed
n9
It is equivalent to permutatior of 6 objects (digits) when any
2. It is equivalent to filling3 places (as prizes) with 7 persons object is rcpeated any number of time.
i.e., number ofpermutations of7 objects taken three at a time.
which is equal to 66. But this iocludes one number 0. Hence
Requircd no. of ways =7 4=7 \6 x5 = 2lO
total numbers = 66- I =46655
3. Ifwe fix 3 in the unit place, other thrce
digits can be arranged Now numberof 5 digitnumbe$ = 5 x 6 x 6 x 6 x 6 - 6480
in 3! ways similarly for 4, 5, 6.
Numberof 6 digitnumbers = 5 x 6 x 6 x 6 x 6 x 6 = 38880
.'. Required sum = 3!(3 +4 + 5 +6) =6 x 18 = 108
For four digit numbff to b€ greater than 3000
4. According to given conditions number can be formod by the
following format
t,2,3,4 6,7,8,9 ,l + + +
)
XXXX XXXX Each place can be
The required number of numbers = aPo x aPn filled in 6e ways
Cau be filled with
5. A number is divisible by t0 if its units digits is 0. 3,4 or 5
Therefore, 0 is fixed at the units place. Hence number having 4 digit= 3 x 6 x 6 x 6 = 648
Therefore, thcre will be as many ways as there are ways But these &8 numb€rs have 3000 as a number which should
of filling 5 vacant placcs in succession by the remai-oing 5 be excluded, so number of4 dig. > 3000 = 648 - | = 647
digits (i.e., l, 3, 5, 7 and 9).
Hence numbers > 3000 = 647 + 6480 + 38880:46007.
The 5 vacant places can be filled in 5! ways.
Hence, required number of fuigit number = 5! = 120 8. In the given word ASSASSINATION, the letter I appear
3 times, S appcars 4 times, 1 appears 2 times, ,V appears 2
6. 5 men and 4 womert arc to be se&ted in a row such that the times, and all the other letteN appear only once.
women occupy lhe even places.
Since all the words have to be arraaged in such a way that all
The 5 men can be seated ill 5! ways. For each arrangement,
the Ss are togethet SSSS is treated as a single object for the
the 4 womcn can be seated only at the cross marked places
time being. This single object together with the remaining
(so that women occupy the even places).
9 objects will account for l0 objects.
MxMxMxMxM These l0 objects in which there arc 3 As, 2 Is and 2 Ns can
Therefore, the women can b€ seated in 4 ! ways.
Thus, possible number of arrangements = 4 ! x 5 be arransed in
!
" 3l2t2t
= 24 x 120 = 2880
Thus, required numberofways of arranging the letters ofthe
7. Whed repetitioil is nol allowed.
eiven word = _..1!l = tstzoo
There are 6 digits 0, l, 2, 3,4, 5 and we can use any numb€r " 1t2t2t
ofdigits
9, There ar€ 5 letters in the word AGAIN, in which A appears
Number of digils Number of numbers
I (+0)5=5
2 times. Therefore, the requircd number ofwo.a. = ]2l = OO.

2 (*0)5x5=25 To get the number of words starting with A, we lix the

(*0)5x5x4=100 letter A at the extreme lcft position, we then rearrange the
remaioing 4 leners taken allat atime. There will be as many
4 (r0)5x5x4x3=300 arrangements ofthese 4 letters taken 4 at a tim€ as there are
5 (*0)5x5x4x3x2=600 permutations of 4 different thin8s taken 4 at a time. Hence,
the number ofwords starting with,,t:4! = 24. Then, starting
6 (+0)5x5x4x3x2xl=600
with G,'21
the number of words : ! : 12 as after placing G
Total 1630

For numbers greater than 3000, no. ofdigits > 4 at the extreme left position, we arc left with the leners l,l,
 tolion ond Combinotion s.22r

l and . Similarl, there are 12 words stErting with the next 15. If four panicular flowers are always together, flowers can be
letter L
strung in 1x 4! = 288 ways.
Total numbcr ofwords so far obtained = 24 + 12 + 12 = 48.
The 49th word is NAAGI. The 50th word is NAAIG. 16. We have following possibiliti€s for class ,{ and I seatiDg in
10. In the word EQUAIION, thcre are 5 vowels, namely, A, E, 4 rows:
I, O, and U, and 3 consonants, mmely, 0, f, and rV.
Rr Rz R3 R4
Since all the vowels and consonants have to occw together,
both (AEIOU) ard (QTN) can be assumed as single objects.
[Link]
Ther! the p€rmutatiors ofthese 2 objects taken all at a timc [Link]
2P2
are counted. This number would be =2 ln Case I, t6 studeots ofclass I catl be seated in R1 and R,
Corresponding to each of these permutations, there ar€ 5! in 16! ways and 16 students of class I cen be seated in R2
permutations of the five vowels taken all at a time and 3! and ,Ro in 16! ways.
permutations ofthe 3 consonants taken all at a time.
So total number ofways in case I is (l6l)'?.
Hence, by multiplication principle, required Dumbsr of
Similarly for case II also number of ways is ( 16!)2.
words = 2! x5! x3! = 1440
So total number of ways = 2(16!)2
ll. Volume ofeach set may be irl due order in two ways, either
from left to right or from dght to left. Now we have 17. 6 gentlemen 'x' can be seated in 5! wsys.
D1D1D1D4, l/tv2\ ... y8, EP2E!
='lt x2t x2t \2\ =81
12. (a) {x{xJx{x{xix
Let x denoto boys, then J denote the possible places for
gkls which are 7.
So selectionof 6 places for girls =
7Cu
Every geotleman may have a lady by his side if'3' ladies are
Permutation of6 boys and 6 gids among tlrcmselves either in positions marked with'.'or ma*ed with'='

=6!x6! .. Number of ways = 5! x3!x2! =1440

+ Total number of permutatioos ([Link])
Concept Application Erercise 3
=7c6x6lx6 !=? !x 6!
(b) Thcre are two possible afiangemeols L t5c1,= t5c,*3
b g b gbg b s b g b g= 6 | 6 | + 3r=r+3ot 15 3r=r+3
or g b gbgbgbgbgb=6|6 |
- r=3l2otr=3
Since only one ofthese may happen, so by the sum rule
number of arrangements = 2.(6!)'?.
= r=3 asris positive iotcger
20cro
2. Maximum value of20C, is and maximum value of25C.
(c) Total arrangements thal all girls arc rct together ls --L tr.
= total arrangement without any r€sldctions + Rario =
2ocrltcn= 143t4025.
- arrangement when all girls are together 3. In a deck of 52 cards, ther€ are 4 aces. A clmbination of 5
=(12)t-7 tx6l cards have to be madc io which therc is exactly one ace.
13. (a) Let the two particular delegates who wish to sit together Theq one ace can be selected in
acl ways and the remaining
be trealcd as one delegatcs. So we have 19 delegates who 4 cards can be selected out ofthe 48 cards in 4q ways.
can b€ arang€d on a round table h ( l9 - l)! i.e. l8! ways. Thus, by multiplication principle, required tlumber of 5 card
After this the two particular delegates can be permuted combinations
:4Ec o xnc,
between themselves in 2! = 2 ways- Hence, by product
rule, number olrequired arrangements = 2 (18) ! ...(l) 48! 4t.
(b) totalnumber ofarrangements of20 delegates on a round 4lx 44! l!x 3!
table = 19! ... (2)
48x47x46x45
Hence number o[
arrangemenl in which the two x4
panicular delegates never sil togelher
4x3x2xl
y(t9-2) ='t78320
-19!-2xt8! = l8! 17 x l8l
[4. Since rolal members are 15. but one is to be left. because
4. A team of3 boys and 3 girls is to be selected form 5 boys and
4 girls.
of circular condition, therefore remaining members are 14
but three special members constitute a member Therefore 3 boys cao be s€lected form 5 boys in 5C, ways.
required number ofarangements is l2! x 2, because, chairman 3 girls can be selected form 4 girls in aC, ways.
rcmaiNbetweenthe two specified penons andtheperson can Therefore, by multiplication principle, numbor of ways in
sit in two ways. which a team of3 boys and 3 girls can be selocted
s.222 Molhemotics
5cax4c3 11, lncluding the two specified people, 4 others can be selected
=
5C1
5! 4! in ways. The two adja@nt seats can be taken in 4 ways
1lvrl 'llvll and the two specified people can be arranged in 2 ! ways,
remaidng 4 people can be arranged in 4 ! ways
5x4x3! 4x3! 5cox4x2l x4! =5! x8!
3lx2 3!
+
12. Seleation of 2 consonants from 7 consonalts : 7C2 : t
- l0 x4=40
3Cr
2

Selection ofone vowel from 3 different vowels = =3

5. It is givel that the question paper coDsist of 12 questions
dividcd inlo two parts Pat I atld Pan lI, conraining 5 and 7 Now we have 2 consonants and a vowel and the vowel
questions, respectively. should be between consonants i.e., cons. vow. cons.
A student has to attempt 8 questions, selecthg at least 3 form So, two consoflants can change their positions in 2! ways.
each pan
Hence, by product rule, number ofwords = 2l x3 x2= 126
This can be done as follows.
(a) 3 questions from part I and 5 questions from part U 13. Two circles intersect maximum at two distinct points. Now
two circles cart be selected in 6C, ways.
(b) 4 questions from pan I and 4 questioDs ftom part Il
(c) 5 question form Part I arld 3 questions form Part II Now each selection of two circles givcs two points of
intersection.
3 qucstions from Part I and 5 quostions folm part II can be ucrx
5Cl 7C5 Then total [umber of points of intersection arg 2 = 30
selccted in x ways.
4 questions from palt I ard 4 questions form part II ca[ be 14. For each game 4 persons are necded. Hence select 4 from 8
selected in
5C4 7C4
x ways. in 8Co way.

5 questions from part I and 3 questions from part II can be Now ftom each selectioo 3 games can be held
5C5 ?Ca 8c0.3=2lo
selcctcd irl x ways. =
Thus, required number of ways of selecting questions 15. Let S, and S, refuse to be togeth€r and Sl afld .ta want to be
- ca x1 c s + 5c 4 ><1 c 4 + s c s x1 C.:
5
together only.

=
5l 7\
_x_+_ 5t x '| 5t ',tl Total ways when 53 and Sa are selected
213'! 2t51. 4!t! 4r3! 5!0! 3!4! = (8C2+
2Ct.8C) = 44
=210+ 175 + 35 Totar wavs when s, ano r.,*
= 420 "", :F";1, c r. 8 cr1= ys2
6. Two positions forlt and llo can be selected in roC, ways. Thus total ways = 44 + 182 = 226
Rest 8 students can be mnked in 8! Ways.
16. Number ofdiagonals passing through centre = 6
Hence total number ofways are roc, x 8! = 11lO!.y Number of rectangles = 6q - 1 5
2'
17. To form triangle,3 points out of5 can be chosen in scj = l0
a
7. Number ofcards exchanged = 2 x (number ofways 2 studgnts
ways. But ofthese, thc three poins lying on the 2 diagonals
can be selected who will exchange cards) = 2 . 20C,
will be collinear. So, l0 - 2 = 8 hiangles can be formed
8. According to the condition ofthe problem, we have to select 18. Lct the [Link] side on which 3 particular sailors can work
(r - 3 ) things fiom remaining (a - 3 ) things and permute these
('- l)C1,-, . r I
be narned and side by B on which 2 panicular sailors can
r things so number ofpermutations = ! work. Thus we are left with 3 sailors only.
9. A committee of t2 including at Ieast 5 womerL car be formed Selectiol ofone sailor for side,{ ='C, : 3 -d th"n *" -"
in the following ways. left with 2 sailors for other side
Now on each side 4 sailors can be arranged in 4 ! ways.
Women (e) Men (8) Ways
Hence total number of arrangements
) 1
'crx8q:loo8:s, =3x4! x4! =3 x24 x24=1728
6 6 'c6x8c6= z35z: s2

1 ) 'c,xtc,=20l6=r, 19. we have E_::=!!

n6
8 1
'q x'q = 639 = ro lt 2L
9 3
'crx8q=56=s, 6n
= n= 12
Number of committee when women are in majority :
.. Number ofdiagonals
r'?C2
- 12 = 54
=s3+sa+s5=2702.
20. Total no. of points : 2 ends + r points = r + 2 points
10. Selection of3 consonants from l0 = loCr
aCu .'. Total line segmgnts formed
Selection of2 vowels from 4=
_.._,
n-2- {t1 + 2) (/i + l)
Permutation ofthese 5 lefters (ell distinct) = 5!
numberofwordr=
[Link]. 5 !:86400.
=
P utolion ond Combinolion s.223

Concept Application Exercise 4 6. Let the blankets received by the persons arc .xl, ,2, 13 atld 14.
W€ have rr +t2 +.tl + r, = 15 and r, ) 2

l. Number of selections of at least on€ red ball from 4 identical + (\ -2) + Q2-2) + G.-2) + (xa-2)= 7
balls = 4 + yr+ y2+ y3+ y4:7,wlrarcl,: ri-2>0
Numbcr of selections of any oumber of black balls ftom Requircd number is cqual to the numbor of non-negative
5 identicalballs=5 + I =6 integral solutions of ttis equatioo which is equal to
.. Required numbe! ofselections ofballs= 4 x6=24
I *1 - |: loca.
cr, i.e., locT

2. According to the question 7. l-etd=U+ I,b:2q + I,c:2t+ l,d=2r+ I wherE

p, q, r arE non-negative irtegers.
63:b*tct+...+b*tcn
64:1b*\Co+b *tC, +... +r*rq; + 2p + I +U + I +2r + | +2s + l:20
= + P+q+t+s=8
64: ! ('"co*'"*'c, + .,. +b*tcz,*) RequiEd number of solutions
2
= Nuober ofnotr-negativc integral solutioos of
I
2b* | + n:3 G,+4+r+r:8)
2
- E*n-lca-, : t'q = 165
3, At least one $een ball can be selected out of 5 green balls in
E. L€t four variables be x, y, z, w.
25 - I i.e., in 3l ways.
We have ff z"d s'tchthat a + b + c + d= 3
Similarly at least one blue ball can be sclccted from 4 blue
.'. no. of non-ncgative intcgral sotutions =
a *'- 20
balls in 2a - I= 15 ways. 'Cr=
And at least one red or not red carl be select in 2] = 8 ways. 9. Any number botween I ard 100000 must be ofless than seven
digits.
Hence required number ofways = 3l x l5 x 8 = 3720.
Therefore, it must be of trc fotm araleraoatau
4. Number of selections of any number of copies of a book
:p + [, (because copies ofthe same book are identical things). whete dt. 02. ar, a4, a(, a6 € € {0, l. 2. ..., 9}
Similar is the case for each book. Ac{oding to questioo,
. . Total number of selections = (p + I )' ar+ a2+ a3+ a4+ a5+ a6= 18 ...(l)
But this includes a selection which is empty i.e. zero copy where 0 ( ari 9, i = l, 2, 3, ..., 9
of each book. cxcluding this, the requircd nurnber of non- Requircd numb€r
empty selections = (p + tf - I = coefficient [Link] in (l +.x +r2 + ... +&)6
/. ro \6
Concept Application Exercise 5 = coefficient ofrr8 in I l:L
I t-r./
I

l. Five people can be divided into rhree groups in (1, l, 3) or

= coefficient ofrrE in 111 -110;6 1t -r;{1
(1, 2, 2) ways.
= coefncicnt ofxr8 in - (l
6c, ,r0) (l
-.x)-61
Hence, total number of ways
[ignoring terms having powers ofr greater thar l8]
5!
=-x-r 5! I I u* lc,e-u u *'-'c,
3 (l!r 2! (2 !r1! 2l = "- x
=23Cs-axtsCs
=10+15=25 -x-
2. Now, any two months can be chosen in l2C, ways. 10. Let u be a non-negativc integer such that

The six birthdays can fall in thes€ two months in 26 ways. 3x+y+z+w=30
Out of these 26 ways there are two ways when all the six Let a=, - l, b = y- I,c = z- l,d = w, thet
birthdays fall in one month. 3a+b+c+d-25,wherea,b,c,d>0 ...(l)
So, favourable number ofways =
l2C, x 2; Clearlr0<a<[Link]=t,
126 -
3. For onto functions each image must have corresponding pre-
tlrcn b+c+d=25-3k ...(2)
imagc Numb€r of non-negative htegral solution of equation (2)
This is equivalent to distribution of 4 distinct objects in =1't_tcr
3 distinct boxes ifnon ofthe boxes remains empty, --l-25
lt-l- r25_tt--21-7k- -21 t*-
w25_lt- 12
Then lumber of functions are 3a - rC,13 -l)o *'Cr(3 - 2)'
=81-48+3=36
_ (21 - 3k)(26-3k) _ e* fik-234)
2
- I
2
4. Here number of solutions are equivalent to number of ways Required number
l0 identica I objects are d istributed in 3 distincl boxes ifempry
boxes are allowed which is r0'1-rcr l2C . - l
5, Here number of solutions are equivalent to number of ways
\ ltr?-strtzt+)
2

l2 identical objocts are distiibuted in 3 distinct boxes ifempty

boxesarenorallowedwhich is 12'C,-, = ll6r=55
3t 3, 8t9^17
=,,1 :
6) -53"!I2* 234,,9 1215
s.224 Mothemotics

11. For I < i < 4, letx, (2 3) be thc number of blarks betwecn 7. There arc 12 letters, of which,ly' appea$ 3 times, E appears
is ard (i + l)th lett€rs. 4 times and D appears 2 times and the rost are alt different.
Then, Therefore

tl +r2+x3+r4= 15 ...(l) The required number ofarangements = -!l- = rcAlzOo

3l412t.
The number of solutions of (I )
(i) Let us flx P at the extreme left positioq we, therl count
= coemcient ofrr5 in (f + y' +..-14
the arangements ofthe rcmaining I I letters. Therefore,
= coefficient of / in (l * r)a the required ofwords starting with P are
of/ h [l +4ct+5c2 ? +6caf +
= coefficieot
=6cz:20'
...1
= "!4t = t:eroo
3l2',!

But 5 lottcrs can be pcrmuted in 5! = 120 ways. (ii) Therc are vowels in the given wor4 which arc 4 Es and
5
Thus, thc required number arrangements I I. Since, they have to always occur together, we treat
them as a single object for the time being. This single
= (120) (20) = 2400.
object together with 7 remaining objects will account for 8
objects. These 8 objects, in which there are 3Ns and 2 Ds,
NCERT TEVEL EXERCISES
can be rearanged in *ays. Corr"spooding to cach
l. There will be as mafly signals as there are ways offrlliog in
" 3t2t
--L
of these arrangements, the 5 vowels 444 , and can
2 vacant places in succession by the 4 ffags of different ,a

5l
-4tin 1
colours. The upper vacant place cao be filled in 4 different be rearranged ways. Therefore. by multiplication
ways by anyone of the 4 flags; following which, the lower
vacant place can be filled in 3 differeot ways by anyone of prilciple the required number of arrangements
the remaining 3 dilfereot flags. Hence, by the multiplication
principle, the required lumber of sigmls: 4 x 3 = 12. = 8! x 5! = 16800
3l2t 4l
2, There will be as many ways as there are ways of filling 2 (iii) The required number of arangements
vacant places in succession by tie five given digis. Here, in
this case, we start filling in unit's place, because the options = the total numkr of arrangemcnts (without any
for this place are 2 and 4 only and this can be done in 2 ways; restriction) - the number of arrangements wh€rc
following which the ten's place can be filled by any of the all the vow€ls occur logether.
5 digits in 5 different ways as ths digits can be repeat€d. = 1663200 - 16800 = 1646400
Therefore, by the multiplication principle, the required (iv) Let us fix l ard P at the extreme ends (1at the left end
number of two digits even numbers is 2 x 5, i.e., 10. and P at the right end). We are left with l0 letters.
3. A signal can consist ofeither 2 flags, 3 flags, 4 flags or 5 flags. Hence, the required numbq of arrangements
Now, let us count the possible numb€r ofsignals consisting of lo! = tzeoO
=3t2l4|
2 flags, 3 flags, 4 flags and 5 flags separately and theo add the
respective numbers. There will be as many 2 flag signals as
there are ways offllling in2 vacant places insuccession by the 8. There will be as many ways as there are ways of filling 3
5 flags available. By Multiplication rule, the number of ways vacant places OEE io succession by the given six digits. In
is 5 x 4 = 20. Similarly, there will be as many 3 flag signals this case, the units place can be filled by 2 or 4 or 6 only i.e.,
as there are ways offilling in 3 vacant places in succession the units plac€ can be filled in 3 ways. The tens palace can
by the 5 flags. The number of ways is 5 x 4 x 3 = 60. be 6lled by any ofthe 6 digits in 6 different ways and also
Continuing the same way, we find that The number of 4 flag the hundreds placc can be 6llcd by any ofthe 6 digits in 6
signals = 5 x 4 x 3 x 2 = 120 and the number of 5 fl ag signals diffcrcft ways, as the digits can be repeated.
= 5 x 4 x 3 x 2 x I = 120. Therefore, tle required no of Therefore, by multiplication principle, the required number
signals = 20 .t 60 + 120 + 120: 320. of three digits even oumbers is 3 x 6 x 6 = 108.

4. Here, there are 9 objects (letters) ofwhich there are 4A's,2 9. The thousa[d place of the Higit number is to be filled with
L's and rest are all different. Therefore, the required number aoy ofthe digits from I to 9 as the digit 0 cannot be included.
of arrangements : 9!/4121 :'7 560 Therefore, the number of ways in which thousands place can
be filled is 9.
5. Every numberbeNveen 100 and 1000 is a3-digit number We,
The hundreds, tens, and units place can be filled by any ofthe
f,rst, have to count the permutations of 6 digits taken 3 at a
6Pr.
But, these permutations will
digits [Link] 0 to 9. However, the digits cannot be repeated in
time. This number would be
include those also where 0 is at the 100's place. For example,
the,tdigit numbers and thousands place is already occupied
with a digit. The hundreds, tens. and units place is to be filled
092,042, ..., etc are such numbers which are actually 2-digit
by the remaining 9 digits-
numbers and hence the number of such numbers has to be
subtracted from
6P3
to get the required numbor To get the Therefore, thgre will b€ as many such l-digit numbers as
number of such numbers, we frx 0 at the 100's place and there are permutations of9 differelt digits taken 3 at a time.
rearrange the remaining 5 digits taking 2 at a time. This Number ofsuch 3-digit numbers
tPr. So The required number = 6P3 5Pr: 100
number is -
Pe totion ond Combinolion s.225

ot ot 6
=,8=----::-=-
' (9-3)! 6! (7-r)(6-r)
9x8x7x6! + Q-r)(6-t)=$
6! + l-Bt+36=O
=9x8x7:504 + (r-4)(r-9)-0
Thus, by multiplication principle, the requircd number of + r:4 ot r:9
4-digit numbers is 9 x 504 = 4536 -t
It is known thsi trP
10. 4{igit numben are to be formed using the digits, l, 2, 3, 4,
(n - r)t'
atld 5. where0(rln0(rl5
Therc will be as many ,Higit numbers as the re are Hencf,., t *9
p€rmutations of 5 differenl digits taken 4 at a time.
Therefore, rsquired number of 4 digit numbeB
12. There arc 8 different letters in the word EQUATION,
:s,- 5!
(5-4)!--5!l!
Therefore, the number ofwords that can be formed using all
the letters ofthe word EQUATION, using each letter exactly
=lx2x3x4x5=120 once, is the number of permutations of 8 different objects
8Ps
Among the,tdigit numbers formcd by using the digits, l, 2, taken 8 at a timc, which is = 8 !.
3, 4, 5, even numbers end with either 2 or 4. Thus, required number ofwords that can be formed
The rumber ofways in which units place is filled with digits = 8! = 40320
is 2.
13. We have 'Cn ='C.
Sinc€ the digits alc not repeated and the uoits place is already
occupied with a digit (which is even), the remaining places
-'. 9=n-8
are to be filled by the remainitrg 4 digits.
." n= 17
,n. c, ll
t"
Therefore, the number of ways in which the remaining places
can be frlled is the permutation of4 digits taken 3 at a time. 'c, I
Number ofways offiling the remaidng places
l2n)t ._ 3!(n - 3)! ,,
:aD 4l
- (4-3)! - 3)t
3l (2n nl
-41
r!
(2n) (2n -l\ (2n - 2\ (2n - 3)l
=4x3x.2xl=24
Thus, by multiplication prirciple, the required number of
(2n - 3)l
(z-3)!
even numbers is 24 x 2 = 48 x '
t. 0) 5P"= P,_
n(n-r')(n-2)(n-3)l =ll
|
5! - 6l 2(2n -t\ (2n - 2) _, ,

(5- r)! (6- r+ t) !

(n-l)(n-2)
51. 2x 6l
-=2X- 4 (2n -t) (n - t)
(s- r) ! (1 - r'1'l (n-l)(n-2) =ll
5! 2x6x5! + 4(2n- l)=ll(r-2)
(5-r)! - r) (6 - r) (5 - r)!
(7

2x6 15. TherE are a total of6 red balls, 5 white balls, and 5 blue balls
9 balls have to be selected in such a way that each selection
(7 - r) (6- r) consists of3 balls ofeach colour.
- (7 r)\6 r) 12 Herc, 3 balls can be selected from 6 red balls in 6C, ways.
e l l3/ + 30:0 3 balls can be solected form 5 white balls in
iC, ways.
+ (r 3)(r l0)=0 3 balls catr be selected from 5 blue balls in
5C,
ways.
= r=Jorr=10 Thus, by multiplication principle, required lumb€r ofways
It is kno$ lhal. 'p-.
' --L . lvhere 0 < r < n 0 < r< 5 ofselecting 9 balls
1n-r\1 6! 5! 5!
Hence, r + l0 =oC,x5C,x5C,-
' 3t3tx 3t2tx 3t2l
r:3
=20x l0x l0=2000
(ii) P,=6P"
5

I
16. Out of l7 players, 5 players are bowlers.
5! .6l
A cricket team of ll players is to be selected in such a way
(5- ,') ! (6-lil)l that there are cxactly 4 bowlers.
5! 6x5! 4 bowlers can be selected in tq ways and the remaining
(5 - r)! (7 - r)! 7 players can be selected out ofthe 12 players inl2C, ways.
s.225 Mothemotics

Thus, by multiplication principle, required number of ways 20. When a coin is tossed once, the number ofoutcomes is 2 (Head
of selecting cricket team and tail) i.e., in each throw, the number ofways ofshowing
=
tcox"c, a different face is 2.
st t' t2xl1xlox9x8 Thus, by multiplication principle, the required number of
= 3960
4!l! 7!5! 5x4x3x2xl possiblc outcomes is 2 x2 x2=8
17. There are 5 black and 6 red balls h the bag. 21. In the given world EXAMINATION, there are letteN out ll
2 black balls can b€ selected out of 5 black balls in 5C, ways ofwhich, A, I, and N appear 2 times and all the other letters
and 3 red balls can be selected out of6 red balls in
6C,
ways. appear only once.
Thus, by multiplication principlg required number of ways The world that will b€ lised before the words starting with ,
of selecting 2 black and 3 red balls in a dictiomry will be the words that start with,4 only.
=tcrxuCr= l0 x 20 = 200 Therefore, to get the number of words staning with the l,
18. There are 9 courses available out ofwhiclq 2 specific courses letter A is 6xed aqt the eterme left positioq and then the
are compulsory for ev€ry student. rcmaining l0 letters taken all at a time are rearranged,
Therefore, every student has to choose 3 courses out of the
Since there are 2 ls and 2 Ns in the rcmaining l0 letters,
remaining 7 couscs.
This can be chosen in ?C, ways. Number of words starting with l = =9OZZOO
2t2l
Thus, required number ofways ofchoosing the programs
Thus, the required number ofwords is 907200
-9
1l 7x6x5x4l --
22. 2 differcnt vowels and 2 differcnt consonants ar€ to be selected
3!41! 3x2xlx4!
form the English alphabet.
19. There will be as many ways ofchoosing 4 cards from 52 cards Since there are 5 vowels in the English alphabe! numbe. of
as there are combinatioN of52 different things, taken 4 at a ways ofselecting 2 different vowels from the alphabet
time. Therefore rc. = j]_
52Cn
=
' = ro
The required number of ways = 2t71
521 49 x 50 x 51x 52 Since ther€ are 2l consonants in the English alphabet,
4!48! 2x3x4 number ofways ofselecting 2 different consonants from the
alphabet
= 270725
(i) There arc fow suits: diamond club, spade, heart and rhere
=^6-=
'
2!=^s
2l9l
aro 13 cards ofeach suit. Therefore, there are llC. ways Th€refore, number of combinations of 2 ditrerent vowels ad
of choosing 4 diamonds. Similarly, there are rrC. ways 2 diferent consonants: l0 x 210:2t00
ofchoosing 4 clubs, r'Cn ways ofchoosing 4 spades and Each of these 2 I 00 combinations has 4 letters, which can be
I3Cn
ways ofchoosing 4 hearts. Thcrefore arrarlgcd among themselves in 4 ! ways.
The required number of ways Therefore, required number ofwords = 2100 x 4 ! = 50400
= r3c{ + r3ca + rlca + r3ca 23. From a deck of 52 cards, s--card combinations have to be

=q, l3l
made in such a way that in each s€lection of 5 cards, there
:2860 are 4 kings.
4!9!
In a dcck of52 cards, there are 4 kings.
(ii) Thcre arctl cards in each suil Therefore, therc are rrC,
r3C,
I king can be selected out of 4 kings in 'C, ways.
ways ofchoosing I card from t3 cards ofdiamond,
4 cards out of the remaining 48 cards can be selected in
ways of choosing I ca.d from 13 cards of hearts, l3C, '-L4 ways.
ways of choosing I card from 13 cards of clubs, r3C, Thus, the required number of 5-card combinations is
ways ofchoosing I card from l3 cards ofspadcs. Hence, nct xo8c4.
by multiplication principle, the required numberofways
lscr x llcr x llcr xlscr
24. From the class of25 students, l0 are to be chosen for an
- - 134 excursion party.
(iii) There are 12 face cards and 4 are to be s€lected out of Since there are 3 students who decide that either all ofthem
l2C, ways.
these 12 cards. This can be dooe in Therefore, will join or none ofthem willjoin, there are two cases.
the reouired numberol*ur, = J?l - 495. Case I : All the three studentsjoin.
4!81 TherL thc remaining 7 students can be chosen from the
22C,
rcmai[ing 22 students in ways.
(iv) There are 26 red cards and 26 black cards. Then
no. of ways of choosing 2 red and 2 black cards is
CaseII : None ofthe three studentsjoin.
Then, l0 studeots cao be chosen from the remaining 22
'2crxt'cr= 66 *66 students in
22Cro
ways.
(v) l3c4 + r3c4 + lrc4 + t3cc=4t1co Thus, required numhr of ways of choosing the excursion
parly is 22c 1 + 22c rc.
 utolion ond Combinolion s.227

25. Since, 1000000 is a 7-digit rumber and the number ofdigits 10. (c) Words start with D are 6! = 720, start with E are 720, start
to be used is also 7. Therefore, the oumbers to be counted ytith MD arc 5'! = 120 and stafi with,t.1, are 120. Now the
will
be 7-digit only. Also, thc rumbers have to be greater than f,rst word stans with MO is nothing but MODESTY. Hence
1000000, so they can begin either with l, 2 or 4. rank ofMODESTY is 1681.
The numbe. ofnumbers beginning with I . (c) The number of ways that the caodidate may solect 2 questions
6! 4x5x6 ftomland4ftom8=tc2xic4
= _=- =60.
3t2l 2 3 qu€stions from,{ and 3 ftom I = 5q x tca
4 qucstioDs from I and2 kom B =
5C4x3C2
as whcn I is fixed at the exaeme left position, the remaining
Hence total number ofways is 200.
digits to be rtaranged\rill& o,2,2,2,4,4, in which there
are 3, 2s and 2, 4s. 12. (c) Total number ofways to distributc one Rs. l00trote and five
Total numbers beginning with 2 other notes = 36.
6l 3x4x5x6 = 13. (d) A garland can be made from l0 flowers inl(S,) *"rr.
)t 1t 7
180 2'
can be made in
(' l)! ,ruyr)
and total numbers beginling with 4 { .' z flowers' garland ;2
6l
=i:=4x5x6=t20 (2n'll 2tx(n-2)! 44
14. (b)
3! (2, -3)!x3! nl 3
Therefore, the rcquired number of numbers
4(2n - l\= 44
= 60 + 180 + 120 = 360. =
= 2n= 12 = n=6
Now 6C.= 15 + 6C,=6c2or6ca
STATE TEVEL EXERCISES
toc,= toc,*,
= t=2,4.
15. (d) - t+t+2:lo
' t^ 5? 5!
Single Correct Answer Type L._l!4t__J.
-'
1. (c) To be divisible by 5, the digit 5 must be at unit place, so now 16. (c) Required number ofways =
8C, + 8C, + 8q + 3Cn + 8C,
to be betwcen 3000 and 4000,3 must be at thousand place. =8+28+56+70+56-218
aP..
Hence the requircd trumber of ways =
{Since voter may votc to onc, two, thEe, foul or all
7 (c) Requircd numbc. of ways are a" since each letter may be candidates ).
posted in z ways.
17. (^) .E.E.E.-..E.
Pj Accordi[g to condition there are 22 vacant places for Hindi
at "l ,('-5)l
" *r Pa=9= (r-5)! (r-l)! =9=r=9. book heoce total number ofways are - 2C,, = 1540, ( Since
books ale same).
4. (c) The number ofpossible outcomes with 2 on at least one die =
(The total number ofoutcomes) - (The number ofoutcomes 18. (d) The letters can be s€lcct in x 4c2 ways.
5Ca

Therefore the number ofarrangements arc (5cr x

oc, 5!.
in which 2 does not appear on any die) 6a - 5a = 1296 625 -
= 67. 19. (b) Sincc 5 ar€ always to be excluded and 6 always to be included,

t (b) Seven boys can be seated in a row in 7! ways. therefore 5 players to be chosen from 14. Hencc required
number of ways are C, - 2002.
la
Hence the total no. of a[angements such that no two girls
3P3.
are seated logether = 7! x 20. (c) The number of selections
lol = coefficient of-rE in (l + r +l + -. + 18)
6. (c) I gets 2,, gets 8; (l +, +l + ... +r8) . (l +r)8
2!8!
^2
t-}
l0 ! = coefficient ofrs in {:
I gets 8, B gets 2; (l-r)' 1r*ry,
8t2l
= coefncient ofiE in (l + r)8 (l - x)-'?
.. 45+45:90.
7 (c).T.R.N.G.L - coefficient ofr8 18co + 8crr + 8cf2 + ... + 8csr8)

Three vowels can b€ arrange at 6 places in 6P3 = 120 ways.

x(l + 2x + 3* + 4S +... + 9.x3 + ...)
860+ 3. 8C, + 7. 8Cr+... + l. 86:"
Hence therequirednumberofarrangements= 120 x 5 !- 144@. =9.
8 ( a).A.t.U. = Co.t zct + 3C2+ - . + gca lC,-'C)
The pointed places to be frtled by MXMM.
Now Co.r + Crl + ... + [Link]:r(l +x)E
Diflerentiating with respect to r, we get
Hence required number ofways 3 !x a =4 ! Co+ 2Cfi + 3C;? + ... 'C"r8 = 1l tr)8+8x(l +.r)7
3!
Putting r = l, we get
(Sinc€ thrce vowels can be aranged i[ 3! ways also]. Co+2Ct + 3C2+ ,.. + 9Cr= 28 + g v21 =2t,12*g't
9 b) It is obvious. = 10x21
s.228 Molhemotics

21. (c) Since number of selections arc n - PCr - ?. Therefore the

axrangement ofr things carl be done in r ! ways. Hence the Hence the rcquired number = 3 ! xaP3 *).=n
2l
total permutations arc' -P
C, - o tl
22. (8) By inspection r = 5. 6. (c) The units place can be filled in 4 ways as any one of 0, 2, 4
or 6 can be placed there. The remaining three places can be
23. (c) Required number ofways filled in with remairling 6 digits i[ 6P] = 120 way. So, total
=oc, x"cr+ ncrx'c.+ actxlct+ acoxscz number ofways = 4 x 120 = 480. But, this includcs those
=4 x56+6 x70 +4 x 56 + I x 28 = 896. numberc in which 0 is fixed itr exteme left place.
24. (a) 5 persons are to be s€ated orl 8 chairs i.e.
8C! x
5! or 6720. Numbers of such numbers = 3 x tP2 = 3 x 5 x 4 = 60
6C5
{Sinca 5 chairs can be select in and then 5 persons can 0 X x
be aranged ill 5! ways].
Fix 5
[Link] 3 ways (only 2, 4 or 6)
25, (c) The required number ofwords is
,'. Required number ofways:480 - 60 - 420
(2ct xncz+zczxoc) 3l = 96.
7. (c) Givcn, 'Po:24 . 'Cr.
26. (c) Four letters can be selected in the following ways
l) (z
(i) All differcnt i.e. C, O, R, G.
Therefore, z(z - -2\(n-3')
(ii) 2 like alld 2 different. ", _. n(n - r)(n- 2)(n - 3)(a - a)
5x4x3x2xl
(iii) I ditrerent i.e. threc O and I fiom R, c aod C.
3 like and
The number ofways in (D is
4C4
=I . (n-4)
3C2 5
The number ofways in (ii) is I x =3
The number ofways in (iii) is I x 3Cr
=3
n-4=5+n=9
Thercfore, rcquircd number of ways = I + 3 + 3 = 7. 8. (a) 'P,=720.'C,
(c) required number ofways = 8q - 5q - 3C,. rP,+'C, =720
2?. The
=
{Since total points arc 8, but 5 are cotlinear and other three = rl=720=61-r=6.
are also collinear).
e. (b) Total number of po ints are r, + n + [, thc A's formed by these
28. (b) No. oftriangles = 6Ca - 6. Poins-'*'*tC,
29. (d) Required number ofways = 2r0 - I Joining 3 pohts on the same line gives no triangle, such A's
(Since the case that no friend is invited i.e., roCo is excluded). are'C1+ nC1+ tc.l
tca
Required number ='*'* -^C, -'cj -ic1.
Archives
r0. (b) We have, 30 = 2 x 3 x 5. So, 2 can be assigned to either d
n(a-l) or 6 or c i.e. 2 can be assigncd in 3 ways. Similarly, cach of
l. (b) .6,'2= 153 - = l5j.+ a= rB.
3 and 5 can be assigned in 3 ways. ThuS the no. ofsolutions are

2. (a) Anumber betwe€n 5000 and 10,000 can have any ofthe digits 3 x1x3 =2'7.
5, 6, 7, 8, 9 at thousand's place. So thousand's place cao be 6lled lr. (c) There arc four sven places for the four odd digits 3, 3, 5, 5.
in 5 ways. Remaining 3 places can be 6lled by the remaining
8 digis in
8P,
ways. Hence required number = 5 x 8P,. ... The reauired no. o1*"r, = Jl-.-l!- = 66 .
2l2t 2l3t
3. (a) l2 persons can be seated around a round table in I t ! ways. The
total numberofways in which 2 particular persons sit side by 12. (c) Given, total number of points = a and number of collinear
side is l0! x 2!. Hence the required number of arrangements points = p. We know that one line has two end points.
:9x Therefore total number of lines = 'Cr. Shce p points are
= ll!- l0! x2! 10!.
collinear, therefore total number oflines drawn from collinear
4. (r) Given oumber is 960, we know that 960 = 26 x 3r x 5r. points = PC2, We also know tha! concspondilg to the line of
Therefore bases arc p t = 2, pz- 3 and pr = 5 and powers ar collineadty, one will also ba added.
= 6. ar= I and at= l. Thus sum of all the positive divisors p
Therefore number of lines ='Cz - C2 + l.
of960
13. (d) Required oumber-zoCz-oCz+ I

-t p,""
( -r\( p;" - r)[ p,''.' - r ) _ 20x19- 4x3_,
e,-r ll. en )\ ,n ) 22
f26.' l)flr.' l)fsr.r _r)
_ _ =190-6+l=185.
I z-, J( 3-r Jl. 5-r J 14. (a) There can bo two types ofbommittees
(i) Containing 3 men and 3 ladies
= (127X4X6) = 3048
s. (c) Fis! we arrange 3 consonants in 3! ways and then at four
(ii) Containing 2 men ard 4 ladies
placEs (two places bctween them and two places on tivo sides) .'. Required number ofways = (8q x acr) + (8c2x4ct)
aPl I
3 vowels can be placed in
2t'
Pe utolion ond Combinotion s.229

(b) Fix up I man and the remaining 6 meo can be seated in 6! 26. (^) Required numberofways= 45 =2t0 = 1024
'i ways. Now no two women ar" to sit toggther and as such the 27. (b)
7 women are to be aranged in seven empty s€ats between 28. (b)
two consecutive mcu and number of arrangement will be 7 ! .
2e. (b)
Hence by fundamcntal theorem the total number of ways
= 7l Y 6'1. 30. (c)
31. (b)
6 161 q=^g.- o=^(--l) 32. (c) Number of rcquircd ways : 2' a 2C r, -, = t6Q
'2
33. (a) .'. Requircd rumber ofways = 4! = 24
= !.4!)ln(n
.. ac^= .1.-y,zs- -l)
-'-2 2 I 2 -rJ'J 34. (c) Clearly, 30 mangoes can bc distributcd among 4 boys such
that each boy can rcc4ive any number ofmangoes.
I lq
-, :
n(n -I)(n - 2)(m +t) Hence, total numb€r of ways =
30 + a - 13
Ct = 5 456
8
15. (d)
1
(n +l) m(m-l)(m-2) = 3. '*'C. 36. (c)
8
37. (b)
I (r) iC5 + rC5
'C6 > '+ 38. (d)
tcs
= "tc6>" 39. (b) No. offour digit numbers divisible by 5 = 6 + 4 = l0
(n +1)! s!.(z - 4)! ___q =3!:6
= 6!.(,l -5)! (, +l)!
-l =3!-2! =4
Total no. of four digit numbers = 4! - 3! : l8
- 0J-9. t t =r-4>6
6
+n >lo .. Required = l8 l0 : 8
40. (d)
Hence according to options n = ll.
I (a) The number ofwords before the word CRICKET is
JEE TEVEL EXENCISES
4x5! +2x4! + 2!= 530.
I (c) Out of7 plac€q 4 places ale odd and 3 even. Therefore 3 vowcls
Single Correct Answer Type
lP, ways artd remaining
cart bs aranged in 3 even places in
aPn Lrver 1
4 consooants can be afiangcd in 4 odd places in ways.
Hence required no. of ways=3Prxa Po= 144. 1. (c) t5cr.: r5c.* r = l1 : 3
(et
g! 9x8x7x6x5x4 Clearty 'r' can be 0, l, 2, 3, 4, 5 but possibilities ofr = 0, or
1.0 - =--:-:=-=16E0.
Total wavs
(3D' 3x2x3x2 5 arE clearly ruled out (as
15Co
=
156r,
= 1;
For r: l,
21 ({) It is obvious. t5r- 15x14x13 15x14
Lrr-= t3c-
Ll-= ano -t/r =
(cl 6! 6 I -;-
Reouircd number of rrur, =2t 212! =90. l'cr,: ttc.., = 13 :3
@) Given nC,, -'Cu For r=2,
.'. 12+6=n-n=16 l5x14x13x12xllxl0
...,ra,=18r17=9xl?=153.
"3r 6x5x4x3x2xl
'2 t5^ t5xl4xl3
and L,+r- L!-_
15-
(c) Requircd number of arangements 6
=6p,x4t=:/2ox24= tlzlo tscr,: l5c, * ll :3
= *,
l(b) civen thar 'P, = 30240 and''c,= 252 For r=3,
; nl 3o240 utd nl ttc, = I5x14x13x12xllxl0
+ (z - r)!
= (n - r)l rl
=252 "cr, = 6x5x4x3x2xl
l5x14xl3xl2
- ,r=W=pg
252
andl5c,*r-15c1=
4><3x2xl
,tcr.,,tc,*,=u :3
... nl For
(z-5)! =zoz+t r5cr,= rs6,, = r5c, = I!I-I1IJ1
= z(r- l)(r-2)(n-3)\n - 4)= 30240
+ ,t lh - l)(n-2) (n-3) (n- 4) 15x14xllx12xlt
= 10(10 - l) (10 - 2) (10 - 3) (10 - 4) ano 'i,*1= 'd,= --iITllIlIl-
= z=10
Hence, requircd ordered pair is (10, 5). = "cr,: "c,.r = 5 :33
Thusr=3
s.230 Molhemoiics

2. (d) The number formed by last two digits must be divisible by 4. nl

Lakh Ten Thousand Hundred Ten Unit (" -')l
(a) we have
Thousand 13.
fr= ,11

ways
3 3 ways 4 ways 4 ways 5 ways 2 ways G:;+tI
b
(1,
5,'1,9)
3, (2,6)
a='4
' P,-,
=n-r+t ...(l)

Total numbcrs= 3 x3 x 4 x 4 x 5 x 2 = 1,140

and
c '4.', (put/=r+ I in (l))
3.(a) Each rillg cao be wom in any of the four fingers. So total b ,P,
number of ways is 4 x 4x4x4x4= 4s
b2 b n-r +l
4.(d) Required number of ways are 2t0
question may be answercd in 2 ways.
= 1024, because every
ail) ;(,4 I + n-r

s.(a) Total number of numbers without resriction = 25.

14. (c) Since the 5 boys can sit in 5! wais. In this case there are
Two numbers have all the digits equal. So, the required
6 places are vacant in which the girls can sit in 6P, ways.
number of numb€rs = 25 - 2.
Thercforc rcquircd number ofways are 6Pr x 5!.
6. (c) For cach bulb there are rwo possibilities.
ls. (d) Afler fixing I at one position out of4 places 3 places can be
Either it lvill be switchod on or switched off. Hence total 6lled by 'P, ways. But some numbers whose founh digil is
[umber ofways in which many can be illuminated = 212 - I 6P,
zero, so such typc of ways -
7. (d) A number is divisible by 5 ifit either ends with 5 or end with .. Total ways =
7Pt-6Pz= 480
zero.
16. (b) When seats are numbered circular permutation is sarne as
(i) Total oumber ending with zero = 9 x 107 linear p€rmutation as sit number is also important. Thus total
(ii) Total number ending with 5 = 9 x 107 lumber of sitting alrangoment = ?nr
Thus total number ofsuch numbers = l8 x 107 17. (b) We have a ='+ 2P,,, : (x + 2)!,
(b) lst mao can vote in 3 ways. 2nd man can vot€ in 3 ways.
" = (r-'ll l)!
E.
5 ='P..
Similarly all other men can vote in 3 ways individually.
Henc. the total numberof ways= 3 x 3 x3 x 3 x3 x 3 x 3 and c -,- 1rp,_ t| =(r_ ll)!
:37 ways. Nowa=1826c
9. (") We have 32 places for tecth. For each place we hav€ two
+ (.x+2)! =182.(r-'! rr-tt)l
choices either thcre is a tooth or theG is no tooth. Therefore I l)!'
the [umber of ways to fill up these places is 232. As there is
no person without a tooth, the maximum population is 232 - I .
+ (r + 2)! = 182-r!
+ (.x+2)(r+1)=182
r0. (b) Extreme left place can be 6lled ir 6 ways, the middle place
x=12
can be frlled in 6 ways and extreme right place in only 3 ways. -
( . number to be formed is odd)
r8. o) [IN]TEGE\ taking I and N together

.'. Required numbers ofnumber = 6 x6 x3 = 108 Number ofwavs

'2!= !x 2l=61=720
. (b) Numbers geater than 1000 and less than or equal to 4000
will be of4 digits and will have either I (exc€pt 1000) or 2 =l)-'zo= T oo
or 3 irt the first place with 0 in each ofremaining places. '''21
Afier fixing lst place, the second place can be filled by any When the words bcgin with I and end with R I]NTEGEIRI
ofthe 5 digits.
Number ofwavs:
j]
Similarly third place can be filled up in 5 ways and 4th place '21 =60
can be filled up in 5 ways. + mr= 60
Thus there will be 5 x 5 x 5 = 125 ways in which I will be in
first place but this include 1000 also hence there will be 124
... Il m2
=ro
numbers having I in the first place.
19. (a) All strips are ofdifferent colours, then number offlags = 3! = 5.
Similarly 125 for each 2 or 3. One number will be in which
4 ir the first place and i..e 4000.
When two strips are of same colour, then number offlags
_ 'lt -
Hence the required numbers are 124 + 125 + 125 + I :375 - Ll Lt-16
-
ways.
Total flags:6+ 18=24=41
r2. (c) A = t2,3,5,7, ll,
13, 17, 19,23,29]l. A rational numbers is
made by taking any two in any order 20. (a) There are 900 three digit numbers and there are five odd digits.
Thus, there are 53 = 125 three digit numbers comprised ofonly
.'. the required numb€r ofrational numbers
=roP2+ I (including l) -
odd digits. The other 900 125 = 775 three digit numb€rs
must contain at least ono even digit.
 utotion ond Combinotion s.231

2t (a) Any numb€r in which sum ofdigis is divisible by 3 is divisible arranged in 3! ways and contents of these packets can be
bv 3. further arranged in 3! 4! and 5! ways respectively.
Now from given six digits we can remove either 0 or 3, so Hence total number of ways = 3 ! x3! x4! x5!
that sum oftie rcmaining 5 digits is divisiblc by 3. 30. (a) Total number of books = a + 2b + 3c + d
The numbers are made of 1,2,3,4,5 ot 0, 1,2,4,5 Total number of ways in which these books can be arranged
Hence the required number of 5{igit numbe(s = 5! t 4 x 4! in a she lf (in same row)
= 216 (a+2b+3c+d)'!
-- rKbtf Gl'
(b) Let setl = {ar, a2, ..., a.} ard set 8 = lbr, br, ....-, a"\
Now prc - image ar can be assigned any one ofthe images 31. (b) Sum of single digitnumber t + 3 + 5 + 7 + 9 =25 =S
from set 8. Sum of two digit number 45 (t + t0) = 4(.t + l0.t) = 44S
Thus al can be assigtred image in rt ways. Sum of tkee digit number l2s (t + l0 + 1o'z)
After assigning image to dt we have ,? -l images left for a2 = (12) (l I r)s: 1332s
or a2 cart be assigned image in, - I ways. Sum of four digit number 245(1 + l0 +102 + l0r)
Similarly a, can be assigned imagc in z -2 ways. = 24{llll),S= 266645
Hence total number of functioN are ,(/, -l ) Total = 28041S
(n -2\ '- (n - n + l) =aP. 32. (c) The number ofnumbers with 0 in the udts place = 3l = 6.
(i) xlxlxl The number ofnumbers with I or 2 or 3 in the units place
Even digis occupy odd placrs shown by crosses.
Crosses can be frlled in 2 x 2 x I ways .-. the sum ofthe digits in the units place
('.' 0 camot go in the 6rst place from rhe left), =6x0+4 x l+4x2+4x3:24
The remaining places cao be fllled ir 3! ways. Similally for the tens and the hundreds places
.'. The required number ofnumbers = 2 x 2 x lx3t =24 The number of numbers with I or 2 in the thousands place
=3!
24. (b) Number of one digit numbcrs = 6
Numbcr of two digits numben = 5 x 5 = 25
.. The sums ofthe digits in fte thousands place
:6xl+6x2+6x3=36
Numberofthee digits numbers= 5 x 5 x 4 = 100
.'. The required sum= 36 x 1000 + 24 x 100 +24x l0 + 24
Total numb€r arc = t3l
33. (d) The 6rst 24 = 4! words begins with A, the next 24 begin with
25. (b) The number ofnumbers when repetition is allowed = 5'. E and the next 24 begin with H. So the 866 begins with M
tP,
The numberofnumbers when digits camot be repeated = and it is the 86 - 72 = l4rh such word. The first 6 words that
.'. The required number ofnumbers = 5a - 5! begin with M b€gin with MA and the next 6 begin with ME.
So the desired word begins with MH and it is the socond such
26. @) @; C and D separated; E and .F any where
word. The first word that begins with MH is MHAES, the
AB ; and E, ,F can be seated in 3 ! 2 !
second is MHASE. Thus E is rhe letter we se€k.
4C2 .
no. of gaps are 4l AB lElFl C D can be seated in 2!
34. (b) AtAz BtB2 ... LtL2umber of ways in a circle (l l)! x 2r2
Total ways 3! .21.4C2.21= 144
35. (d) Let number ofteams be l,,theo number ofmatches to be played
6l
(c) Totalnumber ofarangements are J2l =360. ='c2=28
The numb€r ofways ir which O's come together = 5! = 120 _ n(n-l) _rf
2
Hence required number ofways = 360 120=240.
28. I (i) Let the two particular delegates who wish to sit together
be treated as one delegates. So we have l9 delegates who
+ n2 -n-56=0
+ (z-8)(z+7):0
can be arranged on a round table in (19 - I )! = 18! ways. ) n=8asnt-7.
After this the twp particular delegates can be permuted 36. (b) Bt824...81B8BeBrc
betweeo themselves in 2! : 2 ways. Hence, by product (i) When two terminal books are taken (Br B, or rerr then
o)
rule, number of rcquired arrangements numberofways=2x7= 14
=2x(18)! ...(l) (ii) When two consecutive terminal book are not taken (i.e.
(ii) total number of arrangements of20 delegates on a round B2Br B$4, ... BsBe)
table = 19! ...(2) Then the third book can be selected in 6 ways
Heoce number of arrangement in which the two particular The[ the oumber ofvays arc7 x6:42
delegates nevcr sit together
.. Total = 14 + 42 = 56 ways
= 19! -2.18! = 18! .(19-2)=17.18! 37. (b) Let number of ca[didates be ,. Therefore (n - 2) are to be
We can think ofthree packets. One consisting ofthree boys elected and so one can vote upto (, - 2). Hence number of

I of class X, other consisting of 4 boys of class XI aIld last

one consisting of 5 boys of class Xll. These packets can be
ways in which one can vote
s.232 Molhemotics

='Ct ncz+ ...

+'C,- 2 = 56 (given)
+ | +255=2b
2'
=
..
= -(Co+'C,'t+rcr\= 56 '11=T8

= 2n-n=58 - n=4
+ 2" = 58 + n which is satisfred by r, = 6 oDly ,l8. (b) Number ofpossiblc pairs of, objects
38. (c) - (50 + 5) : 135
'zoc, n(n -t\
39. (c) The selection scheme is as follows: '2
Category [Link] Category III Total wcight "(" -t\
of --r-:---r objeds = 120
I l 2
Group ,{ (4) 2 2 3 n("-t\
Yx2xw=l20
+
Oroup I (5) 2 2 )
Group C (6) 2 2
a n(n - l),/, = 120 ...(l)
Similarly, total weight of all triplets = 480
No. of ways 4c2.5c2.6ca 4^ 5- 6- nc3. 5c2.6c2
ofselections = 1200 = 900 : 600 ='Crx3r=480
Henc€ total number of different selections
= n(n-l\n-2)w=960
(2) (l),
...(2)
DiYiding get by nc
= 1200 + 900 + 600 = 2700 n-2=8
40. (c) The number of ways can be given as follows or r=10
aC,
2 bowlers and 9 oth€r players = x eC, ql
aq x eC, 49. (^l 1{-1- - oumber ofways when balls ofthe same colour arc
3 bowlers and 8 other players = 2l 3l
4 bowlers and 7 othel players = aCn eC,
x together
Henct required number ofways
=6x I +4x9+l x36=78. = -2J-
2t 3t -
3141= 517, -4,1

41. (a) The selection can be made x 22Ce. in 5q s0. (c) Let the squar€ has dimensiotrs z x ,.
3 vacancies filled from 5 candidates in tC., ways and
{Since If a is even, total no. of blue (diagonal) tiles = n + n : 2n
now remaining candidates are 22 afld remaining seats are 9].
If n is odd, then total [Link] blue tiles = 4 + r, - I = 2a - I (the
42. (b) First omit two particular persons, remaining 8 percons may middlc tile is be couored twice).
be 4 in each boat. This carl b€ done in 8C. ways. The two
particular pemons may be placed in two ways one in each
Hence,2r-l=l2l + n=61
boat. Therefore lotal number of wal s [Link] = 2 < 3Co So, net red tites = 6l x 6l - l2t = 3600
43. (a) Number ofways for select 4 questions out of5 queslions. Levet 2
Number ofways = 5Co = 5 (c) :
51. ,4's = 2; B's = 4; C's 2
Remaining questions = 8
Remaining questions for solving - 6 Total words formed
8! =lzo
= 412'!2'l ..(l)
Number ofways 8C6 = 28
Numbcr oftotal ways=5Cax8C6=5 x28=
Let ABBC ='x'
140
Number of ways in which x lrrc can be arranged
5 (One circle)
44. (b) II
= !.1
= 69 6u11L1, 1n clndes x ABBC andABBC x.
6 (tro. 4 lies on the same ciicle)
2l
5cr.6cr+ucrscr+6cr+ I = 156
But the word ,{EBCIBBC is counted twice in 60 hence it
Altematively, "C, -'C, * I should be 59
algebra ='ci.t2-'cj Hence required number ofways:420 - 59 = 361
4s. (d) t2(x
\(12
- .x) calculus 52 (a) Since diamonds do not have naturals order of left afld right
46. (a) Choices available to the candidate are 3 questions from f,rst so clockwise arrd anticlockwise armngements arc taken as
group and 4 from another (or the other ways around). Thus identical.
toialways=2.5Cr.5C{. .'. Number of arrangements of l0 different diamonds to
47. (^) w€ have"lcr +'*'cr+ -.+b*'gn=255 ...(l) from a necklace = f .sl = tttono
7
Also the sum ofbinomial coefficients
i[
-z" -t6o',b't6r+b, t Cr+ -..+b'tCo*u rCo.,
s3. (c) Four pcrsons can b€ aranged circle io 3! Ways.
lfallshall not have the same neighbours in any arralgement
+.1,+t^ (rr2r. + 2,al^ Lz,rt
:(l+ l)2n+ t =22'+t
we have to
consider clockwise and anti-clockwise
arrangement to be similar. Then total number of ways are
+ b* tco+21bt tc * tcz,*
r+b*tcr+.-. +b'tcn\+b r 31.12= 3

s4. (a) The number ofwords like C C = Jl = fts nun661q1

+ I + 2(255) + I =zb*l wordslikel-L - 2l2l
 uiotion ond Combinolion s.233

The numb€r of words beginning or ending with Number ofways = (Total words formed) -/t (l !, B)

c. L = zxl) 9l 2.8! _.
2t 21.21 2l
The numbq ofwords beginning or eding with (C or ,), = 18. 7! -7'7! =(18 -7)71: n. 71

7 =212,'1, JL 53. (b) t2=22.3

2t2t Then the four digis can be
+ the rcquirEd number ofwords Ll
11 1t 1t 1t l- 1.6.2 -, no. ofnumbers=
-2t = 12
= -:-:- + -::- + 2\:: + 2/.2t\x -::-
2't2t. 2l2t 2! 212t. 4,1

( It l. l. 3. 4 -+ no. ofnumbers = = 12
-t -+-+t+I (7D =
2l
44 AI
2- 2. 3. l-, no. ofnumbers = -:: =12
55 (r) Total words, witlrcut any restriction = 7!
2l
Hence total numbers is 36.
Total words beginning with 1= 6!
Total words elding with B = 6!
64. (b) Number of gamcs excluding ,4 and 8 = '-2C,

Total words beginnhg with 1 and ending with I = 5!

I
But b€fore leaving.4 and have played 3 games each.
Thenn-2C2+6=84
Thus total number ofrequired words = 7! - 6! - 6! + 5!
Solving this equation we Eet n = 15.
= 7! - 2(6!) + 5!
6s. (b)
(a) A number is divisible by four, it the last two digits arc divisible
Number N umber Number of Total number of
by four. of girls ofboys groups going dolls
Thus last two digits canbe 12, 16,28,32,36, 68,92,96. to picnic
Thus last two places can be filled in 8 ways I 4
t
c, nco tccr 4c4)
= 3
The remaining three places can be filled with remaining
2 'crnc, 2{3Cract1=24
4 digits in 'Cr . 3! ways rcr):
2 'crnc, 3ccr l8
numben = 8 . (4q
r--r--_l
Total number ofsuch . 3!) = 192
Total 45
:\/ (a) Clearly, ofthe odd digits 1,3,5,7,9 will be repeated.
one
l2C6
The number ofselections ofthe sixth digit =
tcr = 5 66. (a) 26 cards can be chosen out of52 cards, in ways. There
arc two ways irl which each card cin b€ deall because a card
Then the rcquired number of numbers : 5x $2l can be either from the first pack or from the second.
52C -
Hence the total numb€ t of ways = ru 226 .
(a) 8 different beads can be arrangcd in circular form in (8 I )! - 67. (b) The smallcst number of people
= 7! ways. sinc. there is no distinction between the clockwise
= total number ofpossible forecasts
and anticlockwise arrangement. So the required number of
: total number of possible results
arranpemens = ].1 = 2520.
"2 =3x3x3x3x3
59 (c) Iffour particular flowers are always together flowers can be 68. (c) Any s€lection offour digits from the ten digits 0, l,2,3,...,
9 gives one number.
,mrnn in i.14! = 288 = loCr
-2 So, the rcquired number ofnumbers

2oC3 69. (b) The number oftimes the teacher goes to the zoo = "C3
60 (c) Total ways of selection without restriction =
The number of times a padicular child goes to the zoo
Number ofways ofselection when two are adjac€nt
r6cr = number of ways two other children can be selocted who
= 20 x accompany a particular child = "-lC2
Number of ways of selection when all the three are adjacent
=20
From the question,'Cr -n 'Cr= 84
20C,
or (a- l)(a-2)(r-3)=6x84=9x8x7
Required number ofways = - 20 x l6 - 20
2o' 19'18 70. (b) Th€ oumbers can be categorized as
= - 20 * l6- 20
6 (a) 5, 10, 15,...,100 -, 5r,
= 20[s7 - 16 rl (b) 1,6, ll, ...,96 - 5L+ t
=20x40:800 (c\ ).,7,12, ... ,97 + 5L+2
61. Let the araogement be .xt 12 13 r4 15 .x6 ,7 ,8 clearly 5 should (d) 3,8, 13,... ,98 - 5L+3
occupy the position r, or.16. Thus rcquired number = 2(7!) (e) 4,9, 14,...,99 + 5L+
62.
[' 'MEENANS[{U'. Number of letters = 9
4

rb Now sum of two numbors is divisible by 5 then we can have

(EE=2,NN=2\ following cases.
s_234 Mothemotics

(i) both rhe numbers from the list (a) - oumber of selection 74. (r) Given letteN are I, (N, N, N), (D, D), (E, E, E), P, T
ways are
ec, The choice are as follow:
(ii) one numbcr from list (b) and other &om list (e) - number
Choice Ways
2ocr
ofselection ways are x 2ocr ucr=
(iii) (D All the letters arc distinct [as 6
one number from list (c) and other from list (d) - oumber
different lefters are I, N, D E, B Tl
of s€tection ways arc PCr x 2ocl
Hence total number of ways are
(ii) 3 distinct,2 alike 'c, x'q = 36
Ncr+4c, x*c, +20c, x'oc, -996 (iii) 2 distinct, S alike 'c,,tcr=29
71. (c) Thc scheme is as follows (iv) 2 alike,2 alike, I distinct xcrxacr= 12
Husband's rel. Wife'[Link]. (v) 3 alike, 2 alike 'cr*'cr= 4
Numbcr of selectio[ Total = 72
MFMF 75. (a) Since one player emerg€s the winner, each ofthe remaining
(3) (4) (4) (3)
I 15 players los€s in some round. So 115 matches are played.
133 Altematively, 58 + 29 + 14 + 7 + 4 + 2 + I = l15
tc., x'gr= 1
76. (c) Two circles inters€ct at two distinct points
2 I l2 Two straight lircs intersect at one point
'crxoc, xnc, x'cr= 144 One circle and one shaight line iltErsect at two distinct
III 2 2 | points

'c, xacrxagrx36r= 324 Then total number of points of int€rs€ctions are as follows :

IV -3 3 - Selection Number ofways Total point of

acrxacr= 16 ofselection intersection
Total number ofways =I+ 144 + 324 + 16 = 485 Two straight lines c2 5crxl=lo
72. (bl \- \r2\xars, Two circles c2 acrxz= lz
h2=YtY2Y3YaY5
One line and one 5cr x 4cl 5c,xoc,x2=40
at and z2 can be subtacted without borowing at any stage circle
if x, + y,39
Total 62
Value of .x< Value ofJ,,s
77. (a) Selection of 2 parallel lines from z = -C,
9 0,1,2 9
Selection of 2 pamllel lines from z ='C2
8 0,1,2 8
'1
0,t,2,......7 Hence number ofparallelograms ='Cr. 'C,
0,1,2,3,4,5,6
i .,(,,-r)(,-D
6
=
5 0,r,2,3,4,5 78. (d)
4 0,r,2,3,4 C
3 0,1,2,3
B
2 0, 1,2
I 0,t
0 0

Thus 15 and* can be selected collectively by l0 + 9 + 8 +

...+l=55ways. ,4 D
Similariy each pair (.ra, y), (x1, y), (t2, y) can be selected The number of triangles with vcrtic€s on sides AB, BC, CD
in 55 ways. =
lcr x 4cl x 5cr
But for pair (rr,/r) can be selected in I + 2 t 3 + .. +9= 36 Similarly for other cases
ways as in this pair we cannot have 0
.'. Total number of aiaogles
Thus total ways = 45(55)l :rcr xlcr lcr x 5Cl
x 5Cl +lcr x4Cl x 6cr +
uc,
73. (b) The letters other than vowels alc : PRMTTN .x6c, +ac, x 5c, x
Number of permutations with no two vowels together is :342
:- x /C. x 5! 79. (c) Out of l0 points lct n points are collinear
2t-
Further among these permutations the number of cases in
Then number of riangles are toq -'q : 1 19

which T's are together is 5! x

6C5
x 5!
l0x9x8 n(n-l)(r-2) =ll0
AI
66
So the required numbe.
'21 = x'crx5! -5! x6C5x5! n(n-t)(n-z)=60
-l
:57 x (5!)'z
 ulotion ond Combinolion s.235

8 (c) Select any thrE€ pohts from total 3p points, which can be 89. (a) Ifeach receive at least two books then the division trees are
3PC,
done ways. as shown irl figure
But this also includes selection of thrce collinear points.
Now three collinear points ftom each straight linc can be
selected inPC, ways.
Then number of triangle ae 1pc, 3p
- c. = p2 14p - 31

(c) wehave
2x5EL2T
o-;=T
8
--=- -h=lZ
(D (ii)
. . Number ofdiaeon"6 = J?1!2:!)
'2 = 54
Division wavs for tree (il =
ji-
(2t\' 4t 2l
(b) At geen ball can be selected out of 5 green balls in
lest one
8!
25 - I i.c., i[ 3l ways. Similarly at least onc blue ball can be UlVlSOn WaVS IOr taee (ttl =
' l1t\t rt 1t
selecrcd from 4 blue batls itr 24 - I = 15 ways. And at least
one rEd or trot red can be select in 2r :8 ways. Now total number of ways of distribution of these goups
Hence required number ofways = 3l x 15 x 8 = 3720. -
83 (8) 5880=2r.3.5.7'?
amons 3 students is
" l--ji-..--jllr
(2!)',4t2t (3t)z 2t2t
r,.
L )
Thus total divisors:4 . 2. 2. 3 = 48
,
90. (a) Suppose one rupee coins, y fifty paise coins and z tlventy
84 (a) The rcquired number of se lections 6ve paise coins are selected. The&
3cr x 4cr x 2cr (6ca + 6c2 + 6cl + 6co)
= a+y+z:6 ...(D
85 (b) The candidate is unsuccessful ifhe fails in 9 or 8 or 7 or 6 or The total number of ways = No. of solutions of (i)
5 pap€rs. _6+t-t^Ll-l
-
.'. thc nurnber ofways to be unsuccessful -8c2=28
=ece+9cE+eC7 +ec6+ecj 91. (.) Here we havc to divide 12 books into 4 s6ts of3 books each.
=9Cr+rC, +ecr+"c. +eCn
(recall the concept ofhalfseries) Therefore, the re4uired numb€r of ways is )!-x +l
(3!)'4!
=j Cco*nc, + .. +e601=
| xz' =z" 92. (a) Since the shelves which arc to rec€ive the books arE different,

86. (b) 'Pr' must witl at least (z + l) games.

therefore the requirod number of ways is ]|(4D' .

l,et 'Pt' wim , + r games (/ = 1,2, ...., n) corresponding 93, (c) Herc we arc dividing 2, people in r-groups of2 each, and wc
lvays arc concerned with mere groupilg

Hencc, the required numU", of *uy, = jf

Tora! ways = =tr,-r+bc,*r+.-+bc-
L""..,
r=l
e4. (b) The requL€d nunber = ""'' Cr, =t' gr- 666

2r, _rn. l .t Lnlt es. (d) Suppose /h person receives Rs.x; i = l, 2, 3, 4

= - -\zrtz,-2. tnr
un =
Therl x, + .x, + r, + 1o = 18, where ti >4
2
(c) Whcrr at least one Re I coin is selected we can select any
lal yi= xt- 4,i = l,2,3,4. TherL
h + y2+ y1+ ya= 6
number oftwenty five coins and ten paisa coins. Then number
of ways of such selection = 4 (2 +l)(5 +l ) = 72 as we can The total numbff of ways = Number of solutions of tho
selecl zero or more twenty five paisa and ten paisa coins to above equation
ensue that amoult selected is Re I or more. e6. (b) Plrtilioning Number ofways
But whcn none of one rupee coins is s€lected we have to 4 members I
select all twenty five paisa coins and ten paisa coins to
ercure sum Re. I which can be done only in one way. Then [ +3 memb€rs
4l
=q
total number of ways are 73. M!
nt
88. Ftst divide 22 books into 5 groups ofthe size 5,5, 4, 4, 4. 2+2members
l" 711 (21).21
The number of wavs are
' ------
3!2!(s)r(4!)J -=3
I+ t+2members --1L =u
Now distribution waysofthese groups among 5 studcnts are 5 ! (t l\'2t21
Then total number of ways of distributioos are 4l
'r7t 11t
l+l+l+lmembers
(r 9'4!
3!2!(5!)'l(4')r
" - l!2!5t(4!)l Total t 5 ways
s.236 Mothemolics

97. (a) Let the balls put ill the box are ]1, ]2, ,t, 14 and xr. We are Total numbers which does not contain digit 2 aod 7
have =5n+5n-4'
Xt + x2+ \
+ x4+ x5= 15, xi> 12 Total numbers which contain 2 and 7

- (\ - 2) + (r2- 2) + (\-Z) + (xa-2) + - 4t

(xr- 2) = 5 6d -5r -54 +

1 yt + yz+ y3+ y4+ yr= 5, y,: x,-2 2 O 105. (b) The concept of derangement. The rcquired number
Tolal number of ways is simply equal to number of non-
=lr ;_l*l_l * l']=s
nogative integral solutions of the last equation. Which is
equal to 5
+t-1c5
=ec5.
L r! 2! 3! 4U
106. (b) Total number ofrequired functions
e8. (b) By above formula nrunber of ways
= Number of derangemcnt of 5 objects
(/-l)5 + 3cr(,,
=3t-3cr -2f
=241-96+1=l5O = 5!
llll
---+---
21 3l 4l 5l
ee. (b) Thus 16 constables can be divided into 8 batches of each in
(16)! Numerical Value Type
8!(2!)"
l. (41 2 nl nl = lr52
Now the first batch may be assigned to patrol any one of 8
villages, the second one caa then be assigned to any one of = (nl)2 = 576
the remaining s€ven villages and so on. - nl=24
Henc& no. ofways ofassigning 8 batches to patrols 8 villages + n=4
(16)! (re)r 2. (61 rCr.r(r=))J 111= 6

8!(2r"'' (2!)" 3.(sr',P,=',P.+l

100. (c) If we put mirimum number of balls rcquired in each box.
nl
-r""""'-=:--= n! n-r=L (D
,/, - t\ nr+n-2 (r-r)! (r-r -l)!
Balls len ar€ :Ii-J which can be put in 2 q_r ways

without res,triction.
2
-'-',=--'l-.=,
Apain'C = "c
(n-r)rrt (z -r + 'll)l(r-
,

t)!
101. (b) First giye Rs 3 to cach of four persons. Now for remaining l= l
4 rupecs we have = r n-r +l + r-2"=-l ..(ii)

,+t+z+,4=4 ...(l) Solving (i) and (ii), z:3, r=2

whero r, /, z, w are number ofrupees gained by person l, 2,
4. (8) Let z(o) = number divisible by 60 = 60, 120, .-, 960 = t6
3 atld 4 respectively.
We have to 6nd number of non-negative solutions of ,(6) = numb€r divisibleby 24= 24,48, -.,984: 41
equation (l) which ar€ n-tCn-r='gr- z(l n 8) = number divisible by both = 120,240, --,960 = I
'* 35
r02. (c) 480=25x3x5 Herce n (A nE) = n(a) - n(A a B) = 16 - 8 = 8

Now 4n +2=2(2h + l) = odd multiple of two. s. (361)

Thus total such divisors = I x2 x2 =4 We have I's = 2; 8's = 4t C's = 2

= 412t8l2l -
r03. (c) 24 =2x 3 x 4,2 x2 x 6, I x 6 x4, I x3 x8, I x 2 x 12,
Total words formed qzO .(l)
I x I x24 (as product ofthree positive integers)
.. the total number ofpositive integral solutions of LetABBC ='x'
il 1l 5!
xlz = 24 is coual to 3!+ 1+ 3!+ 3!+:. i.e.. 10. Number of ways in which x IBBC can be arranged =
2t 2l
:60
2|
Any two ofthe factors in each factorization may be negative. but this includes x ABBC ai ABBC \,
. . The numb€r ofways to associate negative sign in each
But thc word ABBCABBC is counted twice in 60 hence it
case is
lc2, i.e., 3. should be 59
.'. The totaloumberofintegralsolutions:30 +3x 30= 120. Hence required number ofways:420 - 59 = 361

104. (a) Total numbers without any restrictions containing digits 2, 3, 6. (12960)
4,5,6,'l = n(E = 6' Let T and S denote teacher and student respectively
Then we have following possible pattems according to
Total numbers of numb€rs which contain 3. 4. 5. 6. 7
question
= n(a)= 5'
(D TSSTSSTSS
Total numbers ofnumbers which contain 2, 3, 4, 5. 6
(i0 sTs sTS sTs
= n(a):5,
Total numbei ofnumbe$ which contain 3, 4, 5, 6
(iii) ssTSsrssr
Henc€ total numb€r of arrangements are
= n(A B)= 4'
^ 3 x (3!) 6! = 18x6!
P lolion ond Combinotion s.237

(64) ... l0) can be selected

Now two odd exponent (ftom l, 2, 3,
Her€ A is commoo lettcr in words 'SUMAN' and 'DIVYA' in 5C, was and two evc[ exponent can b€ sclected in
Now for selectiflg six differ€nt letteN we mwt selectA either 5q ways.
from word 'SUMAN' or ftom word 'DMA . Hencr numb€r of G.P.'s ate 2 g, = 2g
5

Herrce for possible selections, we have

12. (4) [Link] to the qucsion
A excluded ftom SUMAN + A included in SUMAN
='ct.5ct +[Link]
f - nl:232
=40+?4=64
+ n=4
13. (rs)
(9) We have 2'- 2 = 510; nca
Numb€r of subsets contaioi[g three elemeDts =
+ ?! = 512
Numbcr of subsets containing thrEc elsments of !f,hich one
elemcnt is a, :'-
16'"

(o x= 321546 According to the questioo

Numb€r ofnumbcrs begiruing with I = 120
t, ,tc. 2o (,
I
[T_TTT_ ' = 100'c.\-'
Number ofnumbers beginning with 2 = t20
= z: 15

2
IIIII :24
Stading with 3l ...
14. (30)
'll 1t. 'l'l
l ]IIII

Starting with 3214 ... = 2

a x+y=3Oz
' T'r 4l'- 114'l

Finally = I
I 4
II 15. (9) 5400=23x33x52
Powcrs of2 can be l, 2, 3
Power of3 must be I
3 2. I 5lr 6 Powers of 5 can be 0,
.'. total divisors = 3 x I x3 =9
l, 2

Henc€ unit placs digit of267th number is 6.

l0 (sr0) 16. (6) t + / + 2' = 2336 = 2s x73
(i) He can invite 2 friends [Link] times each =25x(l+8+64)
Lets select 6rst those 2 ftiends in 3C2 ways =25 (2o +23 +26)
:25 +2E +2tl
Now these two ftiends each thrce cal be invited on 6
.-. Number oftriplets (5, 8, ll)is3!
6^n. ;n
'
J! 17. (6) Images of 1,2,3,4,5 are respectively.
3!3!
7,7,7,8,9; 7,'1, 8, 8,9; 1, 7, 8,9,9
Thus total number ofways 2 friends can be invited three 7,8,8,8,9; 7,8,8,9,9; 7,8,9,9,9
6-.5 =
16" Jl .'. there are six functions.
'3!3!
18. (rrr0)
(ii) another possibility is that he invites all three friends 2
2 | 2 2t
times each
AI
CA L US
' :'
Thennumterof wavs=
2t2t2l
Tipr ofrord \umber ol irirntutiilions
(ii) one more possibility is that he invites one friend three 2 identical t 2 idertical
+ I different
ta, ' :210
times, one two times arld one [Link] times. 'a, ,lrtI
6!x 6
Then numher ofwavs
' = -:- 2 identical + 3 different n", : 720
3t2l 'a, -2l
Hence total number of ways All 5 diffcrent 120

=
6! 6X6 6t
"crx_+_+_=5lu _.- .'. Total numberofword= lll0
' 3!3! l!2! 2l2t2l le. (18)/(l) = t
(20) For 2, there will be 3 cases.
If thrce lumbers are in G.P, then their exponent must be in For 3, therc will b€ 3 cases.
A.P For 4, therc will be 2 cas€s.
Ifa,6, c are sclccted number in G.P, thetr the exponents ofa For 5, there will be I casc.
and c both are either odd or both even, or otherwise exponent .. Numberofone-one onto functions.= 3 x3 x2 x I = l8
ofD will not be integer
s.238 Mqthemotics

20. (288) 24. (36'

Let Gr and G2 be the girls who do not want to sit with boy Bt. 3o - 11cr1zo -21+1cr1= 36
xxxxxx 25. (2s)
123456 7 letters
Crsc I: ,r occupies the first or sixth place. P-r I
IfBl occupies first place, then Gl and G2 cannot sit at seclnd E)2
place.
Rrl
So, Gr ard G2 can be seated at four plac€s (3,4,5,6) in1P2 Frl
ways.
At remaining three places, two boys altd one girl can be
C;l
scated in 3! ways.
T-+ I
So, number ofways in this case = 'P2 x 3! = ?2
2alike+2diff. = I x5C2: l0
Similarly, if Bt occupies sixth place, number of ways will
AIt4diffcrent-6C4=15
be72. Total=15+10=25
Case II: B, occupies second thfud founh or fifth place. 26. (36)
If8, occupies second plac€, Gr arld G2 canrot sit at frIst or rsi 7-to
third place.
- x+y+z=loir,y,z>l
So, G, and G, can be seated at foutl! fifth or sixth placc in .'. Required numb€r of solutions = l0-lCr
3p, ways. -.,=9Cr=36
27. (t96')
At remaining three places, two boys and one girl can be
Thcre are two different ways of forming the committee
seated in 3! ways.
So, number ofways ill this case - x 3! = 36 3Pz (i) Oldest is included and youngcst is excluded
Similarly, if 8, occupies third, fourth or fifth place number We have to select 4 candidates out of 8,
ofways is 36. Number ofways = sc, = 8!
8x7x6x5
From above two cases, total number ofways ' 4l4t= 4x3x2 - 70

=72x2+36x4=288 (ii) Oldest is excluded and youngcst is included

21. Oo80) We have to select 5 catrdidates from 9.
We have letters (C, C), (O, O), N, U, T Numbcr of ways = ec.
9! 9x8x7x6
Requfu€d number of ways
' ' = 5l4t- 4x3x2xl -126

= Total number of ways without any restriction Hencc, the total number of ways in which committee
- when no C comes at odd placc can be formed is 126 + 70 = 196.
7! 28. (630)
=2t2l-rc,,5!
' 2l =lo8o 'co"tcn=636
22. (28s) 29. (960\
(i) a +, * c (all distinct and c + 0) We have lcttcrs M, D, C, L, E, I, A
+ Total cases = 2(eca) We have 4 consonants, which can be aranged in 4! ways.
Now, there are five places, where we have to arrange vowels
t23 A, E, I so that A and E arc tog€ther but all arc not together.
So. we have to arrange AE and I.
^,/\
r32 231 Number ofways are 5C2
x 2! x 2! (as AE can slso be arranged
(ii) a+b,c=0(a<b>0) 3 eC2 in 2! ways)
Total cases =
(iii\ a=b,c+0(a=6>c) + Total cases = eC2
So, total [umber of arrangements = 4! xscrxz! x2l = 960
30.
(iv) a= b,c=0(a=, > 0) + Totalcases= eCr o36s)
According to the questiorl each sel must conlain minimum
(v) a=c+O(a<b>c) - Tolal cases= eC2
two elements, such that sum of smallest and la€est element
e.g., 1,4
= l4l (formed) is 13.
.. Number ofsuch 3-digit numbers lfsetcontains smallest number I and largest number 12,theo
=z (c)+ 3. (eC; r e6, = 235 we can select other elements of subset from 12,3,...,l2l.
So, number of subsets are 2lo.
23. (179')
Ifset contains smallest number 2 and largest number I I then
Total number of ways - Number of ways when largest
wc can s€lect other elements of subset from (3, 4, ..., l0).
number is 4
So, number ofsubsets are 23.
=6x6x6-(4x4x4-3x3x3) Similarly, we have subsels 26 , 24, 22,20 .
= 216 - (64 - 2't) = 216 - 3'7
So, total number ofsubsets I+ 22 + 24 + ... + 2r0 = 1365
= 179
 ulotion ond Combinotion s.239

Multiple Correct Answers Type Clearly !r,, + ,i = 9 and 2wt=\.1,: 45

I (r), (b), (c), (d) wiz:81+ 11- lSli

We know that product ofr coos€cutive integer is divisibte by,.!
=
!lr,,2 = !1 x l0+,Ji-180E,
We have P = (n - l0) (, - 9) (z - 8) ... (z + l0) is product of
=
= sl0 r t/,2 - ls x45 -t i
2l cons€cutive integeG
5. (a), (b), (c)
Which is divisibtc by 2 I!

[(r - l0) (r - 9) (z - 8) ... z] (2oo)! _ (2oo

=1.3.5....199
(n + lxn + 2X, + 3) ... (a + l0)l 100!x 2r@
1.};=l(too)t
Which is divisible by lM0! l00tic
(n - l0)... (z-6I x (z - 5) ... (z- l)l (2oo)! / lol'\l'lo2) )
l.;l[;.] -l;l
r'zoo
l) ... (, + 4)]
x [n(n + Arso
frrt'oo.=
x (n + 5)... (,t + 9)l x (, + l0)
Which is divisible by (5!)4. 6. (b), (c)

Also it can be shoum that P is divisible by 2! 3! 4! 5! 6!. The number ofways of inviting, with the couple oot included
:BCs.
2. (e), (c), (d)
The number of ways of inviting with the couple included
6l : tc,
B U LB U L: numberofwavs = 2lx 2t x 2t.
.. The required number ofways
(8) 2 Apples can be distributed h 3 people in_
aC, ways and
=
8Cj +ECa 8Cr +
=
ECa (,. tCr
=tCr)
oC2
4 Mangoes can be distributed in 3 people in ways.
l0! 8!
Atsoroc.-2x8c,=
.'. Total ways=6Cr'aC,
5!5!-2x 4l4l
6! 4!
2lx4l 2lx2l _ l0x9x8x?x6 _.. 8x7x6x5
t20 24
6! :9x4x7-140
2lx 2lx 2l
:112=2*--!L
3!x 5!
(b) 6 books i! 3 bundles, two in each burdle = 7. (r), (b), (c)
f#,.*,
(ct T,+ irL (x + y + 2)6 is6ck + y)6-' . / When l, = 3t, there are exactly nl3 integeN ofeach type 3p,
| + l,3p +2
3p
Put r=2
\=6c2(, + y)a. ] =6cr.? laco. ra-r .9 Now sum of3 selected integeN is divisiblc by 3, then either
all thc integers of the same tyIf- 3p,3p + I of 3p + 2 or otre-
Put P=2
one integer from each g?e.
T. =6c^. i .1c-.;i\=6c-. ac-ie2;2 - 6'! nBcr+'Bca+"Bca+
Then sclection ways = Cc,) (*c,)
| ' 2l2t.2l (1c,1=t(3cr1 + 1nt313
d) 6 prizes in3 childre& two to each =
6!'3! - 6! lfn = 3/.t - I y3 intcgersofthe ryP3p,3p+2
I , then there arE (,,

2!-2't.2t.3't 2t.21.2! type and (, + 2)/3 integers ofth€ typ€ 3p + l.

3 ( s), (d) Then number of s€lecrion = 2(r rvrq) + e +

'z)'4q)
l2l + ((n - l')B\2Ot + 2\
All AAAAA BBB D EEFcan be arransed
" in 5lx3t x2l When ll : 3t + 2, number of selection ways are sarne as in

Betwceo the gaps C can be arranged in lrC, ways.

the case of, = 3f t I
8. (a), (b), (c), (d)
= 116, 1
8q
1o1u1 ,r,nu" --J?L-
5!x3!x2!
The five digit numbers starting with I are
?Ca
= 79
The five digit numb€rs starting with 2 arc = 35
Number ofways = without considering sepamtion ofC - in Total=70+35=105
which all C' s arc together - in which exactly trvo C's are
together
.'. (105)s frve digit no. is 26789

15! l3t t2l 9. (r), (b), (c)

Considcr squarc of 2 x 2, in which we have '2' pair of
squares which have common vertex.
4. r), (b), (d) We have such 7x 7 squares of size 2 x 2
Clearly each playcr will play 9 games. And total number of So number of ways of selecting two squares having one
games-106r=45 vertex common is 7 x 7 x 2 = 98
s.240 Mothemolics

In each row or column we have '7'pairs of squares having and io+rr+...+r,=(rr-,?) ...(D
one side common. Put r, =/i + l, wher€/i > 0
of ways of s€lecting two squarcs having one side
So number
commonisTx8x2=l12 - to+yt+...yn r+-r,t(l+l+1.. + (,, - l)times)
=(rr.-n)
Therefore number of ways of selectirg two squarc such that
they neither have a common vertex nor have a mmmon side - xo+yt+,., yn-, + x,= m - n - (n - l)
is
ac,
- 98 - l12 = 1806 - xo+yr+... yn_t+xn=m-2n+ I
Now number of non-negative integal solutions,
r0. (r), (b), (c) n+t1(n-2n+D-tvur+l-l- _h-d+t?
We can take 0 identical and n disti[ct, I identical and l!-t
Since we can pennute n p€rsons in a! ways, thc rc4uired
distinct; 2 identical and rF2 distinct and so on.......
number ofways is

. + "C, = + z-r +l)!

. Total no. ofsolutions =
)r=0 2n (a) is true
(--.,,c.\l,t)=ffffi,r= (n-zn +t)l
No. ofpossible subsets of a set containing a elements is 2,
and
a* lco + a* lct + b * | C, +..- +b * g,= 22" 1 s. (a) If, is odd, then such an anangement is impossible.

+ (b) ard (c) a.e also Auc. Suppose n is evon. Let l, = 2k, where /< is some positive
integer.
ll. (a), (c)
Let ,o denotes tho oumb€r of empty seats io the left of the
The requircd number of selections of 4 letters flrstpair,-ri(l < i<t 1) the number ofempty seats between
= coe$. ofx! in the expansion of ith and (i + I )th pair and 4 the number of empty s€ats to the
(r0 +.rr) (-xo +rr +l) (ro +rr +l) G0 +.xt)
+rr) (r0 right of the t1h pair
= coeff. ofxa in (l + r)r (l + x + l;'? = 1g Note thatr(),,x,.> 0,-x, > l, (l <, < k l)
12. (b), (c) and .ro+rr+... +xr=(n-2k) ...(2)
toq The numb€r of [Link] solutions of(2) are is'- 1' lC,
lsee
* 'q r,
Totat required number oft€ams is = " l? the solution to (13)l
3!
Since we can p€rmute n persons in ,! ways, the rcquired
r0!
= _x_x
6! -t number ofways is
4lx6! 3!x 3!x3! (n-2k+l )!
=
toc. x tc, :2loo (*".'q Xzt)r= [!(,n -3r+l) ! (zk)l

(2k)l ts-2k+l
Linked Comprehension Type
(&) (nr -:rr +t) I
Panacnnpx 1: Foa Queslots 1ro 3 = (upr) (-ut,p)
l. (b) For ln and event there are 7 ways = ( P,,r) ( -,*, P,n)
2nd event there are 7 ways 6. (d) ,, is even. Irt m= 2t, where /. is some positive.
We can choose ,, s€ats out of the f seals to the left ofthe
8th event therc are 7 ways middle seat in lC, ways.
+ Total no ofways = ?8. Each chosen seat can be eithcr empty or occupied.
Thus, the number of ways choosing seats fou persons is
2.(a) l+ l+l+l+l+l+2=8 equal to 1tq1 1z).
Total number ofways =
8! xzt=28x5040 We car arrange r persons at these seats in
'P, ways.
' )l5l Hence, the required number of arrangements is giveo by
3.(b) ltl+l+l+lt3=8 (nt\ (kc,) (2') = (P,l (T) = (P,\(2\
I+I+I+ l+21-2=8 Pnnlcnapx 3: FoR QuEsnoNs 7 To 9
8!= lr7! 7. (b) When balls are different and boxes are identical, number of
Totat number ofwavs =
' l8! * distributions is equal to number ofdivisions in
L3!5t 4t(2t)' 2tl
{t
=266x7l.
5t

t,.2,.1,- 1r,.r1-
- .'
Plnacnapx 2: Fon Quesnous 4 ro 6 8. (c) When balls as well as boxes are idertical, we have only two
4. (c) [Link] denotes the number ofempty seats to the lefl ofthe frrst ways (1, 1, 3) and (1, 2, 2).
person. n, (l< i <r? Hence number ofways = 2.
-l)
the number ofempty seals betueen
the i'h and (i + I )'h persons of the zs person. Then ro. x, ) 0 9, (d) When boxes are kept in arow, they will b€ tseated as differcnt.
and .t, 2 I for I < i < ,r - l. In this case the number ofways will be cqual to
=5-tc:.-|=aC2=6
 iotion ond Combinolion s.241

(b) Select 4 pairs in 5Ca = 5 ways. Now select exactly one shoe
Matrix Match Type
from each ofthe pair selected in (2Cr)' ways.
This will fulfil the condition
(a)- (q) ; (b) - (p) ; (c) - (s) ; (d) - (r)
Requircd aNwer = 5 x 16 -80.
(a) -, (q) =
(c) The fim child C, cart be choscn 3 ways, hiyhq mother can
lf polygon has n sides, then number ofdiagonals
='C2 - r. : 35 (given), solving we get n 10 : be interviewcd in 5 ways, the second child C2 can be chosen
2 ways and hiyher mothcr can be interviewed in 3 ways.
Thus there arc l0 vertices, from which IoCr = 120 triangles Hence total numberofways= 3 x 5 x 2 x 3 = 90
can be formed.
(d) Required number of ways = 5!-4! - 3!
(b) J (p) = t20 - 64 - 6:90
Four vertices can be selected in loq = 216 ways. Using [Number will be less than 56000 only if eith€r 4 occurs on
these four vertices two diagonals can be formed- which has the frrsl place or 5, 4 occurs on the first two places.l
exactly one point of intersection lying inside polygo[. r6C.
4. (d) (p) For ,(P) = ,(,{), number ofways
Hence Numb€r ofpoints of intersections of diagonal which
^3 16^
lies inside the polygon roc! x I 210 = = nt P\> nb\ a--:--:!.
-
2
(c) -, (s)
A2 A3 (q) Every elcment has 2 options, then 28 : 256 ways.

rr) sc x6c. x 24 = !l1rlII^16= 56,,36*4

Ay
'22
(s) [Link] as (p)
5. (a) (p) The number of permutations which contain the word
.INDtA'
A4
(INDIA), N, O, L L
Number of ways = 5! 120 :
Suppose one of thc sides ofthe triangle is ,4r,4r, then third (q) Thc nwnber ofpermutations which contain the word 'Oll,l
venex cannot be lj or ,{lo. Thus for the third vertex 6 (orl), r, N, D, r, A, N
venices are left. Thus there 6 aiangles in which side lrl2 Number of ways = 7!12|2'l = 1260
is common with that of polygon. Similarly for each of the (r) The rumber ofpermutations which contains neither word
sides Al3, A1A4,...,llro there are 6 triangles. Then total
'OIU nor 'INDIA'
number of triangles are 60. L)
Total number ofpermutation ofall letters (UI NN D A O
(d) -+ (r) = 9v3t2t = 30240
I friangles A/zAr,A4y'l. .-.. A/y4ro have two sides Number of words which contains both words 'INDIA'
common with that of @lygon. Henca therc are I 0 zuch and IOIL'= 3!
triangles. So required number of ways
I

2.](r) - (n, I, r, s) ; (b) - (p, r, s) ; (c) - (q, r, s) ; (d) - (s) =9ll3l2l - 5l -7ll2l2l + 3l
= 28866
l(r) Number ofsurjective functions rC(3 2)6 = 729 192'3 = 540
I 3u -'C,(3 - l)6 + - - JEE ARCHIVES
( b) If/(a) t 6i, then pre-image ay ay a1 ce|irnot be assigned
images 6,, 6r, 6, respectively. JEE (Main)
Hence each ofar, a2, a3 can be assigned images in 2 ways.
a4, ar, a6 can be assigned images in 3 ways each. Srt'tcle Connrcr ANswER TYPE
Hence no. of functions = 2\3'= 216 l. (a)
l(c) Invertible functions are both one-one and onto which are Indians Foreigners Numher ofwavs
J ur,,
= rzo
2 .1
uc2"Ec4=lo5o
Number ofmany-one functions = tolalnumber offunctions 6c.,86u=566
Id) l 6
- number ofone-one functions
I 8
6co*66r=15
3. (r) - (q, s) ; (b) - (p, r) ; (c) - (p, r) ; (d)- (p, r)
Total number ofways = 1625
|(a) Case (i): 5, 4, l, l, I
{l 2. (d) x-w=t x3t
Numberofwals = ::= 20 *'-
I Ttree 2's can be distributed among x,1 z in ' 'C, - , -
Cas€ (ii): 5, 2, 2, l, I 5c, : lo t'uYs'

One 3 can be disaibuted among r, y, z in 3 ways.

11146", o1 ,rur.
' = -ll
2|2|
= 36
So, total number ofways = lO x 3 = 30.
Total number ofways = 20 + 30 = 50
s.242 Mothemoiics

(b) r= 5C,
3. " 3! = 60
),=t56ax3! =15x 14x lj=30x91
10.(b) 'P,=iP*, -;^=a5
:. 2y =91 x ? (r-r) = I ... (l)
4. (c) All the digits canDot be l. ,C,:NC,-I
Also, we catrnot have I, I, I, I, l, l, 2 or l, l, t, l, l, l, 3 -n-r+l=r
So, we must have at least orc digits 2 and 3. 1n+l=2r ... (2)
Case I : l, l, I, l,1,2,3 SolviDg ( I ) and (2), wc gct / =2

7l 11. (d) Total oumber oftriangles = l5C,

So, required number = =7 x6=42
5! l*t j
i + + k = l5 then possible values of ,;J' and ,t 8re as
Case II : 1, l,I,1,2,2,2 shown in the following table:
'l'!
So. reouired number
' = 4!3!-7x6x5 -3s k
6
I 2 t2
Tot2I = 42 + 35:77
I 3 lt
s. (d) -ll5
l+z=)ano l0
-+-=-.y>z
yzb I 4
I 5 9

I 6 8
+ n = 13352
', l0
So, oumber ofodd divisors = (3 + lX2 + l) = 12
2 4 ,
6. (d) a- Number oftriangles gpts
d=5x6x'l+6x7x9 A D
1 5 8

2 6 7
+7x9x5+9x5x6
3 4 3
=210+378+315+270 5pts Tpts ,7
3 5
= I173
,1 5 6
p= Number of quadrilaterals
B 6p," c
B:5x6"7x9=1890 So, number oft angles using the vertices Pi, P/, Pr such that
:. B - q= t89o - rr73 :'71'l +/ + l* l5 to t5ca
I is equal - 12 = 443
7. (c) Matches between boys ofboth tearns = 7Cr 4Cr
' = 28
Matches befween girls ofboth teams = "C, 6C, = 6a Nutrrentcal Vllu: Tvpe
Total number ofmatches = 52 l. (300)
..28+6n=52+n=4 3__= l0 x l0 = 100

8. (c) _3_:l0xl0=100
A
__3=10,10=100
Total numbe. of times 3 will be wriften is 300
2. (4)
Clearly,, = (2 - l)rr : I nn
BC w=(12-8)41=lu
Total Number oftriangles formed z=(7 -471t =36
- 14-
Ll- ,^Ll- 5^
Ll- 6^
Ll So, r,: (5 - 3)2! = 4

3. (316s0)

9. (a) Digits aro l, 2, 2, 3 If gloup C has one student then number of grcups

lt '0c,12'- 21 = 5166
Total number ofdistinct numbers = -i)l = t2 lf group C has two students then number of groups
Number ofnumbers cnding with I = 3 'ocr12t-21= 11436
Number ofnumbers cnding with 3 = 3 If group C has three students then number of groups
Number of numbers cnding with 2 = 6 =tocr " 121
_21= t'tz1
So, sum ofunitplace digitofall the numbers is3+9+ 12=24 So total [Link] : 31650
Tlrercfore, sum ofall the numbers 4.(32)l+2+3+4+5:15
=(3 + 12 + 9) (l0r + 102+ t0 + l) So, for three-digit numbers divisible by 3, two non-appearing
= 24 " llll = 26664 numbers will be (1, 2), (1, 5), (2, 4), (4, 5).
 )rmutotion ond Combinotion s.243

So, trlJmber of thre{igit numbcrs divisible by 3 -4 x 3l =24

Numben divisible by 5 cnds with digit 5. = 25oo -! 2'G+ 99) - 365 - 17

So, numbcr of thrcedigit numb€rs divisible by 5 = 4 " 3 = 12. = 2500 - 36s - t7 = t25t
- 867
Numberofnumbers divtible by 3 and 5 = 4 (345, 435, 135, 3 t5)
10. (720) fli\ + f(2):3 - f(3)
So, total number numb€rs = 24 + 12 - 4 :32
For 3' + 7' to be divisible by l0
- fii) + f(2) + fi3): 3
The ooly possibitity is that/(l), /(2) and /(3) take values
3' has unit placE digit 3, 9, 7, I accordingly as n = 4k - 3, 0, I and 2.
4k -2,4k - t,4k Elements l, 2, 3 in the domain can be mapped with 0, l,2
7" has unit place digit 7, 9, 3, I accordingly as n = 4k - 3, only in 3! ways.
4k -2,4k - t,4k Remaining frve elements catr be mapped io t! ways.
So, r can be any odd number So, total number offunctions - 3! x 5! = 720
.'. Number ofodd two digit numbers = 45
rr. (96)
6. 1000 )
2,4.6,8
I-et N be the four-digit number
G.C.D. (N, 18) = 3
=4x4x3\2=96
.'. /{ is an odd integer which is divisible by 3 but rot by 9.
12. (238)
Now 4-digit odd integers which are multiples of3 are
1005, l0l l, ..., 9999 -+ 1500 terms loth(5) 11'h(6) r2'h(8) Number of ways of selection
And 4-digit odd integers which are divisible by 9 are 2 2 6
5cr"6cr"tgu
1017, 1035, ... 9999 r 500 terms 5
scr" 6c, *9,
"
Hence number ofsuch : 1000 2 ) tcr'ucr""6,
7 7) TotIll 23 800
BQwlers (6) Batsmen (7) Wicket- No, ofways According to question, 100 f = 23800
Keepers (2) ofselection .. k=238
4 5 2
ucn x'c, x'cr= 315 r3. (490)
I 6c4 x1c6 xzcr= 2lo
4 6
f(n.n\=f(m).I@\
I 6c, x1c, xxc, - 252
5 5 Putm=1,
Total = 17'l :. f(n) = f(t) .f(n) =/(l) =I
Put m=n=2
8. (9)
l= 20
AL
IQ)= t&d f (4) =r
a(@ + l) ... (@+ 20) q+k
f(4\ = f(2). f(2)
I I f(2\=2and f(4\=4
(-l4X-13)... (- l) 0)...(6) l4!x6! Putm=2,n=3
ll wh€n /(2) =I
) 4 (-r) 0)...(5) l5l x 5l "/(3)=ltoZ
-1 I(6) = f(2). f(3)
(-13).. (-l)0) . (7) l3!x7! f(2) = 2
Aro
Ar.
=l4!xI 6!x(-13!x 7n=l=-1
14 2 /(5),/(7)
.f(3)=l or2or3
can take any value
Ars I 42 So, total number of functions

Ar.
=- I5!x5!x(-ll!x 7'l\=l5xl4 =!5 =(t x I x 7 x I x 7 x I x 7)+(l x I x3x I x7 xI x 7)

= 490
t00 4o +
Al ll
AB AB
= 100 --+-
25 r1. (924)
N=2ro,5ro * ltrr" ljrl
9 r) = 2to x (4+ I)r0 " (12 - l)rt ' (12 + l)tl
2O4o=2tx3x5x17 = 210 t (4ot+ t\ x (48+ (-1f) x (4y+ I ),
ofz and 2040 is l.
H.C.F. $tere m =1,2,3,..., ll
So, a should not be multiple of2, 3, 5 and 17.
So, for divisor of"4a + l" t),pe 'rr' must be ever.
Also, power of 2 must be zero and powers of 5 and l3 can
i.c. ,r is odd but not a multiple of 2, 3, 5 and 17.
be anything.
Sum ofall /,=(l+3+5t...+99)-(l+9+ l5+21 + +
So, number of divisors = I r (10 + l) x 6 x (13 + l) = 924
99) (5 + 25 +35 +55 + 65 +85 +95)-(17)
s.244 Mothemotics

ls. (136) 19. (s76)

tpr+2.2P"+3.3Pr+ ... + l5. rsPrs Lefters arc ( ,/, W, L, q, (O, q
=l!+2x2! +3 x 3!+...+ 15 x 15! Number of words in which coosona s are not together
l5 = Total number ofwords - Words in which all lhe consonants
= !,Lt'tr+ l-llr! are together
=61-3t4t=576
l5 20. (s r43)
= I - set of4-digit numbers divisible by 3
>t(r+l)!-(r)ll
,=1 = ( 1002, 1005, ... 9999)
=t6l-t=r6pr6-l 9999 = 1002 + (z - l)3

= q:r=16,s=l
{+'q-' = t?5" = 136
+ a=3000=z(l)
" I - set of 4-digit numben divisible by 7
16. (52) Case I : Unit place digit is '0' = { lool, 1008, ..., 9996}
(i) When'0'is at unit place + 9996 = r00l + (z- l)7

fTlrt
tt
= n= 1286= n(B)
I I = set of4-digi numben
^
divisible by 3 and 7 both

54 = ( 1008, 1029, ., 9996)

9996=1008+(z-l)21
Number ofnumbers = 20
Case II : Unit place digit is'4 or 6' a n=429=n(A^B)
(ii) When 4 or 6 arc at unil place So, number of numben divisible by either 3 or 7

ox I [Link]
/,(,{ t, B) = 3000
So,.equired set ofnumbers has 9000
+ 1286 - 429 = 385'l
- 3857 = 5143 numbeN.
.1 x,1
1 21. (77) Letters in atphab€tical order;1,4 F, M, R, R
Number ofnumbers = 32 No. of words starting with I but not contaidng RX

So, total number of numbers : 52 5l

= -4t=69-24=36
17. (100) 2l
No. of words starting with E but not containing Rjt
5 q b b a 5
5t
It is always divisiblc by 5 and ll. =::_4t=60_24=36
2l
So, rcquired number = l0 x l0 = 100
No. ofwords starting with FIE but not containing RR
18. (80) Numbers 3, 6, 9 are of3rz tyt€ 1l
Numbers l, 4 are of3/, + I type
21.
Numbers 2, 6 alc of3a + 2 q?e No. of words stating with Ii{Mbut not co aining RR
Number of subsets of S crntaining one element which is not 1l
divisible by3 :2Cr +2Cr =4 = =2l _2t =l
Number of subsets of S containing two numbers whose No. ofwords starting with.E4R, but not containing RX
some is not divisible by 3
=21=2
1cr x1c +1Ct x2c, +rCr+rcr=
= | 14
So, serial number ofwo.d, FA RMERis36+36+ | + I +2+ I ='17
Number of subsets containing 3 elements whose sum is not
divisible by 3
1c2xac JEE (Advanced)
=| + (2c2xzc) +1ct (2c1+2c) = 22
Number ofsubsets containing 4 elements whose sum is not Snele Connecr ANswER TYPE
divisible by 3 l. (d) Total number ofunordered pairs ofdisjoint subsets
=
t6rxnc, +'cr(2C2 +2cr1+ 211c r2c, x2c11 3o*l=41.
=
=4+6+12=22. 2
Number of subsets ofScontaining 5 elements whose sum is 2. (c) If'2'goes in 'l'then it is derangementof4 things which can
not divisible by 3. (t r r\ ways
be done in 4 rl l=9
---+-ll
- rcrl2cr+ 2c.1+
13c.2ct x2c?) x2 = 2 + 12: 14 \2! 4!,i
Number ofsubsets ofs containing 6 elements whose sum is If'2'doesn't go in 'l', it is derang€ment of5 things which
not divisible by 3 = 4 r
of digits is
Total subsets of set ,{ whose sum not
can be done in 5! Il_l_
\2! l!
*l)
4! 5!/ =44wavs.
=
divisibleby3=4+ 14+22+22+ l4 + 4:80. Hence, total 53 ways are there.
 utotion ond Combinotion s.245

3. (a) Number ofways = t'[Link], = rt6, - 31 = 391

= (selecting 4 girls and a captain) or For ca, Number ofways in which Cr is included and M, is
(selcctilg 3 girls and I boy aDd a captain) excluded
=6c4x 4 +6cax4ct x 4 = 4ct
5c2+ 4cz.5c, + acr= 4x + 39 14 14
=
= 380 Number ofways io which M, is iucluded and G, is excluded
= acz.5Ct acl=
4. (d) rvr + l{2 + .& + 1[ +.I{j + 34
= Total number of ways - Number of ways when no odd Nurnber ofways in which both G, and M, are excluded
ago+ agr. 59, + agr. sgr= 91
numb€r is selected =
Since only ayailable even numbers arc 2, 4, 6, 8; number of Hence, oq = 74 t 34 a 31 - 139
ways when [o odd number is selected is zero,
.'. &+ r+Nr+&+Nt=ecs-0=126 Nulaenrclr Vlrue Tvpe

TIPLE CoRRECT ANswERs TYPE

1. (5) Let (1, I, t), (-1, l, 1), (1, -1, l), (-1, -1, l) be vecto$

l. (a, b, d) 6, b, i, i . Rest ofthe vectors are -d,-8.-2.-l and let

a, =n(.S,) = l0 x l0 x l0 = 1000 us find the number of ways of selecting coplanar vectors.
n.= r(s.)= roc = I0x9x8x7-210 Observe that out of any 3 coplanar vectors, two will be
24 collinear (antipamllel)
nn = n(S) = l0x9x8x7 = 12x420 Number of ways ofselecting the sntiparallel pair = 4
... lt = oo Number ofways ofselecling thc third vector= 6
t2 Total = 24
For set 52 Number of non-coplanar selectiom =8C3 -24 = 32 = 25.
lf, : l, 2 thenJ € { l, 2, 3, ..., 8)
Ifl = 3 then/ E {2, 3, ..., 8} 2. (s) Number of red lircs = 'C2-,
Ifi:4 then/ E (3, 4, ..., 8)
Number ofblue lines = z
If , = 5 thenj € {4, 5, ..., 8}
Hence,nCr-n=n
Ilr:6 thenl € (5, 6, 7, 8) nC2= 2n
If, = 7 then/ e {6, 7, 8}
Ifr=Sthenj€ {7,8} n(r-t) ^
2
Ift=9thenJ € (8)
.'. No. of pairs (i,y)= 8 + 8 r 7+ 6+ 5+ 4+ 3+ 2 +I n-l=4+n=5
:44 = n, 3. (7) Possible solutions arc
Lrnxeo ColapnexeHstoN TYPE 1,2,3,4, t0
(b) dr= bn+ cr l,2,3,5,9
l,2,3,6,8
cr= AE2- an= aFt+ ahz 1,2, 4, 5,8
As or= l, ar= 2, ar= 3, an= 5, at= I + bu= 8 t,2,4,6,'l
2. a As an- ar-, + a,-, 1,3, 4, 5,7
fot h= l7 2,3,4,5,6
- an= a$+ a$ Henc€, 7 solutions arc there.

4. (s) For a
M x MATCH TYPE
B b 82, 4, 81, 85, (G t, G2, Gr G4 G5\
I (c) 6 Boys and 5 girls
Number ofarrang€meots =a = 5! x6!
cr = Number ofways ofselccting 3 boys and 2 girls
For m
= 6Cj x sC1= 2OO
First arrange 5 boys in 5! ways.
o6 = Boys and girts are equal and members are greater thao
ql
or equal to 2
I B,l B2T Bnf Bsl
6ct.'ct + 6co'5Cr+6cs'sc5 Now, we have to arrange 5 girls in such a way that group of
= 6ct .5ct t 6c2.3c.2+
four girls and the fifth girl are arrargcd in any two ofthe six
= 30+ 150+200+75+6=461 positions shown as arrows.
06 = Number of ways of selecting 5 members having at Two positions can be selected in
oC2
ways.
least 2 girls Four girls can be selected in
tcl ways.
= Total cases without afly r€striction Now, this group aad the fifth girl can be arranged in selected
- cases when no girl is selccted two positions is 2! ways.
cases whcrt exactly one girl is selected Also, four girls arrange among themselves in 4! ways.
-
s.246 Mothemotics

Hence, number of arrangements ='c, + 3'cr-'c,

=m= 5l x6c2\tclr<21\ 4l :4x35-21=119
=5! x 15 x2x5!
8. (30.00)
m 5!xI5x2x5!
Maximum number ofhats of same colour used is 2.
a 5*61
Let the hats us€d be it, R" G, G, B-
5. (5) According to questioir,,x = l0!
This can be selected in 3 ways. lt can be RGGBB or RRGBB
Now for y, we can select one letter which will be repeated also.
twice in loC, ways.
eC. Now, numbcr of ways of distributing blue hat (single one)
Remaining eight letters can be selccted in ways.
among 5 persons is equal to 5.
So- v=toc, xe6"[Link] Let tbe blue hat goes to person ,{.
"21
A
v roc xeG loxg
9x 9x2l 9x2 E B

6. (62s)
Number is divisible by 4 ifnumber formed by last two digits
is divisible by 4.
So, last two digits are 12,24,32,44,52.
D C
For each oflhe aboye cases, first three places can be fillcd in
5x5x5=l25ways.
So, total number ofnumbers = 5 ,, 125 = 625 Now, either the pair of8 and D gets $een hats and the pair
7. (lre) of C and E gets red hats or the pair of B and D gets red hats

n(n=5 and pair of C aad E gets gcen hats.

n(Y) = 7 So, two ways are possible.

c, = Number ofways ofselecting 3 boys and 2 girls Hcnc€, total number of ways = 3 x 5 x2 - 30
c = Number of one-one futrction &om set X to I 9. (49s.00)
= Numbcr of ways of selecting five images ftom seven Number ofways is equal to number solutioos ofthe equation
7C, x
images and then assigning to five preimages - 5!
.rt +.r2 + xl + ,a +.rj = 10,
P = Numbcr of onto fuoction f to X where .xr, .t, ) 0 aod x2, xr, rn ) L
= Numberofways in which all frvc images arc associated .', \ + yz+ y1+ ya+.r, = 8, where x,, yr, yr, yo,.t, 2 0
with seven preimages. t*t -'C,
So, number of solutionr =
= Number of ways in which seven different objects can -,
l2^
be distributed among five persons if each gets at least
one object 12xllxl0x9
4x3x2 =llx5x9=495
So, possible group sizcs for distribution are (1, t, l, l, 3) and
(t, t, t,2,2). r0. (r080.00)

Hence.6= l! xsl+ - 7!. *sr

' (l)"3!4!
Numbor ofpersons in rooms will be 2, 2, l, l.
(l!).,(2!)r3!2!
of*ur, = 6!
. P-a 1l '7'. t
So, required number x4!=1080
2t211!| 2l 2l
' '5! =]**tltrr-'ct