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
