[107807] in Cypherpunks

home help back first fref pref prev next nref lref last post

Re: CDR: geometricl factoring via oscillators - a

daemon@ATHENA.MIT.EDU (Bill Stewart)
Sun Jan 24 17:07:36 1999

Date: Sun, 24 Jan 1999 13:54:46 -0800
To: Jim Choate <ravage@einstein.ssz.com>, cypherpunks@einstein.ssz.com
From: Bill Stewart <bill.stewart@pobox.com>
In-Reply-To: <199901240236.UAA03627@einstein.ssz.com>
Reply-To: Bill Stewart <bill.stewart@pobox.com>

At 08:36 PM 1/23/99 -0600, Jim Choate wrote:
>I've also just simplified the oscillator model. We don't need n-2
>oscillators. We only need oscillators for the primes known to be 
>less than n.

Try comparing this method with the Sieve of Eratoshthenes ....


				Thanks! 
					Bill
Bill Stewart, bill.stewart@pobox.com
PGP Fingerprint D454 E202 CBC8 40BF  3C85 B884 0ABE 4639


home help back first fref pref prev next nref lref last post