— We es ee eee Discrete Mathematics piscrete mathematics %$ the Study of discrete gprackures hich One abstract discrete models cleating pith discrete abJects and melationship between Yen nese discrete Obsects cay be discrele Sets graphs tations etc. per yprarositions : A Propositdn ig G declarative Sentence jot 15 a sentence that declares a fact that 1s erter que or False, but not both, j ext: Washington DC, is the Capital of united states at America — True. ay 41S @ Composite number — True xs! 14152 — True xu 242 =3-— False. eas 3 Tormoto is the Captal of Canada - false. Some Sentences that Ore not prapasitions : oxi: What Hme is rt 2 éx2: Read this care fully » €u32 Werle dD exy ts Mtye Ze NotGtion‘ true=-!, false=0. Pris Ore Used to denote the Propositional variables, propositional variables; A vartable that rePresents @ Proposition csithout any Specified tue Value, ex' Py 4 15) fainpe number. @ 210 +10=20 R: gun is the Center of Solar System,Logical connectivities And A a p and@ A P26 1S @ Compasite ROY g @ > KetPD hos more gms than boys Praga: € is a composite rumber Gnd J21PP hos mox git!S than boys. truth Table: een PAL o | ° 6 0 ' ° lea ae cl \ | | 9. Operators: Negatian OPerGFors (wp or P) See cul e T €x12 Find the negation oF proposition. We ecto Friday” express in Simple english. A) The negation iS nig ts OOF the case that today is Friday.” This negation can be mOre Simply ex pressed by “ Today 3S not Fridcy, ” ovo | Nye 1s nok Friday today.’ fr21, Find the negation af the Proposition u At Seast lo inches Of ran fer today in Miami, _ ends eX prees i Oma aig Ue ae english w Je iS nok cae that Gtleast 10 inches oF Fain fell reday 1s Miami” iie ea ae qhis Negation can be more Simply expressed by fii, ness than 10 Inches of rain Fei) today In nami 3. CONGUNCHON Let Pand 4 be propositios » The candunc an of P and 4 denated bd PAL, 1S el position "P Gnd gq. 4 The conduaction Pnty is tue qyhen path P Ond > are true and Is fale ortherculSe, conJenclo aed two Propositions, (but 2 and) é33 (2422404 C4J=D a — The. (in=2) A (243=4) a Oe etal on are _ Pisvueckion 7 the disuunction oF pand q is denoted — ne ow pyq, 1s he Propasition ‘Pe or 4" The dis duo CH, Rand % ase false Gnd is u by pvy is False Chen both we OtnerDise. Cor) diciuacton Table For two prapasitins eyed txt (ela Du KOR 2 Jee P Crl=d v Cmonkeys can fly) ft Rm VIF +S! faise. on of the. propositions P and txt. Find the. conJuncl Friday 4 q where Pp is He proposition " Today is ond 4 is the proposition 11+ is 3Gning todo * i propasitos PAY is te A) The Condunction oF these. j d it 15 20IMng today” woday 1s Friday @n Proposition qhis propasiiey Is true, on rainy fridays Gnd i is Folge on any doy thot © hoe c. facley aac eee | Feast hen) cae Oe “the same Gnser for drsyunctian is} The disduncto of e and 4, pvg is the propasitay 5 xnaining today ” y 1S Friday Or we I «yoda 3-Not aw) ] gui, P! THO and Whree make Vue : | do not make aCe ~P 2 Two and thre and | be the propositos - The exclusite and@, denoted by POHL Cor p 62), 's the ig tte hen exactly one of Pond or OF RP proposition that G is wwe Gnd false Otherwise. Truth Table for Exclusie Cr of THO propositias |sanditionas State : 5: CC a Seemermerts Let .P Gnd. 4 be propositions gn conditionay statement P2% {5 the prapositicn , "if P 4," The. CanditiQnay atateme nt P9554 13 Fas when pis the and 4 is Fake, ord true aiherwize, In Cond)- yonad statement P57, P is Called hypothesis (Or premise) Gnd 4 13 Cated Conclusion, A Conditional sarement 13 ako Caled Impuficatton C=s) ar CS) e(>Qq Cohen] ae con clusion hypothesis Consequence . anticident assumPtion tie PP. An inteder 33 G multiple oF 4 ae Gs An integer 13 GQ multiple of 3 P59. An inteder 14 Multiple of 4 dren it jc A multiple of 3. gx2:_ "|@ Tuan has a Sma@rtPhare , then 213= $1 P + + D “WE today is friday, Hen 243=¢! 13 true everyday exept Fridag , en though 243=6 1S false reo T — MWe. 6 Logica) Equivalence: (45 "if Gnd any if,’ necessasy & Sufficient condition : ea e=<¢ Truth Table ! ce & aC ga er tetha togica connectivittes In the statemert iS represented OF a, #- ext. YoU CA access be aaa (and Comes) i“ W you GE a Computer science masa,” and % you ax a freshman respeCbicly: Nothing that only if" 1s ae one Gay o conditional atatement Cr be expressed ag er fer) oO C cvevF). If you Oe exat yau cannok ride the roller coaster Se, 6 you are aide theo) 1G uacss Do Base fuel) Unies under old.” de te cH nde represent " yews Fy ves hea oS ee bie. a be Rods Per ac Re Once aos oe Cv: : , Ig years old," respectively. s uy are older thon a yo (rans ore 4. Converse = The Propasttion %>P ig the Converse oF P= 4- a. Contropositive * The contropositive of P3F IS Se ae the. proposition oF nForP. q. Enverse ¢ the Converse af Pq iS te Propesiticn oF wp 3Wd ext: the home team Guns cshenever ik Is Frainrg.” 9 j y W)& the home beam GINS then it IS rGining, + oy [pit fs: NOE FanIng, then the home Converse iS 4 The invers tS beam Coes nok Gun! 1 ]p the bane team does not win, contrapositive (Se then fe IS Nat raining!ze 1 Oa Or Bilmpiitication; Let P and 4 be PI|POSIEIONS - The. biconditional Statement Py 1S op0sition "'P if- ‘ | proposition "PTE Grd if only 1F 4: The Gi condi tiaras | searoment Per G IS tue Giten p Ond % hare the Sane woth values, Truth table — = DAS e Pesg] (or) (ee 7 ap a = lea ale * NOK ET e ey = (e2g) A (938. 18) Con pol PRS eis a When one Or MOre prapositiGns coje conrected through various came ctivities is Caled compound propositions, ¢x: Roses Gieeeal and Vidlets Gre blue U ea ms 1 t proposition 4 Connectivity Propositions '2) fr Proposition i> said bo be Primiti€ if 1E Carvot be broken AWN into Simpler Propositions. eq} Roses) Gre: KeCl me unbreakable, PAL (pvvq) CAD) alg as E F F T F ie> ET ei ery pre ee conctiuck the truthtGhe for Cevad)—> CPnd) | ie alig gs Tea Fae = Se ee St ar Merci er vr 3 pete 1 Thee he 4s ee a oe a7 7 5, cleel =T isha ay aT eae rae ri) x Noket BODMAS 423x4-S+2. ts tow: Cavey = AES (An8 es Acwugs ~(svt = (wsdA (ow) POG) = Nes!) (oe) SV (Ps) V— V lo) % Note! Demorgoo uw Pa 2 AC BA P2A ~—~-APa) $2) Precedence of Lagica ape ratars 2 ope ratOr precedence | =~ neg ation R — consuncticn 3 —> drsvunchoy v —5 ep P implies Y = > jf and -coly JF A v = PvY va hWAds ee ag 7 oa 7 Pa ie T oi pF a ase peri \tes \W 513) Taurtology » Jautology’ A Compound Propositicn that 14 Ae. awe, 1S caved “Toutdlagy 1) Contrediction’ A Compound proposition Hat es cways false is CGlled ContradicHon, PAP ey Cup) > Tautdogy PALA 3 Contradiction 1) Logical Equivdences: “The Compound Propositions Jogicany eGuivalent BS cae n PEY denotes that pandq oe caved tautology + The not aba icqiy e*ulvdlent: mPAKRY Ge Jagically is a P24 are 109 show that ~CPevd) and pas pest 2 bicond itana). mena we Jogically equivalent (dermorgans) uv (eV) = (opr DY ~p VL NPAT Pe Pyy ~ (ev) + al aly F P fi i - F T F F a te iB + + fe DP fi F a a e : Afurther demorgan's dows extend -to. w (PV PLV--- Pn) = (we) Av ea New AW PD 16) Conditional disdun ction eguivalent : a po ord YP VG OF sogically equivalent: (P Vv ~P wv PVY p> =F al F ale é a F F ~~, : Ei s zs ig its f + Sie pos Mo xx (De UAYTULAZ Noe py (avon = (PYDA (eva) PA Cave) = Cpngdv (ord. 2D xx (yxd= Crawrz ye4 CYED= (xt YH Logical Equirdents: Equivalence Nome EE RAL Adentity tows PYFEP RAS Dommnat 100 aus PAF =F Page Idemporent $015 ePAe=e : 4) a(n) =P double negation Ow.5) PV eet c tie ta 0 Nata mmutative $095 6) CevMvr = ev Cqwy) Associative Ja.ws CeAMAY = PACD D ev (aAn= Ceyara Cpv) — Pistribubye tous eA (4b = Ceng) v Cen) » ~ (PAD = VPVOL Pe margan's Iasus ~COVD = vPAve Q PvCeAd =P ‘ bs AOS PA CPV PEP gai 19 Eee Negation tows CAvPEF ewle2! Logica) equivdences Involving eos Atokements. ) P34 = vPve DD PBYENV O-PS 2) RV Se poe YD ery = v (P0279 ee aa, \n O Ceana Ces esi) 4) (ean (4=0= (Pvp3r ® Ceep v (Pan=b>(9VD ) (adv (4ane (PADS,