[105711] in Cypherpunks
Re: Goldbach's Conjecture - a question about prime sums of odd numbers
daemon@ATHENA.MIT.EDU (Ray Arachelian)
Thu Nov 19 13:03:46 1998
Date: Thu, 19 Nov 1998 12:49:36 -0500
From: Ray Arachelian <sunder@brainlink.com>
To: Ray Arachelian <sunder@brainlink.com>, cypherpunks@cyberpass.net,
cypherpunks@einstein.ssz.com
Reply-To: Ray Arachelian <sunder@brainlink.com>
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 ==========================
