Uhh, yeah, I've got a 2^32 one, too and I can *make* any arbitrary part of a
2^64 one fairly quickly. :)
> ----------
> From: Jud McCranie[SMTP:[EMAIL PROTECTED]]
> Sent: Wednesday, June 23, 1999 9:19 AM
> To: Brian J. Beesley
> Cc: [EMAIL PROTECTED]; [EMAIL PROTECTED]
> Subject: Re: Mersenne: Testing for factors
>
> At 06:17 AM 6/23/99 +0100, Brian J. Beesley wrote:
> > Checking whether f is _really_ prime is going to take a lot
> >longer than that, unless you have a 2^63 bit lookup table lying about
> >somewhere in RAM ;-)
>
> I've got one for up to 2^32. That really helps on some things.
>
> +----------------------------------------------+
> | Jud "program first and think later" McCranie |
> +----------------------------------------------+
>
>
> ________________________________________________________________
> Unsubscribe & list info -- http://www.scruz.net/~luke/signup.htm
>
________________________________________________________________
Unsubscribe & list info -- http://www.scruz.net/~luke/signup.htm
