hi,

a short, maybe silly question:

i know how the LucasLehmer test works for Mersennes (S(n+1)=S(n)^2-2 mod 2^n-1, S(1)=4 etc. ).

But how it works for a general numbers like a*b^n-1?

Or the algorithm used in PRP3.exe isn't related to LL-tests? If it isn't, may i kindly ask for a short explanation or a link to such?

J. HOlmes