Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

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?

share|cite|improve this question
up vote 3 down vote accepted

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.

share|cite|improve this answer
Can you give me a brief description of this method? – Voyska Dec 6 '12 at 2:25
I 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. – Gerry Myerson Dec 6 '12 at 2:29
I know I can, I just thought that it would be something deadly complicated and if this was true, I'd need a simplification. – Voyska Dec 6 '12 at 2:30
@Gustavo Take a look at it. It's not complicated at all. – Rick Decker Dec 6 '12 at 2:34
Yep, I'm reading about it. Thanks for your answer. – Voyska Dec 6 '12 at 4:46

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.