Module-2 2.1.1, Introduction In this chapter we are mainly concerned with det the number of logical possibilities necessarily identifying every case. ermining of some event without For example, suppose we are to create password which is six to eight characters long, where each character is an English letter (upper or lower case) or a special character from the set {#, @, &}. Here we are concerned with the number of such possible passwords without identifying every password. Finding this type of number is counting. There are two basic counting principles used throughout. 2.1.2. Sum Rule Principle Let some event A can occur in n, ways and the event B can occur in n, ways; A and B cannot occur simultaneously. Then ‘A or B’ can occur in m+n, ways. More, generally let an event A, can occur in n, ways, A, can occur in n, ways, 4, can occur in n, Ways...and so on. Suppose no two of the events can occur at the same time. Then one of the events A,,A), 4, ...can occur in n +n tnt ways. Illustrations (@ Suppose there are 8 characters each of English letters and 5 special symbols. A person can choose a character in 8+5=13 ways. (ti) Suppose A=“Choosing a prime number between 10 and 20", B=“Choosing an even number between 10 and 20". A can occur in 4 ways {I 1,13,17,19} and B can occur in 4 ways {12, 14, 16,18}. Note that A and B can not occur simulaneously. So ‘A or B’ can occur in 444=8 ways.COUNTING TECHNIQUES 2.1.8. Product Rule Principle A, the event B can occur in n ways. Then combinations of A, In general let an event 4 can occur in n, ways, independent ways,,.Then all the event can occur simultaneously in Mustrations ( Suppose a code contains two letters followed by three digits with the first digit non-zero, Each letter can be choosen at digit in 9 ways and each of the umber of possible in 26 different ways, the other two digits in 10 ways Hence total don ~ 26-269 010-8400 secretary, Tho president can be elcid in 20 ilrent a lowing this the vice present canbe elected in 28 ware (aince the person choowen president inno eligible ta be preieat); and lowing hn th scary cane ete erent wayn. Then by this principle of counting, easaaiosciseso, ” alerent wore i whit 24 are 26x25x24=15600 organisation can elect the office bea 2.1.4. Expression of the above principle by set If n(4) is the cardinal number of a set that is if m(4) Mf the number of elements in a set A then 5 (1) Sum Rule Principle: »(4U8)=n(4)+n(a) if A and int nots, Lo. if ANB ep are di in general, let $= 4U4,U..UA, be non-empty set whan ach 4(/=10n) is a non-empty set such that 4f01, 26 jeltom and ie) Then m(S)=m(4) m(4)+--+04,) Sonia) (2) Product Rule Principle: (AB) = n(A):n(B) where 4xB is the cartesian product of the two sets A and B. In general, let 4, ds..A, be m non-empty sets, Then md x dyn) =n Aa) A) = FY A) where 4,» 4;% 4, ia the cartesian producto the seta 4, yA, Mlustrations. Let us find the number of two digit or three digit numbers which ean be formed using the digits 1,2,34,6,6 (repetit not allowed), Number of ways in which two-digit numbers can be formed fare 6x5=20, sine ten's place can be filed in 6 ways and units place can be filled in 5 ways, as repitition of digite in not allowed, Similarly, the number of ways in which 8 digit number ean bbe formed using the given six digits are S04 = 120, Hence, by sum rule, the number of two digit or three digit umber can be formed 306120 150 way 2.1.6. Permutations Any arrangements of a set of n objects in a given order ix called & permutation of the objects Arrangement of any r(<») number of these objects in ‘kiven order is called a ‘permutation ofthe m objects taken r at ‘time’ ae eeThe number of permutation of n number of objects aken r at a time is denoted by =p bject A. B, Eand F ns we consider the following thre ee ee ee ee et Now first letter can be choosen in 6 different ways; following this, the second letter can be choosen in 5 different ways, and, following this, the last letter can be choosen in 4 different ways. We write each number in its appropriate box as follow 5 This by principle of counting (Product Rule Principle) there are 6¥5%4~=120 possible permutation of six objects taking 3 at a time. Thus *7 =120 ‘Theorem. oi Proof. (This proof follows the procedure in the preceeding es Wen + object are being chosen from n bjs the Bx element can be chisen in Giflernt way: following tia second lament in the permutations can be chosen in/ach way: and, flowing this the third element in the permetaion can be chosen in -2 ways. OUNTING TECHNIQUES orally: There are»! umber of permutation on ait Pro: Number of this permutation <7, = Mlustrations (@ Number of different 3-digit number formed from the digits 2, 5, 6, 8, 8 ‘umber of permutation of 5 digits taking 3 at a time yw St Se3e2t = (Gi) Number of possible ways of sitting of 6 students in a 6 umber of permutation of 6 students taken 6 at a time ="R=61=n0 Permutation with Repetitions In this Article we are going to find the number of Permutation of a set of objects some of which are alike. We use the notation P(n n,n.) to denote'the number of permutations of m objects of which m-are alike, m are alike...m, are alike, In the following theorem we find the value of this permutation,ENGINEERING MATHEMATICS ~ ty formed using the STATISTICS because hore $ repeats peats 9 times and I repeats 2 times number of objects. A combination of these n. F at a time is any selection of r number of objects Mlustrations ‘The combination of the letters x, y, z w taken three at . a time are xyz, 29%, XBW, yaw, observe that the following combinations are same xyz, yxa, axy, xay and yex The number of combinations of n objects taken r at 4 time is denoted by “C, Before we go to the following theorem we consider an example Example : Find the number of combination of four objects, x, 2, w token three at a time, Each combination consisting of 3 objects determines, =6 permutation of the objects in the combination as shown in the following table : (shown in the next page) ‘Thus the number of combinations multiplied by 3! equals the number of permutations; that is 'Cyx3t="R, a —_ COUNTING TECHNIQUES Permutations Combination ‘Theorem : °C, ren Proof. Since any combination ata time determines r! number of permutation 1 of n number of objects taken 8 ofthe objects in the combination, we can say pant: a nr Ilustrations. (i) Let us find the number of committees of four that can be formed from nine people Each committee is, essentially, a combination of the nine people taken four at a time, Thus the number committee that can be formed is 9 _ 9x8 7x65! eee Cs" Sai Sheaxaaa ‘ (ii) A man buys 3 cowe, 2 pigs and 4 hens jrom another person who has 7 cows, 6 pigs and 8 hens. Let us jind the number of choices that the man can do. ‘The farmer can choose cows in "C, ways, the pigs in C, ‘ways and the hens in *C, ways. Hence altogether he can choose the animals in SG xtC OC, ways (Here product Rule Principle pplicable aoe ai ai at =36750 waysERNEST Combination with Repetitions Consider the following problem : Let we have the lett a,b, € and d. We are going to find the number of combinati aabbeedd, r= aaacddd, r, = bbbbeddd,and n=, Counting the number of such combinations is not Suppose we want to code the above combinations two symbols, say 0 and 1. This can be done by letting 0 a letter (among a, b, c,d) and letting 1 denote a 7 one kind of letters to its succuding letter (e.g b to ¢ or d ete). Then each combination will require p=g zeros 4-1=3 ones (1s'), where the first 1 denotes the change f a to b, the second 1 from b to e, and the. 1 from, ‘Thus the above four combinations will sf +, =00100100100 ; COUNTING TECHNIQUES 29 ‘Similarly we can view the solution combination of 18 objects consisting of five ‘a, two 'W and eleven ‘ ‘Thus required number of integral solution = number of combination of 18 objects (where any object may repeat any time) from three kinds of objects (say a, b and o) = Cy = "Cy =190 2.1.7, Binomial Co-efficients The symbols °C, is defined as m__ nln=W(n=2)- Ane Mei 1a34r= Nr We have some important relation; == @ "G,= "14°C, wae anEERING MATHEMATIOR It follows, me on more items, for g Selection of one or more objects. The number of ways of selecting one or more i tems, for a =2"-1 Mlustration, ‘The number of ways one student ea question out of 6 question is in solve one oF more GHG Ht Cy 3 Circular permutations. ‘The permutations discussed #0 far are known as linear Permutations as the objects were assumed to be arranged in tine: When th objet are arrangedin ace or ins tad curve, we get circular permutation. In a circular permutation, we consider one object is fixed and the remaining objects are arranged in the same way as arrange are made in linear permutation. We have two types of circular permutations: (A) Those in which anticlockwise and clockwise are distinguishable. In this case the number of different circular arrangements of » objects is (n-1)! (B) On the otherhand when anticlockwise and clockwise ‘arrangment are not distinguishable, then the number of Alifferent circular arrangments of m objects is 1 INTING TECHNIQUES a Hlustrations. ) & people can be arranged about a circular table in (¥-1 Gi) 8 differfent beads can be arranged to form a necklace Illustrative Examples: 1, How many seven letter words ean be formed using the letters of the word BENZENE? Solution, Required number of words = number of Permutation of the letters in BENZENE 2 3131 ince E repeats 3 times, N repeats 2 times) 420 Ex.2. Find the number of ways that a party of seven persons can arrange themselves (in a row of seven chai (ii) around a circular table Solution. (i) The seven persons can be arranged in seven chair in 77, =7!= 5040 ways, Gi) One person can sit at any place in the circular table ‘The other six persons can then sit in *P, =61= 46656 ways Ex.3, Find the number of distinct permuations that can be formed from all the letters of the word (i) RADAR (ii) UNUSUAL. Solution. (i) Among the 5 letters, R repeats 2 times, A repeats 2times, ‘Therefore total number ofpermutation = 5 = 30 (i) Among the 7 letters U repeats 3 times. x total number of permutation ==) = #40ENGINEERING MATHEMATICS ~ ty ‘eed on Solution. “Ph Biology arranged mathematicy = 6 ways, g n be arranged among spectively. So by Produet Principle the required number of arrangement Chemistry and 2 biology books ¢ 24x 24x6x6x Ex.5. 6 boys and 6 girls are to be seated in a row, How many ways can they he seated if (i) all boys are to he seated togeth: seated together. and all girls are to be i) no two girls should be seated together. ii) the boys occupy extreme positions, Solution. (1) All possible ways girls can be seated All possible arrangement among boys = 6 j Now ‘boys’ and ‘girls’ can be arranged among themselves in 2 ways the required number of arrangements = 61612 = 1036800 ‘The boys can be seated among themselves in *”, 1 ways. There are 7 in between positions among boys (inch the positions at both end). Now if the 6 girls be seated among these positions then two girls will be together. COUNTING _TECHNTQUES 61x 7F =61x7! =720%5040 ii) Two boys may be seated in two extreme positions in ways, The remaining ten people (4 boys and 6 girls) will be seated in the remaining 10 positions in "Ry =101 ways. by Product Rule Principle required number of sitting =*A.x10!=30x108 Ex.6. If all the permutations of the letters of the word DIRECTOR be written down as in a dictionary what is the rank of the word? Solution. When the permutations ofthe letters of DIRECTOR are written down as in a dictionary we have the following sequence of words Crtttene @ DCtteeee a DEtteeere eo DICttese is Dineeve’ si DIOttees os DIRCtMs* a DIRECO** 6 DIRECR*®* ® DIRECTOR ao Number of words in (1) is Number of words in (2) isboth the digits 8 and 5 of words in (7) in 41 = 24 Solution. After inclusion on 3 mber of word: © other two digits can be from 1, 2,7, 8 im 4G, ways. After aeleeting the two digits all the four digits ean be arranged among themselves in P=! way Number of words in (9) is 21 So number of permuted words write, DIRECTOR is written en down before total number of required numbers =*C,+4!= (#24 =144 2520 x10, Find the number of different words of six letbers taken ‘from 10 different letters such that in each of which at least one letter is repeated, Solution. Number of words of six different letters taken from 10 different letters = 7, Number of words of ix letters where the letters may repeat any number of times =10x10% 10x10, 10x10 =10¢ Required number of words 10" -"', = sasson Ex.11, 15 different balls are to be placed in 15 different holes fone in each hole. If 6 holes are too small for 8 of the balls, hhow many ways the placement of all the balls in the hole is possible? ‘ lution. ‘ean not be placed in the 6 small holes. Prom ‘he romtning Tile hea ice eto aed a whi | can be done in 7 ways. Alter filing in the 6 holes we have | 1 + 8 = 9 balls which are to be placed in 9 holes (big) which | can be done im "2 =9t ways. the required number of ways of placement =P x91 = 1929915200 2 Mss ‘The word DIRECTOR will be w Ex. 7. How many w MISSISSIPPI can be ar find the ritten at 3449 th position, ‘ays can the letters in the word ranged? If Ps are to be nape number of arrangements. a Solution. Total ways of arrangement of all the letter Number of arrangement where the Ps’ are separated = 34650-6300 = 28350 Bx 8 How many different signals, each consisting of 8 flags hug in vertical line, can be formed from a set of 4 identical red Mags, 3 identical white flags and a blue flag? «2Ex.13 six digits 2, 3, 5, 6, 7 and 9 if 5, 6, 7 and 9 if repeti How many of these are less than 400° Solution. Number of a Similarly any 2 switches can illuminate the room and 2 switches can be choosen in C, ways. Thus total number of ways of illumination 2G + 20, 4 9G, +4 9Cyl tg9s TECHNIQUES Tn how many ways 6 men and 6 Now, there are 6 places for 6 women. So they can be seated ‘The required number is 36) about a round table, how many rangements| 60 Bx.24, If 10 people are seated different circular arrangements are possible if ar are considered the same when one can be obtained from the of them are female and others are other by rotation? If 2 do the sexes alternate? males, in how many arrangements Solution: The required number of circular arrangements is (10-11-91 5 male can be seated about @ round table is (5-1)!=4! ‘Then there are 5 places for 5 female. So they can be seated in s! ways. ‘Total no. of required circular arrangements is ust = 2880 Ex.25, Find the number of ways in which 7 different flowers ‘ean be arranged in a garland. Solution: Since the arrangment of flowers in a garland is one direction, so the required number of ways is Vg-ayeb F-16360 Ex26, In how many ways 10 different beads can be arranged to form a necklace? Solution: In a necklace, the beads are arranged either in Clockwise or in anticlockwise direction. So the required number 1 of arrangent is 5(10-1)' 181440ximum numb "er of i we vertices where < N these types of Case 2: A ; ; ~ maining lines, Number. | int from the 5 points on any of if eat three vertices selected above Gin sce) become callnear thn the nue af ani ninished. So the maximum number of trangag 500 6001109 Ex.28. A car company manufactures 5 the number of ways a customer ean buy eaten oo ad Solution. The models will epat several times. From an easier {heorem, umber of ways of purchase of ars fom the eae ‘models = Number of combination (with repeating) of i aaa from Ex.29, Find the number of nonnegetive solutions to x+y+2=18 with the condition 23,22 and 8 ¥=y-2, 2 Then x+y+2=1822'+y+2/=12 j 221. Solution. Let x Then required number of solution number of nonnegative solution to x'+ y'+2’=12 —Se repeat any time) from three kinds of Ge and ¢ WG, = MC, = 91 Ex.80, Find the number of non-negative integral soltions of the inequality stata tee <8? 20, fat to 4 ty by the i Solution: We convel quality into an eqi introducing an auxiliary variable x,>0 Le x21 Thus we got ntnryes <8 o where x20, =1244 421 Putting x,-1=1) in (2), we get 6 aie meee 520, [ald 3/20 where ‘The required number of non-negative integral solution "C45 Ope Cy 2390 Ex.1. Find the number of ways in which 4 seience students and 17 commerce students can sit together in a queue such that between any two science students at least two commerce students ean sit Solution. Let $,,5,,8, and S, be the four science students; they are kept in « queue. Let n, number of commerce students sit before §, n,commerce students sit between S, and S,, m, commerce students sit between $, and-S), nq commerce students sit between S, and $,, n, commerce students sit after 8, We have to find n,nymym and my such that yong +m +, $15 =17 oSuNTING TECHNIQUES Beet tonal ns =17-6ua e = eocetficient of n!*in] etre cee stats | Gee Se SS = couticiont of nit in(nt=1)'(n-1)* 5 2, = co-efficient of n'? in(1-n*)‘(1-n)* a = Number of combination of 11 objects (whore any obj oe ay repeat any time) from 5 kinds of objects — Now (1=nt}* ={(1-n8)'} Gy =, «1368 =(0-2n* on Now the science students may permute themselves in dt ways. The commerce students may permute themselves in 17} required number of arrangements =17!x4!x 1865 Ex.32. Four diee are thrown at a time, In how many way a total of 16 can be obtained? lution. Let, = points of the face shown by Ist die rng =points of the face shown by 2nd die ni =points of the face shown by 3rd die rn, = points of the face shown by 4th die ‘Therefore, we have to find the number of solutions of +n, +n, +n, =16. where 15, <6, 19(7), ea Solution. We see 2160 any fusction f:X-9 exnnot be sortroa, stare Veo Pa eae ces nice Teast two distinet elements x, and in X such that multiply them we get a factor iia From the four 2,’ we can take one 2 or two 2 oF three 2.9, four 2 or no 2. So there are 5 choices of selection from 2g! Similarly there are (@ Suppose an institute contains 1 teachers. Then at least ‘two of the teachers (pigeons) were born in the same month (pigeonheles). (ii) Suppose a busket contains many red, white and blue balls, Then one need only grap four balls (pigeons) to be sure of getting at least two of same ‘colour balls’ (pigeonhole (ii) Find the minimum number of elements that you need to take from the set A=(1,2,3,~-9} to be sure that two of the numbers (not necessarily distinct) add upto 10, Here the pigeonhole are the five sets {1,9}, 2.8}. (3.7). (46), (5.5) ‘Thus any choico of six elements (pigeons) of A will gurantee that two of the numbers add upto 10 Generalized Pigeonhole Principle In pigeonholes are occupied by An +1 or more pigeons (k is a positive integer) then at least one pigeonhole is occupied by 441 or more pigeons. Mustrations () Find the minimum number of teachers in an institute to bbe sure that four of them are born in the sare month. Here ‘months are the pigeonholes and }+1=4 or k=3. ‘So among any fo +1=341241=37 teachers (oigeons) four of them are born in the same months Gi) Let a box contains many red, white and bluc bale Find the minimum number of balls that one needs to choose in order to get four balls are of the same colour. Here n=3 colours (pigeonholes) and k+1=4 or & =3. This among any in+1=10 balls (pigeons), four of them have the ‘same colour. 4 choices from 3 and two choices on §; ‘Therefore number of choices = 5.4.2. Here one ease may occur where none of 2, 3 or 5 are taken («total number of factors, excluding 1=5x4%2-1=38, Sum of these factors #24242 424)(14347 43°)45)-1 (2-1) ) 7 ss <6-127439 Gi) © total number of factors, excluding 1 and itself 5x42 1-38 Sum of these factors (14242? 42° +24)14343"4P )(l+5)-1-2160 1439 -2160=5279 2.1.8, Pigeonhole Principle Many results of Counting Technique come from the following statement. Pigeonhole Principle : If n pigeonholes are occupied by n+1 or more pigeons, then at least one pigeonhole is oceupied by more than one pigeon. (W.B.U.T, 2015) Remark: The pigeonhole principle can also be stated in set theoretic terms as follows: (shown in the next page)2.1.9. Mlustrative Examples: How many single sh Solution. to have a pair. single shoes, by pigeonhole prin to one pigeonhole ic. we certai ither friend i ns where the WBUTE 013 «vis straiger of gy stranger of s,. Here Pigeonholeg Pigeonholeg ns 2+1=3 or more people Suppose X contain § nds, then these two and 0 distinct pairs constitute 50 pigeonholes. We k the single shoes as pigeons. Therefore if we choose 51 ple, a least two shoes will go then X has three mutual le. If two of them arg se two and x, become 3 mutual strangers riends. So there are three of either mutual friend or mutual Ex. 1. Assume there are 50 distinct pair of shoes in a rack, #* can be chosen from the rack, that we ly get a pair of shoes. Ex.2. Show that at least 3 people out of 25 must have thelt birthday in the same month when they are assembled ip & Solution: Here we may consider birth monthe of people as pigeom and the calendar months ( According — + bn =21241=25 12) as the pigeonholes. Thus the minium number of people who may have their birthday in the same month 25 OUNTING TECHNIQUES ‘ SH Ex. Find imimum number of atuden antec that 5 of them belong to the sam unpaal Solution. Here the number of pigeonholes (classes) is weralised pigeonhole principle minimum number of rons (here students) to go toa pigeon is k+1=5 or. k=4 Th students (pigeons) 5 of them belong Ex. If three men and five women are lined up in a row how that at least two women will be next to each other Solution. First, place the three men in a row. Then the three rn generate four locations (pigeonholes) in which the women on) are going to be placed. Since there are five women (pigeons), at least one slot will contain two women who must. therefore, be next to each other. Ex.5. Find the minumum number n of integers to be selected from s= {2.9} ao that (a) the sum of two of the n integers 1s even (b) the difference of two of the n integers Solution. (a) Consider the sets 5, and 5, = (2.4.6.8). These to are pigeonholes So if at least 3 integers (pigeons) are chosen from S two will belong to S, oS, giving the sum even 3.8,7,8), Thus the minimum number n =3 (©) Consider the sets 5,=116}, 8,-2.7, S,= {4.9}, §,=8-(S,U8,08,U8,)= (5) Note that itis not necessary to select 5 So we consider are 4 pigeonholes S,,S,,S,,8,. So if at least 5 integers (pigeon) are chosen from § two will belong to ‘one of the above sets and their difference will be 5 (Note that ‘no two will belong to $,) Hence the minimum number n=ong 987 with PQ=1. Show that ior of the triangle, is whose distance apart is less then Solution. Let D.E.F are the mid points les PO.PROR respectively. — p /\ he four smaller triangle APDE, ADFQ, SEFR and ADEF are s ent eugilateral triangles with ¥ side -1. Here 4 equilateral angles created be considered as pigeon holes and five interior points as pegions The by pigeon hole principle, for any five interior points jangle APQR, at least two points must be in or on the same small triangle. Thus the distance between them is less than 4, +Bix.8. Let S be a square where each side has length 2 inches. Find the minimum number of points to be chosen from the interior of $ such that distance between two ofthe points will be less than v2 inches. (W.B.UT 20138) Solution. Draw two lines beween the opposite sides of S which partitions into four subsquares §,,5,,5, and 8, COUNTING TECHNIQUES any two points belong 8, and S, then their distance will Consider 5, 8,8, 8 four pigeonholes So by pigeonholes principe if at least five points (pigeon) 5.5,-5, and Lg ts tae Gatien ef ere will be less than V2. Hanes te atta sie E29, 26 candidates appears in a competitive examina Show that there exists atleast two among them whove rll number differ by « multiple of 17 Solution. Let be the aet of roll numbers of 96 candidates and bo the set of remainders when any positive integer is divided by 17 ¥=(12-16 Now we define a function J as follows: f:-+1 such that f(e)= remainder when 1 is divided by 17 As n(X)=36 and nf so n(X)>n(? ‘Therefore by Pigeonhole principle, function f° is not one-tovone. Thus ther exist two distinct roll numbers x, and sysuch that f(s)= fi) By Euclidean algorithm, We have alts) agttar fa) pacZ*, tho set of positive integer whereENGINEERING MATHEMATICS ~ ty Since an integer he multiple of 25.Henee t roll numbers differ by nultiple of 25 2.1.10. Principle of Inclusion and Exclusion (WBUT.2019 Lat 4 and 4, be two sets, m(4,), m(4) are catdinal umber of 4, and 4, respectively (that is the number elements in the set). ‘ Then m(4UA)=m(4)¢n(y)—at 41.4) For three sets 4, 4,4, AUBUCCU] =1000- 543 =457 2.1.11, Mustrative Examples. Ex, Of 32 students who play football or cricket (or both), 80 play football and 14 play ericket. Find the number of students ‘who (i) play both the game (i) play only football and (i) play only erieket.COUNTING _TRCHNIQUES olution. Let p 2 Set of rude foetal | FC) =82,(F)=20,n(C i ‘ ts playing both the game, By | MF JC) =n(F)en(C)-n(F oC) | Or, 92 =30+14-n(F AC)=44-n(F AC) | 3 MF AC)=44-a9=12 No, of students playing both the game = 12 Gi) Now, FF C= Set of students playing only football Required number =n(F-F 0C) =n(F)-n(F AC) [y 0-12-18 Gii) Similarly, No. of students playing only cricket n(C-FAC)=n(C)-n(F nC) =14-12=2 FoceRr] Ex.2. Let A, B, C, D denote, respectively English, Japanese, French and Russian language courses. Let 12 take A, 20 take B, 5 take A and B, 7 take A and C, 3 take A, B and C, 2 take A, B and D; 20 take C, 8 take D, 4 take A and D, 16 take B and C, 4 take B and D, 3 take C and D, 2 take B, C, D, 3 take A, C, D, 2 take all the four and 71 take none, Find the number of candidates who take at least one courses. Hence find the total number of candidates on which the survey _| is done. Solution. Let A = Set of candidates taking language-course A B = Set of candidates taking language-course B C = Set of candidates taking language-course C D = Set of candidates taking language-course D AUBUCUD~$et ofall candidates taking at leant one By Principle of Inclusion and Exclusion, n(AUBUCuD) =n(A)+n(B)+n(C)en(D)-n(AnB) n(ANC)-n(AND)-n(BNC)~n(BAD)-n(COD) 4n(ANBNG)+m(AOBD)+n(BaCnD) 4m(CODNA)~n(AnBacnd) =(12+20+20+8)~(64744416+443) +(8+24263)-2 60-39+10-2=29 ‘Total number of candidates = 29+71=100 Bx.3, Find the total number of integers lying between 1 and 1000 that are divisible by at least one of 2, 9 and 7. Solution. Let A = sot of integers, lying between 1 and 1000, which are divisible by 2, B = set of such integers divisible by 3 © = set of such integers divisible by 7 Now 200 5 mt) =80 1000 _ 535) “ - n(B)= 383 2 n(C)=142 Now Lem of 2 and $= 6 Lem of 3 and 7= 21 Lem of 7.and 2= 14 Lem of 2, 8 and 7 = 42Required number of integers = n(AU BUC) n(A)+n(B)+n(C)-n(AnB)-n(BAC)-n(Cra) 4n(AnBoey 833+ 142-166-47-71+28 = 714 Ex.4. Using Principle of Inclusion and Exclusion show that for any three sets A, B and C, n(AUBUC) =n(A)+n(B)+n(C) if they are pairwise mutually disjoint (W.B.U..2013) lution. If A, B, C are pairwise mutually disjoint then NC=CNA=ANBNC=$, the null set, Then n(An (BNC) =n(CNA)=n(ANBNC)=0 ‘nciple of Inclusion and Exclusion, n(AUBUC) Then by Pri n(A)+n(B)+n(C)~n(ANB)=n(BAC) -n(C.4)+n(AN BNC) (A)+n(B)+n(C) Ex.5. (i) Let A and B be sets such that n(4)=6and n(B) Find the number of surjective mappings from A to B. Solution. Let B= {x,,%,%,,x,). Let Uset of all mapping from A to B. Let F; = Set of mappings which do not send any element of Ato », I Ff, = Set of mappings which do not send any element of A Similarly Fy, are formed Then Ff =Setof mappings which send at least one element = Set of mappings which send at least one clement of A and 80 on FOF NR NFS Set of mapping form A to B where 1,3, and 2, are images of some clement of A. Set of all surjective mapping from A to B. mapping in U there are 4 choices for each of the For ead Jements in A. Henee n(U)=4° = 4096 For each mapping in F, there are 8 choices for each of the 6 elements in A. Hence n() =3 = 729, Similarly n(F,)=729, n(F,)=729 and n(F)=729. For cach mapping in F, (1. there are 2 choices for each of the 6 clements in A. Hence n(F,0F,)=2 Similarly n(F,1R)=n(F1R,)= Similarly n(F, 1F, 0K) =n, NR NF;, Oviously FF, NF, is ml set. Hence n(F, NF, AFAR, By Inclusion Exelusion Principle, n(F URURUF,) n(F)-S(R OR) DA NANA) -n( FN NFAF,) =64 | 64. =4729-"C,x644'G 11-0 = 2916 -384+4 = 2536Projet an assign : mapping from A to B Ex6 F number of integars between 1 and 1000 which are neither perfect squere nor perfect cubes, (WBUT 2018 Solution. Let U=(1.2...1000}. Also set 4 set of integers, lying tween 1 and 1000, which are perfect squares and p-set of integers, lying between 1 and 1000, which ate perfect cubes The set of integers which are either perfect squares or erfect cubes is 4UB and the set of integers which are both perfect square and perfect cube is 4NB Now, the set 4 is obtained by squaring each element of the set (1.2.3 1 but 327 =1024 n(a)=31 Similarly the let 8 is obtained by exbing each element of the set {1,2,3..10}. since 10? =1000 n(B)=10 ‘An integer which is both a perfect square and a perfect cube must be a perfect power of lem(2,3)=6 i | «18 =(4uBy £18")=m(AUBF =n(U-(4UB)) =n(U)=n(4UB) 000-38 = 962 Ex7. How many solution the equation x +2;+1=11 have where 4.4; a€ non-negative such thet <3, 1<4 and <6? Use the principle of inclusion-exelusion, Solution. Let $= the set of all non-negative solution of +e tyall n(S)= no. of combination of 11 objects from three kinds of objects ="4G, ="G,=%o Lat 5,,5,,5, be the sets of non-negative integral solution of sity tay ell when 424, 25, 427 respectivly. n(S))= no. of negative solution of 5 +15 45 =11 when 5,24, ie, Keay ay =7 [putting =_-4) 2G ='G=", 36 n(S,)=no. of non-negative integral solution of, +1) ¢55=11 when 25 ie. 4 +xitay 26 [putting =5-5) (1G, Ga! 92no. of non-negative solution of By the Principle of inclusion exclusion we have ™(S US US) =¥n(5,)-Snl5,N5,)en(5,Ss NS) =36428+15-(64041)+0 The required number of solution =n(5)=n(5\US, US, $72 =6 1 Short and Long Answer Que: 1. Find n if (a) "P, =72 0) 2*P,s50= 2. (i) Find the number of ways in which five persons can sit (ii) Find the number of ways in which five persons ean sit n a row if two of the persons want to sit together. (iii) Find the number of ways in which five persons sit around a circular table if two of the persons do not sit together. 3. ls how a rsidering Sunday as holiday 1y ways can 5 examination be scheduled in a tno two examinations are scheduled on the same 6 Find the number of license Dts at ontains two different letters gis ifthe first digit ean not pe 4 * that can be made if each followed by three different There are 6 roads from Kol bet that kata to Burdwan and 4 Burdwan and Durgapur, Ping pete yecaen ice the number of ways () from Kolkata to Durgapur vie Burdwan i) from to Kolkata Durgapur via Burdwan and returna rom Durgapur to Kolkata via Burdwan, (is from Kolkata to Durgapur and returns back via Burdwan without using the same road more thee en & In how many ways can letters @, b, od, arranged if @) m and n always together G3} fore mand n be mm is always 8. In how many ways 6 people ean occupy the seats of a car if one of three particular people of them will drive 10. If A= (1,2,3.-.2n) then find the number of dearrange- ments of the elements of A such that the first n elements of tach of the dearrangement are the last n elements of A 11. Find the number of ways in which five books of Mathematics, four books of Physics and three books of Computer science can be placed on a shelf so that the books of same subject are together. 12. @) Find the number of words that can be formed from the ‘ters of the word ELEVEN sy i) How f them begin and end wit ‘many of them 3 ‘") How many of them have the three E's together? ) How many begin with E and end with N? eaeCOUNTING TECHNIQUES th the letters of if MISSISSIPPI taken all together. In how many of hese will the vowels occupying the even places 14. How many different words containing all the letters of the word TRIANGLE can be formed 1o that © consonants are never separated nants never come togethe: Git) vowels occupy odd places. 15. How many different words ean be formed with the letters of the word DOGMATIC? How many of th @ letters G will occupy odd places? Gi) letters D, 0, G occupy only first three places? 16. If all the permutations of the letters of the word (@ CHALK be written down as in a dictionary, what is the rank of this word? Gi) MODESTY be written down as in a disctionary, what is the rank of this word? 17. (i In how many ways can three Ist year students and two second year students sit in a row? (i) Tn how many ways can they sit in a row if the 1st your students and 2nd year students are each to sit together? Gi) In how many ways can the students sit in a row if just the 2nd year students sit together? 18. Find the number of ways that 4 digit number ean be formed with 0, 4, 5, 6, 7, 8, 9; no digit being repeated. How many of them are not divisible by 5? 19. How many number not more than 5 digits taken from the digits 1, 2, 3, 4, 5,6, 7 in each of which digits may repeat any number of times. 20, How many seven digit telephone numbers are possible, if- G) only odd digits may be used. (ii) The number is multiple of 100. (isi) the first three digits are 481 Aer: fonts win the 6 prises (i one student gets only ong ot all tho six prizes 23. Find the numberof vn oss pomber tal Find he sum eae 4. Fnd oe mana a iret beter staal 25. Find the amber 09 itr iormed toot a age wich 2ia placed aha} cluding 1 and the nt digit numbers that can be 45,6, 7, 8, 9 in each of 1 together? 27. In how many ways can 18 members of «council sit around 8 circular table, when the president isto eit one sie of the secretary and the vice President on the other side? 28. Find the number of diferent committees of 5 members from 10 members in each of which 2 particular members will always be included. 28. In how many ways ean a committee consisting of three men and two women be choten from seven men and five 30. A busket countains six blue balls and five yellow balls. Find the number of ways four marbles can be drawn from the busket if Gi they can be any color (i) two must be blue and ‘wo yellow (ii) they must all be of the same color. 3: How many committees of 5 with given chairperson can selected from 12 persons?—_ ENGINEERING MATHEMATICS ~ 1 uNTING _TECHNIQU dias'ot ths line erga te : Raeprrorie Se vue a seh qo? bot not wih SP RINE IPAs ear Neo 84. Out of 5 males and 6 females, a committee of 5 is to be iv) How many ways he ean ( fnowor if he answer exactly three out of the first five questions? = : («) How many ways he can om formed. Find the number of ways in which it can be formed so that among the persons chosen in the committee there are (i) exactly 3 males and 2 females swer if he answer at least (i) at least 2 males and one female remaining children receives 8 biscuits. Find the mumer of ways of distributions, 85. A staff of a bank consisite of a manager, a deputy manager ‘and 10 other officers. A committee of r members is to be formed, Find the number of ways in which this ean be formed 90 as to always inelude (i) Manager (i) Manager but not the deputy manager Gi) 41. Ip how many ways 10 students can be divided into three | neither the manager nor the deputy manager. teams, one containing four students and the other twe contares 36. Sukrit has 11 friends. Find the number of ways hone, aa | (@ Sukerit invites 6 of them to a party. 42. In how many ways can 12 students be partitioned into (i) Sukrit invites 5 of them if two of his friends are married four teams A, B, C and D so that each team contains 3 students? and will not attend separately. 48. There are 9 students in a class. Find the numberof ways (iii) Sukrit invites 5 of them if two of them are not on the 9 students can take 8 different tests if 3 students are to speaking terms and will not attend together. take each test. 37. Sayani has 11 close friends of whom six are also gir ‘4. Find the oie: cOMeiGe alta Saracen ¢ Find the number of ways that she committees where two 6 the tattislos beataetalsSleberh and the others two, 45. In how many ways eam a set with Uhre elements be divided into three cells (a cell ean be empty). (® can invite three or more to her birth day party. (i) can invite three or more if she wants the same number of boys as girls (including herself, 38. Pappu has 8 friends of whom 5 are girls and 3 are boys. 45. A candidate is required to answer 6 out of 10 questions Buku has 7 friends of whom 4 are girls and 3 are boys. In Si hana oi : sn how many ways Pappu and Buku invite that trends in bees divi 2 a Pappu's birthday party of 4 girls soa toes, wat there irk i emit ‘sca fo ust 4 of Pappu's friend and 4 of Buku’s frien elt i ee sereea Gwestions?_— ae “ ENGINEERING MATHEMATICS ~ py vHING_THCHNIQUES 9.1 «7 hres coplanar lines, Four distinet points are Prove that w0t of 87 positive integers come RsT bow sary woos cket team of eleven be chosen Megor Prove cha thaw senate SEY 8 pai ; Sd; Ta how any way can crcht toa ines, Prova nt some elements of X whose noe (include « particular play 40. 2) exclude « particular player Hint: Lat 9 9 Bae aay 5 49. In a triangle ABC four, five and six points (other than A, in true HT vome & ie divisible by 28. Otherwise, 1, be retnainder B, ©) are taken on the sides AB, BC and CA respectively, How sinon § is divided by 26. Two of auch remalader aay fy and " many triangles can be constructed using these pointe’ ay 4 are caual Let D<@, Then 8,28 ca 4p nice a tices? How many triangles considering the points A.BG . SE attest along with the above 15 points as vertices can be constructed? }50. Assume there are n distinet pairs of shoes in a box. How ‘many single shoes can be chosen from the box so that we are certain to have a pair 51. What is the least number of students that ean be admitted to a college so that there are at least 16 students from one of the 50 districts, [Hint : Partition S into 9 equilateral triangle where each side has length one inch.} ‘then test ocean eta eee is . Show that at least 2 people out of 13 must have prohenamtersiteemenreieers room. divisible by 25.) 59. Ina party there are 10 persons where each pir of persons aro either friends or strangers. Prove that there is cnt group of 4 mutual friends in the strangers in the party. party or a group of 3 mutual 60. If A and B are two disjoint sets then by principle of Inclusion and Exclusion prove that n(AUB)=n(A)+n(B), 61. Find the numberof integers between 1 and 500 (inclusive) which are multiples of 8, 5 and 7, 62. Find the number of intogers between 1 and 500 (inclusive) which are not divisible by 3, § and 7 63. Find the number of nonnegative integral solution of At tay 218 where <7, a <8, 34 <9. 64. Find the number of non-negative integral solution of Xhy+e=20, where £<8, ¥<8, 210, 65. Find the number of combinations of 10 itoms taking from five x's, four y's five 2s, and seven w's. ; [Hint : required number = number of non-negative al ‘olution of x, +, +35 444 #10 where x, 58, $4,%5 55 S4] 86. A store sells 4 kinds of biscuits. How many way a customer ‘an buy (i) 16 biscuits (i) 10 biscuits.6s ibuted among A,B@ r Fore 69, ' ich are lese or 5. 2OX20+10¥9%9=485009 6, aeasrnmeseisoo ble by 11, 7 ] + © 24.69 576 Gin 360 & 200 G 70. * ommittees from 14 : ee 10. (nny 2 committees contain 3 persons and4 other | 11. 9!*5!x4!x3!=103680 comm gi } 12. G) 120 Gi) 24 Gy 24 Gy 12 ain aioe Sneed a te. F number of surjective mappings from ae ‘on ae 72. Find the number of ways a company can assign 6 projects 14. () abt Gi) 8-4) Gy +P to 4 employees so that each employce gets at least one project. 5 15. () 471 Gi) 351 73. Find the number of ways a school can give 5 prizes to 5 ts so that each student gets at least one prize 1 Oe ee 17. () 512120 Gi) B>BM2=04 Gi abeal=as 74. A set A contains 5 elements and a set B contains 7 elements. How many surjective mapping from A to B ean be 1872, -"P, constructed 75. Four dice are thrown at atime. In how many way a total 18, 19607 28.6) 5G ao Gid 104 of 14 can be obtained, 21. () *P, =360 (i) 6* =1296 20; 7P,-(°F,-P,)-*P, =30 76. Three dice are thrown simultaneously. In how many ways a total of 11 can be obtained so that the sum of the points shown 22.(5%10" -1)- by two dice should exceed the point shown by the third die. a. uaa ao ents [Hint : Required number of way = number of solution of styeeai] 0 tbat ziye2 peer as, ("Gage fe acc of %,9,2 should be <5 and 21. 2 So required number of ways = number of integral solution 21. 12be 28. *¢,=56 of x+y+z=11, 152,9,255] 29, 350 i ways in whiel rs and 15 . 77. Find the number of ways in which 3 doctors and 30.69", «2906 Cys, =180659°0, +9 = engineers can sit together in a queue such that between aBY ee two doctors at least two engineers can sit. ; aaa weENGINEERING MATHEMATICS - oUNTING TECHNIQUES ei bo $8.4) 2", 1900 6 srionn . : Sige coe he ip 7 1500 r °C, $90,046, + 40x80, «990 a E 36-6) 402 210 9 502-0, 4,0%6, «ea er 9719 "eC ou4NG, (eae, Gy x18 F ie Multiple Choice Question, "CxO, +t0,nty 6 esac 5 50,360, wad 0 ne Chice Quest ( 38, 925 1.1 °6,76,44:38 the value of ia 89. Gi) 286 Gi 165 Gin 110 Gv) 80.69 276 a 40. 0,440, x60, x26, «377200 2. The numberof pormtation ofa att with element ie eee () a! OR)! (Ast)! ) none of tho 41-!°C, "0,3 =4200 42. 960600 - ‘ a wivsshs 48, 5040 44, 151351200 45, axaxs 4. The umber af gol that cane drawn in ely 40.(°C,%°C,)+(°G 5G) +(°C,°C,) =200 on) erg © © 2D @ od 47.(44%4) +45 ‘Cy x°P, = 208 "Cy, the value of » is 48. G, = 364 () "Gy = 286 Git) °C, =78 at Ele itees oe “Gx'G, en 5. If "GC, and 7G, are in AP,the value of » is 2nd part : °C, -(°C, +7C, +*C,) = 705 oo << os @s sane Se 6 The number of triangles that can be formed by joining 61.4 ene the angular points of a decagon is 63. Cg ("G+ "Go "G)+(°G #'C, +°G)-0010 (a) 120) 66 (@) 220 none of these 64, 15 oe 7. A man has 6 friends . The number of ways he ean invite 66. (i) 646 (ii) 286, 67.78 one or more of them to a party is 69. 520 ou. oer On er 68. "C, =286