View Single Post
Old 2003-05-28, 06:13   #1
Feb 2003

2016 Posts
Default Faster way to do LLT?

As I understand it, everytime the LLT is done to M(n), computation starts from S(1) mod M(n) up to S(n-1) mod M(n).

Suppose, if the unMODed value of S(n-1) is saved so that it can be used for the next possible candidates and MODed to M(n+k), wouldn't it be faster?

I know that S(n-1) can be extremely large in comparison to M(n), but does using more hard disk space compensate for the time spent in re-computing from S(1)?
1260 is offline   Reply With Quote