From: Petro <petro@playboy.com>
To: Jim Choate <cypherpunks@einstein.ssz.com (Cypherpunks Distributed Remailer)
Message Hash: 682fc1ed1e12d2437090959a747230875c957831063aec3147833c03cd737a10
Message ID: <v04011750b279e6916c78@[206.189.103.230]>
Reply To: <199811190522.XAA01164@einstein.ssz.com>
UTC Datetime: 1998-11-19 17:06:55 UTC
Raw Date: Fri, 20 Nov 1998 01:06:55 +0800
From: Petro <petro@playboy.com>
Date: Fri, 20 Nov 1998 01:06:55 +0800
To: Jim Choate <cypherpunks@einstein.ssz.com (Cypherpunks Distributed Remailer)
Subject: Re: Goldbach's Conjecture - a question about prime sums of oddnumbers...
In-Reply-To: <199811190522.XAA01164@einstein.ssz.com>
Message-ID: <v04011750b279e6916c78@[206.189.103.230]>
MIME-Version: 1.0
Content-Type: text/plain
At 12:22 AM -0500 11/19/98, Jim Choate wrote:
>Hi,
>
>I have a question related to Goldbach's Conjecture:
>
>All even numbers greater than two can be represented as the sum of primes.
>
>Is there any work on whether odd numbers can always be represented as the
>sum of primes? This of course implies that the number of prime members
>must be odd and must exclude 1 (unless you can have more than a single
>instance of a given prime). Has this been examined?
>
>I'm assuming, since I can't find it explicitly stated anywhere, that
>Goldbachs Conjecture allows those prime factors to occur in multiple
>instances.
>
>I've pawed through my number theory books and can't find anything relating
>to this as regards odd numbers.
Well, since all primes over 2 are odd, and the sum of two odd
numbers is always even, there goes that theory.
Unless they changed the rules on primes since I last checked.
--
"To sum up: The entire structure of antitrust statutes in this country is a
jumble of economic irrationality and ignorance. It is a product: (a) of a
gross misinterpretation of history, and (b) of rather nave, and certainly
unrealistic, economic theories." Alan Greenspan, "Anti-trust"
http://www.ecosystems.net/mgering/antitrust.html
Petro::E-Commerce Adminstrator::Playboy Ent. Inc.::petro@playboy.com
Return to November 1998
Return to “Ray Arachelian <sunder@brainlink.com>”