GCD Computation of n Integers
Data Structures and Algorithms
2014-08-19 v1 Symbolic Computation
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.
Cite
@article{arxiv.1407.6794,
title = {GCD Computation of n Integers},
author = {Shri Prakash Dwivedi},
journal= {arXiv preprint arXiv:1407.6794},
year = {2014}
}
Comments
RAECS 2014