Chapter 9 | Permutations and Combinations | BMM10233 | 157 of 204

Fundamental Principal of counting

Ifajobcanbedoneinmdifferentwaysandanotherjobcanbedoneinndifferentwaysthenthetwojobscanbedone,
insuccession,inmndifferentways.
Permutations
Thenumberofwaysofarrangingnthingstakenratatimeiscalledthenumberofpermutationsofnthingstakenrat
atimeandisdenotedby
n
p
r
orp(n,r).
Supposetherearekseatsandnpeoplearetobearrangedinthesekseats.Notethatn kandtheseatshaveaspecified
order.Weneedtofindthetotalnumberofpossiblearrangementsorpermutations.
Inthefirstplaceanyoneofthenpeoplecansit.Foranygivenpersonsittinginthefirstseatanyoneoftheremaining(n
1)personscansitinthesecondseat.So,foreachofthenwaysoffillingupthefirstseat,thereare(n1)waysforfillingup
thesecond.Thus,totalnumberofwaysforfillingupthefirsttwo,seatsisn(n1).Foreachofthesen(n1)waystofill
upthefirsttwothereare(n2)waystofillupthethird,asanyoftheremainingpeoplecansitonthethirdseat.
Totalnumberofwaystofillupkseats
=n(n1)(n2)(nk+1)
Learning a new notation:
n(n1)(n2)2.1isexpressedasn!wherenisapositiveinteger
1!=1
2!=2 1=2
3!=321=6
Andbyconvention,0!=1
NowP(n,k)ornumberofpermutationsofnthingstakenkatatime
=n(n1)(n2)(nk+1)
n(n 1)(n 2) ... (n k 1)(n k)(n k 1) ... 3.2.1
(n k)(n k 1) ... 3.2.1
n!
(n k)!
+
=

=

[Alsonotethatp(n,n)=waysofarrangingnthingsamongthemselves
n! n!
n!
(n n)! 0!
= = =

]
Now,supposetherearekseatsandnpeoplearetobearranged,butk>n
Now,thefirstpersoncanoccupyanyofthekseats.Foreachpositionofthefirstperson,thesecondcanoccupyanyof
theremaining(k-1)positionssothefirsttwopeoplecanbeseatedink(k-1)ways.Proceedingthus,wefindthatthe
numberofpermutations
k
n
k!
P
(k n)!
= =

Preface
Permutations and Combinations
Chapter 9 | Permutations and Combinations | BMM10233 | 158 of 204
Solved Examples
Example: 1.
Inhowmanywayscan5postsbeassignedto5candidatesselectedafteraninterview?
Sol.:
ThepostcanbeassignedinP(n,k)ways,n=5;k=5
5! 5!
P(5, 5) 5! 5 4 3 2 1 120 ways
(5 5)! 0!
= = = =

Example: 2.
Findthepermutationsoffouralphabetsp,q,r,staken2atatime.
Sol:
Numberofpermutations=P(n,k),n=4,k=2
4! 4 3 2 1
P(n, k) P(4, 2) 12.
(4 2)! 2 1

= = = =

Note:Supposeoneobjectistobeincludedinallpermutationsofnthings,takenkatatime
Theitemthatistobealwaysincludediskeptinanyoneofthekplaces.Theremaining(n-1)thingscanbearrangedinthe
remaining(k-1)placesin
(n 1)!
p(n 1, k 1) ways.
(n k)!

Sincethisistrueforeachofthekpositionsoftheconstantarticle,totalnumberofpermutations
(n 1)!
k or k p(n 1, k 1)
(n k)!

