On a new algorithm for computing GCD of integer numbers

ST Ishmukhametov*, BG Mubarakov, RG Rubtsova and Al Khalidi Arkan Mohammed

In the paper we give an introduction to a new algorithm counting the greatest common divisor (GCD) of natural integers called the approximating GCD algorithm introduced by S.Ishmukhametov in 2016. We compare it with the classical Euclidean GCD algorithm and the kary GCD algorithm in spirit of J. Sorenson and K. Weber and outline their advantages and disadvantages. 

Keywords:

Published on: Jul 6, 2020 Pages: 15-17

Full Text PDF Full Text HTML DOI: 10.17352/tcsit.000013
CrossMark Publons Harvard Library HOLLIS Search IT Semantic Scholar Get Citation Base Search Scilit OAI-PMH ResearchGate Academic Microsoft GrowKudos Universite de Paris UW Libraries SJSU King Library SJSU King Library NUS Library McGill DET KGL BIBLiOTEK JCU Discovery Universidad De Lima WorldCat VU on WorldCat