PlanetMath (more info)
 Math for the people, by the people.
Encyclopedia | Requests | Forums | Docs | Wiki | Random | RSS  
Login
create new user
name:
pass:
forget your password?
Main Menu
Owner confidence rating: Very high Entry average rating: High
Lucas-Lehmer primality test (Theorem)

Theorem: Let $ p>2$ be a prime, and let $ M_p$ be a Mersenne number, then $ M_p$ is prime iff $ M_p$ divides $ s_{p-1}$ where the numbers $ (s_n)_{n\geq1}$ are given by the following recurrence relation: $ s_1=4$, and

$\displaystyle s_{n+1}={s_n}^2-2$
for $ n\geq1$.



"Lucas-Lehmer primality test" is owned by CWoo. [ full author list (2) | owner history (1) ]
(view preamble | get metadata)

View style:


Attachments:
examples of the Lucas-Lehmer primality test on small numbers (Example) by PrimeFan
proof of Lucas-Lehmer primality test (Proof) by rm50
Log in to rate this entry.
(view current ratings)

Cross-references: recurrence relation, numbers, divides, iff, Mersenne number, prime
There are 5 references to this entry.

This is version 5 of Lucas-Lehmer primality test, born on 2004-06-11, modified 2008-03-08.
Object id is 5910, canonical name is LucasLhemer.
Accessed 2767 times total.

Classification:
AMS MSC11A51 (Number theory :: Elementary number theory :: Factorization; primality)

Pending Errata and Addenda
None.
[ View all 4 ]
Discussion
Style: Expand: Order:
forum policy

No messages.

Interact
post | correct | update request | prove | add result | add corollary | add example | add (any)