ISHou Tro wrt wosay, tho student MUS Sale r, v8 sxc heat = : coe ap Foon tenn me 8 oer 1d essay, the student must select rarer how ‘example 421 ct the two o38ay PIS? 1,8, and ways an the student the Pundamental Counting Ping) Fundamental Counting Fring Solution: . ae that: Uso Method 2 Us Gaal A Lag Eres Wlogromnl essa ovnn| Maeno =P Feeney Secondonsey Sekctor | the task of choosing essay topics has two stapes, choosing an essay from topics A B,and Cand choosing ay | essay from topics 1, 2,3, and 4 1 | The total number of ways of selecting the two essays jg 85 | the product of the choices available at each of the twp Ba cer | stages: S Number of ways =3*4 = 12 ‘The student can select the two essays 12 ways. - a ie me { The student can selectthe two essays 12 ways, Example 4122: Hon many thee-oter combinations canbe made fom A, D and L. Solution : iz | Method 1: Using a Tree Diagram | ema chance sO Arrgenen van | Me lask OF choosing essay topics has three stapes aa | choosinga first, second and third letter, 2 | The woral number of ways of mree-letter of ways of selecting the th ws Product of the choices available at ‘Method 2: Using the Fundamental Counting Principle an | Number ofways=3 353 227 Ther are27 three letter arcang rangements, There are 27 three Jeter arrang ements on inapard person hi rerefore BY persons has 53 ‘ample 432 Solution : To hold ¢ me of (23,4,5,9,0 hich 6 unit "aintained athhave their birth day during that month, PAN of 20 people, thar are two people wo have the same nubor ofa 2 party f 20 person each has ateaton and tint 9 hens on hevng frends we en east him in oom beled Le we eure 19 roms i alae 20 by pigeon hole principle, there is at east 2 acetal ad tere I atone oon cnaing te pene three |has same number of friends, Say: : are: Pie 42.2: Prove that l gion a set of any seven distin! epee, ve musl ede wo logon te et whose sun © ditference is multiple of 10. Fo hold condition of divisibility we require numbers whose unit placed elements are distinct and whch are from Brothe set ( 04, 2s a So es 8 6 SS 8} oe 5,9,0) ..ete, Such each set contains exactly 6 numbers. By pigeon hole principle if selection of 7 numbers for unit placed elements, Then there exist at least one repeated unit placed element or elements from other sets fined above. Hence such 7 numbers does not exist, 43.3: 1110 points are choosen within the equilateral rangle of side longth 3. Prove thatthe selection includes at Joast two points which are at most 1 unit farthest apan trom each ether we can find 9 small triangles of given triangle, of which there are two points of two triangle are 1 unit. apart but we have 10 points hence by pigeon hole principle one ofthe triangle contains at least two points {V/\ [NIN/\rematics (MU B.Se,ComD) LW isrete Math rom bat ee doo rotons 7 cs aac} S07 nutes from 10) alt such sub Example 44: St ea Solution : Period from 10 am co 1pm is 3 hours lots of 30 minutes each from 10 am t0 1 ie ys in same slot of time. ist at east two lecture Ay pigeon hole principe there exist a ny ve numbers fom the set (1, 2.8) are “There does not ens 7 le Example 435; Show tha Solution: "The possible collections of two numbers from set {1 2,8) having sum is 9 are 5, = (1,8)S,=(2,7) 5, = B.6),5,= (4,5) | we select one number from each set then we can not have sum of any two numbers is 9 but we have to see: zumbrs tom 4 sets then by plgeon hol principle Its necessary to select oth numbers from one ofthe set, os FS; Sy but then sum ofthese numbers becomes 9 solution = ‘There doesnot exist five numbers from {1,2,..8) Such that two of them will add upto 9, RS: frample 426: Show at tany 14 roger re sled fim he oat a = (1,2, 25), there are atleast two integers whose sum is 26. ‘Therefore Solution LHS: ‘Thepose colton of two numbers trom st (23,25) having sum 26 ‘Number of al Si= 6,25) Ss = Gay = (8,23) Number of al Se= (4,22) S = 6.21) Se = (6,20) Number of all 19) S = 6.18 5S = 9.17) Su = (10,16) Su = (11.15) Sa = (12,14 Number of al Sn = (13,13) * inall, alls C(n, 0): by Equations © (0,0) + ¢( Solution : Als finite set ofn elements Lis, = subsers =e EMP 444: Solution las, Let Ais: Number Riis. bate Number Numbersubsets, D+eM~4,2-3) + Let Ais set ofn elements, (A) =Set ofall subsets of = jp (a arly Ip(A)I> IA] Le. 2"> ny 443 Using combinatorial argument prove that Z Cin, y=2", r=0 42.C(n, 0) + Cin, 1) +6 (2,2) +... + n,n) =2" Let A be set of n elements. p(A) ts set ofall subsets of A Therefore “ [pl = 2 ~) Number ofall subsets of A containing 0 elements. “Number ofall subsets of A containing 1 element ‘Number of all subsets of A containing 2 elements: ‘Number ofall subsets of A containing n elements = C (nn) + inall all subsets of Aare € (n, 0) +C(n,1) +C(n,2)+C(n.3) +. C (a.m) 2) ‘by Equations (1) and (2), C(n.0) +C(n.1) +6 (n,2)+..#C (wn) = 2 te, Z cfr) = 2 PaO 4A; Using combinatonal argument prove thal © (2n,2)=2%C(0,2)+m mn: Let A is set of 2n elements. Number ofall subsets of A containing 2 elements are C (20,2) (1) ‘ach contains n elements. Band C are partitions of A. E fall subsets of B containing 2 elements are C (n.2). Number of jements are C (0,2) 7 Number ofall subjects of C containing 2 elements are C (n.2) aeand other from set C thats mts one fron set B nanan 3 Zi ipsets of A containing 2 elemer ws “jmiarty number ofall st et pactsaseelh cain? eee A cie.2)+ctn,2)¢m? = 2xC(02)* Equations (1)and (2) x(n. 2) +0 — y yy + (C (9.2) +(C (MN =O (an,5) Trample 445: Usig conbnaloal arpanent prove tal Solution: Bis: LetAissetof2nelements Number ofallsubsets ofA containing n elements are C (20,1) (3) Lis: Inanother way such counting becomes ‘Band Care partitions ofA. Each contains n elements. ‘umber ofall subsets ofA containing n elements, 0 from set B and n from set C are c(aoxceam 1 element fom set 8 and n~1 from setCareC(n,1) XC (0.81), 2 cement from set Band n~ 2 from set Care (ni, 2} C(n,n=2) Continuously. a elements from set Band n~n= O fom set Care Cnn) x(n, 0) Number ofall subsets ofA containing n elements are €(0.0)xC (0.0) +C(a.2)xC(,m-1)+€(,2)xC(n,0-2) +C(0.3)xC(nn-3) +Cln-1)xC (0.2) +C(n,m)xc(n.0) Butwe know C (0.7) = Cn, n=1) (©(0,)* + C(n. 19+ (C(0,2))*+ ..+ (Cm, my)? But uation (1) and (2) are same, EO! COD r+ Cy my=c (2mm, rape 4.46: Lang conbinaail rumen prow ha E kxCiniienx EP on ema 11x01 +2x6(n2)49% §9C(0.1)-C (1) ways onsekDlayers and then choose a captain aaa fe kxC (mk) ways them, This oe oe ‘is can be done rk 1.2.3, ..m.the total numberof way 1xC(H01+2xC(n,2)+3%C(,3) +, ait subsets: sub et Bis number of elements rather ‘Therefore | From Equa 45 Prine (0) Inclusion - Let A and ®) Inclusion. Let A, B aree to TW Discrete Mathematics (My _ BSc. Comp) Suppose now first player p in P, in 2"** ways, 59 p 40 1S ay " ee Remaining players are aT 82°" ways. Simiacy P, ig Counting Principles sociated with a team in number. They areas captain in 28-1 So that total number of ways Pals captain in 2°" - ‘WAYS of choosing a ca By Equations (1) and (2), tains x2" which is RMS BxC(r.1)+2xC(0.2)+ mx c(any Me ‘ = nxgtt le. E kexctn f 2 Clo = near =C(nst.n) Let Ais set of (n + 1) elements, All subsets ofr objets from (n+ 3) are (n+, Let Bis subset ofA containing n elements then forac A = Bio: Number ofall subsets of B containing r elements = ¢ lements=C (1) Smilary there are Ca, 1) subsets containing t= jents rather than {a}. me z euiepggiec cS Therefore total number ofr subsets from (n/+1) elements are Can) +c(nr-1) ” From Equations (1) and (2), Cur) +C(ur-2) = Cnt Principle of Inclusion-Exclusion (Sieve Formula) (Without Proof) Inclusion - Exclusion principle for two sets ‘Let A and B be finite sets then JAuBl = [Al+BI-1A8 Inclusion - Exclusion principle for three sets. Lec, Band C be finite sets then JavBudl Jal = Er l+V+VE |p) = WenteiveV jo] = WeV+ Vie VIE 1+ = Als [Bl 1Cl—CAM B+ ancl + Anche cl jana fanc| = Vel pods Ve¥ ansod=¥ ae tlemieteVeVle VIEFig. 454 [+ 1BCh+ (ABC Inclusion ~ Exclusion principle is lav Buc] = [Al [Bl + IC (IAB +A +1V+¥) tele stVeVeVieVIl = (elle V+ VD + (Tell + IV. (Weve vis vip-((+V)+(V+¥D +0V+V)) +V = Tellellte Ws VeVieVil = [+ Iellt+1V+V+ V+ VIL 3) Inusion-Excluson principle for sets Let Ay Ay yw A, Bem Ante sets. then a Zi- T wnale LY lAnaoad mal a iste istejck seen | aa | Cardinalityofunion ofn finite sets. = sum of cardinality ofeach single set ~ Gum of cardinaides ofall posstbe intersection of two sets) * (um of cardinals o al possible intersection of three sets) + (eum of carinalities of all possible intersection, Of four sets) tetAUB > counting Princes Tostudents gordistinctoninatiea ecg, ABI ee atleast =55+30-15= ‘one year. wy, 180 sui nthe aT st 05 eer nad coe 8 Computer Find the number of students who ‘ ©) hav bt 81 stand compu (©) _ have only a computer, ; ® ITUT]~650 [PUT] =150 +65 0 student live in the hostel Mul = TUT] ~| (TUG 1=800-50=750 ‘Number of students having .V. and computer Ire] = IM +ICl- [TU] =650+ 175-750=75 student have both a TV set and a computer. tof student having only a computer |cl-itoc} = 175-75=00 200 student have only a computer. (453: An investigator interviewed 100 Interviewers to determine their skils, expert in C language, expert in oracle, expert in V. B. Report occured is 10 are sklled inal thao, 20 are sklled in © and V.B. 90 are ‘siled in V.B. and oracle, 25 are skiled in C and Oracie, 12 are skilled in C only, 5 are skiled in VB. only ‘and 8 are skild in Oracle only. Then (How many are skiled in at least one (i) How many are unskilled. Gi) How many are skiled in C but not V.8. Gv) How many are skiled in V. B and Oracle but not C. C= Interviewers skilled in C \V_ = Interviewers skilled in V.B- (©. = Interviewers skilled in oracle Ie) = 47 I= 45 [cov = 20 leno} = 25 WoondFig. P. 453 2) Injusin-exuson prindpefor sts r d ea we isectenmieret nach siea ob = 47645+53~(20¢25+ 0} +1060 oe ncaa en aS ete = 190-8020 20 are unk intervewers (2) Imerscwors sled in Cbur no. = shied in €~ skilled in Cand VB. = (Gl-[Cvv]=47-20=27 27 interviewers are sklled in Cbut tin VB, (4) Interviewers seed in V8 and Oracle but not ¢ * interviewers sll in V.B. and Oracte~ inte = Wn0l-ICn ve 0}430-10=29 20 arestiled in VB and Oracte but not ay ow many ilgers betwen jo 200 ae cise by 7o¢ 147 0-2 Show Watt here are 30 stents na clase, than, 23 Show natv2 viewers skilled inc md ‘he Set contains marred coupe?The ckeumtorence of a whoet ig Manner Show that thre are tog set Me 98 ec 36 ar assigned o them in ata ‘Assigned numboris atleast 56 E kx CO, Wenxz! ket cf yO B baal ae corre eee Using combinatorial argument prove that (0,0) +011. 2)+... aC) s0%,3)¢., Find number of integers between 1 and 1,000 which 419 not vse by any of 2, 8 and 7 Suppose 60% of college professors tke lenis, 63% the brsge and SOR Kee chess 4% Ske ‘any given pair of recreations. (2) Should you be suspicious i told 20% ke all he three recroations? (©) What is smaliest percentage who could ike all the three recreations? goo 7 || WAH