Lehmer's GCD algorithm
Lehmer's GCD algorithm is a Fast Greatest Common Divisor algorithm developed by Lehmer.
All 1 facts, and where they come from
Facts
1 facts · 0 confirmed by two sources · 0 cited · 1 from one source
Where this comes from
Papalocal keeps its own record. It started from these sources; what each one said is kept here as it was copied, so a change on their side never changes this page by itself. Tap one to read its version.
What Wikidata says · copied November 19, 2026 · revision 2570714941
- Described as
- Fast Greatest Common Divisor algorithm developed by Lehmer
- What it is
- algorithm
- Wikipedias with a page
- 2
Wikidata item Q6518927 (wikidata.org/wiki/Q6518927), public domain (CC0). Copied 2026-11-19.
What Wikipedia says · copied November 19, 2026 · revision 1358436605
Lehmer's GCD algorithm, named after D. H. Lehmer, is a fast GCD algorithm for multiple-precision arithmetic, which improves on the simpler Euclidean algorithm by doing most operations using only the leading digits of the values. "Digit" here is not necessarily a decimal digit; the algorithm is often used with integers represented using a base β such as β = 1000 or β = 232.
From the Wikipedia article “Lehmer's GCD algorithm” (en.wikipedia.org/wiki/Lehmer's_GCD_algorithm), by its contributors, under CC BY-SA 4.0 (creativecommons.org/licenses/by-sa/4.0/). Copied 2026-11-19; not changed.
Confirmed Two sources agree. Cited One source, and it names where it got it. One source One source, without a reference of its own. Sources disagree The sources disagree. We show the best-supported value and keep theirs below.