.
Andnowsupposewerequirethenumberofpermutationsofnthingstakenkatatimewithonethingalwaysleftout.
Obviously,thisnumberisp(n-1,k).
Notethatp(n-1,k)+k p(n-1,k-1)=p(n,k)
Repetition of objects:
Supposewerequirethenumberofpermutationsofnthingstakenallatatime,butthenthingsarenotalldistinct,someof
them(kinnumber)aresimilar.Lettherequirednumberofpermutationsbex.
Now,ifallnobjectsweretobedistinctthenthenumberofpermutationswouldhavebeenn!.
Sincekofthesearesimilarandwecannotdistinguishbetweenthem,ifwetakeaparticulararrangementofthenobjectsand
interchangeanyofthesekobjects,westillgetthesamepermutation.Theseare,however,countedasseparatearrangements
inthen!arrangements.
We see that the k objects can be arranged within themselves in k! ways and so there will be k! repetitions in the n!
arrangements,foreachcombinationofthedistinctelements.Hence,togetthecorrectnumberofarrangementsweneedto
dividetheabovenumberbyk!.
n!
the number of ways
k!
=
Ifoutofnobjects,kobjectsareofonetypeandtheremainingn-kareofanothertypethenthenumberofpermutations
Chapter 9 | Permutations and Combinations | BMM10233 | 159 of 204
ofthenobjectstakenallatatimecanbederivedbyasimilarlogic
n!
(n k)!k!
Note: (i)Theaboveisvalidonlyforpermutationsofthenobjectstakenallatattime.
(ii)Numberofpermutationsofnthingsallatatimeofwhichpthingsarealikeofonekind,qarealikeofasecondkind,
rthingsalikeofathirdkindandsoonisgivenby
n!
x where p q r ... n
p!q!r!...
= + + =
Example: 3.
InhowmanywayscanthelettersofthewordINDIAbearranged?
Sol:
Thereare5lettersoutofwhichthereare2similaralphabets(twoIs).Hencethenumberofways
5!
60
2!
= =
Example: 4.
InhowmanywayscanthelettersofthewordMISSISSIPIbearrangedsothattwolettersM&Parenevertogether?
Sol:
NumberoflettersinMISSISSIPI=10,with4Ss&Is
Totalno.ofwaysinwhichtheletterscanbearranged
10!
4!4!
=
SinceMandParetobetogether,wetreatthemtogetherasoneletter.
Totalnumberofwords
9!
4!4!
=
(nowthereare9letterswithMandPbeingarranged)
However,foreachofthese
9!
4!4!
= ways,MandPcanbeinterchanged(MPandPM)
TotalnumberofwaysinwhichMandParesidebyside
2 9!
4!4!

=
TotalnumberofwaysinwhichthelettersMandParenevertogether
10! 2 9!
5040.
4!4! 4! 4!

= =

Permutations with repetition of positions

Supposetherearekposts,andtheytobenominatedfornpeople.Ifonepersoncanbenominatedforonlyonepost,then
thenumberofways
n!
.
(n k)!
=

Butifrepetitionisallowed,i.e.onepersoncanbenominatedtomorethanoneposts,then
thefirstpostcanbefilledinnways,thesecondpostcanalsobefilledinnwaysandsoon.
Totalnumberofways
k
n n ... n(k times) n = =
Notethatthelogicisnotthateachpersoncanbenominatedinkwaysandthereforenumberofways=k
n
.Donotcommit
thismistake.
Chapter 9 | Permutations and Combinations | BMM10233 | 160 of 204
Example:
Thereare3letterswhichhavetobeputinto4boxes.Inhowmanywayscanbethisdone?Eachlettercanbeputinany
ofthe4boxes.
Totalnumberofways=444=64.
Example: 5.
Howmanyfourdigitnumberswithdistinctdigitscanbeformedusing0,1,2,3,4,and5?
Sol.:
Thereare6digits.Aszerocannottakethesignificantplace,thethousand'splacecanbefilledwithoneoftheremaining5
digits,second,thirdandfourthplacescanbefilledupin6,5and4ways.Thereforetotalnumberofways=5654=
600ways.
Circular Permutation
Supposenpeoplearetobeseatedatroundtable.Ifallthenseatsarenumbered,markedorotherwisedistinguishable,then
thenumberofarrangementsissameasthatoflinearpermutationsi.e.n!.Howeveriftheseatsarenotdistinguishable,and
twoarrangementsaresameaslongasone'srighthandsideneighbordoesnotchangethentotalnumberofpermutations
is(n-1)!.Ascomparedtotheearliercase,thepositionsofindividualsmightchangehere,butisconsideredthesame
arrangementaslongasthepositionsofonerelativetoothersdonotchange.
Howevernotethatinthesecondcase,foreachrelativearrangement,therewillbeonemirror-image(intheanti-clockwise
direction)wheretherighthandneighborofeverypersonchangesintothelefthandneighbor.Ifthesetwoareconsidered
tobethesame,asinthecaseofflowersinagarland,thenthetotalnumberofarrangements
1
(n 1)!
2
=
Example:
Thereisaroundtableconferenceinwhich5delegatesareseatedaroundatable.
Inhowmanywayscantheybeseatedin5chairswhicharenotinanyorder?
Sol.:
Totalnumberofways=(5 1)!=4!=24.
Note that here the neighbors can exchange places - as long as the people are the same, the clockwise/anticlockwise
arrangementsdonotmatter.
Numberofpermutations=
1
24 12.
2
=
Combinations
Thenumberofwaysofselecting'r'thingsoutof'n'thingsiscalledthenumberofcombinationsof'n'thingstaken'r'atatime
andisdenotedby
n
C
r
orC(n,r)
Oncechosen,theserthingscanbearrangedinthemselvesinr!ways.
Totalnumberofarrangements=C(n,r)r!
Thisisalsothetotalnumberofpermutationsofnthingstakenatatime.
C(n,r) r!=P(n,r)=
n!
.
(n r)!
Chapter 9 | Permutations and Combinations | BMM10233 | 161 of 204
C(n,r)=
n!
.
r!(n r)!
NotethatC(n,n-r)=
n!
. C(n, r)
(n r)!r!
=

