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.
- Comment
- enLehmer'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
- enLehmer'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.
- Is primary topic of
- Lehmer's GCD algorithm
- Label
- enLehmer's GCD algorithm
- Link from a Wikipage to an external page
- www.imsc.res.in/~kapil/crypto/notes/node11.html
- Link from a Wikipage to another Wikipage
- Algorithm
- Category:Number theoretic algorithms
- Derrick Henry Lehmer
- Donald Knuth
- Euclidean algorithm
- Greatest common divisor
- Identity matrix
- Kapil Hari Paranjape
- Matrix (mathematics)
- Quotient
- Radix
- SameAs
- 4q1fb
- Lehmer's GCD algorithm
- m.0277gs0
- Q6518927
- Алгоритм НОД Лемера
- Subject
- Category:Number theoretic algorithms
- WasDerivedFrom
- Lehmer's GCD algorithm?oldid=935282641&ns=0
- WikiPageLength
- 3844
- Wikipage page ID
- 8547944
- Wikipage revision ID
- 935282641
- WikiPageUsesTemplate
- Template:Number-theoretic algorithms
- Template:Short description