Lehmer's GCD algorithm
id:
lehmer-s-gcd-algorithm-198-18052820
title:
Lehmer's GCD algorithm
text:
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.
brand slug:
wiki
category slug:
encyclopedia
description:
Fast greatest common divisor algorithm
original url:
https://en.wikipedia.org/wiki/Lehmer%27s_GCD_algorithm
date created:
date modified:
2020-01-11T18:19:52Z
main entity:
{"identifier":"Q6518927","url":"https://www.wikidata.org/entity/Q6518927"}
image:
fields total:
13
integrity:
14