A Really Trivial Proof of the Lucas-Lehmer Test
From MaRDI portal
Publication:4695136
DOI10.2307/2324959zbMath0785.11056OpenAlexW4240658927WikidataQ56226592 ScholiaQ56226592MaRDI QIDQ4695136
Publication date: 26 April 1994
Published in: The American Mathematical Monthly (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/2324959
Related Items (8)
A note on primality tests for \(N=h\cdot 2^ n-1\) ⋮ Binomial coefficients, roots of unity and powers of prime numbers ⋮ 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? ⋮ Computers as a novel mathematical reality. III: Mersenne numbers and sums of divisors ⋮ On good initial values for the Lucas-Lehmer sequence ⋮ On a family of sequences related to Chebyshev polynomials ⋮ Unnamed Item
This page was built for publication: A Really Trivial Proof of the Lucas-Lehmer Test