On acceleration of the k-ary GCD algorithm, integer
C = (Ax+By)/k takes a value less than A. At the next iteration, a new pair (B,
C) is formed. The
k-ary Calculation of Bezout’s coefficients for the k-ary algorithm of finding GCD elaborate a new algorithm for calculating Bezout’s coefficients based on the
k-ary GCD algorithm.
Programming of an approximating K-ary GCD algorithmIn our paper, we consider the procedure for effective programming of an approximating
k-ary GCD
Analysis of the k-ary Euclid for tuples of integersIn our paper we discuss the
k-ary Euclid Algorithm for counting the great common divisor (GCD
An approximating k-ary GCD algorithm© 2016, Pleiades Publishing, Ltd.In our paper we elaborate a new version of the
k-ary GCD algorithm