Scribd Logo
Upload

Welcome to Scribd!

  • 1 views

    ASSINGMENT

    Uploaded by

    emusa5544

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd

    ASSINGMENT

    Uploaded by

    emusa5544
    1 views4 pages

    Copyright

    © © All Rights Reserved

    Available Formats

    DOCX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Download as docx, pdf, or txt
    1 views4 pages

    ASSINGMENT

    Uploaded by

    emusa5544

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Download as docx, pdf, or txt
    of 4

    DISCRETE MATHEMATICS ASSINGMENT

    PA106/G/22424/24

    1.DIRECT PROOF

     We use direct proof to prove statements of the form “if p then q” which can be written as p q.

    we take statements p which we assume to be true and use it to show another statement q is

    true.

    A direct proof has the following steps;

     Assume the statement p is true.

     Use what we know about p and other facts as necessary to deduce that another

    statement q is true, that shows p q is true

    Example

    Direct proof that if n is an odd integer then then n2 is also an odd integer

    Solution: assume that n is an odd integer then by definition (n=2k+1) for some integer k, we will

    now use this to show that n2 is also an odd integer

    N2=(2k+1)2 =(2k+1) (2k+1) =4k2+2k+2k+1 =2(2k2+2k) +1: hence we have shown that n2 has the

    form of an odd integer. Therefore we have shown that p=q and so we have completed our proof

    2.PROOF BY INDUCTION

     Proof by induction is a mathematical method for proving that a statement is true for all natural

    numbers

     A proof by induction of p(n) a mathematical statement involving a value n

    These involves these main steps;

     Prove directly that p corrects for the initial value of n. This is called the base case
     Assume for some value k that p(k) is correct. This is called induction hypothesis. We will now

    prove directly that p(k)=p(k+1). This means prove directly that p(k+1) s correct by using the fact

    that p(k) is correct this is called induction step.

    Example

    Prove by induction that n2+2n is divisible by 3for every non-negative integer n

    Solution: let p(n)be the mathematical statement n3+2n is divisible by 3. when n=0 we have 03+0=0=3*0

    so p(0) is correct. (k+1)3+2(k+1) =k3+3k2+3k+1+2k+2=3m+3(k2+k+1) =3(m+k2+k+1)

    As m+k2+k+1 is an integer we have that (k+1)3+2(k+1) is divisible by 3 s0 p(k+1) is correct hence by

    mathematical induction p(n) is correct for all non-negative integers n.

    3.PROOF BY CONTRAPOSITIVE/INDIRECT PROOF.

     Proof by contrapositive involves inferring a conditional statement from its contrapositive

     The contrapositive of a conditional statement is the mixing of the converse and inverse

     The method of contrapositive means to prove “if not q then not p”

    In a statement; if the sun sets down=hypothesis

    It’s in the west=conclusion

    To form the contrapositive of the conditional statement, interchange the hypothesis and the

    conclusion of the inverse.

    Inverse: the sun is not in the west, if it is not setting down

    Contrapositive: the sun not sets down, if is not in the west

    To prove that p q it is sufficient to prove that (not p) (not q) is the contrapositive of the

    implication p q

    Example

    Is the statement “for all integer n, if n2 is even then n is even “, true?


    Solution: we will prove the contrapositive let n be an arbitrary integer suppose that n is not

    even thus odd then n=2k+1 for some integer k now n2=(2k+1)2=4k2+4k+1=2(2k2+2k)+1. Since

    2k2+2k is an integer, we see that n2 is odd and therefore not even.

    4.PROOF BY CONTRADICTION

     This is a method that establishes the truth of a statement by showing that assuming the

    statement is false leads to a contradiction.

     In mathematics a contradiction occurs when we get a statement p such that p is true and its

    negotiation not p is also true: consider two statements p and q.

    Statement p:x=a/b where a and b are co-prime numbers

    Statement q:2 divides both a and b

    In this case we have to assume that the statement p is true and also manage to show that the

    statement q is true hence we have arrived at a contradiction because the statement q implies

    the negation of statement p is true.

    Example

    Proof by contradiction the following preposition when x is real and positive

    X+(49/X) =>14

    Solution: assume that there is a positive and real value of x such that

    X+(49/X) <14 multiply by x X2+49=14X = X2-14X+49<0

    X-7 is not real contradiction

    X+(49/X) =>14 we’re told x is real therefore X-7 is real

    You might also like

    pFad - Phonifier reborn

    Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

    Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


    Alternative Proxies:

    Alternative Proxy

    pFad Proxy

    pFad v3 Proxy

    pFad v4 Proxy