0% found this document useful (0 votes)
92 views19 pages

CS25 Discrete Structure - 230228 - 084328

These focus on Mathematics
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
0% found this document useful (0 votes)
92 views19 pages

CS25 Discrete Structure - 230228 - 084328

These focus on Mathematics
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF or read online on Scribd
You are on page 1/ 19
Jo Sun 202.3 Statement CF sition) 5 declamtive sentence ; Ie? due [fale net bol bertthncts (2 troth value 7 bth ¥falyr 2 can be assesseck, [cateqonzedt Losieal Cone ctives (Ane if. ele, or) sempoural ‘entence, > logic > sefere on how 4e evelote arguments | Measoning a methods of regsonu fe Ven’ cones of (ape Pe ums A Nobleme'cal 7 delyctive formal prot 7 leytol Conechies 7 propositional variable A Conjuction 7 AND (A) ve seonunch 7A WY) Necyachion 2 TRUE to FALSE Ge) (~) ne YT Conslitton 2 Tf -ebe (2) / eae ES nicl Bes a Br cond tioner| 221 and only sf (ea) 5 sofhtient o reresnry Excluive OR 2 Exclosie DR (®) jnemebion of: bicalrboml aos Wat Al a a aaa weaad wt ee ae Because conditional statements play such an essential role in mathematical af reasoning, a varity of terminology is used to express p —» q. : The following are some of the ways to express this conditional statement ce “if, then @” “p implies q” ret ‘fp "ponlyif a” “pis sufficient for q” “a sufficient condition for q is p™ Tel “git” “a whenever p” @F q when p" “q is necessary for p™ F “anecessary condition for pis q” “q follows from p* “q unless =p" @LPa (Ps Ql & I78 a = EEE x & eo r Se ow << a eS o ee Cau ie i (> P> (QE>R) ‘e 4 Bs SrunlkerREE aN a a yJrearPeRewpe aS Nae eda Pod Cg A Sri-uureew Oo fee ne ee Logically tauvalenve 2 compare wo cbabanerts if ae have tho seme bulk table ©) Tobentity PATE; PVF =P Tere PA~Pz te Pv-ret Double Neg ub ~(~P) =P if WAVE fan (avile a g ou ~v (PAR) = ~PA~R ic yy ~ (PV@E= ~P VR vy jou! (AR paisa Bad | Bare PA CPV OEP Absorption | py(PAQ)=P LP V PARQ] v PI~@ Converse esl “(PR vopa (Prva) vP wa Taverse. a) ~Q io |rv®) Conba porrhve “QR alae is Bt 0 "ont ae ae valve C \,0) Bookyan Youiebhe 37 >~e Hse . Bit Shing” setpene of as; mobo of bl = Rng froo? 2 hypothesis assunesbions -fo conhs'o4 Rule, of Jaferences- TABLE 9 Rules of inference ‘Name of Rul Ri in ns Rule of Detachment p [pa@argloa (or Modus Ponens) p> q Law of Sylogism pa [@>9.@595050 gor Modus ofTolens _p-»q [p>@A-4q]>—p College of Arts and Sciences Education General Education Mathematics hells led 2nd Foor, OFT Bung Matin Campus Daa Cy =a ule of Conjunction ——p aa Rue of Ojuncton —pvq Tevaasploa Syllogism Ap Rule of Contadeion

F GeoFiae Rule of Conjuncive pag @ad>P Simplification P Rule of Disjncive——D_— P>ova Amplifcation pea Rule of Conditional png Toad Garr Proof polo Rule forPioolsby pF Teo) Cases aor Rue of Conetwueive pq Toaaiashpaloas Derma ros bur Rule ofDestuewve pq Teranasaav=3> Dilemma ros v-0 mavat ae A. Consider each of the following argument. Identify the rule of inference tha establishes its validity. a eee. LPacrooyjo& me = If x+ y= 3, then y =2, F>Q Therefore, y=2.-- Pole of fesochmnend- 2. if Y25=5, then #=-1. PK Poke of troots by If s*=25, then #=-1. QR G. SEF Therefore, 125 =5 or 5 =25, then Fat. 7 (PV@)IK Leparya Gar) 7 L(fvaa 7k) 3. If Maria is a senior citizen, then she is at least Meads of follens 60 years old. PQ Aaa? Maria is less than 60 years old. 1 Q TP PQATA 494 Therefore, Maria is not a senior citizen:1P 4.lf4+3=7, then-5-3=-8. PQ -2-54#3 Therefore, 4+347. °° ~~? meat 5.8>6o0r4<2 FVQ Drsj 8<6. ae Sane Therefore 4<2. ..Q C(pva)sar] 2Q Vermubeh'on al Conbrech on Yerrwtabion 9 avcorgenunt o objects « po repebhen, (cores 7 Fucainental firuple af Gurkig ce = nie forcfon'«| es S ae vu a 720 7! m — ” ae jomebabions: aa { i ee wo. of pomubbiong of gata objed Me . (h-y)! wo. of ponbstion im eae = eG (n-})? po- of pom bens vf reprtttion a n | whye Vi, taMa ave chine} ahjeds n,! na! Ny! Ly goaup of abject Conbire bon 7 arrang tof objects . . saree of objects lve ally te mt (yor = ule = / ( )- At Air)! \h posrtble combirachion wothioly aha-ot objet ris Me (a an Taclusion Exclusion Ly Ne N-No op tads'e N~Na-Ngf Neg) N- Na -Ng~Ny 4 Nog) Nea,ayt Neg ay News ‘Topic 1: PERMUTATION Lstng the numberof elements fer a lage sample space become very complex tocnumerate Deteraning twihout actual sing each clrment could be poesble tough cme concepts n probably such as permutation an combination, Definivon 1. permutation san arangement of cblecs where he ors taken into account Consider the thee ltrs bande. There ae 6 dstnet arangements that ‘could be enuimrated Thess ae abo seb bac bea cab cha Instead of tng the E 3 of Counting, a: 2 mutipicaton ‘ule, is use nding Be numberof rangement “The mutipleston prince (Fundamental Prinaple of count) states tha an event E car and bea ‘sch way of osc Stother event en heft number of ou oe et seve Set aters tobe aranged en tno be cops 8 sated boon, ‘This problem exhibis an example ofan ordered arrangement hat i reered 102s permutation @UM College of Arts ane Scenes Education xpresdon of factors; Se Zed can be wren na charthand notton calles factorial, hats 3 factorial ot 3. ‘Tha n factors denoted by TU ate { nn-Dn-2eee3e2ebit n21 1 fine Several Ways of Counting by | The folowing are some techniques of dng the number of permiation using format 1. The numberof permutations ofn distinct objects factor In symbol nl + Example 2 In how many ways cn he 5lters ftom the word COVID be arangedin 30H? Answer. There are 5 cstncteters,aranging them in row willbe ls ,P, = 5t=5e4030201=120 ways 2. The number ofper lect taken rata te i the quotient of ‘acttl ana ress than) fecal In symbol “wn {3 The numberof permutations of nastnct objects cle fs n minus 1 factorial. In ee eee ena P=(n-0)! + Example 4 in how many ways can 6 students sit around table? ‘Answer To aange the ek students in a ele, the numberof ways canbe determined % P= G-Dl=51=120 4 The number of dstnct permutations on things efwheh mare one of nd. nf {Tetra ola sequal inion! ‘© Example 5 In how many ways can 4 mango tees, 5 coconut tees and 6 ack ‘ruitres tobe pated along property ine fone does not disinguish beeen eee ofthe same kind, Answer Lotn=4, 25, andini=6. The overall ees tobe planted are 15. The number of ways tcan be planted is nt 151151 RinLanl aSI61 2,073,600 630,630 ways Inthe previous problema, what have been soWed are the numberof ways seeing + objects om objects with consideration of the orser However, il be aferet metet ow, te problemi fang the numbers of rangement of jects which the order not considered, Detnkion 2 An arangament of bess nw ede int imporant ati Te number of combinations of tings taken rat a tme is wien as (mae + Example 6. In afte, each toket hae Sone-gt numbers 0.9 on You win if ou eket has he Gs nay order What are your chances of waning? ‘Answer. The chances of winning computed by way ofthe formula, 1 JeIeBe T0605! Eee rceaneee tee { “lO sd Santa =(pgh SE ' Example 7. There are men and S women in small office. The customer wants ‘of viet foma group of 2 men and? wemen. How many alent suocerneeT arc 10H 6” Answer. The numberof ways of electing 2 man inthe commtee of ie is ‘emt testy Saree cnet ot oA (3) agai 29 ‘opiate mapa rude where mst nurber of wys of elecig 2 FUSE oe nog ote @UM College of Arts an Sciences Eaton Tan, = Ge10=60 ways Topic 3 THE PRINCIPLE OF INCLUSION-EXCLUSION ——E—E—_— Inwilbe convenient to lad upto inctusion-excusion principle by a sequence In general analysis Let denote the number of objects having both the properties w and Let, denote the numberof cbecs Having the thee properties up and Let N» danote the numberof objects having thet b.vand 6 Now suppose a question willbe asked How many of te N obacts donot have the propery of ? The answer, 1 is cbtaned in sirpe subtraction. ii How many objects have nether the property nor #2 The answer ie NN, +N, i, Howmany objects have none ofthe thee properties u B.1? The answer is NN Nyy“ # Nan Naos Mos Mea Consider an abject having none ofthe properties of. Such an objects counted bythe term but by none of te term Hence such an objects counted in ones Next consider an objec that has exactly one ofthe tree properties; cuppose, it has the ‘property off. Such an objects counted by to tems, namely -N& Np; But since Ni ‘refaced by @ minus sign, such an objects not counted Nest Consider an object that has exact two of the properties, and y. Such an cbjectis counted by the terms N,N,N, 88, ,, and by nother terme, Hence, in efec, ‘eh an object isnot counted at al because of he arrangement of plus end minus signs in shat formal. College of Arts and Sciences Education Finaly, consider an abject that has al ee properties, andy tis counted by every one ofthe eight terms but again this means that in eflect it Ist counted at all because ofthe arangement ofthe sans. Summing up the argument, the formula N= Nay—Moy Noy +My May 4M) ~Nay fleet Counts those objects, and only ‘hose objects, having none of te properties Formula can be extended to any number of properties. The number of objects having none ofthe properties 7. 8 Ny “N, ‘Thiele the inclusion-exelusion principle. aveve] = WAl+}Bhyc|- | N1B)-[ Mel Jane | + [ANB 1c | ——=—= Topic 4, PIGEONHOLE PRINCIPLE Basic Form of Pigeonhole Principle oat Form of Proconhore Prine’ The following are the three eer principles: Principle 1 ne igeons enter m pigeonholes (mis a positive integer), there must be at k {one hole having more than 1 pigeon. Principe. When m+ geo enernpigeonhoes, there must be one ole having at wont lets Dy = max fn Principe il, When infritely many elements are parttoned into fntely many sets, there must be at least one set containing infinitely many elements. The examples below will demonstrate several methods for getting pigeonholes, 4 Example 12. In a bag, there are some balls of the same size that are colored by 7 ‘colors, and for each color the number of balls is 77. Atleast how many balls are needed to be picked out of random to ensure that one can ‘obtain 7 groups of 7 balls each such that in each group the balls are homochromatic? > yp, 7 Ansi For this problem, itis natural to let each color be one pigeonhole, and a ball drawn be a pigeon. At the first step, for getting a group of 7 balls with the same color, at least 43 balls are needed to be picked out from the bag at random, since if only 42 balls are picked out, there may be exactly 6 for each color. By pigeonhole principle, there must be one color such that at least [42/7] + 1 = 7 drawn balls have this color. Next, after getting the first group, itis sufficient to pick out from the bag another 7 balls for getting 43 balls once again. Then, by the same reason, the second group of 7 homochromatic drawn balls can be obtained. wm a . “ {= Pee : a 4 ab )T mayo othe College of Arts and Sciences Education ‘General Education -Mathematics 2nd Floor, DPT Building Matina Campus, Davao Cy eee eee cin nina 456/305,0647 Loca 138. Repeating this process for 6 times the 7 groups of 7 homochromatic balls are ‘obtained. Thus, the least number of drawn balls is 43 + 6 x 7 = 85. + Example 13. A bag contains 200 marbles. There are 601 red ones, 60 blues ones, a 60 green ones and the remaining 20 consist of yellow and white ones. 1 If marbles are chosen from the bag without looking, what is the mox s smallest number of marbles one must pick in order to ensure that, 0 5 among the chosen marbles, at least 20 are of the same colour? Answer. When 77 marbles are chosen, there are may be 19 red, 19 blue ,19 green and 20 yellow and white. If78 marbles are chosen at random, the number of yellow and white ones among them is at most 20. Therefore, there are at least 58 marbles of red, blue or green colors. According to the Pigeonhole Principle, the number of drawn marbles of some color is not less than (3 Zin = 20, ie., at least 20. Thus, the smallest number of marbles to be picked is 78. In this problem, a color is taken as a pigeonhole, and then a drawn marble is taken as a pigeon. fat =f v n > . ote 3 & I ee 3s~- Practice Exercise 3 Solve the following as indicated. Show detailed solution. 1.How many integers from 1 to 33,000 inclusive are divisible by none of 3,5,11? wee 11,000 -e 0D Nee ee, (eo Na ae. | Noi Be Zee seo Soest Ns: ee a > oO 0 : : ae me Noss) EE i aoe! 2. How many integers from’1 to 450,000 inclusive are divisible by none of, 3,5,92 NHs00c . Nie eno Niven = SPA? np ae a we « na Be ce ie Nuasy2 tae SRI I tT MUlah UF $1010 N= mat = 9,893.99 29994 S.How many integers fom 1 '0 1 milion inclusive — fe square, perfect cube” 3 nor perfect fourth powers? a 4. Let U be the set of households and let |P|= 83 and |G|=41 be the set of households that subscribe to PLDT and GLOBE, respectively. There are 32 households that subscribe either PLDT or GLOBE a) Find the number of households subscribing to at least one. = @( b) Find the number subscribing neither. = (¢ 2 9 Pope PAGEPAL px 9885 PuL=P4L+PAG > BB 44 422 gH RE = [Se Puc: 2979 mos at 5. Let s be the set of all positive four-digit integers. Then \S|= 9x 10. Let So and Ss be the subsets of S consisting of all positive four-digit integers containing no O's ~ - and 3's, respectively. Clearly, ‘So}=9! and |Ss'= 8x9°, We also have |S0 S3i= 84. \I-tyao |Sol=esul \5) ~ S (32 tsoa5]7 84 wi | SHB PM 1-4-8 \s) a . Peay ws eal eae @ mMissise! Fr | ne (Na Nye owl Mie coal Na? P= 2, My 2M =] WE N10 BA] SY 447,200 ye alain © we ytoe = He = B4USD One \ oo s1_| 51 84H 50 (Ge Mhz i000 | A= 21 Pe Pe Naas = _ eo h Na=Nz 2232 = sco | Nap = Nee * 2 sd = |ie00 a ices 100 | Naja =Neosy = a - 20 Ae Nie] \iscd y= Nos See aut) por Nine 22 280 - Ne p=Nysjoeg “Fa = (000 — Soo -|P0-YO4 GO4 ZO+Y —2 - |?) fen ancl Toncbiens Biron felction = Ace 6} subset AXB > (wb) ER; if a KB lreleces fo a oLividles b = Oley portions ~ Ave B (PAP) gootl ff = Fe) ed OF coaekef iON 7 ' c (0 42 2 IG EER TOKE D _, be Given f04)=Sx+1 and f(%)=x -x+5 DDSx] UAC pe = x Hcl i) Lexa yd 4 De 1489 > P52 4.28% KTS W loa sD ean err Compasiton of » taco = {'y (fes)ix)3 rephve x \nle 4 (4h) Oj replace x inte F bel K=8-2¢y0 1,23 4. Determine whether each of these functions is a bijection from R to R. Bijection a. f(x)=2x+1 fe) =af-aya-3 Foe xoyape Fl) = 2H 4 FU) 2a et FO) 204) -3 Bedony, sq) =324 . ret Rp 1s flo)2 t=) FAIZ ATH 2S FODGYAHe2 pe the? ge a fey-0?=0 Pl)=2?°B Pes E=~t FD =P =I 5. Let f be the function from R to R defined by f (x) = x°. Show if f is one-to one. Find f". ‘ib f («5 =x* on ly) lx*s : ]K=4 . 6. Find f»g and g +f, where f (x) =x? + 1 and g(x) = x + 2, are functions from R to (tess) ar f)) = Ca) COP) Gata) HC er? yard HHA Kae IS (A) = 9E9)= (ewe fess] Rewrrence Pelaben a Sequined Seumple'’ : Oy Oy 43 led; A= 2 Oo 123 7,305 io Gl 16 5S) ac Qs: Qn 43= Bt97// Sommation. & ai Yeuble = amb AC) Q (owert: 4, to | C-comen) ZA: CH alta) + G43) BA 2 tle O2 (Vite) = (3() 16) 4034 +) a S q 4 l2 = Zl

You might also like