EUVIMEDEUVIMED entdecken
Open Access · CC BY-NC 4.0

On a new algorithm for computing GCD of integer numbers

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

Trends in Computer Science and Information Technology · 2020

DOI: 10.17352/tcsit.000013 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Trends in Computer Science and Information Technology, 2020. Verfasst von ST Ishmukhametov und 3 weiteren Autor:innen. Die Arbeit wurde bisher 1-mal zitiert (Crossref) und nennt 9 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY-NC 4.0).

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

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.

Zitieren

APA

Ishmukhametov, S., Mubarakov, B., Rubtsova, R., & Mohammed, A. K. A. (2020). On a new algorithm for computing GCD of integer numbers. Trends in Computer Science and Information Technology. https://doi.org/10.17352/tcsit.000013

Vancouver

Ishmukhametov S, Mubarakov B, Rubtsova R, Mohammed AKA. On a new algorithm for computing GCD of integer numbers. Trends in Computer Science and Information Technology. 2020. doi:10.17352/tcsit.000013

BibTeX
@article{Ishmukhametov2020,
  author = {Ishmukhametov, ST and Mubarakov, BG and Rubtsova, RG and Mohammed, Al Khalidi Arkan},
  title = {On a new algorithm for computing GCD of integer numbers},
  journal = {Trends in Computer Science and Information Technology},
  year = {2020},
  doi = {10.17352/tcsit.000013}
}
Kostenlos starten →