From: Ray Arachelian <sunder@brainlink.com>
Date: Fri, 20 Nov 1998 02:16:43 +0800
To: Ray Arachelian <cypherpunks@einstein.ssz.com
Subject: Re: Goldbach's Conjecture - a question about prime sums of odd numbers (fwd)
In-Reply-To: <199811191722.LAA04172@einstein.ssz.com>
Message-ID: <36545A30.EFE1ABCF@brainlink.com>
MIME-Version: 1.0
Content-Type: text/plain



Ray Arachelian wrote:

> Actually the issue is 1=1*1, 1=1*1*1 ... 1=1^n.  If 1 is prime, then -1 must
> be prime since -1=1^n where n is odd and 1=1^n where any n is used.  The fact
> that 1 can be factored from itself recursively is the issue.

Duh! I must not have had enough caffeine this morning.  Above should 
say -1=-1^n where N is odd.
 

-- 

=====================================Kaos=Keraunos=Kybernetos==============
.+.^.+.|       Sunder       |Prying open my 3rd eye.  So good to see |./|\.
..\|/..|sunder@sundernet.com|you once again. I thought you were      |/\|/\
<--*-->| ------------------ |hiding, and you thought that I had run  |\/|\/
../|\..| "A toast to Odin,  |away chasing the tail of dogma. I opened|.\|/.
.+.v.+.|God of screwdrivers"|my eye and there we were....            |.....
======================= http://www.sundernet.com ==========================