CHAPTER 1 Permutations and Combinations 1 Fundamental Principle of Counting (i) Multiplication principle If an operation can be performed in m different ways following which a second operation can be performed in n different ways, then the two operations in succession can be performed in mn ways. This can be extended to any finite number of operations. Example 1A college offers 6 courses in the morning and 4 in the evening, The possible numberof choices with the stud fhe wants to study one course inthe morning and one in the evening is (4 2 @ 10 12 Solution The student has 6 choices for the morning courses out of ‘which he can select one course in 6 ways. For the evening course, he has 4 choices out of which he can select one course in 4 ways. Hence, the total number of ways = 6 x4 = 24 Hence, (a) is the correct option Example 2 A person wants 10 go from station P to station R via station Q. There are 4 routes from P 10 Q and 5 routes from Q 10 R. In how many ways can he travel from P 10 R? @9 1 ©20 @n Solution He can go from P to Q in 4 ways and Q to R in 5 ways so mumber of ways of travel from P 10 R is 4 x $= 20 Hence, (c) is the correct option, Gi) Addition principle If an operation can be performed in 1m different ways and another operation, which is independent of the first operation, can be performed in n different ways. Then, either of the two operations can be performed in (m+n) ways. This can be extended to any finite number of ‘mutually exclusive operations. Example 3 A college offers 6 courses in the moming and 4 in the evening. The number of ways a student can select exactly one course, either in the moming or in the evening @6 m4 (©) 10 (24 Solution The student has 6 choices for the morning courses out of Which he can select one course in 6 ways For the evening course, he has 4 choices out of which he can select one in 4 ways Hence, the total number of ways = 6 +4 = 10 Hence, (c) isthe correct option Example 4 A person wants 10 leave station Q. There are 4 routes from station Q to P and 5 routes from Q to R. In how ‘many ways can he travel the station Q? @9 On ©20 @2 Solution He can go from, Q to P in 4 ways and Q to R in S ways He can leave station Q in 4 + 5 = 9 ways Hence, (a) is the correct option, | Factorials If nis a natural number, then the product of all natural numbers upto n is called factorial n anc denoted by nt or | Thus, n!=n(n—(n—2)..3-2+1 It is obvious to note that n=l (n—1)|n—2 =n(n—1)(n—2)|n—3ete. aa, | Permutation Each of the different arrangements which can be made by taking some or all of a number of things is called a permutation, 1 Counting Formulas for Permutation (2) Without Repetition (The number of permutations of n different things, taking r at a time is denoted by "P. or P(n,r). Then, "R=—"— rn) =n(n-D(1=2)..(n=r4+1), ne N and reW The number of arrangements of n different objects taken alla aime is "P, =n! 2 tRan, Rann haloes eeExample 5, The number of ways in which four ersons can si On six chairs is ei eee : (a) 24 O48 (360 Solution "p, Hence, (4) is the core! option, ©) With Repetition @® The number of ions time, p ae ans ee™atons Of things taken alata Gi) The number any number of times is 1 Esaropel OM Tnainenier ory that can be formed out of the {eters of the word ‘COMMITTEE: iy 91 9 oo oF wo Hence, (a) is the correct option Example 7 ‘4 boys when every boy can take one or more prizes? Inhov many ways can prize be dsributed among ROAR) 2500 56 (6).120- (4) 600 Solution Fin prize may be given to any one of the 4 boy, hence first prize can be distributed in 4 ways Similarly, every one of second, third, fourth and fifth prizes can also be given in 4 ways 4 The number of ways of their distribution 4x44 x44 = 45 1024 Hence, (a) is the correct option, (Gi) Number of permutations under certain conditions (@) The number of permutations of n different things ‘taken all together when r particular things are to be place at some r given places (b) The number of permutations of n different things taken r at a time when m particular things are to be placed at m given places (©) Number of permutations of n different things taken rata time when a particular thing isto be always included in each arrangement, is r-"“"P, (@) Number of permutations of m diterey taken rat a time when a particular hy taken in each arrangement is *p (©) Nomber of permutations of mein taken all ata time when m specified thins ang come together is m!x(n—m'+1)! (© Number of pcnaions OF» den yy taken all at atime when m spe come together is n!=m!x(n—m+1)! TR sn fied thing’ ey Frample 8 How mary diferent vords can be famed wn yg Sans othe word IAIPUR' which start with 6 and nda 7 @ 10 (20 wa a Solution After puting A and at thee respective places ony in one ha) wesall range the remaining 4 diferent leters span in 41 ways. Hence, the required number =I x4! =24 Hence, (4) isthe correct option, Example 9 How many diferen 3 leer words can be fomed iui eters ofthe word ‘JAIPUR’ when A and 1 are at tobe excluded? (24 ws 20 10 Solution After leaving A and 1, we are re 4 with 4 differen fetes which are to be used for forming 3 leter words Hence, the requited number Hence, (a is the correct option | Greular Permutation (2) Arrangement round a circular table The numberof GUA" Permutations of n different things taken all a tine 9 fires i clockwise and anti-clockwise orders an nies sifferent (0) Arrangement of beads or flowers all different) around ‘cireular necklace or garland The number of circlarpermunion ofn differen things akenallatatimeis + (1, ifclockwiseand 2 Aani-clockwise orders are taken as not daferent (©) Number of circular permutations taken rat a time ‘different things * Cate T If clockwise and ani-clokwse oes ae tana diferent, hen the eel mune ea pemutaions (Py * Case IIIf clocks and ant-ctockwie ond se taken a nt ferent, then th rated oni a ) Restricted circular permutation When, th recon in hear peer n en ee Perform the restricted part of the operation and then performExample 10 in how many ways can 4 beads out of 6 different ‘beads be strung into a ring? (as 24 (360 @d) 180 Solution In this case a clockwise and corresponding anti-clockwise ‘ordered will give the same circular p $2 65-43 mutation, So, the required number = 45 a2” 4.2 Hence, (a) is the correct option, Example 11. The number of ways in which 10 persons can sit ind a circular table so that none of them has the same neighbours in any two arrangements, is 10 persons can sit round a circular table in 9! ways. But here clockwise and anti-clockwise orders will give the same Solution neighbours. Hence, the required number of ways 4 Example 12 ‘ata round table so that no two girls may be together? In how many ways S boys and 5 girls can be seated i a steet tsi HS Salve Lesien Seeee ae ee a boy tos my be seated in 4! ways. Then, at remaining 5 sea 5 girls may sit in 5! ways. Hence, the required number = 41x! Hence, (b) is the correct option, 1 Combination Each of the different groups or selections which ean be made by some or all of a number of given things without reference to the order of the things in each group is called a ‘combination. | Difference between Permutations and Combinations [Problems of 1. Arrangements 2. Standing in tne seated in a row 3. Problems on digits 4, Problems on letters from a word Selections, choose Distributed group is formed Committee Geometrical problems 1 Counting Formulae for Combinations @ Selection of objects without repetition The number of ‘combinations of n different things taken r at atime is denoted i by "G, oF Corr) or |” CHAPTER = Permutations and Combinations | 107 (Osrsn) 7ii=7) "P_n(n—1Xn-2)..(n-r+)) FF er rere 202 I r>ny then *C Example 13 How many combination of 4 leters can be made out ofthe letters of the word JAIPUR"? wis ©) 30 (30 (4 Solution Here 4 things are o be selected out of 6 different things. So, the number of combinations caf 43 aad Hence, (a) is the correct option. Example 14 if C,="C, 9, then C, is equal to (a) 4896 (&) 816 (©) 1632_——(@) None of these Solution °C, =C, y+ r+(r-10)=20 18.17.16 C="Cs 320 Hence, (b) is the correct option. Example 15 How many different 4 leter words can be formed with the letters of the word "JAIPUR’ when A and I are always to be included ? m4 wa 2 @ 14 Solution Since, A and I are always to be included, so first we select 2 letters from the n‘C=6 ways, Now, these 4 letters can quired number = 6%24 = 144, Hence, (2) is the correct option. Gi), Selection of objects with repetition The total number of selections of r things from n different things when each thing may be repeated any number of times is"*"-'¢ « 10 be selected from pens of 3 colours (pens of each colour being available any number of times), then total number of selections is as () 90 ©1828110 | CHAPTER = Permutations and Combinations i {Important Results about Points If there are n Points in a plane of which m(A, © ‘PR @ 2. ‘The number of ways in which 6 rings can be worn on the four fingers of one hand is @ 4 ©) °c, © 6 (2) None of these 3. In how many ways can mn letters be posted in n letter boxes? @) (my" © (@, None of these 4. In how many ways can 10 true-false questions be replied? (@) 20 (b) 100 © 52 (@ 1024 5. How many even numbers of 3 different digits can be formed from the digits 12,3, 4,5, 6,7, 8,9 (repetition is notallowed)? (a) 224 () 280 (©) 324 (@) None of these 6. Four dice (six faced) are rolled. The number of possible outcomes in which atleast one die shows 2 is (@) 1296 () 625 © 671 (@) None of these Exercise Al 7. There are 4 parcels and 5 post-offices. In how many different ways the registration of parcel can be made? (@) 20 & 4 © s @ st 8. Inhow many ways students when every (@) 1024 © 120 9. The product of divisible by @ r in 5 prizes be distributed among four student can take one or more prizes? (b) 625 (@) 600 ‘any rconsecutive natural numbers is always © Fr (@) None ofthese Six identical coins are arranged in a row. The number of Nays in which the number of tals is equal tothe number of heads is (a) 20 © 120 11. The figures 4, 5,6, The number of num @ 2 © 9 © 10. ©) 9 @ 40 7,8 are written in every possible order nbers greater than 56000 is (b) 96 @ 98 {n how many ways can 10 balls be divided between {¥0_ boys, one receiving two and the other eight balls? (@ 4s ) 75 (© 9 (@) None of these 12,eer eense reac 13. 14. 15. 16. 17. 18. 19. 20. 21. 23. ‘The sum of all 4 digit numbers that can be formed by using the digits 2, 4, 6, 8 (repetition of digits not allowed) is. (a) 133320 (b) 533280. (©) 53328 (A) None of these In how many ways can five examination papers be arranged, so that physics and chemistry papers never come together? (31 (b) 48 (©) 60 (a) 72 How many numbers of five digits can be formed from the numbers 2, 0, 4, 3, 8 when repetition of digits is not allowed? (@) 96 (b) 120 (© 144 @ 14 The numbers of arrangements of the eters of the word “SALOON, if the two O's do not come together, is (@) 360 () 720 © 240 (@ 120 ‘The number of words which can be formed from the letters of the word ‘MAXIMUM’, if two consonants cannot occur together, is (@ 4! () 3x4! © 72 (@) None of these In how many ways n books can be arranged in a row, 50 that two specified books are not together? @ n-(n-2)! (b) (n=D-2) (©) nb2n-1) @ (n-2)n! The number of numbers that can be formed with the help of the digits 1, 2, 3, 4, 3, 2, 1, so that odd digits always occupy odd places, is (@) 24 () 18 © 12 (@) 30 How many words can be formed from the letters of the word ‘COURTESY’, whose first letter is C and the last letter is Y? @ 6! (b) 8! © 26)! (a) 2)! In how many ways 3 letters can be posted in 4 letter boxes, if all the letters are not posted in the same letter box? @ 68 (b) 60 ©7 (@) 81 How many words can be formed with the letters of the word ‘MATHEMATICS" by rearranging them? ul ut a to 05 @ ©) Fini @ How many numbers lying between 99 and 1000 be made from the digits 2, 3, 7, 0, 8, 6 when the digits ‘occur only once in each number? (@) 100 (b) 90 (©) 120 @ 80 In a circus, there are ten cages for accommodating 1 animals. Out of these four cages are so small that five ‘out of 10 animals cannot enter into them. In how many 25. 26. 27. 28. 29. 30. 31. 32. 33, CHAPTER « Permutations and Combinations | 111 ‘ways will it be possible (0 accommodate ten animals in these ten cages? (a) 66400 (b) 86400 (©) 96400 (a) None of these How many words can be made from the letters of the word ‘COMMITTEE"? @ 24 ay 1 O35 If @ denotes the number of permutations of x+2 things taken all ata time, b the number of permutations of x things taken 11 at a time and c the number of permutations of x—11 things taken all at a time such that a = 182 bc, then the value of x is (a) 15 () 12 (©) 10 @ 18 ‘The number of ways in which ten candidates Ay, AyyonAyq can be ranked such that A, is always above Ay is (@ 5! &) 260 1 © 10! @ 4aoy ) ) 500 ‘The total number of permutations of the letters of the word ‘BANANA’ is, (@ 60 () 120 © 720 (a) 24 How many numbers greater than 24000 can be formed by using digits 1, 2, 3, 4, 5 when no digit is repeated? (a) 36 (b) 60 (©) 84 @ 120 How many numbers greater than hundred and divisible by 5 can be made from the digits 3, 4,5, 6, if no digit is repeated? (a) 6 (b) 12 (© 24 (@) 30 ‘The number of 4 digit numbers that can be formed from the digits 0, 1, 2, 3, 4, 5, 6, 7, so that each number contain digit 1 is (a) 1225 (b) 1252, (©) 1522 (@) 430 Eleven books consisting of 5 Mathematics, 4 Physics and 2 Chemistry are placed on a shelf. The number of possible ways of arranging them on the assumption that the books of the same subject are all together is, @ 4 ) 1! (©) 5141312! (@) None of these ‘The number of words that can be formed out of the letters of the word "ARTICLE” so that the vowels ‘occupy even places is @ 36 © 144 (b) 574 (@) 754‘14 1 CHAPTER « Permutations and Combinations 73. 74. 75. 76. 77. 78. 79. 80. 81. 82. A father with 8 children takes them 3 at a time to the Zoological gardens as often as he can without taking the ‘same 3 children together more than once, The number of times he will go to the garden is (@) 336 (b) 112 © 56 (4) None of these The number of ways in which four letters of the word ‘MATHEMATICS’ can be arranged is given by (©) 1680 (@) 2454 The number of ways in which a committee of 6 members can be formed from 8 gentlemen and 4 ladies, so that the committee contains atleast 3 ladies is (a) 252 (b) 672 (©) 444 @) 420 A person is permitted to select atleast one and atmost ‘7 coins from a collection of (2n+1) distinct coins. If the total number of ways in which he can select coins is 255, then n equals: @4 8 © 16 @ 32 A student is to answer 10 out of 13 questions in an examination such that he must choose atleast 4 from the first five question. The number of choices available to him is (@ 140 (b) 196 (©) 280 @ 346 A student is allowed to select atmost 1 books from a collection of (2n+1) books. Ifthe total number of ways in which he can select one book is 63, then the value of @2 3 4 {@) None ofthese ‘The value of 5 <—— equals eof aot, ®) 1 6) 2 @ nt w4 © ane (@) None ofthese The value of "C,+3°*C, is @ *c, & *c, © *c, @ %c A student is to answer 10 out of 13 questions in an ‘examination such that he must choose atleast 4 from the first five questions. The number of choices available to him is @ 140 () 196 ©) 280 (a) 346 The mabe of angle th em oe by 5 pin ina line and 3 points on a parallel line is @ 'G @) 'G © 'G- 1 (4) None of these 83. 84, 85. 86. 87. 88. 89. 90. 91. 92. ‘The number of diagonals in a octagon will be (a) 28 (b) 20 © 10 @ 16 If a polygon has 44 diagonals, then the numberof jy sides are @7 (b) 1 O8 (@) None of these How many triangles can be formed by joining fo Points on a circle? @ 4 () 6 Os @ 10 es can be drawn by means of 9 nop. How many trian collinear points? (a) 84 © 144 ‘The number of di &) 72 @) 126 sonals in a polygon of m sides is 1 m(n-5) &) Smm—1) mom —2) 1 ©) mim 3 @ (© mom—3) The number of straight lines joining 8 points on a circle @s (b) 16 (©) 24 (@ 28 The number of triangles that can be formed by choosing the vertices from a set of 12 points, seven of which lie on the same straight line, is (a) 185 (b) 175 @ us (@) 105 Im a plane, there are 10 points out of which 4 are collinear, then the number of triangles that formed by joining these points are 60 (b) 116 © 120 (@) None of these ‘The stright lines /,,/, and J, are parallel and lie inthe same plane. A total number of m points are taken on 4, and points on 1, and k points on. The ‘maximum number of triangles formed with vertices at these points are GG, 8 ¢, ) G="c) © "Q+HC,HC, (@) None of the above The number of parallelograms that can be formed from 4 set of four parallel lines intersecting another set of three parallel lines is @ 6 (b) 18 © 12 993. Six points in a plane be joined in all possible ways by indefinite straight lines and if no two of them be coincident or parallel and no three pass through the saine point (with the exception of the original 6 points). ‘The number of distinct points of intersection is equal to (a) 105 (b) 45 © SI (A) None of these 94, There are m points on a straight line AB and n points ‘on another line AC, none of them being the point A Triangles are formed from these points as vertices when (i) Ais excluded (ii) A is included. Then, the ratio of the number of triangles in the two cases is ( min=2 (wy mena2 m+n 2 m+n-2 ‘ (4) None of these Ors (@) None of thes 95. There are n straight lines in a plane, no two of which are parallel and no three pass through the same point Their points of intersection are joined. Then, the number of fresh lines thus obtained is (a) na DMe (oy Men=Din=2)in=3) 8 6 () MORDRR 29) (a) None of these 3 96. A parallelogram is cut by two sets of m lines parallel to its sides. The number of parallelograms thus formed is @ Coy ) "CY © (?C,)* (d) None of these 97. Ina plane, there are 37 straight lines of which 13 pass through the point A and 11 pass through the point B. Besides no three lines pass through one point, no line passes through both points A and B and no two are parallel. Then, the number of intersection points the lines have is equal to (a) 535 (©) 601 © 728 (@) None of these 98. The greatest possible numberof points of intersection of 8 straight lines and 4 circles is @ 2 @) 64 ©) 76 (@) 104 99. Out of 18 points in a plane, no three are in the same straight line except five points which are collinear. The number of () straight lines (i) triangles which can be formed by joining them is G (@) 140 (b) 142 (6) 144 (4) 146 Gi) (a) 816 (6) 806 (©) 800 (4) 750 100. There are 16 points in a plane, no three of which are in a straight line except 8 which are all ina straight line. The number of triangles that can be formed by joining them equals (a) 504 (b) 552 (©) 560 (@ 1120 CHAPTER « Permutations and Combinations f 115 101. Let 7, denote the number of triangles which can be formed using the vertices of a regular polygon of sides. If T,,,~T,=21, then n equals @ 5 (7 ©) 6 (d) 4 102, There are n points in a plane of which p points are collinear. How many lines can be formed from these points? @ PC (b) "G-"G © "G-'G, +1 @ "CG, -"C,-1 103. Given six line segments of lengths 2, 3, 4 5, 6, 7 units, the number of triangles that can be formed by these lines is (@) °C-7 ) SC,-6 (© °G-s @ %c,-4 104, A polygon has 35 diagonals, then the number of its sides is @ 8 9 © 10 @u 105. The number of straight lines that can be formed by joining 20 points no three of which are in the same straight line except 4 of them which are in the same line (a) 183 (b) 186 © 197 (@ 185 106. In how many ways can & 16 be divided into 4 persons ‘when none of them get less than 32 (a) 70 (b) 35 (©) 64 @ 192 A set contains (2n+1) elements. The number of subsets of the set which contain at most n elements is @ 2 & 2 © @ 108. The number of divisors of 9600 including 1 and 9600 (a) 60 () 58 © 48 (@) 46 109. The number of ordered triplets of positive integers which are solutions of the equation x+ y+ 2=100 is 107. (a) 6005 (b) 4851 (©) 5081 (d) None of these 110. If a,b,c,d ande are prime integers, then the number of divisors of abcde excluding 1 as a factor, is (a) 94 (b) 72 (©) 36 @ 71 111. An n-digit number is a positive number with exactly digits. Nine hundred distinct n-digit numbers are to be formed using only the three digits 2, 5 and 7. The smallest value of 1 for which this is possible is @ 6 () 7 ©8 @9| ME cer, Permutations and Combinations | M2. Number of eo SS = 2888 xan phe. ») 68 113. Thee ee There isa Qm=1)x(2n-1), (where motes oot dimension + (where m>0.n>0). It has been into squire of unit area ty raving eTendcuar othe side. Pind nua et having sides of odd unit length. 2 @) (msnsty © ann2 114. The number TRIANGLE can be arra not occur together is (@) 1200 (©) 14400 11S. There are four balls of diffe (b)-mnim+1yin+1) @) mn? (b) 2400 (@) None of these colour is, @ 8 ) 7 9 (@) None of these 116. Ten different letters of an alphabet are given. Words with five letters are formed from these given letters ‘Then, the number of words which have atleast one repeated is, (a) 69760 (b) 30240 (©) 99748, (b) None of these 117. The number of ways of dividing 52 cards amongst four players, so that three players have 17 cards each and the fourth player just one card, is 521 @ ) ‘4 a7y> 32! st (@) None ofthese © 2 118. The number of ways in which the letters of the word “ARRANGE can be arranged such that both R do not come together is (@) 360 (©) 1260 (&) 900 (@) 1620 119. A box contains two white balls, three black balls and four red balls Ip how many ways can thre balls be drawn from the box, if atleast one black ball is to included in the draw? (a) 64 © 46 ) 45 (@) None of these 120. ‘of ways in which they can be seated is of ways in which the letters of the word inged such that two vowels do rent colours and four boxes Of colours same as those of the balls. The number of ‘ways in which the balls, one in each box. could be Placed such that a ball does not go to box of Its own are to be seated in a row, so that ‘m men and n women shat no two women sit together. If m>n, then the number 121. 122, 123. 124, 125, 126. 127. 128. 129. 4) mMm= (mney () PADMA (a) None of these Gn=n+)! {A five digit number divisible by 3 has to fomed yy the numerals 0,12 3.4 and § witout repens total number of ways in which this cam be done (@ 216 ) 240 © 600 @ 30s The numer of times he digit 3 wil be writen ty listing the imeges from 1 t0 1000 is (a) 269 (®) 300 © m7 (@ 302 Ten persons, amongst whom are A, B and C10 speak a 4 function. The number of ways in which it canbe dng if A wants to speak before B and B wants to spah before Cis w 1 wan : © "RT (d) None of these the word INDEPENDENCE whcwma el co a0 0 1460 boxes of different sizes. Each box can hold all five balls. In how many ways can we place the balls so tha ‘no box remains empty? (a) 50 (b) 100 © 150 (a) 200 How many words can be made from the leters ofthe word “BHARAT in which B and H never come together? (a) 360 (b) 300 (©) 240 @ 120 ‘There are 10 persons named A, B,..,J.We have the capacity to accommodate only 5. In how many ways ‘can We arrange them in a line, if A is must and G and 4H must not be included in the team of 5 @ "2 "2 © 7p @ "G5 ‘The number of times the digit Swill be written when listing the integers from I to 1000 is, @ 27 () 27 (©) 300 (@) None of these ‘The total number of different combinations of one of ‘more letters which can be made from the letters of the ‘word ‘MISSISSIPPI’ is (@) 150 © 149 (&) 148 (@) None of these —<$130. A person goes in for an examination in which there are four papers with a maximum of m marks from each Paper. The number of ways in which one can get 2m marks is @ ™C, () Flor (2m? +4m+1) (©) Lome (2m! +4m23) (@) None of the above 131. There were two women participating in a chess tournament, Every participant played two games with the other participants. The number of games that the ‘men played between themselves proved to exceed by 66 the number of games that the men played with the ‘women. The number of participants is (a) 6 ) 11 © 13 (A) None of these 132. A father with 8 children takes them 3 at a time to the Zoological gardens, as often as he can without taking the same 3 children together more than once, The number of times each child will go to the garden is (a) 56 (b) 21 © 112 (a) None of these 133, A library has a copies of one book, b copies of each of two books, c copies of each of three books and single copies of d books. The total number of ways in which these books can be distributed is (atb+e+d)! (a+2b+3c+d)! sat © os © albic! alone) ) BAD! (a) Noncof hese 134. A car will hold 2 in the front seat and 1 in the rear seat. If among 6 persons 2 can drive, then the number of ‘ways in which the car can be filled is (a) 10 (b) 20 (©) 30 (a) None of these CHAPTER « Permutations and Combinations | 117 135. There are (n+l) white and (+1) black balls each set numbered 1 to n+1, The number of ways in which the balls can be arranged in a row, so that the adjacent balls are of different colours is (@) Qn+2)! (b) (2n+2)!x2 @ Aa+yr How many numbers between 5000 and 10000 can be formed using the digits 1, 2,3, 4, 5, 6, 7, 8, 9 each digit appearing not more than once in each number? (a) 5x'R (b) Sxtc, (©) SIx*R (@) SIxtCy (©) (+) 1x2 136, 137. If x,y and rare positive integers, then *C,+ 1G 4CGtnt is equal to OPA MOE, 138, The number of positive integral solutions of abc = 30 is () 30 (b) 27 os (@) None of these 139. How many different nine digit numbers can be formed from the digits of the number 223355888 by rearrangement of the digits, so that the odd digits ‘occupy even places? (a) 16 (b) 36 © 60 @ 180 140. A dictionary is printed consisting of 7 lettered words only that can be made with a letter of the word “CRICKET. If the words are printed at the alphabetical order, as in an ordinary dictionary, then the number of ‘word before the word ‘CRICKET” is (a) 530 (b) 480 © 331 @ 8 as‘18 | CHAPTER » Permutations and Combinations (64241) =182 > 27. (a) Without any restriction, the 10 persons’ can be ranked among themselves. in 10! ways; but the ‘number of ways in which 4, is above Ay and the ‘number of ways in which A, is above 4, make up 101. Also, the number of ways in which A, is above ‘Ap is exactly same as the number of ways in which ‘Ag is above A, Tero, requis minterot ways = 28, (4) To mabe of eomttions = = 60 29. (c) The digits are 1, 2, 3, 4, 5. We have, to form number seater than 24000, Required number = (Total) ~ (Those beginning with 1) = (Those beginning with 21) ~ (Those beginning with 23) = 5! -31-31=120-24-6-6 = 84 30, (b) Numbers which are divisible by 5 have °S" fixed in extreme right place 3 digit numbers 4 digit numbers eT Us |The HT ou RES olxrux ox 5 P, ways 5p, ways = = 3x2 0 =Total ways = 12 (@) After fixing 1 at one position out of 4 places, 3 places ‘can be filled by 7 P, ways. But some numbers whose fourth digit is zero, so such type of ways = °P, 2. Total ways = ’P ~SP, =480 (©) Possible ways = 5!-4!-3!-21 sm de scab eee © be arranged in 4 odd places in *R, ways, Hence, required no, of ways= *R, x 47, = 144 34. (©) Words staring with A,C,H.1LN are each equals 105! ‘ Total words = 5x5! = 600 ‘The first word starting with Sis SACHIN. SACHIN appears in dictionary at serial number 61. Given, set of numbers is (1, 2, «. 11) in which 5 are even six are odd which demands that in the given product it is not possible to arrange to subtract only even number from odd numbers, There must be atleast ‘one factor involving subtraction of an odd number form another odd number. So, atleast one of the factors is even. Hence, product is always even, Total number of ways to distribute one * 100 note, and five other notes =3° Required number of ways =91x2 (By fundamental property of circular permutation) 4! ©. © © 38. (@) Required numberof ways = $(5-1) 2 are same in (Since, clockwise and anti-clock case of ring) Here, A, B and C is grouped so to arrange 10 on circular table => 9! age 39. (@) Now, A, B and C can be arranged in 3! ways, - Total arrangements =9! x3! 40. (a) Since, total members are 15, but one is to left, because of circular condition, therefore remaining ‘members are 14 but three special member constitute a member. Therefore, required number of arrangements are 12!x2, because chairman, remains between the tWo specified persons and the person can sit in two ways, ‘There are 20+1=21 persons in all, The two particular persons and the host be taken as one unit, so that these remain 21~3+1=19 persons to be arranged in 18 ! ways. But the two person on either side of the host can themselves be arranged in 2! ways. Hence, there are 2118! ways or 2-18! ways. 41.)120 | CHAPTER « Permutations and Combinations 42. 45. 47. 49. 50. 51. 52. 53. (@) (b) _mumber of arrangement will be 7! @) @ © © ©) © @ ©) @) 0) Fix up a male and the remaining 4 male can be seated in 4! ways. Now, no two female are to sit together and as such the 2 female are to be arranged in five empty seats between two consecutive male and number of arrangement will be °P;. Hence, by fundamental theorem, the total number of ways Bats Fix up | man and the remaining 6 men can be seated in 6! ways. Now, no two women are 10 sit together and as such the 7 women are to be arranged in seven empty seats between two consecutive men and Hence, by total number of ways fundamental theorem, the 71x61 Number of ways in which 6 men can be arranged at around table = (6-1)! Yiu a ju Nd Now, women can be arranged in 61 ways, Total number of ways = 6! x 5! "C, (maximum) Mw M +1 7 nis odd 2 Fee ee eg aR REA a OCG 126 On solving, we get = Bae 2°C) 51°C, 66= n(n It is obvious and can be checked by putting the values. Since, other three sets do not hold good. HC, IC, Since, " , and "C we have Bach question can be answered in 4 ways and all questions can be answered correctly in only one 4-1=63 way, $0 required number of ways = 2.C, (Since, two students can exchange cards ‘each other in two ways) 54, 55. 56. 57. 58. 59. 60. 61. 63. © @ © @ (a) ©) (b) ces for teeth. For each place iy reve two choices either there is @ {00th oF thre have oun, Therefore, the number of Ways 0 filly, these places is 2°. As there is M0 PETSON witht 2 tooth, the maximum population is 2° ~1 mG, 1G > Gy We have 32 pla "C,4°Cy> (asi SLM 2 Gea! (nt)! GENS, oe 6 e n-4>6 > 0 >10 Hence, according to options 7 = 1 Required number of ways IG HOHGH CHC 8+ 28+56+70+56 = 218 (Since, voter may vote (0 one two, three, four or all candidates), Let there are » candidates, then NHBC tot Cys = 254 = 2-2. 8 > ‘The letters can be sélect in °C, x*C, ways ‘Therefore, the number of arrangements are 6C,x4C,) 5! i Fete herncseyeel 75 X19, XC) XC 7S C,x7C, x°C Ox; 1. Ot 6 eae a xis BS as)! a 31 11"31-91 asta oy 3! 31-61 Required number of ways BGA SMC ENmc,, RUC 32! 26! “bas! Required number of words 6C,98C, x11= 756000 39! “301x131” 261x1 (Selection can be made in °C, x°C, while he 7 eters: be arranged in 7!) ‘The arrangement can be make as totetttt. fie, the (=) signs cam be put in7 vacant (pointed) place Hence, required number of ways =7C, =35 Alteast one green ball can be selected out of balls in 2°1 ie,, in 31 ways. Similarly, atleast ‘one blue ball can be selected from 4 blue balls i ail 15 ways and atleast one red or not red cal be select in 2°=8 ways ee, required number of ways 1x15 x8 =3720 $$ ———— er64, (@) Required number of ways =O x9, 44C, xO, +4, x1C +40, x" x 56+6X70+4x56+1% 28 = 896 65. (a) A voter can vote in *C, #5C, +9C, = 25 ways 66. (a) 5 persons are to be seated on 8 chairs i.e., "Cy x5! or 6720. (Since, 5 chairs can be select in persons can be arranged in 5! ways) ’s and, then 5 67. (b) First omit two particular persons, remaining 8 persons may be 4 in each boat. This can be done in “Cy ways. The two particular persons may be placed in two ways one in each bost. Therefore, total number of ways = 2x*C, 68. (c) The required number of words =0Gx'¢, #0, x¢)3 69. (c) Four letters can be selected in the following ways (i All different iz, C,0,R,G. (Gi) 2 like and 2 different. iii) 3 like and 1 different i, three O and 1 from R, G and C. ‘The number of ways in (i) is *C, = ‘The number of ways in (i) is 1-°C, =3 ‘The number of ways in (ii) is 1x°C, =3 Therefore, required number of ways = 1+3+3=7 70. (a) There can be two types of numbers Any one of the digits 1, 2,3, 4 repeats thrice and the remaining digits only once ie., of the type 1,2, 3,4, 4, 4 etc il) Any two of the digits 1, 2, 3, 4 repeat twice and the remaining two only once ice, of the type 1,2, 3,3,4, 4ete Now, number of numbers of the (i) type afte, 31 Number of numbers of the (i) type 6! 4 “an Therefore, the required number of numbers = 480+ 1080 = 1560 71. (b) The total number of two factor products =""C, The number of numbers from I to 200 which are not multiples of Sis 160. Therefore, total number of two factor products which are not multiple of 5 is We, Hence, the required number of factors wc KC. = 7180 CHAPTER « Permutations and Combinations | 121 72. (a) Since, the total number of selections of r things from n things, where each thing can be repeated as ‘many times as one can, is ""’'C,. ‘Therefore, the required number =*"*"'C, = 28 73. (c) The number of times he will go to the garden is same as the number of selecting 3 children from 8, ‘Therefore, the required number = °C, = 56 74. (d) Word ‘MATHEMATICS’ has 2M, 2T, 2A, H, EI, C, S. Therefore, 4 letters can be chosen in the following ways Case 12 alike of one kind and 2 alike of second kind ie.,3C, = number of words 0,4 18 Case 112 alike of one kind and 2 different (lon Ae => number of words Case IIL All are different ie., °C, ‘umber of words ="C, x41= 1680 Hence, total number of words are 2454, 75. (a) There can be two types of committees (i) Containing 3 men and 3 ladies (ii) Containing 2 men and 4 ladies +. Required number of ways, = CC, x4C) +00, x4C,) = 252 76. (a) Since, the person is allowed to select at most n coins out of (2n+l)coins, therefore in order to select one, two, three, ...,m coins. Thus, if T is the total number of ways of selecting one coin, then THC PC, + NC, = 255 fi) Again the sum of binomial coefficients SMC CC + MC, IC, Cg tat Cy = 4 DBS 3 Ey 20g IG tC) mic, a2! = 1427) +1 = 2" > 1 = 14255= 2" 2 = Pon=4 77. (b) As for given question two cases are possible. (i) Selecting 4 out of first 5 questions and 6 out of remaining 8 questions choices i) Selecting 5 out of first 5 questions and 5 out of remaining 8 questions =°C,x*C, = 56 choices. Total number of choices = 140 +56 = 196| 122 | CHAPTER « Permutations and Combinations 78. (b) Since, the student is allowed to select at most books out of (n+) books, therefore in order t0 select one book he has the choice to select one, 10, three, . 1 books Thus, if Tis the total number of ways of selecting ‘one book, then TEC eC SAC R63) ‘Again, the sum of binomial coefficients mG, GC, 4 MC C,, mic att Cana =e a2 or mG, 420"1G 420, 4.4 IC, eet 80. 81 82. 83. a4. 85. 86. Yrtlee ads RRR [+2404 (sD 2 (b) *C, +(%C, +510, + 0, +..+ °C) Taking first two terms together and adding them and following the same pattern, we get Bo, (ASC, +°C.4= (a) Number of ways for select 4 questions out of 5 questions Number of ways = °C, Remaining questions = 8 Remaining questions for solving = 6 Number of ways *C, = 28 =5x28 =140 Number of total ways =°C, x°C (©) The required number of ways ="C, (Since, total points are 8, but 5 are co other three are also collinear) (b) Required number of ways are "C, ~ (b) Since, "C,—n=44->n=11 (a) Required number of ways = *C, (a) The number of triangles are 89. 91. 92, 93. 94, © @ @ o) ) © © @) quired number of diagonals ="C,—m mm—D y= im Taal 3"-3) Required number of ways *C, = 28 Required number of ways =!"C~"C, = 220-35=185 les Required number of trian 2!¢, 1G, =120-4=116 ‘otal number of points are m+ n+k, the yy formed by these points =""""'Cy Joining 3 points on the same Tine gives no tring such A's are "C,#"C, +1Cs Required number =""""*C, Required number of ways =*C; x°C, ‘Number of lines from 6 points = °C; Points of intersection obtained from these lines 5, =105 Now, we find the number of times, the origina points come, Consider one point say A,. Joining A, to remaining 5 points, we get 5 lines and any two lines from these 5 lines give A, as the point of intersection A, come times in 105 poims of intersections. °c, =10 Similar is the case with other five points. 6 original points come 6%10= 60 times a points of intersection, Hence, the number of distinct points of inter =105-60+6=51 Case When A is excluded Number of triangles = Selection of 2 points fot AB and one point from AC+ Selection of om Point from AB and two points from AC ction 1 a "EG, + (m-+n—2)mn Case II When A is included. The triangles with one vertex at A= Selection of fone point from AB and one point from AC = Number of triangles 1 mn + mn(m-+-n=2) 1 =Smnin+n) a Required ratio = @"+n=2) (m+n)—_—_—_——————————————— 95. (c) Since, no two lines are parallel and no three are concurrent, therefore n straight lines intersect at "C,=N (say) points. Since, two points are required to determine a straight line, therefore the {otal number of lines obtained by joining NV points ™C;. But in this each old line has been counted "IC; times, since on each old line there will be ‘n1 points of intersection made by the remaining n=I lines. Hence, the required number of fresh lines is Nej_nric, = NW=1)_nin=In=2) 2 2 _ nln =1)(n~2\(n=3) z 8 Each set is having m+2 parallel lines and each parallelogram is formed by choosing two straight lines from the first set and two straight lines from the second set. Two straight lines from the first set can be chosen in "**C, ways and two straight lines, 96. (0) from the second set can be chosen in. "*?C, ways. Hence the total number of parallelograms formed C,.mC, =(C,F ‘The number of points of intersection of 37 straight lines is *” C, . But 13 of them pass through the point 97. (@) A. Therefore, instead of getting 'C; points we get merely one point. Similarly, 11 straight lin straight lines intersect ‘out of the given 37 B. Therefore, instead of getting "'C, points, we get only one point. Hence, the number of intersection points of the lines is 7", "eC, —"C, +2=535 98. (@) The required number of points 8c, x14, x24 6G x*C,)x2 = 28412+32%2=104 99. (c:b) 18 points, 5 collinear (®) Number of lines =""C, ~*C, +1 = 153-1041 = 144 Gi) Number of A’s ="*C, ~*C, = 816-10 = 806 101. (b) Clearly, " So, "!C,-"C,=21 = ("C,+" ", or n(n=1) 21 42=7-6 n=7 102. (c) 103. (b) 104. (c) 105. (d) CHAPTER « Permutations and Combinations | 123 Given, total number of points = n and number of collinear points = p. We know that one line has two end points, ‘Therefore, total number of lines = "C,, Since, p points are collinear, therefore total number of lines drawn from collinear points = "C,. We also know that, corresponding to the line of collinearity, one will also be added. ‘Therefore, number of lines ="C,~"C, +1 °C,-6 > 22) = n(n-1)-2n=70 > ~3n=70 = m-3n-10=0 > (n+7) (n=10)=0 = n=10 Required number = "°C, ~*C, +1 20x19 4x3 eae) =190-6+1=185 106. (b) Required number of ways 107. (d) 108. (c) = Coefficient of x!° in (0 bx +5 +47) “oefficient of x! in x? (Lt x+x? +...x4)* = Coefficient of x! in x"(1—x°)(1—x)+ Coefficient of xt in (—x*)—x)4 Coefficient of x in (1—4x° +...) CA Dr+ 20043) 3 [iene +4+21443) _ 45 31 Aliter Remaining 4 rupees can be distributed in *HC, ie, 35 ways ‘The number of sub-sets of the set which contain at ‘most n elements is + mic c+ =s (say) Ct 1G tat IC.) wtenic +c.) ican CEn Cr Cia Camy aC mG at derast Since, 9600 = 2? x3x5* Hence, number of divisors = +DU+ D241 = 48oa) CHAPTER» Permutations and Combinations 109. (>) The Rumber of triplets of positi i hich esoluions of x+yse= igs meen whl = coefficient of x! in (aga 444.9? = Coefficient of x! in wa = coefficient of x! in A(toacscts Ate 4, ) a = 49x99 = 4851 110. (d) The numbers of divisors =(+D2+D2+D0+ 0+ - 1 111. (b) Since, a any place, any of the digits 2, 5 and 7 ean be used, total number of such positive. digit umbers are 3" distinct numbers, he 3" 2900 n=7 x 4851 8x9%539) =8X9X7X7x11=2) xP x7 xt So, number of divisors GB+DA+NA+H+)=72 This includes two divisors | and 38808, Her required number of divisors = 72 ~2 = 70 113. (d) Along horizontal side, one unit can be taken in (2m—1)ways and 3 unit side can be taken in 2m=3 ways The number of ways of selecting a side horizontally is (Qm—142m—342m—54+..43+1) Similarly, the number of ways along vertical side is On=142n~3+,.454341) Since, we have to form 900 112. (a) Since, 38808 nee, the £-Total number of rectangles ENE 4+5 4.04 2m—DIX( 4345+... 20-1] m(+2m=1) ,n(l+2n—1) 2 2 114, (0) #TeReNeGel Three vowels can be arr ize at 6 places in 20 ways Hence, the required number of arrangements =120%5!= 14400 Since, number of dearrangements in such a problems 115. ©) is given by fi miaieait ai nl 2 Number of dearrangements 116. (a) Number of words in which all the $ eye repeated = 10 = 100000 and the number of in which no leter is repeated are" Hence the required number of ways = 100000 — 30240 117, (a) Por the frst set umber of ways Ci Now, oy 35 cards left 17 cards can be put for seco Gj. ways, similarly for third in "¢, 17 Oe ea for the last set can be put in only one 4, Therefore, the required number of ways foe me proper distribution S21 35! 18! say rm ay 118. (b) The word ARRANGE, has AA, RR, NGE let that is two A’s, two R's and N, G, E one each ‘The total number of arrangements — = 1260 Pau But, the number of arrangements in which both RR =360 ae together as one unit= + The number of arrangements in which both RR «do not come together = 1260 — 360 = 900, 119. (a) A selection of 3 balls, so as to include atleast on black ball, can be made in the following 3 mutual exclusive ways GL black ball ="C,=1 Total numbers of ways = 45418 +1= 68 120. (a) First arrange m men, in @ row in m! ways. Sine 11" Required aysare Ss, eters) 124. (a) (Since, IEEEENDPNDNC 125. (c) Let the boxes be marked as A,B,C, We have to ensure that no Gox remains empty and in all five balls have to put in, There will be two possibilities. (@) Any two containing one and 3rd containing 3 AQ) BQ) CG) 5G. 40,90, =5-4-1=20 e, the box containing 3 balls could be any of the three boxes A, B, C. Hence, the required number 0x3 = 60 two contai each and 3" Gi) Any containing 1 AQ) B(2) C(1) $C, °C, »'¢ =10x3x1=30 Since, the box containing 1 ball could be any of the three boxes A, B, C. Hence, the required number 30x 60+90: Hence, total number of way’ 127. (d) 128. (c) 129. 130. 131. © © © CHAPTER » Permutations Combinations | 125 126. (c) The total number of words -£ 60 ‘The number of words in which BH come together 3! x2! 20, 21 Hence, required number of ways in which B and H never came together are 360~120 = 240 Out of 10 persons, A isinand G and H are out of. the team, so we have to select 4 more from 7 remaining. This can be done in 7C, ways. These 5 Persons can be arranged in a line in $! ways. Hence, the number of possible arrangements is 7, 515765) Since, 5 does not occur in 1000, we have to count the number of times 5 occurs when we list the integers from 1 to 999, Any number between 1 and 999 is of the form xyz, 0 x, y, 29. The numbers in which 5 occurs exactly once = CG)-9x9=243 ‘The numbers in which 5 occurs exactly twice =CG-9)=27 ‘The numbers in which 5 occurs in all three digits =I Hence, the number of times $ occurs = 12434227 +3%1 = 300 Here, we have IM, 41,48 and 2P. Therefore, total number of selections of one or more letters = (+4 +D4+)Q+)— The required number 149 = coefficient of x2" in (x° +a! +...+x")* = coefficient of x°" in | = coefficient of x7" in (1—x™")*(1— x) = coefficient of x7" in (1-4x"*! +61" 2} (roses eomromieed i _ Om ne2ms-2¥2m+3)_ 4, tmetyns2) 6 _ m+ Om? +443) a ae Let there be m men participants. Then, the number ‘of games that the men play between themselves is 2-"C, and the number of games that the men played with the women is 2:(2n) (by hypothesis) =n? ~Sn-66=0=>n=11132. (b) 133. (b) 134. (b) 135. (a) © Number of participants = 11 men +2 women = 13 Each child will go as often as he (or she) can be accompanied by two others, ‘Therefore, the required number = C, =21 Total number of books = a+2+3c 4d Since, there are b copies of each of two books, ¢ copies of each of three books and single copies of d books, ‘Therefore, the total number of arrangements (a+2b+3c+d)! ate y(e> Since, 2 persons can drive the car, therefore we have to select | from these two. This can be Jone *G ways. Now, from the remaining 5 persons we have to select 2 which can be done in °C, ways Therefore, the required number of ways in which the car can be filled is °C, x¢, = 20 Since, the balls are to be arranged in a row, so that the adjacent balls are of different colours, therefore we can begin with a white ball or a black ball. If we begin with a white ball, we find that (n-+1) white balls numbered 1 10 (n+1) can be arranged in a Tow in (n+1)! ways. Now, (n+2) places are created between n+1 white balls which can be filled by (n+1) black balls in (n-+1)! ways. 136. (a) 137. (©) 138. (b) 139. (©) 140. (a) “i { So, te foal somber of arangenens in i adjacent balls are of different colours and ft is a white ball is (n+) 1<¢n+D!= (Ons p we can begin with a black ball aso. Henoy required number of arrangements is 2(n+1) ‘A number between 5000 and 10000 can the digits 5, 6, 7. 8, 9 at thousand’s place thousand’s place can be filled in 5 ways. Rem 3 places can be filled by the remaining 8 digg *B, ways. Hence, requited number = 537, have any og ‘The result is trivially true for r=1,2. It can by easily proved by the principle of mathemati induction that the result is true for r also, We have, 30=2%3XS. So, 2 can be assigned y either a or b or ¢ ie. 2 can be assigned in 3 way, ‘Similarly, each of 3 and 5 can be assigned in} ways. ‘Thus, the number of solutions =3x3x3=27 ‘There are four even places forthe four odd digits 3,3, 5,5. ‘The required number of ways, 4st = St eg pov aa ‘The number of words before the word CRICKET = AXS!+ 2541 +21= 530