>I thought we had discussed "S recycling" before and came to the conclusions:
>A: Detecting whether S repeats or not is infeasible, especially if the
>cycling period is even moderately long. You have to spend CPU time to do it,
>and keep lots of storage space handy.
>B: Cycling before the P-1th iteration is unlikely in its own right.
When we discussed this before, those were the main conclusions, (but perhaps
B was an understatment, Chris Nash said that the liklyhood of it repeating
made the probability of finding a mersenne prime quite good) but there
was a possible use for when the S remainders did repeat, that being that
the period of the sequence can be used to derive factors of that number.
Whatever became of this idea? I think someone mentioned that it might be
used to factor M727, did anyone ever do this?
-Lucas Wiman
________________________________________________________________
Unsubscribe & list info -- http://www.scruz.net/~luke/signup.htm
