mbination mber DE XX Xy Xe w chosen in 9 Ways. X, Can be Hah 9 ways ‘Similarly x, and x, can be agent and 7 8S respectively. mer of such numbers 99 8.7 = 4536 cr gan be selected in 9 ways. All c ne ai ng Gigits can also be selected in a ich. ays ew otal number © f such numbers = [00] [302] ./ 202] = 74 =lFs \*L 25 |" qorent of 2 in 300 ! will be greater than Somes there will be exactly 74 zeros at the ard of 300! ‘dal words having exactly one alphabe! ‘eal words having exactly two alphabets = 5.4 = 20 ‘eel words having exactly three alphabets = 5.4.3 = 60 ‘dal words having exactly 4 alphabets 5.4.3.2 = 120 Tial words having exactly five alphabets 5.4.3.2.1 = 120 Thus Total words that can be formed = 325. A i Animber is divisible by 5 if it either ends Wags” ond wth zero. en numbers ending with zero = 9.10" ey Numbers ending with 5 = 9.107 al number of such numbers = 18.107 Anumber ig a igi oe divisible by four, if the last two ae divisible by four. In this case last wrap! Can be 12,16,28, 32, 36, 68, 92, Tay Number of such numbers = 8. (C, . 3!) = 192. *" HINTS AND SOLUTIONS 40. 1. 12. 13. ASAT A “ Number is divisible by three if the sum of 's digits is divisible by 3. Sum of the digits of the given set is 15, That means either we leave out zero or 3. Total numbers when zero is left out = 5! = 120. Total numbers when three is left out = 4.43.24 = 96 Thus total number of such numbers = 216. Total ways = 4.5.6.7.8.9.10.11 ony a P 5880 = 23. 3.5. 7? +. Total divisors = 4. 2. 2. 3 = 48 480 = 25.3. 5 Now 4n +2 = 2(2n + 1) = odd multiple of two. Thus total such divisors = 1.2.2 = 4 Given word have 24's, 2N's, 1S, 1H, 10, 1M 8! Total words = 312) Total words, without any restriction = 7! Total words beginning with | = 6! Total words ending with B = 6! Total words with | and ending with B = S! Thus total number of required words = 7! (6 + 6! 5!) = 71-26!) +5! if number of sides is n, then f diagonals of a convex polygon 44 (given) total number o| 20, -0 => n(n 1) ~ 20 = 88 => ne? -3n- 88 = (n— 11) (n +8) = => nettA. 5.12 14, 15, 16. 17. 18. 19. Total number of books = a + 2b + 3c +d Total number of ways in which these books can be arranged in a shelf (in same row) _ (at2b+3c+d) al (b!)?.(cl) If there are n persons, then total number of handshakes ="C, = 153 (given) = n(n - 1) = 306 = n-n=306=0 = (n = 18) (n + 17) =0 = n= 18 That means formed number can be atmost of three digits. Total number of one digit numbers = 6 Total number of two digit numbers = 5. 5 = 25 Total number of three digit numbers = 5.5.4. = 100 Thus total number of such numbers = 131 Let the number is x, x, XX, Xs Xe We must have XS 6%) SX 5% SK Clearly no digit can be zero. Thus total number of such numbers = C : There will be (n, + 1) gaps created by n, men. Now women have to be seated only in these gaps. Thus number of such sitting arrangements = C, nyling When seats are numbered, circular permutation is same as linear permutation. Thus total number of sitting arrangements is equal to "P,, 20. 21. 22. 23, 24, 25. “Se Permutation and Combi, In Thoro will bo 4 gaps created by 4 ho. can sit only in these gaps. Boys can). Sig in 3! ways and there after girl te 8a Ss cai eg in 4! ways. 7 be Seats Thus total such sitting arrangements F314 We can think of three packets. One of three boys of class X, other conga | 4 boys of class XI and last one consist 5 boys of class XII. These packets anit! arranged in 3! ways and contents of re? packets can be further arranged in 3) 4." 5! ways respectively. a Thus total ways = (3!)? (4!) (51) 1M, 41, 2P and 48. Total gaps created b, letter 1M, 41 and 2P is 8. Y 7 ‘Thus totalanangements = °C,.577, First of all two men can be selected in*¢ ways. Thereafter 2 women can selected i: 7C, ways (as wives of selected men are not be selected). And finally they can be paired up in °C, ways. Thus total ways = °C,7C,-C,. 7350, Choices available to the candidates are; 3 questions from first group and 4 from another (or the other ways around). Thus total ways = 2. §P,. *P, (as after selecting the questions to be answered , he can furhter permute them in 3! and 4! ways respectively). Itis same as dividing 22 books in 5 packets Such that two packets have 5 books each and remaining three have four books each and then distributing these packets. Thus total ways of distributing these books = el Gl) = (61)7.(41)°.21 22! 213154!)yr x, <% a ee eB He > Cy ways ety < Re 2% 7 Me TCs ways oo <% se WC, ways x mber of such numbers rs i 8G, = °C, + "Cy 210e Xe Xe Xe wt sinc ‘ ix, 064 % 3 55.5. = 125 ways fa) x, 000, % eVENs Xs odd | 55.5. = 125 ways val ways = 100 + 100 + 125 + 125 — 450. apiabetical order of these lettersis By E.K,R,U- ‘nal words starting with B = 41> 24 al = 24 Tolat words starting with E Total words starting wit Tolal words starting with KE Total words stal Net word will be KUBER- I (ot there were ‘n’ Bal umber of games to be to °C, and each player oh Sm Snes tg bm ane 4 Maxi im fae nu” Population = 2° - 1 "8 for 1c" 82ch position of tooth , can have two ination nao? eX 6% SX ‘9 following four cases ; sh ise <%= Ke > "Ce Ways number be = Pt t es even. piwing cases * x, all are even 5 = 100 ways. 34.8 qven and X % are 00d (a Di g.8. = 100 WAYS — odd, x, even iy ‘That means there 6 h KB 6 ing with K = 3! fs rank of the word KUBER =24+24+ 18 +1 = 67. players in the beginning played was ay would have med (9-1) games. Thus = (n= 1) + (9 — 1) 1) + 6 = 84 ~§n- 150 = 0 AAS 3 6. All strips are of different colours, then number of flags = 31 = 6 a When two strips are of same colour, then number of flags = °C 2.76, =18 Total flags = 6 + 18 = 24 = 4! 7. Total number of triangles = 7C,AC,8C, + CNC, + °C.) 46,06, + 8C,) + °C,CC, + ‘C,) 45. + 3.9 + 6.8 + 10.7 205 A 7 c 8. In this case one child gets no toy and one gets 2 toys and all remaining children get gne each. Corresponding number of ways al _ 1°Cp = Drin=2) al integral solutions Number of non-negative x) coeff. of x2 in (1+ Xt = x0 (a — xP (= XP x9] (1-0? = "6, =", 40. x, +% t= 18 = x, +X = 15— 2% fe x, can be 1,2 wher Let x, =" wey tae 15 2 Number of positive integral sol equation = (14 - 2n- lutions of this Required number = ' None),A514 1. 42. 13. 14. 15. 16. The number of times, @ particular girl goes on picnic = °C, Now each times she goes, Thus total number of dolls 6! 2,3 = qigr3 = 48 she gets a doll. given to the girls Total permutations sOtkt heh +. Let the formed number is x, X % % Clearly, x,23 Thus total number of such numbers = 4.5.4.3 = 240 Total variables if only the alphabet is used is equal to 26 . Total variables if alphabets and digits both are used = 26.10 . Total variables = 26(1 + 10) = 286 Given numbers can be rearranged as 147... 31-2 > 32-2 type 258...3n—1 > 32~1 type 369... 3n type ‘That means we must take two numbers from last row or one number each from first and second. row. > 3h Total ways = "C, + "C,. = MOD se? 3n? 2 Let Xp. Xa Xo be the number of white balls, red balls and blue balls being selected. We must have Ky + Xq tM = 10. Required ways = number of non-negative integral solutions Of Xp + Xq * Xp 10 2619-16, =", 47. 18. 19. 20. 21. Permutation and co, Formed number can be utmost of." Total number of such numbers i BB+ P+ H+, +8 toy = Dog 39-3 44.3" Person who has to sit between the broth, be selected in °C, ways. "I Thus total ways =8.( 7!) . (2!) = ( 81) (ay Cay Let the number of students be n. Then toig number times the teacher goes to 200 4 equal to *C, and total number of times particular student goes to the 200 is equal to *-'C, n(n=1)(n=2) — (n—1)(n=2) _ ind 3! 2 84 => n(n = 1)(n = 2) - 3(n — 1) (n~ 2) = 50 = (n= 1) (n= 2) (n - 3) = 504 = (n= 1) (n = 2) (n - 3) = 9.8.7 0 ane Matches whose predictions are correct an be selected in ”C,, ways. Now each wrong prediction can be made in 2 ways. Thus total ways = C,_.2" Let the blankets received by the persons Xy Xe % and X,. We have X, +X, + % +x, = 15 and x22 = (x, —2) + (x) — 2) + (x - 2) HF where y,=%~ 27" the number quatt > YA+ Yo + V3 +a = Required number is equal to non-negative integral solutions of this & which is equal to **?~'C, ie, %C, = "C,ee A515 18, 3A, 1H, 2R, 1N, 1P, 1U when all letters | permutation and Combination 22. Let S, and S, refuse to be together and S, 24, and S, want to be together only, i" are different. Total ways when S, and S, are selected Corresponding ways = °C,. 3! = ('C, +0, ."C,) = 44 =P, = 210 Total ways when S, and S, are not selected When two letters are of one kind and other = ('C, + #0, . *C,) = 182 is different. 26,8¢,.2 Thus total ways = 44 + 182 = 226 eorctponding waye’= Whenallletters are alike, corresponding ways= 1. Thus total words that can be formed 23. ‘P, must win atlest (n + 1) games. = 210 +36 + 1, Le 247 Let 'P, wins n +r games (F = 1, 2, un) corresponding ways = 7"C,., San, 25. Let the balls put in the Box are X. Xr XX Total ways = 2, "Cn 2 Cyst Cpe + wth tH tht HE 1S 22 = (4-2) 4% - 2) + H- 2) + (K-24 %H- 28 2x2 20 2” an ea yt tt Ye Ys Total number of ways is simply equal to Felaber of non-negative integral solutions of {ho vast equation,which is equal to 55-16,A. 5.16 Exercise #3. 4, 4, +2 = 2(2, + 1) = odd multiple of two. Total divisors = 1. 5. 11. 7. -1 = 384 (one is substracted because there will be case when selected powers of three, five and seven are zero each and this will make 2 = 0) 2 38% =(4-4)" = 42, 4(-1)", BP =(4-17 = 42241 6% = (8-1) = 4A5+(-1)" - Hence any positive integral power of 5 will be in the form of 4h. +1. Even powers of 3 and 7 will be in the form of 4.+1 and odd powers of 3 and 7 will be in the form of 4,-1- Thus required number of divisors = 8. (3.5 + 3.5) = 240. 3B. KX xy = 223.5 = Total positive integral solutions 1, and n, can be added with out carrying at any stage if = y,s9-r 2 Y= 05 1, 2s ore BUF, 1, 2y one 9) i.e. y, can be selected in (10 ~ r) ways. = Total ways of selecting x, and y, suitably 2 = y (10-1) fo) 2104948 4H +1 10.11 = 55 Permu tation and Cony, = han | ny For i = 1, let x, (r= 4,2 ysO-r q SY F123, 0. (9-7) pee) i.e., y, can be selected in (9 — | VWayy | Total ways of selecting x, y, sj, Y, Sita, 8 = HOM see 7s5, a 9 = 36 Thus total ways = 36(55)* 1, = XX % Xe M2 = Ys Yo Ys Ve n, can be substracted from n, vithay | borrowing at any stage ifx, | For i = 2, 3, 4; let x = rr =ysk sy =0.12 That mean y, can be selected in (r +1) ways. | Thus, total ways of selecting x, and y, suite | 2 = L(+ m a1+2434..410 44.10 =p 88 Fori=4,letx, < (r= 1,2, = ysr BYE Zl That means y, can be selected in va! Thus, total ways of selecting x, y, Sula! 9 2 Dre 4 2b 9.10 2 Thus total ways = 45(55)° = 45 xX +X +x, < 10 Fe 0,1, =x, +x, +x, =3 + rwhere r= rricie| x, +x, +x, = 3 + ris equal to coe Orrin (He IP, + x), 10 2G, ie, xin (1 +x+.sentation and Combination Thus total NuMbOF Of Solutions . S 2G, wo 2G, + °C; +10) + ut PC, + °C, Now number of positive integral solutions of HX EUW ris Hy,» Le 8G. = SC Thus required number of solutions yy fr So, + #C, + "0, + "0, + "C, = 4C, — MC, + (°C, + 9C, #7C, + "C, + "C;) = C, — 86, + C, = 685 In is odd, then SP a4hy BP a4dg tt = 29+ 3° + Sris divisible by four if n22- Thus n= 3, 5, 7, 9, os 99 Le. n can take 49 different values. If n is even, then Bn = 4d, 5s Ake tt => 2 + 3r + 5" is not divisible by 4, as 2n + 3° + 5° will be in the form of 44+ 2. Thus, total number of ways of selecting "n’ = 49. Any Integer having less than 4 digits will be in the form of xyz. If 3 Is used exactly once, written down °C,. 9 times. If 3 Is usod exactly 2 timos, then 3 will be written down CC,, 9). 2 times if3isused oxaclly 3 times, then there is only one such number. Thus, required number of ways B+ 2. 70,9 + Cy F 300 then 3 will be 10. W. 12. 13. 14, 15. a ASAT Total functions = 4°, Total functions when any one el eneerers y one element is the Total functions when any two elements are left out = 4C,.2° Total fun loft out Thus, As when any two elements are C18 total number of onto functions = 48 -(1C, 3° + 4C,.25 - *C,) 240 Total number of required functions Number of dearrangement of 5 objects 14,1 1 = o-oo |= = & 3a 3) “ To form a parallelogram we need 2 parallel lines in one direction and 2 parallel lines in another direction. Thus, total parallelograms = "'C,.°*C)- Total ways of selecting 2 white squares = BC, = 496 Total ways of selecting 2 white squares, when they belong to same row or same column = 2 (8. ‘C,) = 16. *C, = 96 Thus, required ways = 496 - 96 = 400 Total ways of selecting three squares when they don't lie in the same row or same columns 64.49.36 = ap = 18816. Total ways of selecting the squares when they lie in the same diagonal line. = 2 (80, + 2°C, + C, + °C, + “0, * °C) 2 (°C, + 20°C.) = 392 Thus, required number of ways = 18816 - 392 = 18424 Itis possible in two mutually exclusive cases (i) 2 children get none, one child gets three ‘and all remaining children get one each. (ii) 2 childron get none , 2 children get 2 each and all remaining children get one eachALS.A8 16, 17, 18. 19. In first case, number of ways 10! © 382071 In second case, number of ways 10! ante 10! 10! 2(_ 4, Thus total ways = (10!) (aan Gye Let the number of regions for n lines be I(n) Now Mn)= ln -1)+n vane. Clearly = (1) = 2, 2) = 4. As Kn) - n= 1) =n Putting n = 2, 3, Ka) -(1)= 243+. 2424340 ¢n (n+) 2 n+n+2 2 n, we get " => Kn) 1+ Let the number of regions for ‘n’ circles be \(n), Clearly = 1(1) = 2. Now, I(n) = In - 1) + 2(n- 1) vn22 = Kn) - n= 1) = 2(n - 1) Putting n = 2, 3, ..., n, we get Kn) - (1) = 21 +2 43+.., =(n—1)n = Kn)=n(n-1) +2 = (n?—n +2) zy _ 75 = nomen Three elements from set ‘A’ can be selected in 7C,. Their image has to y, Now we have to just obtain function that can be defined from A to B, where A has 4 elements and B has 2 elements. It is clearly equal to 2-25 44 Thus, required number of functions = 20. We must have 21. 22. 23. 24, =~ Permutation a Ind Co, Mbin, ati P+ ai + bit c2g iP + a(-iy + b(-i) > o-astlb—ty=0 ° and =>b=tasc Thus total number of such polynoniy, als ="C, = 10, 36 = 27.3 Total number of integers © (2, 2000p, at 2000 divisible by 2-[22] = 1000 Integer that are divisible by three and ~ 2000 2000} is equal to [ A a | = 666 Integers that are divisibly by 3and 2 ang 2000 e [2, 2000] = |—G-| = 333 Thus total number of integers that are neither divisible by 2 nor by 3 = 1999 ~ (1000 + 666 ~ 333) = 666 Let the numbers selected be x,, x, % We must have 2x, = x, = xt x= => %, x, both are odd or both are even. Ifx, and x, both are even, we can select then in "C, ways. Similarly if x, and x, both are odd, we 7 | again select them in #C, ways Thus, total ways = 2. %C, = 132. ven Let the arrangement be x, XX Xs % % Clearly 5 should occupy the position 50% Thus, required number = 2(7 !)- Lot ‘tis associated with‘, re (12349 then °2' can be associated with 1+ 5. Let '2' is associated with ‘then 3.6" associated with j, j + 1, <1 5:permutation and Combination ASAI Thus, required number of functions 25. Clearly, each player will play 9 games. > se D And total number of games = "C, = 45. ~ aie Clearly, w,+é,=9 and Ew,=56,= 45 $.(6-r)(7-r) me =n(r-r 2 => w? =81467 -186, 3([Eue-orea] = Iw? = 81104507 -18E6, B10 + Ee? - 18.45 ze