lucas-lehmer ( p -- ? )
Lucas-Lehmer Mersenne Primality test

Vocabulary
math.primes.lucas-lehmer

Inputs

p	a prime number

Outputs

?

a boolean

Word description
Runs the Lucas-Lehmer test on the prime p and returns t if (2 ^ p) - 1 is prime.

Examples

! Test that (2 ^ 61) - 1 is prime: USING: math.primes.lucas-lehmer prettyprint ; 61 lucas-lehmer .
t

Definition

USING: combinators kernel math.primes
math.primes.lucas-lehmer.private ;

IN: math.primes.lucas-lehmer

: lucas-lehmer ( p -- ? )
    lucas-lehmer-guard {
        { [ dup 2 = ] [ drop t ] }
        { [ dup prime? ] [ do-lucas-lehmer ] }
        [ drop f ]
    } cond ;