At 08:11 PM 7/8/99 -0400, Pierre Abbat wrote:
>That is going to be a *lot* slower than FFT convolution, for numbers the size
>of the Mersenne numbers we're testing!
Head's algorithm is for getting x*y mod n when 0<=x,y<n; and n is such that
n<M but n^2>M, where M is the largest integer you can store in a format
native to the computer. I don't think it applies for Mersenne testing, but
it helps a lot with Fermat-type tests (pseudoprimes, etc).
+----------------------------------------------+
| Jud "program first and think later" McCranie |
+----------------------------------------------+
________________________________________________________________
Unsubscribe & list info -- http://www.scruz.net/~luke/signup.htm