Thisisonlynaturalbecauseeachtimechoosingchooseagroupofroutof'r'things.Leavingleaveoutanotherof(n
r)sonumberofwaysofselectinggroupsofristhesameasthatof(n r).
Alsoifrepetitionsareallowed(supposewearechoosingone,puttingitbackintothepackandthenagainchoosingand
thenformingagroupbysuchsuccessiveselections),thenthenumberofselectionsofgroupsofrfromnthingsisC(n+
r 1,r)or
(n r 1)!
.
r!(n 1)!
+

Inotherwords,theaboveformulagivesthenumberofcombinationsofndifferentthingstakenratatimetakeneachofthe
nthingsmayberepeatedanynumberoftimes(r).
Useful Relations
(i)
n
r
p n(n 1)(n 2)...to 'r' numbers of factors =

7
3
e.g. p 7 6 5 (No. of factors r 3) = = =
(ii)
n
n
p n n(n 1)(n 2)...3.2.1 (No. of factors n) = = =
(iii) 0 1 =
(iv)
n n
n n 1
p p

=
(v)
n n 1 n 2 n 3
r 2 r 3
r r 1
p n p n(n 1) p ... n(n 1)(n 2) p

= = = andsoon.
indicatesthestartingfactors
so
n
r
P indicatesthenumberoffactors
(vi) n
n r
r
p n(n 1)(n 2)...to r number of factors
c
r r

= =
(vii)
n n
r n r
c c

=
(viii)
n n n 1
r 1 r r
c c c
+

= =
(ix)
n
r
n
r 1
c n r 1
r
c

+
=
(x)
n n
0 n
c 1 c = =
(xi)No.ofArrangementsforatleast
1
X =withoutrestriction-None
1
X
Chapter 9 | Permutations and Combinations | BMM10233 | 162 of 204
Where
1
X isaperson/objectunderrestriction,buttobeincludedinthearrangement.
None
1
X No.ofarrangementsif
1
X isabsent.
Thefollowingtableillustratestheaboveclassificationsandthesolutionstoeachclassification,whenasampleoftwo
object(r=2)aretakenatatimefromasetofthreedistinctobjects
1 2 3
{A , A , A } thatisn=3
Example: 6.
Acricketteamof11membersistobechosenfromsquadof16players.
(a)Inhowmanywayscanateambechosen?
(b)Inhowmanywayscanthebattingorderbedecided
Sol:
(a)Thisisacaseofcombinationsbecausetheorderinwhichtheplayersareselectedtoformtheteamof11isnot
important.Whatisimportantistheselectionof11playersfrom16
C(n,k)=C(16,11)=
16! 16 15 14 13 12
11!(16 11)! 5 4 3 2 1

=

