Title :
GCD computation of n integers
Author :
Dwivedi, Shri Prakash
Author_Institution :
Dept. of Inf. Technol., G.B. Pant Univ. of Agric. & Technol., Pantnagar, India
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 n integers. We extend the Euclid´s algorithm and binary GCD algorithm to compute the GCD of more than two integers.
Keywords :
algorithm theory; digital arithmetic; number theory; Euclid algorithm; GCD computation; algorithmic number theory; binary GCD algorithm; computer arithmetic; greatest common divisor computation; integers; Algorithm design and analysis; Computers; Educational institutions; Electronic mail; Equations; Information technology; Random number generation; Algorithm; Computer Arithmetic; GCD Computation; Number Theory;
Conference_Titel :
Engineering and Computational Sciences (RAECS), 2014 Recent Advances in
Conference_Location :
Chandigarh
Print_ISBN :
978-1-4799-2290-1
DOI :
10.1109/RAECS.2014.6799612
