What is the fastest way to check if this number is a prime number ?

$\displaystyle MM_{31}=2^{2^{31}-1}-1$

Printable View

- Dec 8th 2011, 08:21 AMprincepsThe fastest way to test primality of the number ?
What is the fastest way to check if this number is a prime number ?

$\displaystyle MM_{31}=2^{2^{31}-1}-1$ - Dec 8th 2011, 06:02 PMwsldamRe: The fastest way to test primality of the number ?
I would probably use the Lucas-Lehmer primality test, but even with that you have to run the trial 2,147,483,645 times. That being said this number has been shown to have at least four factors.

- Dec 8th 2011, 10:03 PMprincepsRe: The fastest way to test primality of the number ?
- Dec 9th 2011, 08:43 AMwsldamRe: The fastest way to test primality of the number ?
This is what I read... he used his own sieving program

https://listserv.nodak.edu/cgi-bin/w...0&F=&S=&P=2514 - Dec 9th 2011, 09:00 AMprincepsRe: The fastest way to test primality of the number ?
Thanks..I have found this one : Mfaktc