Quote:
Originally Posted by CRGreathouse
Code:
> Mod(2,13)^1099473911
%1 = Mod(10, 13)
Sorry, try again next time. You might want to read up on the special form of Mersenne divisors.

Why when I multiply 13 after I divide it by 13 the result = 2^1099473911 so what you are saying is I should go the full distance on the Lucas Lemer test and their is still hope. This is strange I have not stopped the processing the number yet.