=4368ways
(b)Heretheorderinwhichtheplayerswillbatisneededandhencepermutationsareused.
P(n,k)=C(11,11)=
11!
(11 11)!
=39916800ways.
Example: 7.
Atouroperatoroffersachoiceof6touristspotsoutof15optionsprovided.
(a)Howmanydifferenttouroptionsdoesatouristhave?
(b)Ifrevisitingplacesisallowedthenhowmanytouroptionsdoesatouristhave?
Sol.
(a)Numberofoptions=C(n,k);n=15,k=6.
C(n,k)=C(15,6)==5005options.
(b)SincerevisitingisallowedweusetheformulaC(n+r 1,r).
C(n,k)=C(n+k 1,k)=C(15+6 1,6)=C(20,6)=
20! 20!
6!(20 6)! 6!14!
=

=38760options.
Example: 8.
DifferentsignalscanbegeneratedbyarrangingBlue,RedandYellowflagsindifferentorders.Ifthereare2blueflags,2
Redflagsand5Yellowflags,howmanydifferentsignalscanbegeneratedusingalltheflagsatatime?
Sol.:
Totalnumberofflags=9ofwhich5areofonecolour,twoareofanotherand
twoareyetanothercolour.Therefore,totalnumberofways=
9!
756.
5!2!2!
=
Chapter 9 | Permutations and Combinations | BMM10233 | 163 of 204
Example: 9.
Inhowmanywayscan4personsbeselectedfrom9personsifaparticularpersonisalwaysselected?
Sol.:
Asonepersonisalwaysselected,wehavetoselectonlythreeoutoftheremaining8persons.Thenumberofselections
possibleis
8
C
3
=56
Note:Numberofselectionsofkfromnthings,whereonethingisalwaysincluded:afterincludingthatconstantthingwe
selecttheremaining(k1)fromtheremaining(n1)things.So,thenumberofselectionsisC(n1,k1).
Similarly,numberofselectionsinwhichonethingisalwaysexcluded=C(n1,k)
NotethatC(n1,k1)+C(n1,k)=C(n,k)
Example: 10.
Intheaboveexample,iftheselectionisforfourdifferentpostsofVP,MD,CEOandCFO,thenhowmanyselectionsare
possible?
Sol.:
Inthis,wehaveaproblemonpermutationssincepeopleneedtobeassignedtopostsandnotjustselected.
Requirednumberofpermutations4P(91,41)
=
8!
4 4 8 7 6
5!
=
=1344
Selecting 3 groups of K
1
, K
2
& K
3
from n people (such that K
1
+ ++ ++ K
2
+ ++ ++ K
3
= n) :
Weknowthatasweselectagroupofk
1
fromn,weautomaticallyleaveoutagroupofnK
1
=K
2
+K
3
Now,agroupofK
1
canbeselectedinC(n,K
1
)ways,Now,foreachoftheseselections,anothergroupofK
2
canbeselected
fromtheleft-outgroupofK
2
+K
3
peopleinC(K
2
+K
3
,K
2
)ways.Thisautomatically,alsoselectstheothergroupofK
3
people.
Totalnumberofways=C(n,K
1
)C(K
2
+K
3
,K
2
)
=
2 3
1 1 2 3
(K K )! n!
K !(n K )! K !K !
+

