GCD Computation of n Integers
arXiv:1407.6794 · doi:10.1109/RAECS.2014.6799612
Abstract
Greatest Common Divisor (GCD) computation is one of the most important operation of algorithmic number theory. In this paper we present the algorithms for GCD computation of integers. We extend the Euclid's algorithm and binary GCD algorithm to compute the GCD of more than two integers.
RAECS 2014