Scribd Logo
Upload

Welcome to Scribd!

  • 78 views

    Methods of Proof: Direct, Indirect, Proof by Contrapositive, Proof by Mathematical Induction)

    Uploaded by

    Johnmeri Dale Genodiala Baldo
    1. There are four main methods of proof: direct proof, indirect proof (proof by contradiction), proof by contrapositive, and proof by mathematical induction. 2. Indirect proof involves assuming the opposite of what you want to prove and showing that this leads to a contradiction. Proof by contrapositive proves the contrapositive statement instead of the original statement. 3. Proof by mathematical induction involves proving a statement is true for a base case, and then using the assumption that it is true for some integer k to prove it is true for k+1. This establishes the statement is true for all integers.

    Copyright:

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

    Methods of Proof: Direct, Indirect, Proof by Contrapositive, Proof by Mathematical Induction)

    Uploaded by

    Johnmeri Dale Genodiala Baldo
    78 views12 pages
    1. There are four main methods of proof: direct proof, indirect proof (proof by contradiction), proof by contrapositive, and proof by mathematical induction. 2. Indirect proof involves assuming the opposite of what you want to prove and showing that this leads to a contradiction. Proof by contrapositive proves the contrapositive statement instead of the original statement. 3. Proof by mathematical induction involves proving a statement is true for a base case, and then using the assumption that it is true for some integer k to prove it is true for k+1. This establishes the statement is true for all integers.

    Original Title

    Untitled

    Copyright

    © © All Rights Reserved

    Available Formats

    PPTX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    1. There are four main methods of proof: direct proof, indirect proof (proof by contradiction), proof by contrapositive, and proof by mathematical induction. 2. Indirect proof involves assuming the opposite of what you want to prove and showing that this leads to a contradiction. Proof by contrapositive proves the contrapositive statement instead of the original statement. 3. Proof by mathematical induction involves proving a statement is true for a base case, and then using the assumption that it is true for some integer k to prove it is true for k+1. This establishes the statement is true for all integers.

    Copyright:

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

    Methods of Proof: Direct, Indirect, Proof by Contrapositive, Proof by Mathematical Induction)

    Uploaded by

    Johnmeri Dale Genodiala Baldo
    1. There are four main methods of proof: direct proof, indirect proof (proof by contradiction), proof by contrapositive, and proof by mathematical induction. 2. Indirect proof involves assuming the opposite of what you want to prove and showing that this leads to a contradiction. Proof by contrapositive proves the contrapositive statement instead of the original statement. 3. Proof by mathematical induction involves proving a statement is true for a base case, and then using the assumption that it is true for some integer k to prove it is true for k+1. This establishes the statement is true for all integers.

    Copyright:

    © All Rights Reserved
    Download as PPTX, PDF, TXT or read online from Scribd
    Download as pptx, pdf, or txt
    of 12

    METHODS OF PROOF

    DIRECT, INDIRECT, PROOF BY CONTRAPOSITIVE, PROOF BY MATHEMATICAL


    INDUCTION)
     Procedure:
    : Assume P is false. That means,
    INDIRECT PROOF OR
    PROOF BY assume p and not q
    CONTRADICTION : contradicts the supposition.
    1.
    such that is even and x is odd. If x is odd, then x
    INDIRECT PROOF OR = 2k + 1,for some kThus,
    PROOF BY
    CONTRADICTION =
    = + 4k + 1
    = 2(2 + 1, for some 2
    Hence, is odd which contradicts our assumption
    that is even. Therefore,
    2. Prove: (A – B)
    INDIRECT PROOF OR
    PROOF BY
    CONTRADICTION Proof: Assume (A – B)
    and . Furthermore, and B from our assumption that . Thus,
    it contradicts our assumption that . Therefore, (A – B)
    Procedure:
    : Assume is true

    PROOF BY : Prove that is also true


    CONTRAPOSITIVE
    : Therefore,
    Recall:
    Application:

    1. Prove: If is odd, then x is odd.


    Proof:

    PROOF BY Assume x is even to show that is even. Then,


    CONTRAPOSITIVE
    X = 2k, for some k . Then

    =
    = 2(2), for some 2 .
    Thus, is even by definition. Therefore, if is odd,
    then x is odd
    Application:

    2. Prove: If A
    PROOF BY Proof: Assume A B’.
    CONTRAPOSITIVE
    To show: A
    Then A such that x B’. Also, if x B’ it implies that
    B. Hence, A . Thus,
    A . Therefore, if A
    Is used when the statement involves the set of
    positive integers n = 1, 2, …

    PROOF BY Steps:
    MATHEMATICAL
    INDUCTION 1. Verify for the few values of n.
    2. assume that it is true for n = k to show for
    the truthfulness of the statement for n = k + 1.
    3. Conclusion: By PMI, the statement is true for
    all n.
    Application:
    Prove:
    1. The sum of the first n positive consecutive integers is .
    .
    PROOF BY Proof:
    MATHEMATICAL
    INDUCTION i) Verify when n = 1: 1 = 1(1 + 1)/2
    1=1
    ii) Assume that = is true for n = k. That is
    1 + 2 + 3 + … + k = k(k + 1)/2
    To show: 1 + 2 + 3 + … + (k + 1) =
    .
    Application:
    Proof:
    1+2+3+…+k=

    PROOF BY 1 + 2 + 3 + … + k + (k + 1) = + (k + 1)
    MATHEMATICAL =
    INDUCTION
    =
    iii)Therefore, by PMI, The sum of the first n positive
    consecutive integers is

    .
    Application:
    2. Prove that
    Proof:
    i) Verify when n = 1:
    when n = 2: is divisible by 3? Yes
    ii) Assume that is divisible by 3 when n = k is true.
    PROOF BY
    To show: is divisible by 3 when n = k + 1.
    MATHEMATICAL
    INDUCTION Proof: = ( – (k + 1)
    = – k - 1)
    = ( - k) + (3 + 3k) + 1 – 1
    = ( - k) + 3( + k) + 1 – 1.
    From our assumption, is divisible by 3 . Then 3( + k) is clearly divisible by
    3, and the last expression 1 – 1 is also divisible by 3.
    iii) Therefore, by PMI,
     Prove each of the following problems:
    1. ,

    ACTIVITY 2. If A
    (TO BE DONE 3. is divisible by 4, .
    BY GROUP) 4. is irrational number.
    5. If x + y is odd, then x and y are both
    even.

    You might also like