Re: JSH: Nearly done

litsohate_at_hotmail.com
Date: 01/27/05 

Date: 27 Jan 2005 12:37:17 -0800

jstevh@msn.com wrote:

> I'm focusing on building a full method that relies only on my work,
so
> it has to call itself recursively to factor, and such a method can
> potentially chew through even an RSA challenge type number in
minutes.

Have you figured out why your program thinks even relatively small
composite numbers like 3001679 are prime?

Is it because such numbers have no factors among the program's
hard-coded list of primes?