ScholarLens Back to search
2020•Trends in Computer Science and Information TechnologyOpen access

On a new algorithm for computing GCD of integer numbers

ST Ishmukhametov, Mubarakov BG, Ramilya Gakilevna Rubtsova, A. Mohammed

Open full text 1 citations

Abstract

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.

Open-access reader

About this research paper

What this paper is about

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.

Why it matters

OpenAlex reports 1 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

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.

Key concepts: Greatest common divisor, Euclidean algorithm, Mathematics, Algorithm, Integer (computer science), Divisor (algebraic geometry), Euclidean geometry, Discrete mathematics

Related papers

Related paper 1Related paper 2
Back to paper searchBrowse research topicsOriginal source
On a new algorithm for computing GCD of integer numbers — Research Paper | ScholarLens