Hi,
the Lucas-Lehmer iteration
L_0 = 4
L_{n+1} = L_n ^2 -2
looks suspiciously like an iteration used in Pollard-Rho:
x_0 = a
x_{n+1} = x_n ^2 +b
Can this be used to do a LL test and Pollard-rho factoring attempt at
once?
I remember faintly having read something that b=-2 is not a good choice
for Pollard-rho, but I don't remember any explanation why.. would it
work here?
Ciao,
Alex.
_________________________________________________________________
Unsubscribe & list info -- http://www.scruz.net/~luke/signup.htm
Mersenne Prime FAQ -- http://www.tasam.com/~lrwiman/FAQ-mers
