At 02:57 PM 7/10/99 +1000, Peter Foster wrote:
>Take 2 Mersenne numbers, m1 and m2 (m1 < m2).
>Do the usual LL series, but use as the modulus m1*m2.
>At the appropriate step, check if the remainder is
>divisible by m1.
>
>This allows us to do two (or more) tests for the price
>of one. What is the obvious reason we don't do this?
>
If we had the full numbers of the LL sequence, this would work. However,
in practice those numbers would get too large to work with. They are
reduced mod the number you are working on at each step, and I don't think
there is any easy way to make it work for more than one modulus.
+----------------------------------------------+
| Jud "program first and think later" McCranie |
+----------------------------------------------+
________________________________________________________________
Unsubscribe & list info -- http://www.scruz.net/~luke/signup.htm
