A Proof of the Lucas-Lehmer Test

DOI10.2307/2322904zbMath0669.10015OpenAlexW1972938820MaRDI QIDQ3822229

Michael I. Rosen

Publication date: 1988

Published in: The American Mathematical Monthly (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2322904

zbMATH Keywords

Mersenne numbersprimality testLucas-Lehmer test

Mathematics Subject Classification ID

Factorization; primality (11A51) Primality (11Y11)

Related Items (9)

A note on primality tests for \(N=h\cdot 2^ n-1\) ⋮ On a new improved unifying closed formula for all Fibonacci-type sequences and some applications ⋮ Could, or should, the ancient Greeks have discovered the Lucas-Lehmer test? ⋮ Primality test for numbers \(M\) with a large power of 5 dividing \(M^{4}-1\). ⋮ Computers as a novel mathematical reality. III: Mersenne numbers and sums of divisors ⋮ An elliptic curve test for Mersenne primes ⋮ On good initial values for the Lucas-Lehmer sequence ⋮ Unnamed Item ⋮ Primality testing through algebraic groups

This page was built for publication: A Proof of the Lucas-Lehmer Test