Lehmer's GCD 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 is mainly used for big integers that have a representation as a string of digits relative to some chosen numeral system base, say β = 1000 or β = 232.
known for
Wikipage disambiguates
Wikipage redirect
primaryTopic
Lehmer's GCD 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 is mainly used for big integers that have a representation as a string of digits relative to some chosen numeral system base, say β = 1000 or β = 232.
has abstract
Lehmer's GCD algorithm, named ...... base, say β = 1000 or β = 232.
@en
Link from a Wikipage to an external page
Wikipage page ID
Wikipage revision ID
724,026,478
subject
comment
Lehmer's GCD algorithm, named ...... base, say β = 1000 or β = 232.
@en
label
Lehmer's GCD algorithm
@en