Scribd Logo
Upload

Welcome to Scribd!

  • 3 views

    Proof by Contradiction

    Uploaded by

    Kim Nicole Vargas
    Ppt proof by contradiction

    Copyright:

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

    Proof by Contradiction

    Uploaded by

    Kim Nicole Vargas
    3 views25 pages
    Ppt proof by contradiction

    Original Title

    Proof_by_Contradiction

    Copyright

    © © All Rights Reserved

    Available Formats

    PPTX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Ppt proof by contradiction

    Copyright:

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

    Proof by Contradiction

    Uploaded by

    Kim Nicole Vargas
    Ppt proof by contradiction

    Copyright:

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

    Indirect Proof

    (PROOF BY
    CONTRADICTION)

    Presentation by:
    VARGAS, KIM NICOLE
    Indirect Proof/Proof by
    Contradiction
    A contradiction is where one
    statement is the opposite of
    another.

    A proof by contradiction is also


    known as "reductio ad absurdum"
    which is the Latin phrase for
    reducing something to an absurd
    Indirect Proof/Proof by
    Contradiction
    In this method of proof, we assume
    that a proposition is not true then
    through that premise and logic, we
    find a contradiction that shows our
    original premise must have been
    incorrect. Therefore the preposition
    was true.
    Indirect Proof/Proof by
    Contradiction
    • For one proposition, p, assume
    ¬p is true, then find a
    contradiction that shows ¬p is
    false, so p is true.
    • For an implication, p->q ,
    assume p and ¬q are true, then
    find a contradiction that shows
    either p->q or ¬q -> ¬p
    How to write a Proof by Contradiction

    Step 1: In the first step, we will assume the opposite of the


    conclusion to be true.

    Step 2: As long as the assumption is opposite of our premises, we


    just begin the use of assumptions to derive new consequences.

    Step 3: In the last step, we will conclude that our assumption is


    false and it is the opposite of our assumption, which means our
    original conclusion is true.
    EXAMPLE 1:

    Give a proof by contradiction


    for the statement that √2 is
    irrational.
    EXAMPLE 1:
    Assume that √2 is rational.
    Then integers a and b exist so that √2=
    a/b.

    Without loss of generality, we can assume


    that a and b have no factors in common
    (i.e. the fraction is in simplest form).
    EXAMPLE 1:
    Multiplying both sides by b² and squaring,
    we have:
    2b² = a²
    So we can see that a² is even. This means
    that a is even ( how would you prove this?),
    so a=2m for some m ∈ ℤ. Then 2b² = a²=
    (2m)² = 4m²
    EXAMPLE 1:
    Now divide by 2, we have b²= 2m², so b² is
    even. This means that b=2n for some n ∈ Z.

    We can see that if √2= a/b , then both a and


    b must be even so are both multiples of 2.
    EXAMPLE 1:
    This contradicts the fact that we know a and
    b can be chosen to have no common factors.

    ∴ √2 is not rational, so √2 must be irrational.


    EXAMPLE 2:
    Euclid’s Proof for Infinite
    Prime
    Statement: There is an infinite
    number of prime numbers.
    EXAMPLE 2:

    Assume that there is a finite number of


    prime numbers.
    We can write this as:
    p1, p2, p3,...pn.
    EXAMPLE 2:

    Let x be the product of all


    prime numbers:
    x= p1 x p2 x p3 x,... x pn + 1
    EXAMPLE 2:

    Let say for example those


    primes are 2,3,5,7 + 1.
    x= 211 prime?

    divisible by some other


    prime?
    EXAMPLE 2:

    ∴ x is a prime itself or divisible


    by a prime that is not in the
    list.
    ∴The assumption must be false
    as the list is not complete.
    EXAMPLE 3:

    Prove by contradiction that,


    “If n is an integer and n² is
    odd, then n is odd.”
    EXAMPLE 3:

    Proof: Assume that n is an even


    integer.
    If n is even then it can be
    expressed as n=2k for some
    integer k.
    EXAMPLE 3:
    Substitute n= 2k into n²:
    n²= (2k)²
    = 4k²
    Since n² is odd by assumption, 4k²
    must be odd as well.
    EXAMPLE 3:

    However, an even number


    multiplied by any integer yields an
    even result.
    Since 4k² is even, this contradicts
    the assumption that n² is odd.
    EXAMPLE 3:

    Therefore, the assumption is false


    and, if n is an integer and n² is
    odd, then n must be odd.
    EXAMPLE 4:

    Theorem 2: If n is odd, then


    there are no integers j and k
    such that n= 4j-1 = 4k+1.
    EXAMPLE 4:

    PROOF:
    Assume that 4j-1 = 4k+1 for
    some integers j and k.
    EXAMPLE 4:
    PROOF:
    Then, 4j-1 = 4k+1
    4j -4k = 1+1
    4j- 4k = 2, so 2j – 2k = 1
    2( j-k) = 1
    EXAMPLE 4:
    PROOF:
    We have: 2( j-k) = 1
    The left side of this last equation
    is an even integer, while the right
    side is an odd integer, an
    impossibility.
    Thank You
    For Your Attention

    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