Scribd Logo
Upload

Welcome to Scribd!

  • Test Flight 4 Steven Dik

    Uploaded by

    Stevieray Driver
    31 views1 page
    Every odd natural number can be expressed as either 4n + 1 or 4n + 3, where n is an integer. This is proven by contradiction. It assumes there exists an odd number m that cannot be expressed in one of these forms. Through a series of logical steps, it derives that the integer p in m=2p+1 cannot exist, since it is neither even nor odd. This is a contradiction, so the original theorem that every odd number can be expressed as 4n + 1 or 4n + 3 must be true.

    Original Description:

    Keith Devlin Test Flight 4 by Steven Dik

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    Every odd natural number can be expressed as either 4n + 1 or 4n + 3, where n is an integer. This is proven by contradiction. It assumes there exists an odd number m that cannot be expressed in one of these forms. Through a series of logical steps, it derives that the integer p in m=2p+1 cannot exist, since it is neither even nor odd. This is a contradiction, so the original theorem that every odd number can be expressed as 4n + 1 or 4n + 3 must be true.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    31 views1 page

    Test Flight 4 Steven Dik

    Uploaded by

    Stevieray Driver
    Every odd natural number can be expressed as either 4n + 1 or 4n + 3, where n is an integer. This is proven by contradiction. It assumes there exists an odd number m that cannot be expressed in one of these forms. Through a series of logical steps, it derives that the integer p in m=2p+1 cannot exist, since it is neither even nor odd. This is a contradiction, so the original theorem that every odd number can be expressed as 4n + 1 or 4n + 3 must be true.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    of 1

    KEITH DEVLIN: Introduction to Mathematical Thinking Test Flight Problem Set

    4. Prove that every odd natural number is of one of the forms 4n + 1 or 4n + 3, where n is an
    integer.
    Theorem:
    ( )( = 2 + 1)( )( = 4 + 1 = 4 + 3)

    Proof (by contradiction)

    Say
    ( )( = 2 + 1)( )( 4 + 1 4 + 3)
    then
    4 + 1
    2 + 1 4 + 1
    2 4
    2

    And
    4 + 3
    2 + 1 4 + 3
    2 4 + 2
    2 + 1

    But if p is not even and p is not odd, then p doesnt exist. Contradiction.

    Therefore the original theorem must be true

    Q.E.D

    You might also like