=
2 3
1 2 3 2 3 1 2 3
(K K )! n! n!
K !(K K )! K !K ! K !K !K !
+
=
+
Note:Theaboveisvalidwhenthegroupsintowhichpeopleareselectedaredistinguishable.Eithertheyshouldhave
namesorbenumberedortheycouldbedistinguishedbasedonthenumberofpeopleinthem.
Example: 11.
Thereare8peopleinabus.3getoffatthefirststop,2getoffatthesecondstopwhiletheremaininggetoffatthelaststop.
Howmanydifferentconfigurationsarethere?
Sol:
1 2 3
1 2 3
n!
C(n, k , k , k )
k !k !k ...
=
n=8,k
1
=3,k
2
=2,k
3
=(823)=3
1 2 3
1 2 3
n! 8!
C(n, k , k , k ) 560
k !k !k ! 3!2!3!
= = = differentconfigurations.
Chapter 9 | Permutations and Combinations | BMM10233 | 164 of 204
Example: 12.
Inhowmanywayscan6peoplebedividedintotwoteamsofthree?
Sol:
Thetotalnumberofwaysinwhich3peoplecanbeselectedfrom6isC(6,3)=20However,10ofthesearemirrorimagesof
theother10.SupposethesixpeopleareA,B,C,D,E&Fareputintotheotherteam;nowanotherselectionofD,E,Fis
redundant,andleadstodoublecounting.
1
Total number of ways = 20 10
2
=
Example: 13.
Inhowmanywayscan6peoplebedividedintotwocampsof3-onecalledtheleftistcampandothertherightistcamp?
Sol:
HereanswerisC(6,3)=20
BecausebychoosingA,B&CforleftistswouldmeanD,E&Fareintherightistcamp.AlsoselectingD,E&Fastheleftist
camp.So,thatA,B&Cgototherightist.Thesetwoaredifferentcasesandarecountedseparately.
Example: 14.
Findthenumberofdiagonalsofanoctagon.
Sol:
Anoctagonhas8points.Numberoflinesthatcandrawnbyselecting2pointsoutof8is
8
2
C
=28ways.Sinceanoctagon
has8sides,totalnumberofdiagonals=28 8=20
Example: 15.
IfPolygonhas44diagonals,thenumbersofitssidesare?
Sol:
n
2
c n 44 =
n=44
Example: 16.
AtrainisgoingfromMumbaitoPuneandmakes5stopsontheway.3personsenterthetrainduringthejourneywith3
differenttickets.Howmanydifferentsetsofticketstheymayhavehad?
(1)
15
C
1
(2)
15
C
2
(3)
15
C
3
(4)
15
C
4
Sol:
2 4 5 3 1
Mumbai Pune
Numberofticketsavailableat1=5
Numberofticketsavailableat2=4
Numberofticketsavailableat3=3
Numberofticketsavailableat4=2
Numberofticketsavailableat5=1
Sopersoncanhaveanycombinationofthreeticket,hence15c
3
Chapter 9 | Permutations and Combinations | BMM10233 | 165 of 204
Example: 17.
Thereare14pointsinaplaneoutofwhich4arecollinear.Findthenumberoftrianglesformedbythepointsasvertices.
Sol:
Numberofpoints=14
Noofcollinearpoints=4
Numberoftrianglesformedby14points=
14
C
3
Numberoftrianglesbyfourpoints=
4
C
3
Hence
14
C
3
4
C
3
.
Example: 18.
Inhowmanywayscan5membersformingacommitteeoutof10beselectedsothat
(i)twoparticularmembersmustbeincluded?
(ii)twoparticularmembersmustnotbeincluded?
Sol:
(i)Since2particularpersonarealwaysincluded
So,
outof80wehavetoselect3personsonlyItcanbedonein
3
8c .ways.
(ii)twoparticularnumbermustnotbeincludedsooutof8wehavetoselect5itcanbedonein
5
8c ways.
Example: 19.
Outof10persons,3arechosentoreceivethe1
st
,2
nd
and3
rd
prizesinacontest.Howmanydifferentpermutationsof
winnersarethere?
Sol:
For1stposition10personcanbeselected.
For2ndposition9personcanbeselected.
For3rdposition8personcanbeselected.
So,totalnumberofways10 9 8 = 720ways.
Example: 20.
GivenFivedifferentgreen,dyes,4differentbluedyesand3differentreddyes.Thenumberofcombinationofdyes.Which
canbechosentakingatleastonegreenandonbluedye?
Sol:
Totalnumberofwaysis 31 15 8 3720 =
Chapter 9 | Permutations and Combinations | BMM10233 | 166 of 204
1. Threeboysandthreegirlsaretobeseatedaroundatableinacircle.Amongtheboys,Xdoesnotwantanygirlneighborand
thegirlYdoesnotwantanyboyneighbor.Howmanysucharrangementarepossible?(AccessCode-01309001)
(1)6 (2)4 (3)8 (4)2 (5)9
2. Howmanywords,eachof3vowelsand2consonants,canbeformedfromthelettersofthewords
INVOLUTE?(AccessCode-01309002)
(1)2280 (2)2480 (3)2880 (4)2680 (5)2375
3. Howmanylinescanbedrawnthrough21pointsonacircle?AccessCode-01309003)
(1)310 (2)330 (3)410 (4)570 (5)210
4. Thereare6boxesnumbered1,2,...6.Eachboxistobefilledupeitherwitharedoragreenballinsuchawaythatatleast
1boxcontainsagreenballandtheboxescontaininggreenballsareconsecutivelynumbered.Thetotalnumberofwaysin
whichthiscanbedoneis(AccessCode-01309004)
(1)5 (2)63 (3)33 (4)21 (5)56
Directions for (Que. 5):Answerthequestionsonthebasisoftheinformationgivenbelow.
AstringofthreeEnglishletterisformedasperthefollowingrules:
(1)Thefirstletterisanyvowel.
(2)Thesecondletterism,norp.
(3)Ifthesecondletterismthenthethirdletterisanyvowelwhichisdifferentfromthefirstletter.
(4)Ifthesecondletterispthenthethirdletteristhesameasthefirstletter,
5. Howmaystringsofletterscanpossiblybeformedusingtheaboverules?(AccessCode-01309005)
(1)40 (2)45 (3)30 (4)35 (5)55
6. Whatistheremainderleftafterdividing1!+2!+3!+...+100!by7?(AccessCode-01309006)
(1)0 (2)19 (3)21 (4)14 (5)5
7. Acricketteamof11playersistobeformedfrom20playersincluding6bowlersand3wicketkeepers.Thenumberofways
inwhichateamcanbeformedhavingexactly4bowlersand2wicketkeepersis(AccessCode-01309007)
(1)20790 (2)6930 (3)10790 (4)360 (5)5870
8. Apolygonhas44diagonals,thenthenumberofitssidesare(AccessCode-01309008)
(1)11 (2)9 (3)7 (4)5 (5)12
9. Adepartmenthad8maleandfemaleemployeeseach.Aprojectteaminvolving3maleand3femalemembersneedstobe
chosenfromthedepartmentemployees.Howmanydifferentprojectteamscanbechosen?(AccessCode-01309009)
(1)112896 (2)3136 (3)720 (4)112 (5)893
Practice Exercise - 1
Chapter 9 | Permutations and Combinations | BMM10233 | 167 of 204
10. Therearethreeprizestobedistributedamongfivestudents.Ifnostudentgetmorethanoneprize,thenthiscanbedone
in(AccessCode-01309010)
(1)10ways (2)30ways (3)60ways (4)80ways (5)90ways
11. Howmanyparallelogramswillbeformedif7parallelhorizontallinesintersect6parallelverticallines?(AccessCode-
01309011)
(1)42 (2)294 (3)315 (4)452 (5)523
12. Howmanyfour-digitnumberseachdivisibleby4canbeformedusingthedigits1,2,3,4and5repetitionsofdigitsbeing
allowedinanynumber?(AccessCode-01309012)
(1)100 (2)150 (3)125 (4)75 (5)76
13. Inhowmanywaysisitpossibletochooseawhitesquareandablacksquareonachessboardsothatthesquaresmustnot
lieinthesameroworcolumn?(AccessCode-01309013)
(1)56 (2)896 (3)60 (4)768 (5)543
14. ThefigurebelowshowsthenetworkconnectingcitiesA,B,C,D,EandF.Thearrowsindicatepermissibledirectionof
travel.WhatisthenumberofdistinctpathsfromAtoF?(AccessCode-01309014)

