Loading ...
Sorry, an error occurred while loading the content.

Goldbach parody

Expand Messages
  • Kermit Rose
    Every odd integer 11 is the sum of two composite integers. Proof. Let z be an odd integer 11. z - 9 is an even integer 2. z - 9 is divisible by 2, with
    Message 1 of 2 , Oct 17, 2009
    • 0 Attachment
      Every odd integer > 11 is the sum of two composite integers.

      Proof.

      Let z be an odd integer > 11.

      z - 9 is an even integer > 2.
      z - 9 is divisible by 2, with quotient > 1.
      z - 9 is composite.
      9 = 3 * 3 is composite.

      z = 9 + (z - 9) is the sum of two composite integers.
    • Lio David
      if you mean (the saum of two composite integers) yours prof  is correct  but problem too easy to solve does not need the prof   you remplace 9 by any
      Message 2 of 2 , Oct 19, 2009
      • 0 Attachment
        if you mean (the saum of two composite integers) yours prof  is correct  but problem too easy to solve
        does not need the prof
         
        you remplace 9 by any composite integer

        23 = 15 + (23-15)
         
         but i think the real probelem  is with     ( the sum of  two prime numbre)

        rachid


        ________________________________
        From: Kermit Rose <kermit@...>
        To: primenumbers@yahoogroups.com
        Sent: Sun, October 18, 2009 1:44:24 AM
        Subject: [PrimeNumbers] Goldbach parody

         
        Every odd integer > 11 is the sum of two composite integers.

        Proof.

        Let z be an odd integer > 11.

        z - 9 is an even integer > 2.
        z - 9 is divisible by 2, with quotient > 1.
        z - 9 is composite.
        9 = 3 * 3 is composite.

        z = 9 + (z - 9) is the sum of two composite integers.








        [Non-text portions of this message have been removed]
      Your message has been successfully submitted and would be delivered to recipients shortly.