FRESH

Hacker News

The Lucas-Lehmer Prime Number Test

96 points by beardyw

by jmount

0 subcomment

The original Agrawal, Kayal, Saxena "Primes is in P" paper is actually an amazing effort in clarity https://annals.math.princeton.edu/wp-content/uploads/annals-... .

by oliviersca

0 subcomment

For those who enjoy burning cpu cycles ! m1277 = 2 ^ 1277 - 1 is not prime. It easy to check it with the Lucas-Lehmer test. But we don't know any of its divisors, which is quite fascinating.

by roflchoppa

1 subcomments

The Lehmers are cool people… Ron’s got a train spotting site.
http://calcoastrails.com/

by 30030

0 subcomment

That's easy.
(factorial(170,141,183,460,469,231,731,687,303,715,884,105,726) + 1)%(170,141,183,460,469,231,731,687,303,715,884,105,727) == 0

by IsTom

12 subcomments

My favourite prime checking algorithm is that for n < 100 if it looks prime, it is prime.

by John-Tony

0 subcomment

by Nevermark

2 subcomments

Just grab some paper, a pen, and check that no number equal or smaller than its square root divides into it evenly.
That is it. That is all. Pish posh.

by NetMageSCW

1 subcomments

by politelemon

4 subcomments