2009/11/15 William Stein
>
> On Sat, Nov 14, 2009 at 4:31 PM, gerrob wrote:
> >
> > I've uploaded a new code on google group. It is using remainder tree
> > to speedup the sieving, and now it is sieving up to about log2(n)^2.
> > It means a speedup by a factor of two for large "random" input (he
On Sat, Nov 14, 2009 at 4:31 PM, gerrob wrote:
>
> I've uploaded a new code on google group. It is using remainder tree
> to speedup the sieving, and now it is sieving up to about log2(n)^2.
> It means a speedup by a factor of two for large "random" input (here
> random means that nextprime(n) is
