Skip to search formSkip to main contentSkip to account menu

Lucas primality test

Known as: Lucas-Lehmer Test, Lehmer, Lucas Lehmer test 
In computational number theory, the Lucas test is a primality test for a natural number n; it requires that the prime factors of n − 1 be already… 
Wikipedia (opens in a new tab)

Related topics

Related topics

9 relations
Addition-chain exponentiationComputational number theoryExponentiation by squaringFermat primality test

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2020
2020
Mersenne primes and the Lucas-Lehmer test
2018
2018
A Proof of the Lucas-Lehmer Test and its Variations by Using a Singular Cubic Curve
We give another proof of the Lucas-Lehmer test by using a singular cubic curve. We also illustrate a practical way to choose a… 
2011
2011
Parametrized hardware architectures for the Lucas primality test
We present our parametric hardware architecture of the NIST approved Lucas probabilistic primality test. To our knowledge, our… 
2011
2011
Gutachten für Lucas Lenker aus Alu
Gutachten fur Lucas Lenker aus Alu vom Typ 1 mit den Bezeichnungen: Kennzeichnung Lucas-Nr. Modell 0365 MCL 100-106 Superbike… 
2010
2010
CATALAN NUMBERS AND LUCAS QUOTIENTS
Let p be an odd prime and let a,m ∈ Z with a > 0 and p m. In this paper we determine ∑pa−1 k=0 ( 2k k+d ) /mk mod p2 for d = 0, 1… 
2010
2010
GAUSSIAN MERSENNE AND
The Biquadratic Reciprocity Law is used to produce a deterministic primality test for Gaussian Mersenne norms which is analogous… 
2009
2009
Implementing a Fast Lucas-Lehmer Test on Programmable Graphics Hardware
The Lucas-Lehmer test provides a deterministic algorithm for testing whether, for a prime number p, Mp = 2−1 is also a prime… 
2009
2009
Equivalence of Pepin's and the Lucas-Lehmer tests
Pepin's test provides a necessary and sufficient condition for a Fermat number to be prime. The Lucas-Lehmer test does similarly… 
1997
1997
Cognitive Processes in Spreadsheet Comprehension
This research focuses on developing cognitive models of representations and processes of learners in a computer mediated… 
1992
1992
A generalization of proth's theorem
We present a generalization of Proth's theorem for testing certain large integers for primality. The use of Gaus sums leads to a… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)