A Double-Digit Lehmer-Euclid Algorithm f
โ
Tudor Jebelean
๐
Article
๐
1995
๐
Elsevier Science
๐
English
โ 316 KB
The use of pairs of double digits in the Lehmer-Euclid multiprecision GCD algorithm halves the number of long multiplications, but a straightforward implementation of this idea does not give the desired speed-up. We show how to overcome the practical difficulties by using an enhanced condition for e