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.

Uloženo v:
Podrobná bibliografie
Vydáno v:2014 Recent Advances in Engineering and Computational Sciences (RAECS) s. 1 - 4
Hlavní autor: Dwivedi, Shri Prakash
Médium: Konferenční příspěvek
Jazyk:angličtina
Vydáno: IEEE 01.03.2014
Témata:
Algorithm
Algorithm design and analysis
Computer Arithmetic
Computers
Educational institutions
Electronic mail
Equations
GCD Computation
Information technology
Number Theory
Random number generation
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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