Hello. how can I use the lucas Lehmer test to see if a Mersenne number is prime? there is an algorithm ready so having only enter the number to be verified?
certainly is a big help!
if I post a Mersenne number in PrimeQ (or ProvablePrimeQ) Mathematica uses the test lucas Lehmer to give me the result?is that so?
That would be great.
I'm not sure if this helps directly, but the Lucas-Lehmer test is used in the Mathematica function PrimeQ.