๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Algorithm 386. GCD of n integers and multipliers

โœ Scribed by Bradley.

Book ID
127401970
Publisher
CACM
Year
1970
Tongue
English
Weight
140 KB
Category
Library

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

A Double-Digit Lehmer-Euclid Algorithm f
A Double-Digit Lehmer-Euclid Algorithm for Finding the GCD of Long Integers
โœ 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

A Multiplication Algorithm for Two Integ
A Multiplication Algorithm for Two Integers
โœ C. L. Pinchback and Damber S. Tomer ๐Ÿ“‚ Article ๐Ÿ“… 2002 ๐Ÿ› National Council of Teachers of Mathematics โš– 663 KB