Scribd Logo
Upload

Welcome to Scribd!

  • 2 views

    Method of Proof

    Uploaded by

    Preeshay Jutt

    Copyright:

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

    Method of Proof

    Uploaded by

    Preeshay Jutt
    2 views32 pages

    Copyright

    © © All Rights Reserved

    Available Formats

    PPTX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Copyright:

    © All Rights Reserved
    Download as PPTX, PDF, TXT or read online from Scribd
    Download as pptx, pdf, or txt
    2 views32 pages

    Method of Proof

    Uploaded by

    Preeshay Jutt

    Copyright:

    © All Rights Reserved
    Download as PPTX, PDF, TXT or read online from Scribd
    Download as pptx, pdf, or txt
    You are on page 1of 32

    Method of Proof

    PRESEN-
    TED TO:
    SIR.AB-
    Name : FARHEEN
    EJAZ

    Topic: Direct Proof

    Roll no: 17631556-


    018
    Definition:-
     WHAT IS PROOF?

    o A proof is a sequence of logical inductions from


    axioms and previously proved statements that
    concludes with the proposition in question.

    o An axiom is a proposition that is simply accepted


    as true. Demonstration that the theorem is true.
    1.Direct proof

    o The implication p->q can be proved by showing


    that if p is true ,the q must also be true.

    o This shows that combination p true and q false


    never occurs.

    o A proof of this kind is called a direct proof.


    Example:-
    Q:Show that square of an even number is an even
    number.
    Solution:
    if n is an even number then n2 is also an even num-
    ber.
    p:n is an even number n-
    >n2
    q:n2 is an even number
    p->q
    Suppose n=2k
    n2=(2k)2
    n2=4k2
    n2=2(2k2)
    Example:-
    Q:show that sum of two odd integers is an even
    number.
    Solution:
    p:a is an odd and b is on odd
    q:a+b is even
    a,b->odd
    we can write a=2l+1,b=2m+1
    a+b=(2l+1)+(2m+1)
    =2(l+m)+2
    =2(l+m+1)
    =even
    Name : SARA EJAZ

    Topic: Proof by Contra-posit-


    ive

    Roll no: 17631556-006


    Introduction:-
    The proof by contraposition method makes use of the
    equivalence

    •To show that the conditional statement Is


    true, we first assume q is true, and use axioms, def-
    initions, proved
    theorems, with rules of inference, to show p is also
    true
    Example:-

     Prove that if n is an integer and n2 is even, then n is


    even.
     Direct method:-
    Assume n2 Is an even number
    Then, there exists an integer k such that n2 = 2k
    the equation will be n = ±√2k
    which is not terribly useful.
    Example:-
     Prove that if n is an integer and n2 is even, then n is even .
    Solution:-
    Past Paper :-

    Year 2015 question 6:-


    Show that if n is an integer and n3
    +5 is odd, then n is even using proof
    by contra-positive.
    Solution:-
    If n3 +5 is odd, then n is even OR
    If n is not even then n3 +5 is not odd. OR
    If n is odd then n3 +5 is even.
    since n is odd so
    n=2k+1 (where k is an integer)
    n3+5 = (2k+1)3+5
    =8k3+12k2+6k+6
    =2(4k3+6k2+3k+3)
    Thus n3+5 is two time some integer, so it is even.
    Name : ANAM
    FATIMA

    Topic:
    Proof by Contradic-
    tion

    Roll no: 17631556-


    011
    .

    .
    PROOF BY:
    EXAMPLE :1
    EXAMPLE:3
    Name : NOOR UL AIN

    Topic: Proof by Induction

    Roll no: 17631556-009


    Proof by induction

    Induction is an axiom which allows us to


    prove that certain properties are true for all
    positive integers (or for all non-negative in-
    tegers, or all integers >= some fixed num-
    ber).
    Principle of induction

    Let A(n) be an assertion concerning the integer n.


    If we want to show that A(n) holds for all positive
    integer n, we can proceed as follows:
    Induction basis: Show that the assertion
    A(1) holds.
    Induction step: For all positive integers n,
    show that A(n) implies A(n+1).
    Standard Example
     For all positive integers n, we have
    A(n) = 1+2+...+n = n(n+1)/2
    o Induction basis: Since 1 = 1(1+1)/2, the asser-
    tion A(1) is true.
    o Induction step: Suppose that A(n) holds.
    =1+2+...+n+(n+1)
    = n(n+1)/2 + n+1
    = (n2+ n+2n+2)/2
    = (n+1)(n+2)/2, hence A(n+1) holds. Therefore, the
    claim follows by induction on n.
    EXAMPLE 2
    Theorem: For all positive integers n, we have
    1+3+5+...+(2n-1) = n2
    Proof. We prove this by induction on n. Let A(n)
    be the assertion of the theorem.
    Induction basis: Since 1 = 12, it follows that
    A(1) holds.
    Induction step: Suppose that A(n) holds.
    Then 1+3+5+...+(2n-1)+(2n+1)
    = n2+2n+1 = (n+1) 2 holds.
    In other words, A(n) implies A(n+1).
    Past Paper:-

    Year 2015 question 6:-


    Show that the following statement
    about an integer n are equivalent.
    P1: n is even.
    P2: n-1 is odd.
    P3: n2 is even.
    ANY QUES-
    TION???

    You might also like