Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 227,633,603 papers from all fields of science
Search
Sign In
Create Free Account
Lehmer's GCD algorithm
Known as:
Lehmer
, Lehmer GCD algorithm
, Lehmer's algorithm
Lehmer's GCD algorithm, named after Derrick Henry Lehmer, is a fast GCD algorithm, an improvement on the simpler but slower Euclidean algorithm. It…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
2 relations
Algorithm
Euclidean algorithm
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
Lehmer's GCD algorithm
M. Kolar
2015
Corpus ID: 126238036
In this thesis we briefly look at the rules related to the greatest common divisor and the lowest common multiple of two integers…
Expand
1998
1998
A Greatest Common Divisor Algorithm
A. Belenkiy
,
R. Vidunas
International journal of algebra and computation
1998
Corpus ID: 28120643
Algorithms of computation of the Greatest Common Divisor (GCD) of two integers play a principal role in all computational systems…
Expand
1992
1992
Computation of mersenne primes using cray X-MP
M. Haghighi
International Journal of Computational…
1992
Corpus ID: 123462574
At first a definition of Mersenne Prime numbers are given. Then we will introduce Lucas-Lehmer's algorithm for primality testing…
Expand
1989
1989
ACM forum
Robert L. Ashenhurst
CACM
1989
Corpus ID: 33984796
on random number generators in the Octo-ber 1988 issue (" Random Number Generators: Good Ones are Hard to Find, " pp. 1192-1201…
Expand
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)
ACCEPT & CONTINUE