B C
D
E
A F
(1)9 (2)10 (3)11 (4)12 (5)13
15. IndiaandPakistanplayonedayinternationalcricketseriesuntilanyoneteamwins4matches.Nomatchendsinadraw.In
howmanywaystheseriescanbewon?(AccessCode-01309015)
(1)35 (2)70 (3)105 (4)140 (5)165
SCORESHEET
Use HB pencil only. Abide by the time-limit
1
2
3
1 2 3 4 5
1 2 3 4 5
1 2 3 4 5
4
5
6
1 2 3 4 5
1 2 3 4 5
1 2 3 4 5
7
8
9
1 2 3 4 5
1 2 3 4 5
1 2 3 4 5
10
11
12
1 2 3 4 5
1 2 3 4 5
1 2 3 4 5
13
14
15
1 2 3 4 5
1 2 3 4 5
1 2 3 4 5
Chapter 9 | Permutations and Combinations | BMM10233 | 168 of 204
1. Mr.Iyerhasxchildrenbyhisfirstwife.Mrs.Reddyhas(x+1)childrenbyherfirsthusband.Theymarryandhavechildren
oftheirown.Thewholefamilyconsistsofchildren.Iftwochildrenofthesameparentsdonotfightbetweeneachother,then
findthemaximumnumberoffightsthatcantakeplacebetweenthechildren.(AccessCode-01309016)
(1)191 (2)210 (3)200 (4)300 (5)306
2. Inhowmanyways2differentnumberscanbeformedusingthenumbersbetween0and180(bothinclusive)sothat60is
theiraverage?(AccessCode-01309017)
(1)50 (2)60 (3)80 (4)90 (5)100
3. Findthenumberofwaysinwhich4squarescanbechosenatrandomonachessboardsuchthattheylieonadiagonal
line?(AccessCode-01309018)
(1)140 (2)182 (3)364 (4)256 (5)432
4. Twodifferentpacksof52playingcardsareshuffledtogether.Findthenumberofwaysinwhichamancanbedealwith26
cardssothathedoesnotgettwocardsofthesamesuitandsamedenomination.(AccessCode-01309019)
(1)
52
C
26
(2)
52
C
25
.2
25
(3)
52
C
26
.2
26
(4)
52
C
4.
2
4
(5)Noneofthese
5. Howmanytrianglescanbeformedbyjoiningtheverticesofapentagonsuchthatnoneofthetrianglessoformed,have
nosidecommonwithanyofthesideofthepentagon?(AccessCode-01309020)
(1)1 (2)0 (3)3 (4)10 (5)0
6. Sixxhavetobeplacedinthesquaresofthefiguregivenbelow,suchthatrowcontainsatleastonex.Inhowmany
differentwayscanthisbedone?(AccessCode-01309021)
(1)28 (2)26 (3)36 (4)29 (5)35
7. Atelegraphhas5armsandeacharmiscapableof4distinctpositions,includingthepositionsofrest.Findtotalnumber
ofsignalsthatcanbemade.(AccessCode-01309022)
(1)4
5
(2)5
4
(3)125 (4)250 (5)Noneofthese.
8. Thereare4lettersand4envelopes.(AccessCode-01309023)
(i)Inhowmanywaycanwrongchoicesbemade?
(1)4
3
(2)4!-1 (3)16 (4)4
4
-1 (5)15
(ii)findthenumberofwaysinwhichonlyonelettergoesinthewrongenvelope?
(1)4
3
(2)
4
C
1
+
4
C
2
+
4
C
3
+
4
C
4
(3)
4
C
0
+
4
C
1
+
4
C
2
+
4
C
3
(4)0 (5)16
Practice Exercise - 2
Chapter 9 | Permutations and Combinations | BMM10233 | 169 of 204
9. Whenreflectedinahorizontalline,BADbecomesBVD.HowmanythreeLetterwordscanbeformed(withorwithout
meaning)thatremainsunchangedbyreflectioninahorizontalline?(repetitionallowed)(AccessCode-01309024)
(1)343 (2)512 (3)729 (4)842 (5)Noneofthese
10. Ashopownerhasanunlimitedsupplyof8differenttypesofflowers.Ifacustomerasksforafiveflowerarrangementsuch
thatthearrangementshouldstartandendwiththesametypeofflower,theninhowmanywaysthearrangementcanbe
madebytheshopowner?(AccessCode-01309025)
(1)
8
C
4
3!
(2)8
3
(3)8
4
(4)
8
C
4.

4
C
1
.3!
(5)cannotbedetermined
SCORESHEET
Use HB pencil only. Abide by the time-limit
1
2
1 2 3 4 5
1 2 3 4 5
3
4
1 2 3 4 5
1 2 3 4 5
5
6
1 2 3 4 5
1 2 3 4 5
7
8
1 2 3 4 5
1 2 3 4 5
9
10
1 2 3 4 5
1 2 3 4 5
Chapter 9 | Permutations and Combinations | BMM10233 | 170 of 204
3. (1)
4. (3)
5. (5)
6. (2)
7. (4)
8. (2)
9. (3)
10. (3)
4. (2)
5. (4)
6. (5)
7. (1)
8. (1)
9. (2)
10. (1)
11. (3)
12. (1)
13. (4)
14. (2)
15. (2)
1. (5)
2. (2)
1. (2)
2. (3)
3. (5)
Answer Key
Practice Exercise -1
Practice Exercise -2