A Really Trivial Proof of the Lucas-Lehmer Test
From MaRDI portal
Publication:4695136
DOI10.2307/2324959zbMATH Open0785.11056OpenAlexW4240658927WikidataQ56226592 ScholiaQ56226592MaRDI QIDQ4695136FDOQ4695136
Authors: James William Bruce 
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
Cited In (10)
- A note on primality tests for \(N=h\cdot 2^ n-1\)
- Binomial coefficients, roots of unity and powers of prime numbers
- 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
- A proof of the Lucas-Lehmer test and its variations by using a singular cubic curve
- Title not available (Why is that?)
- On a new improved unifying closed formula for all Fibonacci-type sequences and some applications
- On a family of sequences related to Chebyshev polynomials
- Title not available (Why is that?)
This page was built for publication: A Really Trivial Proof of the Lucas-Lehmer Test
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4695136)
