On Nov 18, 7:53 am, jzakiya <[EMAIL PROTECTED]> wrote: > www.4shared.com/account/dir/7467736/97bd7b71/sharing
>From the introduction to the paper: "Thus began a process that culminated in my developing a new class of Number Theory Sieves (NTS) to generate prime numbers, and test primality of numbers, that use minimum memory, are simple to code, and are much faster than all previously known methods." That's quite a claim! You might consider toning this down a little if you want to be taken seriously. :-) How does your prime-generating algorithm stack up against Bernstein's primegen package? http://cr.yp.to/primegen.html Mark -- http://mail.python.org/mailman/listinfo/python-list
