another random idea
if S is the generic term of the LL sequence and M is the Mersenne number to be tested, when S is bigger than 2^(n1) it is possible to replace it by MS, so reducing the size of the numer to be squared.(this is equivalent to using the simmetrical definition of modulus and ignoring the negative sign, since we have to square it) Can this result in speedingup the test, or it is something already considered ?
ppo
