Download PDF

Lucas-Lehmer primality test∗
CWoo†
2013-03-21 17:30:23
Theorem: Let p > 2 be a prime, and let Mp be a Mersenne number, then
Mp is prime iff Mp divides sp−1 where the numbers (sn )n≥1 are given by the
following recurrence relation: s1 = 4, and
sn+1 = sn 2 − 2
for n ≥ 1.
∗ hLucasLehmerPrimalityTesti created: h2013-03-21i by: hCWooi version: h35910i Privacy setting: h1i hTheoremi h11A51i
† This text is available under the Creative Commons Attribution/Share-Alike License 3.0.
You can reuse this document or portions thereof only if you do so under terms that are
compatible with the CC-BY-SA license.
1