Scribd
Upload
66 views52 pages

7.P & C

REFERENCE MATERIAL JEE ADVANCED MATHEMATHICS

Uploaded by

shakshampatil9520
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF or read online on Scribd
66 views52 pages

7.P & C

REFERENCE MATERIAL JEE ADVANCED MATHEMATHICS

Uploaded by

shakshampatil9520
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF or read online on Scribd
You are on page 1/ 52
Permutation and Combination A at FUNDAMENTAL PRINCIPLE OF cOUNTI NG MuuriPLICATION RULE ig work cam be done in m ways and another work B can be done inaways and C is a work which is done only when both A and fare completed, the numberof ways of doing the work Cis mx fe Inather words, ifn operation can be performed in m different fas and corresponding to each of these there ace m different ‘rays of performing another operation, then both the operations {on be performed in m Xn different ways P 2 3 First, we give an example to show the validity of the above principe. Suppose, there are three stations P, O, and R and we have two routes to go from P to Q and three routes to go from Q to We want to know the number of routes to go from P to R. aR ptop2 re p29 4 pk plo rR p29 bp ptioe re p29 cpr For each path to go from P to Q, there are three paths to go fom Oto R. ‘Thus, for going from P to R via Q, there will be 2 x 3 = 6 pats, Proof of Multiplication Rule of Fundamental Principle of Counting ‘The first operation can be performed in any one of the m ways and for each of these ways of performing the first operation, there are n ways of performing the second operation. Thus, ifthe first operation could be performed in one such way, there would have been 1 x n= n ways of performing both the operations. But itis given that first operation can be performed in m ways and {or each way of performing the first operation, second can be inn ways. Therefore, the total number of ways of performing both the SPetations is n+ m+ n+ -- tom terms =n x m. Note: three operations ean be separately performed in m, n, and i. ‘ways, respectively, then the three operations together can Performed in m x n x p ways. Similar result holds for any lumber of operations, ae a, ADDITION RULE If work A can be done in m ways and another work B can be done in m ways and C is a work which is done only when either 4 or B is completed, then the number of ways of doing the work Cis m+n Exam ‘Suppose, there are 5 doors in a room: 2 on one side and 3 fon the other. A man has to go | out of the room, The man can 3 D 0 out from any one of the 5 doors. Thus, the number of | ways in which the man can go out is 5. Here, the work of — going out through the doors on one side will be done in 2 ways and the work of going out through the doors on other side will be done in 3 ways. The work of going out will be done when the man goes out from either side I or side Il. Thus, the work of going out can be done in 2+3=5 ways, ILLUSTRATION 7.1 In a class, there are 15 boys and 10 girls. How many ways a teacher can select 1 boy and 1 girl to represent the class at a seminar. Sol. » There are 15 boys and 10 girls in a class. ‘Teacher has 15 options to select one boy and 10 options to select one girl. So, using the multiplication rule of counting, Number of ways of selecting one girl and one boy = 15% 10= 150 ILLUSTRATION 7.2 Ifx<4 1),having the property that no two consecutive digits are same ere Sol. 5 9 8 Place ‘x, "can be filled in 9 ways as digit *0" cannot be us Place ‘can be filled in 9 ways as 0" ean be used but i, place x, cannot be used. o Similarly, each ofthe remaining places ean be filled in9 yyy Thus, total umber of such numbers = 9 99... nines ILLUSTRATION 7.17 There afe ten points in the plane, mo three of which collinear. How many different lines can be drawn thay these points? Sol, There are ten points Py, Pay ..-s Pio: For one line two points are required. ‘Through point P, there will be 9 lines when P, is joined wi, of the nine other points. Similarly, there will be nine lines passing through each poi So, number of lines is 9 10 or 90. But there is double counting in above answer. Why? ‘One of the nine lines passing through point P, is P, Py. But,» is also one of the lines passing through point P,_ ‘Thus, line PP, and similarly each line is counted twice Therefore, actual number of ines is 22 = 45, Note: Double counting error oceurs when things are selected oneby one. When things are selected one by one, order in which xy are selected is also counted, Obviously, when things are tole selected, order of selection should not be counted. ILLUSTRATION 7.18 Find the number of diagonals inthe convex polygon of si Sol, Diagonal of the polygon is formed, if two non-conseu™™ vertices of polygon are joined. So, number of diagonals = number of ways we can select ‘non-consecutive vertices of polygon, The first vertex can be selected in n ways. Let 4) is chosen first, Now diagonal cannot be formed if any of 4, and 4, is chose” Henee for A, another vertex can be selected in (m3) ways remaining (m ~ 3) ver Similarly, there are (x ~ 3) diagonals passing through each ve" ‘So, by multi ces. cation principle of counting, Number of diagonals = » x (n— 3) But, in above answer there is double counting. a Let A, is chosen as first vertex, then against it sometimes + ‘chosen as second vertex. > aly, when Ay 38 chosen as first vertex, then against it Sim mes Ay is chosen as second vertex. sn each pair eres is selected tie. 3) seq ttl amber of diagonals = nfa=3) et : jquusTRATION 719 tar polygon of 10 sides is constructed. Triangles are are f ‘Armed joining vertices ofthe polygon, Find the number of triangles (pif two sides of triangle coincide with the sides of polygon. {ip if only one side of triangle coincide with the side of polygon. {gal} We have regular polygon of 10 sides. / 4 de ds As ty ba Avo Ms A A riangies are formed joining vertices of this polygon. () Two sides of triangle coincide with the sides of polygon. This is possible only if three consecutive vertices of polygon are selected as shown in the following figure. ay Ae As Aw a A So, we have triangles 4,443, A,AyAq, « Thus, 8 such triangles are possible. (ii) Only one side of triangle coincide with sides of polygon. Consider triangles in which one side is Ay. A Adon Permutation and Combination 7.5 Clearly third vertex cannot be A, oF Ayo (otherwise two sides of triangle coincide with the sides of polygon) So, for third vertex we have only six choices (Ay Agy...+As) ‘Thus, number of triangles with one side 4,4, is six. Similarly, for each side of polygon therc will be six triangles. So, number of triangles is 10» 6 = 60. ONGEPT APPLICATION EXERCISE 7. 1, Four buses run between Bhopal and Gwalior, 1f a man goes from Gwalior to Bhopal by a bus and comes back to ‘Gwalior by another bus, find the total possible ways. 2. Find the total number of ways of answering five objective type questions, each question having four choices. 3. A variable name in certain computer language must be cither a alphabet or a alphabet followed by a decimal digit, Find the total number of different variable names that can exist in that language. 4. In how many ways five persons can stand in a row? 8. In how many ways can first and second prizes in | Mathematics, first and second prizes in Physics, first prize in Chemistry and first prize in English be given away toa class of 30 students? 6. Five persons entered the lift cabin on the ground floor of an 8-floor building. Suppose each of them can leave the cabin independently at any floor beginning with the frst. Find the total number of ways in which each of the five | persons can leave the cabin (a) at any one of the 7 floors (b) at different floors. 7, If there are six straight lines in a plane, no two of which are parallel and no three of which pass through the same point, then find the number of points in which these lines intersect. 8 Find the number ordered pairs (x, ») ifx, y € {0, 1, 2, 3, ony 10} and if yl > 5. 9. Find the number of ways in which two small squares can be selected on the normal chessboard if they are not in ‘same row or same column 10, Find the number of natural numbers which are less than 2x 108 and which can be written by means of the digit 1 and 2. 41, Number of non-empty subsets of {1, 2, 3, .. 12} having, the property that sum of the largest and smallest element is 13. 12, Find the numberof three-digit number in which repetition is allowed and sum of digits is even. 13, An 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. Find the smallest value of 1 for which this is possible. | 14, A five-digit numbers divisible by 1 is to be formed using the numerals 0, 4 and 5, without repetition. Find the total number of ways in which this can be done. E ANSWERS oe eee 1, 12 24 3, 2864. 120 | 5. (80x29) x (30x29) x 30x30 6 (a) 7° (b) 2520 7.15 8 309 1568 10, 766 (UL, 136512, 45013, 7 14, 216 7.6 Aigetra FACTORIAL NOTATION _ One important tool in counting principle is factorial notation. So far in the discussion, many times we multiplied consecutive integers. On the bases of this factorial notation is devised. In counting principle many times answer is written in the form of factorial to save us time. The product of first » natural numbers is denoted by mand is read as “factorial n’. Sometimes it is also denoted as |n Thus m= |n=1x2%3%4.. «(n= l)xn = nx(n= 1) X= 2). 342K) eg. SI=1%2%3x4x5 = 120, 41x23 x 4=24 Some Results Related to Factorial Notation . X2x3.. (n= Wen = 11x223...4(n- Nin (n-Ihen nxn! Similarly, (n— 1)! =r Thus nt=ax(a 1! Dx(n 2) = nx (n= Vx(n 2) = nx (a1) % (02) x(n 3)hand soon I'm and rare positive intege mY 123.0 then SR Rar 12:3. = Derr Wr 43) (=I) n rs i re) SOF DUH DX NX = nxn Dx DX. x04 D mL LD oon= Den 5 GAT Ty 12.3.9 Orr tr t= Dn a P23 =r rt dtl = (n= 1) (n= 2). (1=P DOI=" FD = m(n~ 1) (12)... tor factors Notes 2 (mt nylem! +n! © (ann)! mt x nt © Gl ek xn ‘OLUSTRATION 7.20 dn, if (n+ I)! = 12 x(n-1). (SAL) (+ HE= 12 er= or (a+ DXnx(n—-Dl=12x(n- DE or n(n ald or mw +n-12=0 or (nt 4y(n— 3) or n=3 Find the value of ¢ which satisfies (/~ (/sin x) = 3) where [:] denotes the greatest integer function, §SoM) (¢—[Jsinx $= 315171 x io xanes ned then (11)! =(3x2)x(Sx4x3%2)X7! or = 1)! =10x9x8x T= 10! or t-1=10 or Ifx2na~ = (ne D, then (0)! = 10! or f= 10 ILLUSTRATION 7.22, Prove that (n!)? < 1” nt < (2n)! forall positive integers» WSok) We have. (nly = (nly (nly = (IX 2x 3x4. Now, 1$n.2Sm3Sm (n= Dahm msn or Te 2x30 (Dn Saxmxnen or many s(ntyat or anty W Also. Qnyt= be 2dr Dos Qn Dx Qn) Now, ne Lenn D> mnt 3 > Mon (or yr 2) 00-8 3) m= 1) my > nl ot n= y(n #2) n= 1) an) > mn” or Qnytanta” = ta < me ® From (1) and (2), we get (nl)? Sn" (n!) < (2a)! ILLUSTRATION 7.23 Find the sum of the series }°r x r! ma "'SoL)) Here, the general term of the series is Twrxri=(rtl—nrl =(r+ nant =(r+1l-n! “1 n+ I)l=n! Adding all the above terms, we have the sum of m terms, |» S,=(n+ 1-1 a EXPONENT OF PRIME IN n! ioe Legendre’s formula gives an expression for the exponent 0!" largest power of a prime p that divides the factorial n!. Itis™ after Adrien-Marie Legendre. sy ime number P nd aby Positive integer, fe peat oF he ITBest power ofp that be w orl Fm Tet En!) ides n. Then sheabove formula doesn’t work for composite numbers. For on i we have to find the largest power of 6 occurring in 32!, seni anoerisnot given by this formula, iF : 2|+ [3] + s\*le sas Sisthe number of integral multiples of {rocan also be obtained by multiplying 2 and 3. Hence to get solargest exponent of 6, we find the largest exponent of 2 and 3 sgvrands) oecurting in 32!. Using the above formula r=31 and (4 Hence product 2 x 3 occurs 14 times in 32!. Therefore, tagst exponent of 6 oceurring in 321 is 14 [LUSTRATION 7.24 Find the exponent of 3 in 100! Gol 100 1 X2x 3x x 98 99x 100 (UX 2K 4x 5x x 98 100) X(BKOX 9K 96X99) Kx 3°(1 x23 x x 3233) =KxFAU 2x4 K-31 X32) (3x9 12x +3033) =[K(1x2%4x + x 31% 32)) x3 2(3 x 9X12 + 3033) = Ky x3" x3! (1x23 x0 x 10x 1) = Ky (12% 4 «10% 11) 3X3! BX6X9) = Ky x3 x3! 3x (12% 3) Ky x38 3! 33 =k" Hence, exponent of 3 is 48. Alternate solution: Exponent of 3 in 100! is he} - 334 4341-48 Wubraarion 7228 Find the number of zeros atthe end of 130! {$3 The number of zeros a the end of 130! 6 ual to the fg ut of 10 in 130, Now, exponent of 10 is equal to exponent cis *PONent oF is higher than exponent of 5. Now, exponent Permutation and Combination 7.7 130) F130 5 ey Also, exponent of 10 is 32; hence, there are 32 zeros at the end of 130. It should be noted that exponent of 2 is [| eau 130], [130], [130 [e} [2] = |4] +] SP Ya] SO fa 2 BS Lae ee SL 654324 16+ 8444241 = 128 Hence, exponent of 10 is equal to exponent of 5. J-asese1-32 ILLUSTRATION 7,26 Find the ‘umber of zeros atthe end in product 56.67. 78.8? 91°... 308 Soll) Given product P= 5°. 67.78. 8°..(30) [65)"(10)!'15)'5(20)"'(25 7130)" 2 (where A is an integer) oo Exponent of 5 in P= 6 + 1] + 16 + 21 + 2 (26) +31 = 137 Number of zeros = 137 A. Prove that (2n)Mo! = {1x 3% 5 --- (2a 1)} 2”. +2. Show that I! + 2! + 3! + square for any n€ N.n 24. 3. Prove that (n! + 1) is not divisible by any natural number | between 2 and n, 4, Find the remainder when 1! +2! = 3! +4! + divided by 15, if a> 5. 5. Find the exponent of 80 in 200! + nt cannot be a perfect +ntis ANSWERS . 49 PERMUTATION A permutation is an arrangement of all or part ofa set of objects ‘with regard to the order ofthe arrangement, For example, suppose we have a set of three letters: 4. 8, and C, We want to find the number of ways in which 2 letters from this set can be arranged, Each possible arrangement would be an example of a permutation, The complete list of possible permutations would be: 4B, AC, BA, BC. CA, and CB. Thus there 6 number of permutations, We observe that here order in which letters are occurring is important, Le, 4B and BA are two different arrangements. In mathematics we use a specific {crminology. That is “permutations as n distinet objects taken r aa time”, Here sefers tothe number of objects from which the permutation is formed; and r refers to the number of objects used to form the permutation. In the above example permutation was formed from 3 letters (4, B, and C), so n= 3; and the permutation consisted of 2 letters, 80 r= 2 7.8 Algebra FORMULA FOR PERMUTATION Let us establish the formula for “Permutation of n distine! objects taken rat a time” Wis usually denoted by "P, °P,=mumber of permutations ofr things ont of diff numbers of ways of filling up vacant places with n different ‘objects if each place is filled with exactly one object Let the 1 different jects be a). sets rent objects First place can be filled up by any one of the n objects im n ways: ‘can be filled up by any one of the remaining (7 = 1) Second pl things in (n= Dy ways Third place can be filled up by’ any one of the remaining ( ~ 2) things i (yr ~2) ways. This continues til the th plac i filled The number of ways of filing up rth place = (r= 1 {Using the multiplication rule of counting, the number of ways in ‘which all r places can be together is (n-r+) (n-r41) nin 1)n~2). P=nin- Din [n(n = Dn = 2). (nr t= 7) DA =r nar 321 on Number of Permutations of Different Objects Taken All ate Time Let us find the formula “Permutation of n distinet objects taken all (nm) at a time’ "P, = numbers of ways of filing up 7 vacant places with h place filled with exactly one object 1 different objects if atn=Iy(n~2).. 34241 Also, putting r= nin “P, Y we get panne (ary ee op om! Thus nt = = or od Thus, factorial zero 1s defined and its value 1s 1 JuLusTRATION 7-27 16p, ~ S040, find the value of son) "7, 5040 10 504 Wneoe RT "py a) juLusTRATION 7.28 10°, 459P = Py find the value of 7 "P+ SIP, ‘son "7, ILLUSTRATION 7.29 1f?""'p, :2"'P, = 3:5, then find the value of ». aD PPP, = 35 Py 3 oer Qe get 3 wt ey Ss oe EDO 8 (ind 8 oF WAM or HED) ow Mn 40 or Ono Prove tht ifs ys, then *P, is divisible by BOW Lets *p Ph Awhere 05k Ss re Then, n ue! yo nm(s-1) ncn Or 2) Fyn D er 2) = (HRD) Shr DADO DV 9-H) nF (n= (r+) 2 gre M=2-— MODY =) (2-4 1)) (1-4 ky} (rr +k-Iy} sp, 4(n—rv n= ("4 1) 2", x Integet isdivisible by "P, Qn ee participating in a race. In how many ways seen ttre altes win the prizes? Soci sgh ws een 1 Biling 3 lass spies) ih pt os smber of permutations of 7 objects taken 3 at a time is 210 “pe TXOXS iphow many ways can 6 persons stand ina queue? ‘The number of ways in which 6 persons can stand in a {ssame a5 filling 6 places with 6 persons. The number of SE uations of 6 objects taken all ata time is 720 7.33 ow many diferent signals can be given using any number of fags fom 5 fags of different colors? (Sid The signals can be made by using one or more flags at ime Tie wtal umber of signals when r flags are used at a time fom lags is equal to the number of permutations of 5, tking raatime ie, P, Since r can take the values 1, 2, 3,4, 5, by the fundamental ‘repl of addition, the total number of signals is, +P, +P, +9, +°P, 5+ (544) + (5%4 23) 4 (54423 x2) +(5%4 x3 X2%1) =5+20+60+ 120+ 120 =325 = ‘animals of a circus have to be placed in eleven cages (Gin each cage). 114 ofthe cages are too small for 6 of the i then find the number of the ways of caging ull the "eft vacant 4 ‘vteant, The remaining five animals can be placed in the ining five cages in 5! ways. Hence, by the fundamental + the required number of ways is 77, 5! = 04X00. = permutation and Combination 7-9 {iustratioN 7.35 IfA= {x[x isa prime number and x different rational numbers whose numerator an‘ belong to A, IBBUD) Here, A = {2,3,5,7, 11.13, 17,19, 23, 29). A rational ‘number is made by taking any two numbers in any sai Therefore, the requited number of rational numbers is "P2 + (including 1), Five different digits from the set of numbers {1,2,3,4,5.6.7 are written in random order. How many numbers can be formed using 5 different digits from this set if the number is divisible by 9? Sum of given digits = Two digits have to be taken out. If the number formed by remaining 5 digits is divisible by 9, then the sum of digits must be divisible by 9. Ifa and b are two number taken out, then a + = 10 a=3,b=Tora=4, b=6 Number comprises the digits {1, 2,4, 5, 6} or {1, 2.3.5.7} = Required numbers = 2 5! = 240 © 30}, find the number of 1d denominator $2E3+4+5+647=28 iLUSsTRATION 7.37 Find the sum of all the numbers that can be formed with the digits 2, 3, 4, 5 taken all at a time. ['S0L)) The total number of numbers formed with the digits 2, 3 4, 5 taken all at a time is equal to the number of arrangements of 4 digits, taken all ata time, ie., *P, 24. To find the sum of these 24 numbers, we have to find the sum of the digits at unit’s, ten’s, hundred’s, and thousand’s places in all these numbers. Consider the digits in the unit's places in all these numbers. 1f2 is the digit in unit’s place, the remaining three places can be filled in 3! ways or we can say 2 occurs in unit's place 3! (= 6) times. Similarly, each digit occurs 6 times. So, the total sum of the digits in the unit’s place in all these numbers is (243 +4 +5) x3! = 84, Similarly, the sum of digits is 84 in ten’s, hundred’s, and thousand’s places. Hence, the sum of all the numbers is $4 (10" + 10! + 10 + 10°) 93324 uuusrRaTiON 7.38, A shelf contains 20 books of which 4 are single volume and the other form sets of 8, $, and 3 volumes. Find the number of ‘ways in which the books may be arranged on the shelf so that (i) volumes of each set will not be separated, i) volumes of each set remain in their due order, (H) Considering each sot as single unit, permutations of 7 units is 7! EE eS_7oannO Es Permutations of books of the set of 8 themselves is 8! Respective permutations of books of the is 5! and that of books of 3 volumes is 3! By the product rule, total number of permutations is volumes amon (il) Since the books volumes can be at ‘number of permutations is 7! \ 2 din due onder in 2 ways, the total DNIENNTIES ILLUSTRATION 7.39 The letters of wont ZENITH are Teall these words are written out as itt the rank of the word ZENITH. en inall possible ways. ‘9 dictionary, then find Sok” Total number of words = 6! = 720. Writing the letters of word ZENITH alphabetically, that is. EHINTZ “For ZENITH Word saring with Number of weet words | verter aa co a ee ee | ZN ZEN el ZENIT ZENIH i Total number of words is -befoce ZENITH Hence, there are 615 words before ZENITH, then rank of ZENITH is 616. Number of Permutations when Each Thing can be Repeated any Number of Times Let us find the number of permutations of n different things taken rata time when each thing can be repeated any number of times. This is same as filling r places with » distinct things. For each place number of options is. ie., each of the r places can be filled tnt nays Lr 7 T riz) : tH | times = nf So, total number of ways = nm 4%. ILLUSTRATION 7.40, Find the total number of permutations of n different things taken not more than r at a time, when cach thing may be repeated any number of times, [Sol Here, we have to arrange p things out of m, |< pSr,and repetition is-allowed. When p = 1, the number of permutations is rn. When p =2, the number of permutat set of $ volumes set of books containing any number of enn ayy owed, first thing can be: also be taken ina ways.) er of permutations 18 17 mn, then find the number of ‘ways in which they can be seated . Ae | 1. 40 2.483. Px! 4. 36 (m+)! (Sens! oe COMBINATION: ELEMENTARY ‘The meaning of combination is selection. Suppose we want to select two objects from four distinet objects a, b,c, d. This can be stated as number of combinations of four different objects taken two at time, Here we have six different combinations ab, ac, ad, be, bd, ed. In other words, we can say that there are six ways in which we can select two objects from four distinct objects. Now permutation of these four objects taken two at time is “py=l2) Let us count permutation using combinations. For that we divide the job into two steps. First, we select two objects and then we arrange them, Suppose number of ways of selection of two objects is k. Now these two objects can be arranged in 2! ways. So, using the principle of multiplication of counting principle, Total number of permutations (Number of ways of selecting two objects) (Number of ways of arranging them) Similarly, Permutation of n different objects taken r at time = (number of ways of selecting robjects from different objects) * (number of ways of arranging selected r objects) ++ "P,= (number of ways of selecting r objects from 1 different objects) * r! ‘Number of ways of selecting r objects from n different objects 22h ‘Number of combinations of n different objects taken rat atime "CG where "C, stands for number of combinations of different objects taken rata time, PROPERTIES OF "C, We have following properties of °C, omen Proof: © (=r)! #16, ="C, then either.x=yorx+y=n Proof: As "GC "Cray [2 "G= "Gr xey orxenay So, x=y orxty CHC eC Proof: AS, "C,4°C, 1 n-rel ot ntl (Dat [r= +) (att in—r+In—r)) © =D i rr-1 (nD! rin=r+D! =ric. "G_nerth a Maximum value of We ean observe that in t 6, maximum value is “Cy {Also inthe list of "Go, "Cs ”Cax’Cs value is 7C, or "Cy In general, when mis even maximum value of "C is"c, and when m is odd maximum value of °C, is ™ he list of "Co. °C. “Ca 5Cy, e.g CCCs, "Cor "Cont “The productof kconsecutive positive integersis divisible Proof: Let the k consecutive integers be m, m+ I,m+2,... mf) We have m (m + 1) (m +2)... (m+k-1) (im =1) (mt) rm +1) (m=1)! (m+k— (m1)! | lhl (m—1)tk! =anmOG, Since "'*~9C; is an integer, if follows that k! divides (mW) een (m+k= 2), ‘© °C, is divisible by p only ifp is prime number for r= 1,23, wee P-D, Proof: Let Then N= ce pl=Nxrx@p—r! Clearly p divides p! Thus, p divides Nx r! x (p But ifa prime number divides a product, then it dividesat lest cone of the factors, Since p cannot divide r! or (p — r)!, it must divide N. is divisible by 11 ete. Thus, ’C, is divisible by 7, " ILLUSTRATION 7.50 IE"Cy= "Coy then find "C. ‘Sok 1f"C,="C, and x # y, then x + y =n, Hence, yetaaTiOn 7.51 rindi aot) oF Sng he equation 7 wt r-20=0 r=7,-10 sce possible values of rare 3 and 7 as for these values all the jem in equation are defined juustearion 7.52 provethat ’C, +7'C, +o C=C, on aay Ba CICA C + ee 4c, Ga FIC HC AMC HC aPC FMC tae . Cte mica on adding similar Way, we get LHS.=""'C4,+""C, +"C, =n #°C, = "C4 = RES, [LUSTRATION 7.53 FG, ofa, 1 "C,.1 = 36, and "C,.. , = 126, then find the value RATION 7.54 Qn=31 at & Qn@rn@n-2) n(n=1)(n=2) 1 - fermutation and Combination 7.15 4Qn-1) a2 oF 89-4 = Nn 22 or We Ror =6 MWLUSTRATION 7.55 IES G5C,, = 11:3, find the value of r (SHB “Cy:"C,,- 113 Clearly. r can be 0, 1, 2, 3, 4, 5 but possibilities of r= 0 or $ are or 1 T clearly ruled out (as "°Cy =", = 1), Forr=1, Ke, Isx14x13, 6 and SO) = "o8e,, Forr=2, 1s ISx14x13 12.1 110 Cy eee txt 6xSK4XIX2«I 15x14x13 SC =" Cy= aa fF Bey5¢ ell Forr 1Sx14x13x12x1 1x10 6Xx5x4x3x2x1 _ 1Sx14x13x12 © 4x3x2x1 tse, _ 1Sx14x13 O° Sax Soy Bcy= HSxMod3 12x11 Sx4x3x2x1 SCy28 C4) = 5:33 Thus, r=3. WLUSTRATION 7.56. 2 Prove that £ (aly! 7 is a natural number for all n € N. “Sol We have to prove that (1°)! is di We know that product of r consecutive Now (W)!=1X2x3x4x..20F = (IK2K3 Kies ee XM) X [n+ Din 2)x... [2n+)Qn+2)... sible by (nl) teyers is divisible by r! Qn) x GMX (0-1? =a cor? 716_Ageba ‘Thus (n?)! consists n groups of product of n consecutive integers. Each group is divisible by n!. So, (n°)! is divisible by (!)". ILLUSTRATION 7.57 ‘Twenty-eight games were played in a football toumament with each team playing once agninst each ofthe thers, How ‘any teams were there? SOL" Let number of teams be. Number of matches to be played = number of ways two teams can be selected u non S6= (800+ one 8esne-7. usTRATION 7.58 There are n married couples ata party. Each person shakes hhand with every person other than her or his spouse. Find the tora umber of hand-shakes. {Sal} Total number of possible hand-shakes = number of ways in which two perso can be selected =*¢, This wll include n hand-shakes ofa person with her orhis spouse. Required number of hand-shakes =""C,~n 2n(n=, u MLLUSTRATION 7.59 In a network of railways, « small island has 15 stations. Find the number of different types of tickets to be printed for each class, if every station must have tickets for other stations {Sol For each pair of stations say 4 and B, two different types of tickets are required from A to B and from B 10 . Now, the numberof selections of2 stations from 15 station So, required number of types of tickets = 2%", x1S%7=210 SC ILLUSTRATION 7.60 In a certain algebraical exercise book there are 4 cxamples on arithmetical progressions, 5 examples on permutation and combination, and 6 examples on binomial theorem. Find the number of ways a teacher can select for his pupils at least one but not more than 2 examples from cach of these sets, {Sols Number of ways teacher can select examples from arith- metic progression = (*C, + *C,) Number of ways teacher can select examples from permutation and combinations = (°C, + ‘C,) Number of ways teacher can select examples from binomial theorem = (°C, +°C,) Hence, total number of ways = OC +4CNEC, +7C °C, + °C) Find the number of ways of selecting 3 pairs from 8 ding, objects F selecting first pair of objects» [SOHH Number of ways of selecting ects ~ 4p slecting second pair of objects? Number of ways of selecting ects 4, Number of ways = ("C3 * °C, %*C Which paits are selected is immaterial ‘LeustRatian 7.62 {A person tries to form as many different parties 2 he gy ut of his 20 friends. Each party should consist ofthe ‘number. How many friends should be invited ata time y how many of these parties would the same friends be fou, J)S0L)) Let the person invite r number of friends at atime. Thy the number of patties is °C,, which is maximum when rg, Ifa particular fiend will be found in x partes, then «sy number of combinations out of 20 in which this particular fing must be included. Therefore, we have to select 9 more fg 19 remaining friends. Hence, x= !"Cy. 31, since the org A ILLUSTRATION 7.63 Find the maximum number of points of intersection of circles. Soli) Two circles intersect maximum attwo distinetpoints Nox, two circles can be selected in °C, ways. Again, each selection st two circles gives two points of intersection. Therefore, the isa number of points of intersection is °C, x 2 = 30. (lustTRATION 7.64 There are 10 points on a plane of which no three points ae collinear. If lines are formed joining these points, find tie ‘maximum points of intersection of these lines. SOIL) Two points ate required to form a line. Then, the ube of fines is equal to the number of ways two points are selecist ive °C = a5, Now, two lines intersect at one point. Hence, the number points of intersection of lines is °C, ‘NWLUSTRATION 7.65 ‘There are 10 points ona plane of which 5 points ar calline# ‘Alo, no thre of the remaining 5 pointssoe calnca, Tet find () the number of straight Lines joining these poi’ (i) the number of triangles formed by joining these points Sol. (0) Line is formed boy joi fines 18 bWo points, Hence, the number Cy But joining any points from 5 collinear pou We. Again, 2 points are selected from a $C ways or lines joining collinear points is taken °C3("! times. Then the number of straight lines = !9C ~ 10+ 1*' (i) Fora triangle, three non-collinear points are required. TH points can be selected in °C, ways. Now, the selectio# * three points from 5 collinear points does not form trian! Hence, number of triangles is °C, - °C, y »* ‘All the letters are distinet (from N.D.EPT | heii [Two alike (NN, DD or EF). three distnet (from remaining five distinct) 3x5C,=30 Sample: NNDPT (NNN or DDD) and 2x "Cs ‘Sample: NNNIE Tharse alike 0 rot (fom inne | five distinct) | Iqxte,= 12 a e ‘Sample: NNEEP_ Ta atatr ype andere moe ‘fase riot) [Three ake of one typedNNN MBbdrand wate oer Sample Spach reining soup NNNDD etrdenea ete) Total Tilusrration 7.71 Find the total number of rectangles on the normal chessboard, [SP To form a rectangle on a chessboard two vertical lines ‘and 19 horizontal lines should be selected. There are 9 vertical lines and 9 horizontal lines found on the chessboard. Selection of 2 vertical and 2 horizontal lines can be done in °C, x"C, ways, which is equivalent to the number of rectangles. (LLUSTRATION 7.72 ‘m equispaced horizontal lines are intersected by n equispaced vertical lines. Ifthe distance between two successive horizontal lines is same as that between two successive vertical lines, then find the number of squares formed by the lines if (m <7). "Sok, Let set 4 of m equi spaced horizontal lines be I, la fy bn Let set B of equi spaced vertical lines be fy, Koy. hy ‘Also let the distance between two consecutive lines be | unit. Fora square of area | sq. units, we must select two consecutive horizontal lines and two consecutive vertical lines which can be done in (m ~ 1) x (n~ 1) ways. For a square of area 4 sq. units, we must select two lines from set A as (l 1s) (lye fg oo (ly 2s fy) and two from set B as (Bey Beads Chas Ka oy U2» Kd + Number of squares = (m — 2) x (n—2) Similarly number of squares of area 9 sq, units = (m ~3) x(n 3) and so on. ‘Number of squares of area (m — 1)? sq. units = (m — (m ~ 1)) x (n—(m-1) Total number of squares mI Yim-na-r) rt int, 6 others which all pass through another gi re thers which all pass through a third given point § other lines intersect at any point and no tW0 are pag find the number of triangles formed by the intersection) straight line esol) Let 5 straight lines be rassing though A «ra through B. and 7 passing through C. Im all there are 1 yy lines. ‘To find the number of triangles, we have to find the of selection of 3 lines from these 18 lines. Keeping in ming Selection of 3 lines from the lines passing through 4, B, orc, not give any triangle. Hence, the required number of triangles is 8G, = CC, + °C, + 7G) = 751 ILLUSTRATION 7.74 A regular polygon of 10 sides is constructed. In how ‘ways can 3 vertices be selected so that no two verties ze consecutive? Sol The required number of selections is given as fy ___s Ay ds Ay As 4 Ay ‘The number of selections without restriction (the mumbe* selections when 3 vertices are consecutive) — (the number ® selections when 2 vertices are consecutive) Now, the number of selections of 3 vertices without restricts? ~"2, ‘The number of selections of 3 consecutive vertices is 10" observation: 44,43, Ard gAyy «0. Ayo Ay). The number of selections when two vertices are consecttit is 10x °C, (After selecting two consecutive vertices in 10 ways, the ti can be selected from 6 vertices.) Therefore, the required number of selections is "Cy—10-10x8C, = 10% 9%8_ 19-60 6 120-70 50 JeTRATION 7.66, ee maximum number of points of intenection of 7 4 lines and 5 circles when 3 straight lines are parallel we oan 2 points of intersection of 7 straight lines = centric circles can intersect these 7 lines at n TWO 14+ 14= 28 points acl ean intersect the given system at maxim wid ng r2+2=18 " circle can intersect the system at maximum = 14+2+2+2= 20 points Ft sitialcan intersect the system at maximnam 442+2+2+2=22 points Maximom number of points of intersection “218+ 28 + 18 + 20422 = 106 67 “Abax contains 5 different red and 6 different white balls, In ow many ways can 6 balls be selevied so shat there are at east two balls of each color? ‘The selection of 6 balls, consisting of at least two balls tf each color from 5 red and 6 white balls can be made in the folowing ways: eo eo Ree mT 4 5C,x'C,= 150 3 _ 5C,x'C, — 2 5C,xC; | Total 425 | A delegation of four students is to be selected from a total of [2students. In how many ways can the delegation be selected @) fall the students are equally willing? Gi if two particular students have to be included in the delegation? (ii) if two particular students do not wish to be together in the delegation? (iv) if two particular students wish to be included together only in the delegation? () iftwo particular students refuse to be together and two other particular students wish to be together only in the delegation? ©) Formation of delegation means selection of 4 out of 12. Hence, the number of ways is "Cj = 495. (i) Iftwo particular students are already selecied, we need to ing 10. Hence, the number of _ Waysis C, = 45, (Gi) The number of ways in which both are selected is 45. Hence, the number of ways in which the two are not included together is 495 ~ 45 = 450. Peumutation and Combination 7.17 (iv). There are two possible cases: (a) Both are selected. In this ease, the number of ways in ‘which the selection can be made is 45. (b) Both are not selected. In this ease, all the 4 students are selected from the remaining 10 students. This ean be done in °C, ~ 210 ways, Hence, total number of ways of selection is 45 + 210 ~ 255 (9) We assume that students A and B wish to be selected together and students C and ) do not wish to be together. [ewer ep heal A, Balways selected "C, =45=5 A, B always excluded °C, =210=s, A,B.C,Dalwaysseeted |= | A, Bexcluded and C,D included" ‘The total number of ways is 45—1+210-28 =216 8-9) +5) —54 ILLUSTRATION 7.69 Find the number of pairs of parallel diagonals in a regular polygon of 10 sides. Sol.) Fix a vertex, say 4, as shown in the first figure. 4 J H EF BF There are 4 parallel diagonals on cam be There are 5 such sets since the vertices of the pol paired into 5 sets In each set, there are *C; pairs, i.e., a total of “C, x 5. of diagonals. Now, fix a side AB a ‘There are 3 parallel diagonals and S 30 pairs shown in the second figure. ich sets, So, total number of pairs = °C, x $= 15 Hence, total number of required diagonals = 30+ 15 = 45 ILLUSTRATION 7.70 Find the total number of ways of selecting five letters from the letters of the word INDEPENDENT. How many words can be formed from these five letters? (SOL We have letters I, (N,N,N), (D, D), (E, E, E), Py T Different cases for selecting five letters are tabulated as follows > TG = "Cro then find 1M acy 2Py = S716. find C, and *8C, when each of them has the 2. IE 204 find the ratio. of Fi pest possible value, | ee he oceasion if Deepawali festival, each student in 4 Ones sends areting cards to others. If thee are 20 4 ents in the class find the total number of greeting | “ijgs exchanged By the students «x ommitee ois chosen from JO men and 7 wonnen $0 § fo contain at least 3 men and 2 women, In now many | ape ca tis be done if two particular women refuse ¢0 wre on the same committee? | 4. aug contains $0 tickets numbered 1, 2,3, .. $0. Find | she marer of sto five tickets x, %5. 4.4% one has iF meee eB SHE SHS aNd = 30, 4. Four visitors 4 By C and D arrived at a town that as | hotels. In how many ways, can they disperse themselves among S hotels? ¢, out of IS balls, of which some are white and the test are t. how many should be white so that the number of | ‘xays in which the balls can be arranged in a row may be the greatest possible? It is assumed thatthe balls of same color are alike | 4, Inhow many shortest ways can we reach from the point (0.0.0) to point (3, 7, 11) in space where the movement | is possible only along the x-axis, y-axis, and z-axis or parallel o them and change of axes is permitted only at | integral points? (An integral point is one, waich has its | coordinate as integer.) 10, For an examination, a candidate has to select 7 subjects ftom 3 uifferent groups 4. B, C, which contain 4, 5, 6 subjects, respectively. Find the number of different ways in which a candidate can make his selection if he has to | select atleast 2 subjects from each group, 11, A question paper on mathematics consists of 2 questions divided into 3 parts A, B and C, each containing 4 questions. In how many ways can an examinee answer 5 questions, selecting at least one from each part? 12, Find the number of all three elements subsets of the set fa, 4, .. a,} Which contain ay 1B, There are five boys 4, B, C, D and B. The arder of their height is A < B < C < D< E, Number ‘of ways in which they have to be arranged in four seats in increasing order | oftheir height such that C and E are never adjacent, 14, Find the number of ways in which 3 distinet numbers can be selected from the set {3!, 3%, 37, .. 31,3! so that they form a GP. 18. 7 relatives of a man comprises 4 ladies and 3 gentlemen, his wife has also 7 relatives ; 3 of them are ladies and 4 gentlemen. In how many ways can they invite a dinner Party of 3 ladies and 3 gentlemen so that there are 3 of ‘man’s relative and 3 of the wife's relatives? ‘Permutation and Combination Te" 6 The side AB, BCand CA of atriangle ABC have 3.4 | | Serio points respectively om them, Find We number | | arrests that can be constructed using these imeror | | point as vertices. | | 17, Anevaminaion consists of 10 multiple choice questions, aeeain question has 4 options, ony one of which is | | Sees tm every gueton candidate cars 3 mark for honing the eorect option, and ~ 1 for choosing a rong Spon, Assume that a candidate answers all questions | Br choosing exactly one option for each. Then find the + aber of distinet combinations of answers which ean | carmte cantata sore from he set 15. 16,17, 18,19, 204 18, There are » points in a pla ae irre straight line except mv which are all in a straight Hine. Find the number of (a) different straight lines. |G diferent triangles, (e) different quadrilaterals that | ame formed withthe given points as vertices ne, in which no three are | | x _) Answers ___— 1.3 219 3. 143/4025 | 4. 2%, 5. 7800 6. °C, X™Cy 7. 120 8. 7or8 9. 21C,x "Cy 10. 2700 1, ®C,-3x"C, 12." 13.4 14, 2500 15. 485 16, 205 17, 120 COMBINATION AND ARRANGEMENT We know that number of ways of filling r places with n distinct objects(if exactly one object is put in each place) is same as number of ways of selecting r objects from n distinct objects and then arranging them in r places. ie, "P.="C,xr1 ‘But there are situations in which we cannot use "P,, formula directly. In such situation we have to first select the objects or places and then we can arrange. ILLUSTRATION 7.75 Inhow many of the permutations of n things taken r at a time will three given things occur? Sol!) According to the condition of the question, three things are already selected. We have to select (7 - 3) more things from. remaining (n ~ 3) things and then we have to arrange r things. So, requited number of permutations = ==! ILLUSTRATION 7.76 Out of 10 consonants and 4 vowels, how many words can be formed each containing 3 consonants and 2 vowels? {[Sol.) Clearly first we have to select 3 consonants and 2 vowel Number of ways of selection are "°C, x *C, 7.20 Algebra a Now number of words = Number of ways of selection x Number of ways of arrangement of selected letters. =", x4C,)x 5! ILLUSTRATION 7.77 Find the number of different words that can be formed using all the letters of the word DEEPMALA if two vowels are together and the other two are also together but separated from the first two. Sol, We have letters D. P.M, L, E, EA. A. We first arrange consonant D, P, M, L in! ways xDXxPXMXxLx ‘According to the question we have to put two pairs of vowels in the places marked with °', For that two places can be selected in SC, wways. In these two places we have to arrange letters B, B. A, A which can be done in a So. total number of words = 4! x °C; x x 1440 ILLUSTRATION 7.78 Eighteen guests have to be seated, half en each side of a long table. Four particular guests desire to sit on one particular side and three others on the other side. Determine the number of ‘ways in which the sitting arrangements can be made. Sol. Out of 18 guests half, ic., 9 to be seated on side A and rest 9 on side B. Now out of 18 guests, 4 particular guests desire to sit on one particular side say side A and other 3 on other side B. From rest of 1] guests have to select $ more for side A. This ‘can be done in ''C, ways. The remaining 6 guests will sit on side 1B. Now 9 guest on each side can be arranged in 9! says, So. total number of arrangements are ''C,x 9! x 9! ILLUSTRATION 7.79 In a conference 10 speakers are present. If, wants to speak before S, and 5, wants to speak after 5, then find the number of ways all the 10 speakers can give their speeches with the above restriction if the remaining seven speakers have no objection to speak at any number. Sol. According to question the order of speakers 5, S>, can be (not necessarily consecutive) 5, 8,5, 07,5) Sp For each order we can select 3 slots out of 10 in ""C, ways. Aficr selecting these three slots in which speakers S}, 8, Sy have two ways of arrangement, the remaining seven speakers can be arranged in the remaining seven slots in 7! ways. Hence, total number of arrangements = 2 "C7! and Sy ILLUSTRATION 7.80 Find the number of ways in which letters A, A, A, B, B, B can be placed in the squares of the figure so that no row remains empty. (igo) 2 and 4" row block has to be sclected. One row out of Ist, 3rd and Sth will contain ty remaining one letter each. Selection of one row that contains two letters is done nC, ways. Now two blocks can be sel in?C, ways. LC From each of remaining two row, one blocks can be selected in °C, ways. ects Hence total number of selections = °C, x°G °C, xc, ., in each selection of six places, letters A, A, A, BB, Bg 6! arranged in yr =20. So, total number of ways = ten lected from this row Nh 1 x 20 = 1620 ILLUSTRATION | Find the numberof seven letter words that can be fom, using the letters of the word SUCCESS so that the tog together but no two S are together. Sol.) We have letters (S, S, $), U.(C, ©), E Let us first arrange (C, C), U and E. Considering CC as single object, U, C, C, E can be arange: 31 ways xUx(CO)XEX. Here four gaps are created, marked with *’ Since no tow S are together, three S's can be putin places mic with Three places can be selected in “C; ways, in which Ss cn arranged in one Way. So, total number of arrangements = 3! x "C; = 24 ILLUSTRATION 7-82 Inhowmany wayscanthe eters ofthe word PERMUTATIONS be arranged ifthere are always 4 letters between P and? Sol, We have letters P, E, RM, U, (T, T), A. 1, 0,5. ‘Now between P and S there are four letters. We have follow three cases. Case.I: Two of the four letters between P and S are TT. In this case remaining two letters can be selected in “C; ‘Suppose these letters are E and R. So, we have to arrange (P, E, R, T, T, $), M,U, A,LON Number of arrangements in this case is ways ! SOx TL x21 x 4 = 3386880 Case I: Four ltrs between P and S are distin’ of letter is. In this case remaining thre letters canbe selected in "C3" Suppose these leters are E, R, M. So, we have to arrange (P, E, R, M, T, $), U, T. A, bO% [Number of arrangements inthis case is cy TI 2! x4! = 13547520 i: Four leters between P and S are distinc other than 7 ge remaining fout letters can be selected i ot hese letters are E, R, M, U Se have to arrange (P,E, RM, U, 8), 7, A,T,1,0,N 86° Yumber of arrangements in this case is in SC, ways, sex E x21 41= 8467200 ¢, fom al above eases, total number of ways are 43386880 + 13547520 + 8467200 - 25401600 juSTRATION 7.83 ‘Asx letters word is formed using the letters of the word LOGARITHM with or without repetition. Find the number of vyords that contain exactly three different letters, Jal) We have letters L. 0. G. ALR, TH, M. Words contain exactly three different letters Tree leters canbe selected in °C, ways, Now we have following cases for the occurrence of these three eters. Case I: Occurrence of letters is 4, 1,1 The leter which is occurring four times can be selected in 36, vas 6 Then eters canbe arranged in $* ways So, number of words in this case are *C, x. ao Case Il: Occurrence of letters is 3, 2,1 The leter which is occurring three times can be selected in °C, ys ‘The etter which is occurring two times can be selected in2C, ways. Ths nes canbe arranged in > ways So.number of words in this case are *C, x?C, x ana Case Ill: Occurrence of leters is 2, 2,2 Sinee each letter is occurring twice, number of words are é san 56, tot number of words = °C; x (90 + 360 + 90) = 84 x 540 = 45360 MustRaTION 7.84 Number of ways arranging 4 boys and S girls if between two. Birls there is exactly two boys. (SOL) Let four G6..6,, ‘Wo particular girls be G, and G;, between whom there is acti t80 boys we can be selected in *C, ways. gualts© boys are 8, and 8, Ge boys B, and B, are between G, and G,, we have to arrange BG.) Gs, Ga, Gy, By, By » ee boys are By, By, By, By and five girls are G,, G,, Permutation and Combination 7.24 Number of arrangements are 6! x 2! x 2! . 6 —_ 21 [erin ales|c Ge os mB % So, total number of arrangements are *C, x 6! x 2! x 21. ILLUSTRATION 7.85 ‘Number of permutations of the word PANCHKULA where A and U are separated, The word PANCHKULA must be separated, SLD) Case AILA, U, A are separated First arrange P, N, C,H, K, L in 6! Seven gaps are formed. xPENXCxH*KXL* ‘A,U, A are arranged in these gaps. Three gaps can be selected in "C; ways. 3 In these tree gaps A, U,A.can be arranged in 5° =3 ways ‘So, number of words in this case are = 6! « 7C, «3 Case II: AA are together but separated from U. Here we need two gaps for AA and U. ‘So, number of words in this case are 6! x "C, x 21 From above cases total number of words = 61% 7C, x3 +61x7C, x2! 2x7! (Sich aie Galette estate Ped Find the number of permutations of all the letters of the word ‘PERMUTATION’ such that any two consecutive letters in the arrangement are neither both vowels nor both identical. 2. The number 916238457 is an example of a nine-digit, umber which contains each of the digit 1 to 9 exactly | conce. It also has the property that the digits 1 to $ occur in their natural order, while the digits | to 6 do not. Find the ‘number of such numbers. | 3. Find the number of ways in which six ‘4° and four — signs can be arranged in a line such that no two ‘signs ‘occur together. | 4. Find the number of permutations of 1 distinct things taken r together, in which 3 particular things appear and ‘occur together. | S. Find the number of three-digit numbers formed by using digits |, 2, 4, 6, 7, 8,9 without repetition such that sum of digits of the numbers formed is even, Out of 8 sailors on a boat, 3 can work only on one particular side and 2 only on the other side. Find the number of ways in which the sailors can be arranged on the boat In how many ways the letters of the word “COMBINATORICS” can be arranged if all vowels and all consonants are alphabetically ordered? | Algebra - 8 Find the number of ways in which all the letters of the word “COCONUT” be arranged such that at feast one “C ‘comes at odd place. 9. Find the number of ways in which the letters of word MEDICAL be arranged if and her but all the vowels never eo 10. Six V's have to be placed in the squares of figure below in such a way that each row A: 1 together ccontains atleast one Xn how 1 many different ways can this ® be done? 6. 1728 EX(r- 2X3! 8 1080 9. 960 CIRCULAR PERMUTATION 4 2B > é Dusc Chis BODA ©) © o Let us consider that persons 4, B, C, D are sitting around a round table. If all of them (4, B. C, D) are shifted at one place in anticlockwise order. then we will get Fig. (b) ‘tom Fig. (a). Now if we shift 4, 2, C. D in anticlockwise order, we will get Fig. (c) Again, if we shift them we will get Fig. (d); and in the next time, Fig. (a). ‘Thus. we see that if 4 persons are sitting ata round table, they can be shifted four times and the four different arrangements thus obtained will be the same, because anticlockwise order of A, B,C, D docs not change. But if 4, B, C, D are sitting in a row and they are shifted in such an order that the last occupies the place of first, then the four arrangements will be different ‘Thus, if there are 4 things, then for each circular arrangement number of linear arrangements is 4 Similarly. ifn different things are arranged along a circle, then for each circular arrangement, the number of knear arrangements ism, ‘Therefore, the number of linear arrangements of mn different things is m (number of circular arrangements of n different things). Hence, the number of circular arrangements of different things is (ifm) x (number of linear arrangements of » different things) =nlin=(n—I)! CLOCKWISE AND ANTICLOCKWISE ARRANGEMENTS © y ¥ oe Or Ce of a y Gis nn peor A BCD bao abhi cng Lethe fate otcaa, These Ts ong Sane Bova four Hower ved). (3tcen), FGetoge Nl cana om sar once 8 ht ea eas etangerens re Pare ead SON cam rm one siete ue owes eee SSS Miike econ aifson em eames errr ors i appear he che deco Hae ee ante tomieredacenc mgencalty (eee nomeris no changing lier ont he ae ctnon changing Hee to pemutaos wil bce Ome sie iC Ges wi eclackwie Wig en nen, hen Sbavattn'can beads oe ex the mer of ienlr oman Sole ts of differen thn TLUSTRATION 7-86 Five boys and five girls sit alternately around a round tbl, jy how many ways ean this be done? JSOL Five boys can be arranged in a circle in 4! ways Ba After that girls ean be arranged in the 5 gaps shown as “ins Hence, total number of ways is 4! x 5! = 2880. ILLUSTRATION 7.87 A round-table conference is to be held among 20 delegates belonging from 20 different countries. In how many waysem they be seated if two particular delegates are (i) always tst together; (ii) never to sit together. ‘Sol (W Let the two particular delegates who wish to sit togethers treated as one delegate. So we have 19 delegates who a be arranged on a round table in (19 ~ 1)!, ie, 18! ways. After this, the two particular delegates ean be permute! between themselves in 2! =2 ways. Hence, by product ml ‘number of requited arrangements is 2 x (18)! The total number of arrangements of 20 delegates on aro table is 19! Hence, the number of arrangements in which the ° particular delegates never sit together is 19! ~2 x 18!= (19 = 2) = 17X18, HLLUSTRATION 7.88) How many ways are there to seat n married couples (0 23) around a table such that men and women are altemate each women is not adjacent to her ‘husband? SOLY Number of ways of seating n couples in an alteralité ‘manner, ie., one women one man and so on... = (n— 1)! #! — sp ways couples can be seated together always is we (ied number of ways =n! (2 DE 2un DE getRATION 7.89 Iuedqumber of Ways i which persons be seated aa fis oso that all shall not have dhe same neighbors ween since persons be seated a ound abe, so that all shall eae sane neighbours ay Wo arrangements, clocks c NU ticlockivise arrangements are considered fo be the wocand am cmunber of arrangements ae juusTRATION 7-90 person i see ‘round table and S other on another round table, {none round table and 6 ether on another round table {othe numberof ways in each ease in which he can arrange the guests javites a group of 10 friends at dinner and seats Sol. (The number of ways of select n of 5 friends for the first ‘able is "°C; Remaining $ friends are left for the second table. The total number of permutations of 5 guests on each table is 4), Hence, the total number of arrangements is ao! x x4lx 4! "Cx al x 01725, ii) The number of ways of selection of 6 guests is 'C,, The number of ways of permutations of 6 guests on round table is 51, The number of permutation of 4 guests on another round table is 3! Therefore, total number of arrangements is eg st xe LOL 54031 = UO 6x4! 4 ILLUSTRATION 7.91 Find the number of ways in which 10 different diamonds can be aranged to make a necklace. (Sil) Since diamonds do not have natural order of lefl and ‘ight so clockwise and anticlockwise arrangements arc taken as identical. Therefore, the number of-arrangements of 10 different iamonds to make a necklace is 94/2 = 18140. MLUSTRATION 7.92 Sixpersons 4, B, C, D, E, F are to be seated at a circular table, pho many ways can this be done if A should have either ‘or C on his right and B must always have cither C’ or D on isch [S@) Let the seat occupied by A be numbered as 1 and the "maining $ seats be numbered as 2, 3, 4, 5, 6 in anticlockwise tion, There arise two cases Formutation and Combination 7. Case 1B is on right of A, ie. at number 2 , imiber 3 ean be occupied by C or Din 7C, ways and ining. seatsin 3! ways. Hence, 12, remaining 3 persons can have remait the number of arrangements in this ease is 2% 6 Case I Cis on the right of A, jc. at number 2. Then, H ean aceupy any seat from number 3 or4 or. Then, D must boon cleft with 2 persons and 2 seats, which can he accupied in 2! ways. Hence, the number of arrangements in 21-6, These eases are exclusive, So by the sum oe) Fight oF B, so we this ease is", rule, the total number of arrangements is 12 ILLUSTRATION 7.93 Find the number of ways in which six persons can be seated at ‘around table, so that all shall not have the same neighbors in ny two arrangements. Sol) In this case, anticlockwise and clockwise arrangements ane the same, Hence, the number of ways of arrangements is 51/2 = 60, Eee nay a atley ulin i cacti deed 1. In how many ways can 3 ladies and 3 gentlemen be seated around a round table so that any two and only two of the ladies sit together? 2. Inhow many ways can 15 members of a council sit along a circular table, when the secretary is to sit on one side of the chairman and the deputy secretary on the other side? 3. Find the number of ways in which 6 men and S women can dine at a round table if no two women are to sit together. 4. Find the number of ways that § beads of different colors be strung as a necklace, '5. Find the number of ways in which 8 different flowers can be strung to form a garland so that four particular flowers are never separated. __ANSwers LR 2 12x23, 6x5! ALL POSSIBLE COMBINATIONS SELECTION OF ZERO OR MORE OBJECTS FROM DIFFERENT OBJECTS Here, we can select zero, one, two, three oF more objects (Up to all objects) So, number of ways of selection are NEY HICH MC ENC H AMCy tC 4. 2520 This ea also be observed as each object has two possibilities, cither selected o not selected. So, for different objects we have 2«2%2.,..2 (times) = 2" Thus, "Cyt "Cy H"CyH°Cy +. "Cy HC =D". 2:24 _Agebra - SELECTION OF aT LeasT ONE OBJECT FROM 7 DIFFERENT Opsects Clearly here zero selection is nt allowed, i. we have to select one, two, three or more objects (up to all objects). So, number of ways of selection are MCA MCy HCH oa GHC ILLUSTRATION 7.94 Find number of ways of selection of at least one vowel and ‘one consonant from the word TRIPLE. Sol, We have consonants T, R. P, Land vowels I, E. ‘Number of ways of selecting at least one consonant = 21— 1 = 15 Number of ways of selecting at least one vowel So, required number of selections = 15 x 3 = 45 ILLUSTRATION 7.95 There are 3 books of mathematics, 4 of science, ard 5 of literature. How many different collections can be made such that each collection consists of one book of each subject Gi) at least one book of each subject Gi) at least qne book of literature Sol. (i) One book of each subject is selected So, number of ways of selections = *C, x “C, x °C, x4x5= 60 At least one book of each subject is selected. Number of ways of selection of at least one mathematies book = 2? -1=7 Number of ways of selection of atleast one seience book 1415 Number of ways of selection of at least one literature book 2-1=31 So, total number of ways of selection = 7 x 15 x 31 =3255 At least one book of literature is selected. So, we can select any number of mathematics and science books including zero selection. So, number of ways of selection = 2° x 24x (2°- 1) = 128 x31 = 3968 ILLUSTRATION 7.96 ‘Nishi has 5 coins, each of the different denomination. Find the ‘number different sums of money she can form, “Sol Number of different sums of money she can form is equal to number of ways she select one or more coins. Therefore, Required number of ways = °C, + °C +5C, +5Cy+5C, 31 Find the number of groups that can be made from 5 different green balls, 4 different blue balls and 3 different red balls, if at least 1 green and 1 blue ball is to be included. (SONY At least, one green ball can be selected out of 5 green balls in 2°— 1, ic., in 31 ways, sila roe blue ba elected st one blue ball can be selected finn similarly, at . ways. And at least one red oF ore al 8 ways. i ee the required number of waySi8 31% 15% 8—3pp ILLUSTRATION 7-98 ted to select at least one and at moyiy, (n+ 1) distinct coins. Ifthe totaly, ol 18255, then Find *| ‘A person is permit froma collection o ‘of ways in which he can select col ofn. Soll) According to the question mG, eG a 255 But,2""'Gy +271, + AMIGA Cy tae be yet now 1G, =2"Cyg BIC = "Cag 1 wig, =", ee (using "C, mic aera IG) "pel = 1+2(255)41=2"" = 14255=2" = = SELECTION FROM IDENTICAL OBJECTS Till now we have been finding number of ways of selection fre distinct objects. Now let us consider selection from iden “objects. Suppose there are 7 identical objects. How many wap ‘one object can be selected? The answer is 1 as we have no ops to select. We can blindly pick any object. Similarly, number ways of selecting two objects is also 1. In fact, number of ws selecting any number of objects say ris 1 Selection of Zero or More Objects from 0 Identical Objects Here, we can select zero, one, two, three or more objects iP all objects). So, number of ways are 1+ 1+ 1+ =ntl + 1((n+ 1) times) Selection of at Least One Object from n Identical Objet Clearly, here zero selection is not allowed, i.e., we have (0: set one, two, three or more objects (up to all objects). So, number of ways of selection are 1 + | +1 * + 1¢n times) = ILLUSTRATION 7.99 ‘There are p copies cach of n different subjects. Find number of ways in which a nonempty selection can be from them, Also find the number of ways in which atleast copy of each subject is selected. (GGOLD Number of ways of selection of zero or more capi any subject = 1+ 1+ 1+... +1 (p+ 1) times)=p +1 So, total number of ways of selection of zero or more copies: all n subjects (+ N—+ 1)... @+ Dr times) @+y" 2 y CO r (BB) When p, 9 r; we have selection procedure as follows: "Number of objects from | Namber of objects from | pierteat things a Hentica higs Permtation and Combination 7.25 Numaer oF Divisons Consider number 24. Prime factoriza‘ion of 24 is 2’ x 3. Now divisor of24 may or may not contain 3 Also, divisor may contain eto, one, two oF three 2's. So, number of divisors is equal 0 4X2. Here 4 is number of ways in which zera oF mate 2's ean be selected and 2 is mumber of ways in which zero oF more 3°s can be selected. Also, number of divisors of N ean been seen as number of ifferent terms inthe expansion OPM DMX GPa) w = (234 (23!) + (a!) (2! 3!) + (EX 3) +B aay + (229) 4223!) HI342 +6444 1+ BHD From (1) we get sum of divisors as m2 2-1 5x 4= 60 Now any natural number can always be put in the form N=p® pS... pl where p,,py.py are distinct primes and 0%, a, ate non negative integer. Number of divisors of N= (¢ + 1) (a +1) which includes | and N also. ‘Also, number of divisors is number of terms in the expansion of OR pl +eh+ (%*1) + RO) x + PE +p t+ Pr” xipt+ph+ pe Sum of the divisors ( All the divisors excluding 1 and N are ealled proper divisors. Writing the Natural Number as Froduct of Two Natural Numbers Consider number N= 24, which is not perfect square. Divisors of 24 are 1,2, 3.4.6, 8, 12,24 Now, [X24=2x 12=3x8=4x6= 24 Thus, there are four ways to put 24 as product of two natural numbers. This is exactly half ofthe number of divisors Now consider one number which is erfect square, say V Divisors of 36 are 1, 2,3,4.6,99, 12, 18, 36, Here 1x 36 = 2x 18=3x 12=4x9= 6x6. So, there are five ways to put 36 as product of two natural numbers. This is half of the sum of number of divisors and 1 We can consider some more examples to establish that the ‘number of ways of putting N asa product of two natural numbers is F(a #1) (a5 + 1) (0G + DATs not a penet square File + Nhe. fat 41 ‘Nisa perfect square, ILLUSTRATION 7.102 For number = 35700, find i) number of divisors (ii) number of proper divisors (iii) number of even divisors (iv) number of odd divisors (¥) sum of all divisors Sol N= 35700= $x 2° 3'x 7! 17! (i) Number of divisors Q+I)XQ+ NXT +)XU+ HX +D 3x3x2x2x2 =n ‘Number of proper divisors = 72-2 = 70 Number of even divisors = 3 x2 x2x2%2 {as 2 must occur at least once) = 48, (iv) Number of odd divisors = 72 ~ 48 = 24 (8) Sum of divisors = (5° + 5! +53) 2° + 2/427) 3° +3!) (+7) (17 +17!) =BIXTX4X8X 18 = 124992 ILLUSTRATION 7.103 Find the number of divisors of the number W= 2°» 3°- $77 which are perfect squares, ‘SOL Since the divisor is a perfect square, each prime factor ‘must occur even number of times 2 ean be taken in 2 ways (2° or 2) 3 can be taken in 3 ways (3° or 3° or 3°) Similarly, can be taken in 4 ways (5° or 5? or 5# or 5*) and 7 can be taken in $ ways (7" or 7° or 7! or 7° or 78) Hence, total divisors which are perfect square=2%3%4x5 = 120 ILLUSTRATION 7.104 Find the number of ways in which the number 94864 can be resolved as a product of two factors. Sol) 94864 = 2° x 7° x 11° (perfect square) Hence, the number of ways is 1 aenaenesnen-n ieeusTRATON 7.105 Find the number of ways in which the numter 300300 ean be split into two factors which are relatively prime. Soll) 300300 = 29 3! x5? Tec! Now we have to make factors which are relatve prime. Each of 2,31, 5°, 7!, 11', 13! should be considered single factor. So numberof divisors = (1+ K+ 1Y11 +1) (+ NEA) 1) 2 = 64 Number of ways ofspliting into 2 facts ~ = 39 In an election, the number of candidates exogeq, number to be elected by 2. A man can vote in 56 ws Find the number of candidates. 5 2. There are 5 historical monuments, 6 gardens, shopping malis ina city. In how many ways a tou visit the city if he visits at least one shopping may Out of 10 white, 9 black, and 7 red balls, find the ny 3 of ways in which selection of one oF more balls yp made (balls of the same color are identical) 44. Find the number of divisors of 720. How many of are even? Also find the sum of divisors. 's. Find the number of odd proper divisors of ¥ x 6° x91 6. In how many ways the number 7056 can be resolveday, product of 2 factors? Find the number of ways in which India can win the sep, fof 11 matches (If no match is drawn and all matches ap played). Find the number of ways of selecting 10 objects from 4p objects of 21 objects are identical and remaining objec, are distinct. ANSWERS _ 6 2 25x2x(QH) 3. 879 SK piment Ine -1 623 72 a> DIVISION AND DISTRIBUTION OF DISTINCT OBJECTS DIVISION AND DISTRIBUTION OF (m + n) Distinct OBJECTS INTO TWO GROUPS OF SIZES mM AND n(m=n} Division Number of ways in which (m + n) distinct objects divided into two groups of the size ‘mand 1 is equivalent to number of ways in which o objects are selected from (m ~ n) objects. The other group of 1 objects is/—~ fotmed from the remaining n objects. So, number of ways =" Distribution Let us find the number of ways in which (m +n) distinct obj can be distributed between two persons if one gets m objects and other gets objects, For such distribution we first divide objects into groups =! then distribute these groups between persons. (aren! Now number of ways of division is ‘Two groups of objects one containing in and other containing” ‘objects can be distributed between two persons in 2! ways. So, total number of ways of distribution ~ Number of ways of division x Number of ways of distribution of two gt04F* (mem) mint — DIVISION AND DISTRIBUTION OF (m+n +p) DISTINCT OBJECTS INTO THREE GROUPS oF SIZES m,n AND p(m=n=p) bivision Forths division lt first select m objects for first group which ean be done in meet, ways. Nowfom remaining (1+ p)objectsselect probjets for second etoup which ean be") (") (2?) seein PC, ways ‘The third group is formed fromm the remaining p objects. Hence total number of ways of division =("°"7C,, 9 ("Cy meme witne mint p Distribution Now distribution of (m +m + p) objects among thiee persons iff they get m,n and p objects tumber of ways division of (m+ 11+ p) objects Number of ways these three groups ean be given to three persons (ment pt ., mint pl GENERAL FORMULA OF DIVISION AND DISTRIBUTION Let m distin objects be divided Into m groups of size x), 5.13 rQh2x. #%,) Number of ways of division Hee x tx+a;+..4¢a,00 Distribution of these m groups among n persons DIVISION AND DISTRIBUTION OF DisTiNcT OBJECTS 'NTO Groups oF Equal Size Consider division of 4 distinct objects a, b, ¢ and d into two ‘oups cach containing 2 objects. Consider the followin, 1g table for the objects contained by ‘Boup | and group 2. ab q = in the above table options I and 6 gives same divisions. ats options (2 and 5) and (3 and 4) yive same divisions *wehave 3 ways of division Pome tation and Combination 7.27 Hence, number of ways of jon is not same as that given by formula ma a Infact itis " 202824 oups (say ah and cd) is occurring twice, i... the order in which roups are formed is considered here Here we are dividing by 2! as each pair of Now number of ways of distribution of 4 distinet objects between 4! two persons ifeach gets 2 objects is <2 pei a i rip From the above discussion, we get the following results + Number of ways of division of 6 distinct objects into three 4! sroups of equal size = — 4. groups of eq Sianeli Here, we are dividing by 3! as there are three groups of "Number ways of distribution of 6 distinet objects among ay, aaa’ Number of ways of division of 12 distinct objects into five ‘4 soups ofsize 2,2, 2,3,3= ——_41_ om (22IHSTHIAT! Here, we are dividing by 2! and 3! as there are three groups of same size and two groups of other same size. Number of ways of distribution of 12 distinct objects among five persons if three of them get 2 each and two oF ai them get 3 each = ——_44_. sy * (212121313213! three persons if each gets 2 objects = ILLUSTRATION 7.106 Find the number of ways of dividing 52 cards amongst four players equally, of ways is (By ay Now this four groups can be distributed among four players in 4! ways, Then total number of ways of divi 21 a ay u3ysan, mony four players equally is ILLUSTRATION 7.107 Find the number of ways to give 16 different things to three Persons A, B,C so that 2 ets T more thaw andl Cgets 2 more B. FSOK) Leta get n objects, the Begetsn} Vand Now mint hints te sued “Thus, , B,C gets 4, 5 anil 7 objeets respectively Hence, number of ways of distribution is equal to the number of ways 16 objects ean be divided into three 16! Number of ways = 35.5 oups of size 4. $,and 7 nf 7.28 Algebra ILLusTRaTION 7.108 In how many ways can 8 different books be distributed among 3 students if each receives at least 2 books? SOL) Since each student gets at least two books, possible groups sizes are (2, 2, 4) or (3, 3,2). ‘Number of ways of dividing into groups of sizes 2. 2 and 4 8! (ayeaiat Number of ways of dividing into groups of sizes 3, 3 and 2 8! Gyr 2t So, required number of distributions among three persons lLustRaTION 7.109 zn different toys have to be distributed among » children. Find the number of ways in which these toys can be distributed so that exactly one child gets no toy ‘Sol. If exactly one child gets no toy, then exactly one child must get two toys and rest (11 ~ 2) gets one toy cach. ‘The division tree is as shown in the following figure. =I times “The number of ways of division in the groups as shown in the figure is nl nt O12 (m=2)! 2-2) “The number of ways of distribution ofthese » groups among 7 children is n!. Then, the total number of ways of distributions is "Cxn. IuiustRATION 7-110 Prove that (mn)! is divisible by (n!)” and (m!)’. Sal) Number of ways of distribution of (nm) distinct objects ran) yy a! (mty" nt (myy" Obviously, this value is integer. So, (mn)! is divisible by (m!)" Similarly, number of ways of distribution of (mn) objects equally Dy among Peron = gs = Ge ‘equally among 1 persons So, (mn)! is also divisible by (!)". DISTRIBUTION OF DISTINCT OBJECTS WHEN, Gro ’ Sizes ARE NOT FIXED ] Empty Groups are Allowed Consider distribution of n distinct objects among r persong i, ‘one can get any number of objects my | Yor each object we have r options, ic., each object cay given to any one of the r persons. b So, total number of ways of distribution = rKr Xr Xr (times)

The total number of ways is mm X-- mimes The number of ways in which one gets all the prizes is m. Therefor, the required number of ways is m"— m. InLusTRATION 7.112 x Find the number of ways in which m distinet objects canbe cept into two identical boxes so that no box remains emp, Sol.” Let us consider the boxes to be different, .ch object can be kept in 2 ways (either in box By or box B) En ‘Total number way: This includes cases when all the things are in B, or By. Number of ways = 2" 2 Since the boxes are identical, actual number of ways is 2 ere ofa Giaeey al ao 1. Find the number of ways in which four distinct balls bbe kept into two identical boxes so that no box remais empty. 2. Find the number of ways in which 22 different boos ccan be given to 5 students, so that two students &¢ 5 books each and all the remaining students get 4 boo each, 3. Find the number of ways in which 16 constables c40™ | | assigned to patrol 8 villages, 2 for each. In how many ways can 10 different we prizes be gi 5 students if one particular boy must get 4 prizes and of the students can get any number of prizes?

You might also like