I'm watching this, he says that David Slowinski discovered the biggest prime in 1984: $2^{132,049}$-1 and that it took 1 week on a Cray supercomputer: using some shortcut and that the absence of this shortcut would make the process last the age of the universe. What's this shortcut?
What is this shortcut to determine primality?
3
$\begingroup$
number-theory
prime-numbers
primality-test
1 Answers
3
Numbers of the form $2^n-1$ can be tested by the Lucas-Lehmer method, which is not available for numbers not of that form.
-
0Can you give me a brief description of this method? – 2012-12-06
-
0I have edited in a link to the description at Wikipedia, but you could just type $$\rm Lucas\ Lehmer$$ into the internet and take your pick of places to look. – 2012-12-06
-
0I know I can, I just thought that it would be something deadly complicated and if this was true, I'd need a simplification. – 2012-12-06
-
0@Gustavo Take a look at it. It's not complicated at all. – 2012-12-06
-
0Yep, I'm reading about it. Thanks for your answer. – 2012-12-06