[107791] in Cypherpunks
CDR: geometric factoring (fwd)
daemon@ATHENA.MIT.EDU (Jim Choate)
Sat Jan 23 21:40:21 1999
From: Jim Choate <ravage@EINSTEIN.ssz.com>
To: cypherpunks@EINSTEIN.ssz.com
Date: Sat, 23 Jan 1999 20:29:10 -0600 (CST)
Reply-To: Jim Choate <ravage@EINSTEIN.ssz.com>
----- Forwarded message from Jim Choate -----
From: Jim Choate <ravage@ssz.com>
Subject: CDR: geometric factoring
Date: Sat, 23 Jan 1999 20:27:18 -0600 (CST)
I've been playing with geometric factoring and observed something of interest.
[blah blah blah]
Geometricaly then we can break a line into n divisions. Then take n-2 lines
of divisions between 2 and n-1. By comparison of the n-1 lines a number is
prime if no smaller divisioned line has all its division markers shared with
n.
[blah blah blah]
----- End of forwarded message from Jim Choate -----
It occurs to me just now that it might be possible to do this with a
Foucalt's Dust algorithm somehow as well.
____________________________________________________________________
What raises the standard of living may well diminish the
quality of life.
The Club of Rome
The Armadillo Group ,::////;::-. James Choate
Austin, Tx /:'///// ``::>/|/ ravage@ssz.com
www.ssz.com .', |||| `/( e\ 512-451-7087
-====~~mm-'`-```-mm --'-
--------------------------------------------------------------------
