On Sun, 16 May 1999, you wrote:
> all,
> A couple of weeks ago, there was discussion about repeating remainders in
> the LL test. There was general agreement that this would be technically
> unworkable due to the fact that the remainders are so large. Wouldn't it
> be possible to store the last 1024 binary digits of the remainder (saving
> 1024 of these would be only 1MB, not a big deal.) Then we could check for
> repeating remainders in the last 1024 iterations, without signifigantly
> restraining performance. If it actually repeated, it could be confirmed in
> double-checking quite easily.
Once a remainder repeats, does it stay in a loop? If so, you can keep the
remainder when the iteration number is a power of 2, and detect much longer
loops.
phma
________________________________________________________________
Unsubscribe & list info -- http://www.scruz.net/~luke/signup.htm
