Scribd
Upload
227 views66 pages

Permutaion and Combination

Uploaded by

kasalachinu
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
227 views66 pages

Permutaion and Combination

Uploaded by

kasalachinu
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
Permutation & Combination DISCLAIMER “The content provided herein are created and owned by various authors and licensed to Sorting Hat Technologies Private Limited (“Company”). The Company disclaims all rights and liabilities in relation to the content. The author of the content shall be solely responsible towards, without limitation, any claims, liabilities, damages or suits which may arise with respect to the same. Permutation & Combination Fundamental principle of countin; Fundamental principle of counting is a method that is used to find the total number of ways of completing a work (this work consists two or more number of independent sub works). According to this principle, the total number of ways to complete the work will be equal to the product of the number of ways of completing the sub works. So if one sub work can be done in ‘m ways following which another sub work can be done in ‘n’ ways, then total number of ways to complete the work is men. Generalization ‘A work consists of n independent (m,, ™m,, --, M,) Sub works then total number of ways to complete the work is m, x m, xem, FPC (Fundamental Principle of Counting) is used to count some event without actually counting them. Let us take help of some model trEe—4r-R—r, TR, tT LR—-{r,| TER, Qt. in how many ways he can travel from t/t, T, toT, 1 £0 Ts t. /-Ri—{r,}-Rs—{,] = 6 ways ‘Sol. He can travel from T, to T, in 3 ways ys Model-1: Abhishek is travelling from Ahmedabad (T) to Calcutta (T.) via Bombay (T,). There are 3 ways to travel from T, to T, and 2 ways to travel from T, to T,. Then then total number of ways to travel from T, to T, is 3 x 2 = 6 ways (Using FPC) Q2. Find number of round trips ? Sol. T, 97,97, 9T, 97, 3x2%2% 9 = 36 ways Q3. Number of round trips if any path can't be used twice? Sol 3x 2x1x2=12 Modi Mukesh wants to see a movie. So he goes to pew the cinema hall. There are 5 ways to enter and H exit the cinema hall. Then QA Number of ways he can enter andexit through |, E, A consonants > M,R,C,L Three vowels at three position > 3x 2%1=6 Four consonants at four position => 4 x 3x 2*1= 24 Total number of ways = 6 x 24 = 144, f 1234567 @) 1 vowel have 4 choice 2 vowel have 3 choice 3 vowel have 2 choice Thus total ways = (4 «3x 2) x (4x 3x21) = 576 In how many ways 6 letters be posted in 5 different letter boxes ? ws (8) 6 (c) st (D) et @ Since, each letter can be posted in any one of the five different letter boxes. So, a letter can be posted in § ways. Since, there are six letters and each can be posted in 5 ways. So, total number of ways EEX G5XG5XSXSXS HSS Find the number of ways in which we can post 5 letters in 10 letter boxes. I# letter > 10 boxes 2% letter => 10 boxes 3” letter > 10 boxes 4° letter => 10 boxes 5" letter => 10 boxes Total ways = 10° Sol. Lexicography illustrat Find the maximum number of car plates that can have 3 or 4d plate and @ is not included in any of the number plate? number Here repetition of digits is allowed. Also, numbers are formed with the digit 1, 2, 3, Case-I: When car plate numbers contain 3 digit, number of places to be filled up r=3. Out of the 9 digit first place can be filled by $ ways. Similarly, 2" and 3" place can be filled in 9 ways respectively. So, when car plate number contains 3 digit, maximum number of cars = 9% When car plate number contains 4 digit, in this case number of cars to be filled up r= 4. 1 place can be filled in 9 ways. 2" place can be filled by 9 ways and so on. Maximum number of cars that can be numbered.= 9? + 9 = 7290 Know the facts & Lexicography is called science of making words. Find total number of 5 letter word that can be formed from letters of word “TOUGH” TtttT Bx ae gu dxt=12 f all the words (with or without meaning) having five letters, formed using the letters of the word SMALL and arranged as in a dictionary, then the posi- tion of the word SMALL is (a) 46" (B) so" (c) 52 (p) se" Sol. Sol. (0) Total number of words, which are formed by using all the letters of the word SMALL =5!/2! = 60 Let’s count backwards. The 60" word is SMLLA The 59" word is SMLAL 58" word is SMALL All the words that can be formed using alphabets A, H, L, U, R are written asin a dictionary (no alphabet is repeated). Then the rank of the ward RAHUL is (A) 70 (8) 71 (©) 72 (0) 74 ©) Since alphabets are in order A, H, L. R. U as in dictionary. If word starts from A then number of words formed = 4! If it starts from H then no. of words formed = if it starts from L then no. of words formed = First word starting from R with alphabet A, H, L, R, U is RAHLU. Next word is RAHUL ~. Rank of the word RAHUL is 48+ 4l+ 4t4141=3%24+2= 7242574 If the letters of the word ‘MOTHER’ be permuted and all the words so formed (with or without meaning) be listed as in a dictionary, then the position of the word ‘MOTHER’ is 309 Total words starting from E = 5! = 120 Total words starting from H = 5! = 120 = 24 24 Total words starting from MOE = 3! = 6 Total words starting from ME = Total words starting from MH = Total words starting from MOH = Total words starting from MOR Total words starting from MOTE = 2! = 2 and next word is MOTHER Sol. =. Position of the word ‘MOTHER’ is 120 + 120 + 24+24+64+64+6+2+1 = 240 +48 +18 +3 = 309 @ Find the number of four letter word that can be formed from the letters of the word HISTORY. (each letter to be used at most once) 1) How many of them contain only consonants? How many of them begin and end in a consonant? (iv) How many of them begin with a vowel? (v) How many contain the letters Y? (vi) How many begin with T and end in a vowel? (vil) How many bogin with T and also contain S? (viii) How many contain both vowels? @ [7 ]e[5]4] = 840 5] 4[3[2| =120 5]5]4]4] = 400 2[6[5]4] = 240 Total places available for Y is 4 other three places can be filled by 6 x5 x 4 ways Total ways = 480 ways wi) [15472] = 40 Wit) [T Total placed available for S = 3 Other two places can be filled by § x 4 = 20 ways Total ways = 60 ways quilt) For first vowel 4 places available 10. For second vowel 3 places available Other two places can be filled by 5 x 4 = 20 ways Total ways = 240 ways NOTATION OF FACTORIAL Notation of factorial and its Algebra : Definition : n factorial (represented by n! or In ) is the product of first n natural numbers. This can also be defined as Number of ways of arrangement of n different digits at n different places. Note:() Of=1 Qx1=2 3x2x1=6 4x3x2x1=24 Sx4x3x2x1=120 6x 5x4x3x2%x1=720 (i)Factorial of negative is not possible because we are considering the product of natural numbers. © The sum ye +1) <("}) is equal to (nx 1 (B) 10 x (11) coy (D) 11 x (101) Sol, WehaveT,=(@+1+6-or Sere = (r= Tet STs er +d 2 T,'= 10) - 0, (2 + Ort = (r= et T,, = 10(11!)-9(10) 10(1 Le +) is equal to 2° 2 2 2 ar @® cory © To! Oro Sol, We have v4 yt yaa So—+—_+—_ a1! aim" 5151 (Qni=1+2+3+4-5-6-... 2n-1) Qn) Take 2 common each n even terms = 2(1-3-+5... (Qn-1)) 1° 2°3...9) = 2 (A) 03°58... n= 1) © The value of 2n{1. 3.5... (2m = 3)((2n = 1)} is A) (2n)iint B) (2n)!/2n (©) nY¥can)t (D) None of these Sol, “ - __(2n)12"__(2n)! 24.6...2n 2°02.3...n) 0 The sum 1x 1142 214... + 60 x 50! equals @su (B51 (ce) su44 @)2*51 Sol, 109 +22) + aun #50 (50) =2-D00+GB-12D+4-ND+... + G1- 160) = (2! = 1!) + (3! = 21) + (4! = 3) +... + Git - 50). =S5-W= 5-1 The power of prime p in n! can be find out using the formula where s is the largest positive integer such that p! $n < pt” Q, Find exponent of prima 2 in (100) Sol, 2: 50)! = 20. so11-3-5... 99) + 60 2's (60!) = (2+ 25)! = 29. 251 (1-3-5... 49) > 252's (241) = (2- 12)! = 209-121 (1-3-5 ... 23) + 12 2's (129 = (2-6)! = 26-61-35 1) > 62's (6) = (2-3! = 2311-35) +3 2s (WY =3-2-122m- 4-3) 41 2s 50 +25+12+6+341=97 Alternative Method : —_ son) he =50+25+12+6+3+1=97 25tis equal to (A) 27, 3.55.79. 117, 13, 17,19, 23 (B) 2°. 37.5%. 7. 11°, 13, 17.19, 23 (C) 2%, 3.5%, 7%, 117, 13, 17, 19, 23, (D) None of these 13. Sol. =12+64+3+41=22 28) 4/28 e42-10 a} le Fel 25! = 22. 3. 6-72-11 1317-19-23 ‘The number of zeros at the end of 100! is, (A) 25 (8) 23 (©) 24 @) 26 «) [100] F100) , F100] | F100) , F100] | F100 here > |" a 7a JL Le 2 £50425 412464341297 and (122 «| $22) «2044.26 100122". 54, = 20. om. 5, = 2. (2 « §)4 = 22 10%, Thus, 100! is divisible by 10%. 100! ends with 24 zeros 14, Sol. Sol. Sol. The numbor of zeros at the end of 20171 is (A) 500 (8) 501 (c) 502 (D) 503 ©) i 2017] [2017] [2017] [2017 ere. 5 |*|e | * | *L ot = 403 + 80 + 16 + 3 = 502 2017! ends with 502 zeros Tha number of zeros at the end of 2007! is (A) 499 (®) 500 (c) 501 (D) 502 @) 2007 2007 ‘2007 [= | = 4ou[20%7 | 20/2207 |- 2007! = (3 + 16 + 80 + 401) - 20 35... = 59.90 BB... 2007! ends with 500 zeros Find the exponent of 80 in 200! 80=%«s To find the exponent of 80 in 200!, we find the exponent of 2 and 5. Exponent of 2 is ee eee ene = 100 +50 +25 +1246+3+1=197 Exponent of 5 is 200) ,/ 200) 1200) «so 4941249 5 ES S Now, exponent of 16 in 200! Is [197/4] = 49. Hence, exponent of 80 is 49. 15. Find the exponent of 11 in **C,,.. ar 6) 12 wes (01 ©) weg, 200! 725175! Exponent of 1 in 200! = [200] = [222-1019 w |* LaF Exponent of 11 in 125! =|778/.(228) nc {85, 86, 87, 88, 89} Permutation and Combination : Permutation : Permutation means arrangement in a definite order of things which may be alike or different taken some or all at a time. Hence permutation refers to the situation where order of occurrence of the events is important. Combination : Combination/selection/collection/committee refers to the situation where order of occurrence of the event is not important. Combination is selection of one or more things out of n things which may be alike or different taken some or all at a time. Example: (i) Make a number plate of 3 numbers of a car using the numbers 1, 2, 3, 4, 5, 6 is arrangement and it is considered under permutation (ii) if we have four letters P,Q, R, and S and if we choose any 3 letters out of these 4 to form a possible triangle, this comes under combination. ‘Theorem related to application of Permutation and combination : Theorem-1 Number of arrangements of n distinct things taken all at a time is called nt and is represented by —"P, = P(n, n) = AD Proof : Let these aren things arranged at n places ne (n-t) (9 -2)..3-2- 12H! Example: Number of words that can be formed using all the letters of the words 'SHAKTI' is 6! 20 Theorem-2 Number of arrangements (permutations) of n distinct things taken r at atime is represented by "P, where 0 ¢ r +10n = 1750 §n(n - 1) + 20n = 3500 + nin - 1) + 4n = 700 n? + 3n ~ 700 = 0 = (n - 25)(n + 28) = 0 n= 25, -28 n= 25 (Rejecting negative number) How many different words can be formed from the letters of the word GANE- SHPURI, when the letters E, H, P are never together EHP [EHP] + string (Consider EHP as a letter or string) 22. Sol. Sol. Sol. So, we have to arrange one string and 7 letters Hence total number of ways = 10! - 8! x 3! EHP can be arranged amongst themselves in 3! ways. Six boys and six girls sit in a row. The number of ways they can be seated when the girls are separated is 2 a) (? ) (B) (6n2 (c) 617! (D) (72 (c) Clearly, we have 7 vacant places for the 6 girls and so they can be seated in 7P, = 7! ways. The desired number of ways is 6!7! In a morse telegraphy there are 4 arms and each arm is capable of taking § distinct position including the position of rest. How many different signals can be transferred Every arm can take § positions. Hence total number of signals = 5¢ There is one position in which every arm is at rest. Hence total number of different signals = 5*-1 An 8 oared boat to be manned from a crew of 11 of which 3 can only steer. In how many ways the staff can be arranged if 2 of the men can row only on the bow side. Crew of 11 oar 8y pt Stroke 6S 72 Bow 3can steer only 8 canonly row side 7 J be 2 aaa 2 only bow side 6 any where 23. Sol. Out of 3 person, 1 person can be selected by °C, ways for steering position. 2 places can be selected out of 4 on bow side for two particular person by ‘C, ways and they can be arranged by 2! ways. Rest six persons can be arranged by 6! ways at six places. Thus, required ways = °C; x (*C2 (2!)) « (6!) Steer Row Any side side 4 Boys and 4 Girls are to be ated in a line find number of ways ) Number of ways they can be seated, (i) They can be seated so that “No two girls are together” ii) If not all the girls are together or If at least one girlis separated from rest of girls. (iv) Boys and girls are alternate (¥) If there are 4 married couples then number of ways in which they can be seated so that each couple is together. @ They can be seatedby 8! Gi) Out of four standing boys five gaps are there 18,18,18,1 8, Out of five select any four gaps by °C, ways in which girls are arranged by = 5C, x 4! ways. Also’ standing boys are arranged by 4! ways Required ways = (4!) x @C, - 4!) Note : Arrangement by this method is called as gap method. Gi) Consider G, G, G, G, — as one string. cr Four boys If all girls are together then total ways = (1 + 4)! (4) rx 4) Arrangement of four girls in string Total number of arrangement without any restriction = 8! Total number of ways by which not all girls are together= String (5! « 4!) 24, Sol. (iv) Boys and girls are alternate then two ways of arranging respective position of boys and girls are shown below LEELLOOe Number of ways of arranging boys => 4! oR Number of ways of arranging girls => 4! B®ASAOASD Required ways = 2 4! x 4! PAPA CACC CAC PY (vi) Let the couples are as below 2,6] [2,6] [2.¢,] [B.6. There are four string and each string has husband and wife which can be arranged in 2! ways. Ways of arranging strings = 4! Required ways = (2)* x 4! In how many ways 10 examination papers be arranged so that the best and the worst papers never come together? Required ways = Total ways - When best and worst papers are together = 8 x 9! Apostman has to deliver 600 cards on Christmas day, the cards have been col- lected from the students of a class in which every student sends a card to every other student, then find the number of students under such condition? Total number of students = n Number of pair of students = *C, Two students out of n can be selected in "C, ways. Here for each pair of students, number of cards sent is 2 If P sends card to Q, the Q also sends a card to P. Number of cards sent = 2x °C, According to the problem 2 x ‘C. n(n-1) 600 = 2x = 600 = n?-n-600 =0 => n=25 [n= 24] 25. Sol. Sol. Sol. Consider the letters of the word ‘PERSON’, R find the number of ways in which these let- a, ters can be placed in the squares of the given figure so that no row remains empty? Ry | l There are 6 different letters in the word ‘PERSON’ Total required way = Total possible way ~ (1* row empty + 2" row empty) Total possible ways = *P, (arrangement of 6 different letters in 8 boxes) Ways when 1* row empty = 6! (arrangement of 6 different letters in remaining 6 boxes) Ways when 2" row empty = 6! (arrangement of 6 different letters in remaining 6 boxes) Total required ways = ®P, - (6! + 6!) = 18720 One Hindi medium school and one English medium school is under the lead- ership of one principal. Suppose the positions for the principal, 4 teachers of English and Hindi medium school are empty. 'f there are 11 candidates applied for the job, 3 out of these 11 are applied only for the job of principal and 2 only for the job in English school, then find the number of ways in which these dif- forent appointments can be filled is: (A) 4320 (@) 268 (c) 1080 (D) 25920 (0) One sup. = °C, Excepts two fixed English teachers, rest 6 teachers can be arranged at 6 positions by 6! So Total ways = *C, x 4C, x 2! x 6! = 25920 If m denotes the number of 5-digit numbers if each successive digits are in their descending order of magnitude and n is the corresponding figure, when the digits are in their ascending order of magnitude then (m-n) has the value @rc, @c, (*c, (0) °c, (8) m="C, 26. n=°C, m-n=*C, Formation of groups : (No. of ways in which (m + n) different things can be divided in two groups, one containing m things and other contains ‘n’ things is (m+n)! or min! ming, >. Out of four players P,, P,, P,, P, form two teams one contain 3 players and other one player, Sol, Number of groups = 4 = 4 . U3! Note: = Actual explanation of above 4 groups Select-3 | Rejected-1 These an 4 answers so obtains P.sPa Py Py PoP, Pi P,,P,.P, P, (MW) If groups are equal size ie., m= n P,,P,.P, [Py Total number of ways in which 2n different things can be divided into two equal groups Je (2n): 2! (m4) (m1) (24) We divide by 2! to avoid false counting, Proof: Divide P,, P,. P,. P, in two groups We see that half of the case are repeated. 4! Thus —— gives us wrong answer. 2121 IRI) Actually, counting all such cases we observe that regrouping appears when equal size groups are required. To avoid false counting we divide by factorial of number of equal size group's. (itt) Total numbers of ways in which (m + n + p) different things can be (man p)! divided into three unequal groups m,n, p is ——— minip! ©. Find the number of ways in which 21 distinct objects can be divided into three "groups each containing 7 objects. tay 2 py 21! "5 yt Qo! Gy © oF © 305 ©) Gai Sol, © We know, number of ways to divide (mn) objects equally in m group (each group will get n objects) fran)! = x7)! __(2) (nym xm! (7!1P-3! (77-3! Important Points : The number of ways in which ‘r’ group's of n different object’s can be formed in such a way that ‘p’ groups of n, object, q group of n, object each is... Required ways = (4) (n° (eC!) n= (n, +9,...p times) + (n, +n, ... q times) Divide by factorial of number of equal size group. Cc Sol. There are 3 copie: arranged in a shelf (A) 369600 (8) 400400 (©) 420600 (0) 440720 ach of 4 different books. The number of ways they can be # There are 4 sets of 3 identical books. The desired number is a 369600 Sol. oO. Sol. Sol. 18 mice were placed in twa experimental groups and one control group with all groups equally large. Find the number of ways in whieh the mice can be placed into three groups. 18! 48! (3m)! ® oy © fey © enty ®) If 3m things are divided into 3 equal groups, then number of divisions are given by (3m)! (my? 2. Required ways Find the number of ways in which 52 cards can be divided into 4 sets, three of ‘them having 17 cards each and the fourth one having just one card. “ iw e) 5 © iw ©) ee (8) Since, 52 cards is to be divided into 3 equal sets (each containing 17 cards) and 1 set (containing only one card). (52 (82 zwhibh (yp Required number of ways = In how many ways six different books can be distributed between four persons, so that each person gets at least one book. Two cases possible {1, 1, 1, 3}, (1,1, 2, 2} Groups jay (uy 313! (1 (2s) 212! Sol. Sol. Find number of ways by which five different objects given to three students, ‘so that each person gets atleast one object. Two cases possible {1, 1, 3} {1, 2, 2} Number of ways in which 8 persons can be seated in three different taxies each having 3 seats for passengers and duly numbered If internal arrangement of persons inside the taxi (b) If internal arrangement also matters immaterial. 2 a a4 x eo aS [asaa xo 3 a! ) x1 |3:/ara:a! asa 2! 9 (b) Using grouping it or arrange 8 people in 9 seat °C, * 8! Acandidate is required to answer 6 out of 10 questions which are divided into 2 groups containing 5 questions each and he is not permitted to attempt more than 4 questions from each group. The number of ways he can make up his choice is, (A) 120 (e) 150 (©) 160 (0) 200 (D) He can choose 4 from 1st group and 2 from the second group, 3 and 3 or 2 and 4 smoot IIIHT = 50 + 100 + 50 = 200 In a jeep there are 2 seat in front and three in the back, number of different ent height can be seated co that every one in ways in which six persons of front is shorter than the person directly behind him, Sol. cSt Gix3! _6x5x4x3%201 6 45g 00 Ans 8x6 @_ in how many ways can five people be divided into three groups. Gi) In how many ways can five people be distributed in three different rooms if no room must be empty. @ In how many ways can 12 different balls be divided between 2 boys, any ‘one receiving 5 and the other 7 balls? Gi) In how many ways can these 12 balls be divided into groups of 5,4 and 12! Sol. © gr?! Permutation of Alike object: [case-1: taken all at atime [Case -11: taken some at a time Case-I : Permutation of alike abjects taken all at a time Number of P of one kind permutation << g of another kind and } taken all ata time=— = of n things tare all different Proof: DADDY Let the D's are different DiA D2 Os ¥ DiA D3 02¥ ‘one DAD D Vis counted as Ds AD; OY six different, word's Ds AD: D3 ¥ Let x is required ways Da AD: DY xx (6) Ds AD; D2¥ x The number of numbers that can ke formed by using all the digits from 1, 2, 3, 4,3, 2, 1, $0 that odd digits occupy odd place: (ay 12 (ey 18 (©) 24 (0) 36 Sol, © 1,1, 3, 3 are to be placed in the 4 odd places and 2, 2, 4 are to be placed in the 3 even places. AL 3! i is Soa 8 The desired number is 37374] Sol. Sol. The number of words that can be written using all the letters of the word ‘IRRATIONAL’ is 10! 10! 10! O oF ®© oy © @ There are 10 letters in the word IRRATIONAL in which there are 21”, 2'R’ and 20° to! _ 10! H212! (21)? (0) 10! @) ». Number of words = Six identical coins are arranged in a row. The total number of ways in which the number of heads is equal to the number of tails is as (6) 15 (©) 20 (0) 40 (c) Since coins are identical and we have to find the number of ways in which we get 3 heads and 3 tails. Total number of ways = Number of ways in which the letters HHHTTT can be ar- Consider word ASSASSINATION, find number of ways of arranging the letters. @ Number of words using all. Gii) If no two vowels are together. Gii) If all S are separated. Gv) At least one S is separated from rest of the S's (¥) vowels are in the same order. (vi) Relative position of vowels and consonant remain same. (ASSASSINATION contains four S, three A, two N and two |. 13: (44) (29(29(29 (i) We have six vowels as A, A, A, I, |, 0 and seven consonants as S,S,S,S,N,T,N |S|S|SISINITIN] Six vowels in 8 gap’s Total ways Total ways 33. Gi) |ATATIINIAITILIOINT ut of 10 gaps select 4 x ga! PINE) (iv) Total - all four $ together 13! 10! Consider SSSS as one string. Total way = "C, a" (wv) Total ways= "C,x1 x wp [v v vl fv] [vy 6! Total = = x otal ways = = arangarpert—agrangemeat ae TE How many different words can be formed by jumbling the letters in the word MISSISSIPPI in which no two S$ are adjacent? (A) 7-"C,-"C, (B) 8-*C,-7C, (€)6-7-"C, (D) 6-8-7, @ Leaving S, we have 7 letters M, I, |, 1, P, P, |. Number of ways of arranging them 7 mm and four $ can be put in & places in °C, ways. 1563 *C, “a (b) 4 different from 5 possible option > C, 2.3.alike, 3 different (a) 3 alike 000-» 'o, ‘ox =10 49,8! a! (b) 3 different out of 5 different option > 5C, 3.2 alike of one kind (a) 2 alike of one and 2 alike of 3g, 4¢, 2 alike other kind ‘other PP, RR, O00, > °C, and 2 different (b) 2 out of 4 different ‘c, 4.3 alike of one kind (a) 000, PR. PR-> 'C, x *C, 6! +2 alike other kind fan “ara + different (b) 2 out of 4 different : > *c, 5.2 alike, 2 alike PP,RR,000 > °C,x Cx’, 'Cy=1 8! + 2alike * So 6.All6 different 6 possible option 6! P,R,O,T.1,N > %C, Total Number of Number of section = 53 words=11130 Then total number of words formed = 11130 33. © How many 5 lettered words can be formed using the letters of the word “INDEPENDENCE” Sol, There are E> 4, N-> 3,0 2,Po 4141051 4 alike and 1 diff. 3 alike and 2 diff. 3 alike and 2 alike of diff. kind 2 alike and 3 diff. 2 alike + 2 other alike and 1 diff all five diff. 1«9C,=5 &g EEEED °C, x 5C, = 20 EEEDD 1G, «IC, = 4 EEEDD °C, «*C, = 30 ENO! %, x 4=12 EENND “c,=6 EDIPC Number of arrangements = 3345 Sol. $7 4134P+2M>1 Sg = 25 a 5! 2.20400 5! 37% 80 = 1800 5! 22! x12 = 360 6x5! = 720 Find the number of words each consisting 5 letters from the letters of the word “MISSSISSIPPI" 40. Sol. Sol. 5! (1) 4 alike, 1 different (2) 3 alike, 2 alike (3) 3 alike, 2 different (4) 2 alike, 2 alike 1 different (5) 2 alike, 3 different Total 2C,x8C, = 6 2G, x, =4 3, x50, = 6 3G, x C, = 6 8¢, x 8C,=3 Number of Selection = 25 Then total number of words formed = 1350 6x Number of Arrangement = 1350 Determine the number of permutations of the letters of the word MATHEMATICS. M -2,A-2,T-2,H-1,E-1,1-1,0-1,5-1 Total permutations = In how many ways can be letters of the word RESTRICTION be arranged so that the vowels never occur together. Consonants = R- 2, -1,T-2,C-1,N-1 a. Sol. Sol. Vowels > E-1,1-2,0-1 using gap method, 4 tT Total ways = °c, 212! How many ways can be formed with the letters of the word RESTRICTION without changing the relative order of the vowels and consonants. 4! Total ways = > .5 In how many ways can the letters AAABECD be arranged so that the two B’s are together but no two A’s are together. AAA BBCD A-3,B-2,C-1,0-1 | [Be] ¢ | >| ase, 1224 CIRCULAR PERMUTATION ‘When object aro different Arrangements of objects in a closed curve considered as circular permutation while arrangements of objects in a line (row) considered as linear permutation. That's why, ular permutation, one object can be considered as fixed and the remaining objects are arranged as in the case of a linear arrangements. Note: @ The number of circular permutation of n distinct objects is (n ~ 1)! (i) Taken r things out of n distinct things at a time and arranged along circle in *¢,.(r-1)! ways. (iii) If anticlockwise and clockwise are considered to be same total number of circular permutation given by 2 If we arrange flowers or garland beads in a neckless then there is no distinction between clockwise and anticlockwise direction. 42, Gu) If we have n different things taken r at a time in form of a garland or neckless Required number of arrangements _*6,.(e=1)! ~ 2 {v) The distinction between clockwise and anticlockwise is ignored when a number of people have to be seated around a table so as not to have the same neighbours. ©. Ifthere are 7 persons in a group, the number of circular permutations of 7 "persons when clockwise and anticlockwise arrangements of 7 persons a same, is a) 120 (®) 240 (©) 360 (0) 480 Sol. © ‘We know that, number of permutations of n different objects when clockwise and anticlockwise a arrangement of objects are same = :, Required arrangements = aT Thore are 18 objects out of which two are b, and b,. Find the numbar of ways in which we can arrange them at a round table so that there is exactly one object between the objects b, and b, (a) 2x14 (8) 2« 151 (c) 2* 161 (0) 2% 171 Sol. © Let a object M will be placed between the objects b, and b,. Now, object M can be chosen from 16 objects (excluding b, and b,) in 16 ways. Now, consider the objects b,, b, and M as one object, we have (18 - 3 + 1) 16 objects in all. These 16 objects can be arranged around a circle in (16 - 1)! = 15! ways. But b, and b, can be arranged themselves by 2! ways. Hence, the total number of ways = 16 « 15! « 2! = 2« 16! 43. Sol. Sol, Sol. The numb 9 chairs, is 2p 294 as ws «® (2) (6) 2 (@) None of these of ways in which 29 persons be seated around a table if th: (8) In case of circular table, clockwise and anticlockwise arrangements are different, "P number of circular permutations of n different things taken r at a time = a =P) », Required arrangements = n different things are arranged in a circle. In how many ways can three object be selected if no two objects are consecutive Select 1 thing, let's say a, by "C, then we can not select a, and a, Now we are left with (n - 3) things out of which we have to select 2 things, leave those two, now we have (n - 5) things. Se- lect two positions in between these (n - 5) by "5", nc. 9-4) Hence — is the required number of ways. Find number of circular permutation of n persons if two specific people are never together. Required ways = Total - when A and B are always together = (n =1)! = (n= 2) x2 = (n- 2)! [n-1- 2] = (n= 2) (n- 3) ‘The number of ways in which four boys can be seated around a round table in four chairs of different colours is (A) 24 (8) 12 (c) 23 (0) 64 44. Sol. Sol. Sol. a) Required number of ways = 4! = 24 Find number of ways in which 5B and SG can be seated on a circle alternately if a particular B, and G, are never adjacent to each other in any arrangement. For B,, G, not to be together. G, must select from 3 possible gaps in °C, ways 4! x 2Cix 4! = 1728 In how many ways triangle can be constructed by joining vertices of a quindecagon if none of the sides of triangle can be sides of quindecagon. By method in above question ¥e,x"e, 275 In how many ways can 5 men and 5 women be seated at a round table if @ there is no restriction Gi) all the five women sit together Gili) no two women sit together (iv) not more than four women sit together @ Total persons = 10 So 9! Gi) [W.W,W,W,W, |M, MM, M, My So (6 - 1)! 5!= 5! 5! 4s. Gili) Using Gap method, 4 -8C,+ 51 = 4! 5! Giv) Total ~ (all women are together) = 9! - 5! 5! In how many ways can 5 men and 3 women be seated at a round table if @_no two women sit together (i) two particular women must sit together, while the third one must not sit beside those two. @ Using gap method, Sol. (5-1) °C, St = 41+ PL @) [ww, |w, Using gap method, = 4! x 5Cx 21 x 2! > Find the number of ways in which n different beads can be arranged to form a necklace, Sol, Clockwise and Anticlockwise distinction is ignored (n-1)' 2 So TOTAL NUMBER OF COMBINATIONS OR SELECTION OR COLLECTION : We know that 14x)" =" Cy PC x49 x7 4 Cyr? ta AG AMET Now replace x by 1 then 2'="C,#C,4°C,#°C, Case-I: Selection of one or more things out of n things. When all the things are different total number of selections. One things can be selected in ‘C, ways Two things can be selected in °C, ways Three things can be selected in °C, ways 46. n things can be selected in "C, ways Total ways ="C, + °C,+C,+...#°C,=2°1 case The number of ways of selecting zero or more things out of n identical tt Proof: Selecting none thing = 1 way Selecting 1 thing = 1 ways Selecting 2 things = 1 way Selecting n things = 1 way Total number of ways = 141+... + (a #) times = (n +1) Case-Il; Number of ways of selecting one or more things out of which p are alike of one kind, q are alike of secend kind, r alike of third kind, while s are different is (p + 1)(q + I(r +1) 25=1 Proof: Selecting none thing (out of p alike things) = 1 way Selecting 1 thing (out of p alike things) = 1 ways Selecting 2 things (out of p alike things) = 1 way Selecting p things (out of p alike things) = 1 way Total number of ways = 141414... + (p +1) times = (p +1) Similarly for q alike, total ways = q +1 Similarly for r alike, total ways =r +1 For s different things total ways of selecting will be 2%, i.e. any item is selected or not. So total number of required ways = (p + 1)(a + I(r + 1)25-1 (Vis subtracted when no item is selected) Aman has 6 friends. Number of different ways he can invite 2 or more fora dinner is se (72 ©) 28 ©) 57 47. Sol. © Required number = *C,+ *C, + °C, + °C, + °C, =15+20+15+6+1= 7 > The question paper in the examination contains three sections A, 8, C. There are 5, 4, 3 questions in each sections A, B, C respectively. A student has fr dom to answer any number of questions attempting at least one from each section. In how many way can the paper be attempted by a student? (A) 3250 (@) 3225 (c) 3285, (0) 3205 Sol, © As section A having 5 questions, the student can select at least one question out of § in (2% - 1) ways. Similarly, the student can select at least one question from B and C by (2'-1) and (23-1) ways. Hence, total number of ways in which a student can attempt the paper = (26 = 124 - 12° = 1) = 3115 x 7 = 3255 Find the number of ways in which one can make a selection of at least one book on each of three subjects physics, chemistry and mathematics from a library containing 4 different books on physics, 6 different books on cham- istry and 3 different books on mathematics? (A) 6605 (8) 6610 (c) 661s (D) none of these Sol, © A selection of at least one book on physics can be made out of 4 different books in 4C, +4C, 44C, + *C, = 24 1=15 ways Similarly, atleast one book on chemistry can be selected in 2° - 1 = 63 ways and at least one mathematics book out of 3 can be selected in 2? -1=7 ways. Hence, the required number of ways of selecting at least one book on each of three subjects = 15 x 63 x 7 = 6615 Total number of combinations in different cases: (a) The number of combinations of n different things taking some or all (or atleast one) at atime = "C,+°C, +... #°C= 2"=1 48. (b) «) The number of ways to select some or all out of (p + q + 1) things where p are alike of first kind, q are alike of second kind and r are alike of third kind is = (4 GAD (r+ -1 The number of ways to select some or all aut of (p + q + t) things where p are alike of first kind, q are alike of second kind and remaining tare different is =(PtDQtnz-1 PROBLEMS BASED ON NUMBER THEORY Note that every natural number except 1 has atleast 2 divisors. if it has exactly two divisors then it is called a prime. System of prime numbers begins with 2. All primes except 2 are odd. A number having more than 2 divisors is called a composite. 2 is the only even number which is not composite. A pair of natural numbers are said to be relative prime or coprime if their HCF is one. For two natural numbers to be relatively prime it is not necessary that one or both should be prime. It is possible that they both are composite but still coprime. eg. 4 and 25. Note that 1 is neither prime nor composite however it is coprime with every other natural number. A pair of primes are said to be twin if their non-negative difference is 2 e.g. 3 and 5; 5 and 7 etc. Number of divisors and their sum : (a) (b) (©) Every natural number N can always be put in the form N= pS pi ...pft where p,, p,, ..P, are distinct primes and ,,d,...., G, are non-negative integers. If N=ph pit... then the number of divisor of N is equivalent of number of ways of selecting zero or more objects from the groups of identical objects, (p, p,...0, times) (p,, Py, A, times), My Py oly times)= (a, + 1) (a, + 1) ...(a, + 1) which includes 1 and N also. All the divisors excluding 1 and N are called proper divisors. Also number of divisors of N can be seen as number of different terms in the expansion of b+ pis? +. pt) x (ph + ph red +t pe) xn n(n, ep? +08) Hence, sum of the divisors of N is 49. tps pe +. tpt) x (+p, +63 ++ pe] x x(trp, pf + +P tty yet a Pi P,-1 Pot aT (@)_ Number of ways of putting N as a product of two natural numbers is ; (a,+.0 @, +1) la, +1) if N is not a perfect square If Nis a perfect square, then this is ; (a,4 1) (@, +1) a, #1) +1) (©) IfN=p*x q? «©... p,q are prime number and a, b are natural number. (Total number of divisors) 2 where | is the number of required ways if N is not a perfect square. (Total number of divisors + 1) 2 where | is the number of required ways if N is a perfect square Consider the number N= 75600 Now answer the following question @ Number of divisors Gi) Number of proper divisors Gi) Number of odd divisor (iv) Number of even divisor (Number of divisors divisible by 5 (vi) Number of divisors divisible by 10 (vil) Sum of all divisors (vill) Number of ways in which N can be resolved as product of two divisors Sol. @N=2 Kea KT Number of divisor = (4 +1) (3 +1) (2+) (1+1) =5x4x"3x%2=120 Gi) Proper divisor will be other than 1 and number itself So proper divisor = 120 - 2 = 118 Gii) Number of odd divisor can be obtained by choosing 3? x 5? x 7" Which can be formed by (3 + 1) (2 +1) x (1 +1) = 24 ways 50. Sol. Sol. (v) It can be obtain by selecting at least one ‘2’ in 2'.3°.5°7' which can be done in 4x(3+1) x (2 + 1) « (1 + 1) = 96 ways (v) At least one 5 must be there in 2° x 3 x 5? x 7" 4+ G+)@ +1) =80 (vi) For divisibility by 10 number most be divisible by 2 and 5 So total divisor must contain at least one 2 and at least one 5 in 2* x 3° xSxT So that ways = 4 x (3 + 1) x (2) x (141) = 64 ways (vid) It can be obtained from (2° +2! +2? +29 +2*)(3° +3°+3? +3°) (5° +5'+5°)(7° +7!) - pO Pa) 6 Will) N= 20 3 x 527 Total number of divisor (N,) = (4 + 1) x (3 +1) x 241) x (141) = 120 If (N,) is even then required number of ways = = =60 3* - 1) (=) (8-1) (3°-1)(5*-1)(7-1) 24 ‘The number of divisors of the form 4n + 2, n > 0 of the integer 240 is 3 @a4 @s (0) 10 (8) 240 = 2-3-5. A divisor is of the form 4n + 2 = 2 (2n + 1) = 2 (edd natural number) The divisors are 2-1, 2-3,2-5,2-3-5,ie., 2,6, 10, 30 Find the number of odd proper divisors of 3° x 6" x 21", 3°67 217 = 20 germ Te oO Sol. Therefore, the required number of proper divisors is equal to the number of selections of any number of 3's and 7's [- for odd divisors 2 must not be selected] and is given by (p+ m4neH (net -1. Prove that number of ways in which N can be resolved as a product of 2 divisors which are relatively prime = 2°". Where nis the number of prime involved in the prime factorisation of N = 2° x 3° x5¢ «79x 1? x13! N= 28 39x54 x7 xT x13" abcde f a,b, ¢, d, e, f are relatively prime Total ways =" C, +°C, +5, + “S °c. + 1xabedet °C, + axbedef,b xacdef,c x abdef,d x abcef,e x abcdf, f x abcde, °C, + ab x cdef, ae x bed! ‘ Cc. “Fi 2 for equal size group #c: Total ways = §C, + #C, +, + 2 32 Similarly for n prime factorisation total ways = 2" Find the number of divisors of the number N = 2°. 3°. 5? 7" which are perfect ‘squares. Since the divisor is a perfect square, each prime factor must occur even num- ber of times. 2 can be taken in 2 ways (2° or 2) 3 can be taken in 3 ways (3° or 3? or 34) Similarly, 5 can be taken in 4 ways (5° or 5? or S* or S*) and 7 can be taken in § ways (7° or 7? or 7 or 7° to 7°) Hence, total divisors which are perfect square = 2 «3x 4% 5 = 120 Find the number of ways in which the number 94864 can be resolved as a product of two factor Sol. Sol. Sol. 94864 = 2 x 72 x 11? (perfect square) Hence, the number of ways is $1+DQ+DArDeM=23 Find the number of ways in which the number 300300 can be split i factors which are relatively prim 900300 = 2? x 39x 52x 7x 11 13 Now we have to make factors which are relative prime. Each of 2', 3', 5°, 7', 11°, 13" should be considered single factor. ‘So, number of divisors = (1+ 1) (1 +1) (1+ 1) (1 #1) (1+ 1) (1+ 1) = 2° Number of ways of splitting into 2 factors = = =32 Let N be the number of ordered pairs of non-empty sets AandB that have the following properties: (2) Au B= {1, 2, 3, 4, 5, G, 7, 8, 9, 10} ) AN B=6 (©) The number of elements of A is not an el Explanation : (a) and (b) = n(A) + n(B) = 10 (©) and (d) = if A is the two elements set then B is an eight elements set, therefore 2 is not in A and must be in B and 8 is not in B and must be in A. Also note that both set can not have equal number of elements because if A is a5 element set then B will also be five element set and the elements can not be both in Aand B. 8 t. $e 9 element set roup cto ands 1 element set (say) {9} 2.) *c, 2 element set (8 ...} 8 element set group oft and7 3. ‘c, 3 element set {7} Pelernent set gmpdaone 4 element set (6 . He nedtiedt 'c, 5 element set Not possible 6 element set 4 element set ors 7 element set 3 element set °c, 8 element set 2 element set °c, 9 element set 1 element set fc, Total = °C, + °C, + °C, +... #°C,) - °C, = 2° 70 = 256 - 70 = 186 The toal number of non-empty subsets S of the set A {1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12} such that, no two consecutive integers are in S and if, S have k elements, then no number less than kis i S= {1,2, 3, 4, 5, 6,7, 8, 9, 10,11, 12} single element subset = 12 two element subset (1 cannot be taken) °C, = 45 similarly 3 elements subset (1 and 2 cannot be taken) 3,4 2 1,12 000 54, [xT x Px Px px pepe AC, = 56 4 element set (1, 2, 3, rejected) oo00 [x Px Px tx dx &C, +15 5 element (1, 2, 3, 4 rejected) 00000 Ixlebd “C, = 0 Not possible Total = 12 + 45 + 56 + 15 = 68 + 60 = 128 ‘SUMMATION OF NUMBERS (3 DIFFERENT WAYS) (a) sum of all the numbers greater than 10000 formed by the digits 1, 3, 5, 7, 9 if no digit being repeated. Method-1: All possible numbers = 5! = 120 If one occupies the units place then total numbers = 24 Hence 1 enjoys each place 24 times Similarly, 1 enjoys each place 24 times 1 Sum due to 1= 1 x 24 (1+ 10 + 10? + 10° + 10%) Similarly, sum due to the cigit 3 = 3 x 24(1 + 10 + 10! + 10° +109 Required total sum = 24(1 4 10 4 10? +107 + 101+ 3.454749) >. Find the sum of all the numbers greater than 10000 formed by the digit 0, 1, 2, = 4,5, no digit being repeated. Sol. Using all the given digits we can form a five digit number except when zero is at first place. So to find the sum of all the possible five digit number (Sum of all possible arrangement) = (Sum of all the arrangements when zero is at first place) = 5 different qigite can be arranged in 5! ways so each digit will appear at every place = = times i.e. 24 times Sum of all digits at unit place = 240 +1+2+4+5) Sum of all digits at ten's place = 240 +1+2+4+5) ‘Sum of all digits at 10000" place = 24(0 +1+2+ 445) In this way sum of all possible arrangement = 24(0 414244 +5) [1410 4 10% + 10° + 109 when zero is at first place 4 digit number will be formed. Each number will appear 6 times at every place. Sum of all 4 digit number at unit place = 6(1 +24 4 +5) ‘Sum of all 4 digit number at ten’s place = 6(1 + 244 +5) Hence sum of all four digit numbers = 6(1 + 2 + 4 + 5) (1 #10 + 10° + 10°) Required sum = 24[0 +14 2+3+4 +5] [1 +10 +10? + 107 + 104) ~6(1+ 244 +5) (1410 + 10 + 109) Find the sum of all the four digit number that can be formed with the digits 3, 2,3,4. The number of numbers having 2 in units place [-: the other three places are to be filled by 3, 3. and 4] Similarly the number of numbers having 4 in units places 3! [/: the other three places are to be filled by 3, 3 and 2] and the number of numbers having 3 in units places. = 3! =6[- the other three places are to be filled by 2, 3 and 4] Thus, sum of the digits occurring in the units place =2K94+3x64+4x3=36 We can see that the given digits (3, 2, 3, 4) occur at the tens, hundreds and thousands place, the same number of times as they occur at the units place. Hence, the required sum of the numbers formed. = 36(1 + 10 + 100 + 1000) = 39996 Find the sum of the five digit numbers that can be formed using the digits 3, 4, 5, 6, 7 not using any digit more than once in any number. Sol. 1 3is placed at units place, the remaining 4 places can be filled in 4! = 24 ways Thus, 3 occurs at unit places 24 times. The other digits similarly, each occurs at the unit places 24 times. Similarly, each of the digit occurs at the other places tens, hundreds and so on, 24 times. Hence, the required sum, is a(S + 44.5 +6 +7) (109 + 10! + 102 + 102 + 10%) = 24 x 25 x 11111 = 6666600 DISTRIBUTION OF ALIKE OBJECTS: Type 1: Total number of ways in which n identical coins can be distributed among p persons so that each person may get any number of coins is (n+p-7}! Pr (p= 4E(n)! op Proof : Let 6 identical coins can be distributed among 3 persons RISIG CO0000 oo (False coins) eo QOQO OO out of eight places if we select R 5 @ any two 3 partitions are formed by ®C2 ways Partition wall Find number of ways in which 30 mangoes can be distributed among 5 per- sons. Sol, *""C.. Type - 2: Total number of ways in which n identical items can be distributed among p person such that each of them received at least one item Car Sol. Find total number of ways distributing 7 identical computers to R|S|G, so that each receive at least one computer. me, = *, Important Point Number of different terms in a complete homogeneous expression of degree m in n variables is equivalent to distribution of m identical coins among n beggars. If expression is (x, +x, +x,...+%,)", number of terms = ™™C,, Ans. Sol. Find number of different terms in expansion of (x + y +z)", og, = 8, Number of non-negative integral solution of the inequality x + y+ z#< 30 (e+y+z4+ + w=30 L (False beggar) Required condition is equivalent to giving 30 coins to 5 beggars = HC, = HC, Number of ways in which 16 identical toys are to be distributed among 3 children such that each child does not receive less than 3 toys will be @) 96 (16 (c) 36 (0) 46 © Let x, x,, x, be the number of toys received by the three children Then, xy X, x, > 3 and x, +x, +x, = 16 Let u, =x, -3,u, =x, -3 and u, = x, Then, u,.u,,u,2 0 and u, + u, +u, = Here,n=7and r= 3 Number of ways = ""C,, = Ans. Sol. Sol. Number of non-negative integral solutions of x, + x, + x, + 4x, = 20 will be (a) 496 (6) 516 (©) 536 (©) 546 (c) Here, clearly 05x, $5, xy Ky 0 and x, +x, +x, = 20 - 4x, => r= 3andn=20- 4x, If x, = 0, number of way: If x, = 1, number of ways = ** Similarly, if x, = 2, 3, 4, 5, number of ways = “C,, "C,, *C, respectively. - Total number of ways 0, + MC, +9C, + °C, + 70, = 536 20046, Number of ways 5 identical balls can be distributed into 3 different boxes so that no box remains empty will be a @3 os 0) 15 ©) The required number of ways *C,., atc, - 43 Find number of non-negative integral solutions of the equation x + y + z= 10. Here the number of solutions is equivalent to number of ways 10 identical objects can be distributed among three persons if empty groups are allowed that is °*?-1C,, = °C, = 66, Find number of positive integral solutions of the equation x + y + z= 12. Here the number of solutions is equivalent to the number of ways 12 identical objects can be distributed among three persons if empty groups are not allowed that is ™'C,,= "C, = 55 Sol. Sol. In an experiment, n six-faced normal dice are thrown. Find the numbor of sets of observations which are indistinguishable among themselves. Let number i be obtained x, number of times. So, we have x, +X, +X, +X, +x, + X= Nn, where x, > 0. Hence, required number = Number of non-negative integral solutions of above equation +8-1¢, anc, ‘Total number of positive integral solution in the form of (x, y, 2) triplets such that this triplet satisfies the equation xyz = 24, Prime factorisation of 24 = 2? x 3 Suppose we have three boxes x, y, z, ‘3’ can be put in any of the three boxes. Also, 2, 2, 2 can be distributed in the three boxes in 7*?~'C,_, = °C, ways. Hence, the total number of positive integral solutions is equal to the number of distributions which is given by 3 x °C, = 30. Consider the equation 2 ; - + where x, y ¢ N. Find the number of solutions of the equation. Given equation is = + <|a wl or Gy + 15K = xy or (x - 6) (y-18)=90=2x37x5 Consider (x - 6) and (y ~ 15) as boxes. Number of solutions is same as number of ways 2, 3, 3, 5 can be dist these boxes. Number of ways 2 can be distributed = 2 Number of ways 5 can be distributed = 2 Number of ways (3, 3) can be distributed = 3 Total number of solutions = 2* 2% 3 =12 Number of ways in which 10 persons can take seat in a row of 24 seats so that no two persons sit on two consecutive seats? 60. Sol. From the figure we can clearly see that x, is the number of vacant seats before first person and so on Xo Xk Clearly, the total number of vacant seats is 24 - 10 = 14. Xt X +X, Ht MS Hy 1d where x, 2 0.x, 2 1.x, 21%, 24, X21 2 0. Let x, = Yor X= Y, #1, = Ygt Wy ons Ky = Yo #1 Kg = Your Then, the equations becomes Yot WAD*Y, ADE + YD 4Y) = 14 OF Yet Y, FY, tt Vy t Yq = 14-9 =5 Number of non-negative integral solutions of the above equation is simeg, = HC But 10 persons can arrange among themselves in 10! Ways. Hence, the required number of ways is "c,, «101 = 15! st” 1015! MAXIMISE °C, fe ee 2 ifniseven °C, is maximum at c . r FFror SS it mis odd Ue e.g. "°C, is maximum when r= 7 or 8, °C, is maximum when r= 6 GRID PROBLEM: ‘Suppose we have given a graph paper, in which an ant is on point (1, 1), then find the number of ways in which that ant can travel to (4, 5) using the shortest path. Sol. For shortest path,ant has to ravel 3 horizontal (H) and 4 vertical (V) paths Hence required number of path = 7 =7C, a Note: If there are n vertical and m horizontal lines then there will be (n-1) horizontal and (m-1) vertical paths. DISTRIBUTION OF DISTINCT OBJECTS IF EMPTY GROUPS ARE NOT ALLOWED Let us establish that the formula for number of ways of distribution of 1n distinct objects among r persons if each gets at least one object is IC le = + Clr = B= CF = P+ DCT Let A, denates the set of distribution of objects if i person gets no object and the other gets any number of objects. 2 (A) = (F = 1) [as n objects can be distributed among (r - 1) persons in (r - 1)" ways] Then n(A, 0 A) represents number of distribution ways in which person i and j gets no object. FA, A) = (F - 2)° Similarly, n(A, 0A, OA) = (F- 37° So, required number of ways NAY NAS OA) =m n(AVA,U..UA) [Emo YT wanale Y nanaoale Fen “salen * = LE (r= = Clr = BP + Cle ~ 3) =] "IG (F IY + (Cle ~ 2)" FE ~ 3) 4. + (C1 |_ Find the number of ways in which 5 distinct balls can be distributed in three different boxes if no box remains empty. or If n(A) = 5 and n(B) = 3, then find the number of onto functions for A to B. Soll, Using above formula, the number of ways is (3 = 5C, x (3 - 1° + 9C(3 - 2 = 243 - 96 + 3 = 150. DERANGEMENT We have n different letters and n different envelopes, the number of ways by which we can put letters in the envelopes such that each envelope has 1 letter and no letters is in their corresponding envelope. This condition can also be written as “Number of ways so that n different things can deranged from their original places and is represented by Dn 1 at 1 2! +e 3) Thus, we have 0, =O!=1 !-'C,D,=0 -C,0,-*C,D, D,=3!-*C,D,-°C,D, -* C,D, = 2 I-* C,, -* C.D, -* C,D, -* C,D, = 9 5!-° C.D, -* C.D, -* C,0, -* C,D, -* C,0, = 44 and soon There are 5 boxes of 5 different colours. Also, there are 5 balls of same colours as those of the boxes. The number of ways in which we can place 5 balls in 5 boxes such that at most 2 balls goes to the wrong boxes, is as (8) 10 (ce) 1 (D) None of these sol, © At most 2 balls goes to the wrong boxes = 2 balls to the wrong boxes and 3 to the right boxes +1 ball to the wrong box and 4 balls to the right boxes + 0 ball to wrong box and 5 balls to the right boxes i} 50,4041 =1x10+041=1 [(not possible to place 1 ball in wrong box) +1 (all balls goes to right boxes)] Sol. 0. Sol. Six cards and six envelopes are numbered 1, 2, 3, 4, 5, 6 and cards are to be placed in envelopes so that each envelope contains exactly one card and no card is placed in the envelope bearing the same number and moreover the card numbered 1 is always placed in envelope numbered 2. Then the number of ways it can be done is (a) 264 (8) 265 (c) 53 (0) 67 (cy Using the principle of inclusion and exclusion, we have the number of ways in which card number 1 be placed in envelope number 2 =i ffeyale ‘cyal4 tc,2h c,h 7120 - (96 - 36+ 8-1} = 53 id the number of ways of distributing 5 different balls in three boxes of ifferent size so that no box is empty and each box being large enough to accommodate all the five balls. (a) 100 (8) 120 (c) 140 (0) 150 @ Using the fact: Number of ways of dividing n non-identical objects in r groups such that each group get at least one object i.e. empty groups are not allowed = Crt 4S = 2 = (Cr = 3 +N CP aH PCy + CM rutting n = 5, 6 = 3) = 243 - 3x 32+3= 750 Therefore, total number of required ways = °C, x 3! x 2 = 240

You might also like