Skip to search formSkip to main contentSkip to account menu

Lucas–Lehmer primality test

Known as: Lucas-Lehmer test for Mersene primes, Test for primality of Mersenne numbers, Lucas-Lehmer primality test 
In mathematics, the Lucas–Lehmer test (LLT) is a primality test for Mersenne numbers. The test was originally developed by Édouard Lucas in 1856 and… 
Wikipedia (opens in a new tab)

Related topics

Related topics

17 relations
AKS primality testFast Fourier transformFürer's algorithmGreat Internet Mersenne Prime Search

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
Social Distance metric: from coordinates to neighborhoods
ABSTRACT Choice of a distance metric is a key for the success in many machine learning and data processing tasks. The distance… 
2014
2014
HUNTINGTON'S DISEASE AS A TAUOPATHY
  • 2014
  • Corpus ID: 86894569
Tauopathies are a group of neurodegenerative diseases such as Alzheimer’s disease (AD), progressive supranuclear palsy (PSP… 
2013
2013
The digamma function, Euler–Lehmer constants and their $p$-adic counterparts
1n+x−1n,where γis Euler’s constant. Just like the case of the gamma function, thenature of the values of the digamma function at… 
Highly Cited
2012
Highly Cited
2012
Inequalities between Arithmetic-Geometric, Gini, and Toader Means
We find the greatest values , and least values , such that the double inequalities and hold for all with and present some new… 
2008
2008
Between Memory and Materiality: An Archaeological Approach to Studying the Nazi Concentration Camps
Abstract By its very nature, historical narrative that is rooted exclusively in textual sources is destined to be more linear… 
2006
2006
A Lucas-Lehmer primality test for the numbers
Highly Cited
2005
Highly Cited
2005
Being a Good Teacher of Black Students? White Teachers and Unintentional Racism
Abstract This ethnographic study describes the roles adopted by four White teachers in the United States during and after they… 
1997
1997
The Rabin-Monier theorem for Lucas pseudoprimes
We give bounds on the number of pairs (P, Q) with 0 ≤ P, Q < n such that a composite number n is a strong Lucas pseudoprime with… 
1984
1984
A simple proof of the Lucas-Lehmer primality test
1946
1946
The Lucas Auk Appears Again
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)