GCD computation of n integers

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.

Saved in:

Bibliographic Details
Published in:	2014 Recent Advances in Engineering and Computational Sciences (RAECS) pp. 1 - 4
Main Author:	Dwivedi, Shri Prakash
Format:	Conference Proceeding
Language:	English
Published:	IEEE 01.03.2014
Subjects:	Algorithm Algorithm design and analysis Computer Arithmetic Computers Educational institutions Electronic mail Equations GCD Computation Information technology Number Theory Random number generation
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Description
Summary:	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.
DOI:	10.1109/RAECS.2014.6799612