cryptoanarchy.wiki

Arise, you have nothing to lose but your barbed wire fences!

1998-11-23 - Re: [spam 03.92/10.00 -pobox] Re: Goldbach’s Conjecture - a question about prime sums of odd numbers…

Header Data

From: Bill Stewart <bill.stewart@pobox.com>
To: cypherpunks@cyberpass.net
Message Hash: 2546ad4d9f08bc92a9ea16a1382b3105f8d5f3f58ef57d989c0bce01dd250de6
Message ID: <3.0.5.32.19981123012140.00bab940@idiom.com>
Reply To: <199811190522.XAA01164@einstein.ssz.com>
UTC Datetime: 1998-11-23 06:47:33 UTC
Raw Date: Mon, 23 Nov 1998 14:47:33 +0800

Raw message

From: Bill Stewart <bill.stewart@pobox.com>
Date: Mon, 23 Nov 1998 14:47:33 +0800
To: cypherpunks@cyberpass.net
Subject: Re: [spam 03.92/10.00 -pobox] Re: Goldbach's Conjecture - a question about prime sums of odd numbers...
In-Reply-To: <199811190522.XAA01164@einstein.ssz.com>
Message-ID: <3.0.5.32.19981123012140.00bab940@idiom.com>
MIME-Version: 1.0
Content-Type: text/plain



At 12:20 AM 11/19/98 -0600, Eric Cordian wrote:
>> Is there any work on whether odd numbers can always be represented as the
>> sum of primes? 
>
>Goldbach originally suggested that all numbers greater than two could be
>expressed as the sum of three primes, if one tossed in 1 as a prime
>number.  Euler pointed out that this was equivalent to even numbers
>greater than two being expressed as the sum of two primes. 
>
>This seemed a somewhat cleaner formulation, and it was adopted.

well, you can express any odd number >= 7 as
the sum of 3 + an even number, so if Goldbach's conjecture is true,
then three primes are enough for the odd natural numbers
except 1, which is a special case, and 3 and 5 which are prime anyway.
				Thanks! 
					Bill
Bill Stewart, bill.stewart@pobox.com
PGP Fingerprint D454 E202 CBC8 40BF  3C85 B884 0ABE 4639

Thread