In this paper we organize new refined enhanced hybrid extended algorithm for searching
finding greatest common divisor. We expand the algorithm introduced by us in [24]. For …

In this note we obtain new hybrid extended algorithm for finding greatest common divisor.
For regular numbers extended Euclidean algorithm reach acceptable speed …

In this paper we will give how it can be constructed optimized version of Daykin-Harris
algorithm [1],[2] for computing greatest common divisor of two natural numbers. This …

EXTENDED BASED ON GENERALIZED HARRIS ALGORITHM USING SGN FUNCTION
Anton Iliev1,2, Nikolay Kyurkchiev1,2, Asen Rahnev1 and Todork Page 1 Communications …

In this research we present new extended algorithm which is generalization of Tembhurne-
Sathe algorithm [3] as well as our previous enhanced versions of Tembhurne-Sathe …

In this paper we generalize Daykin-Harris algorithm [6] in the way that now our new
algorithm can calculate coefficients x and y in Bezout's identity [1] ie for arbitrary but given …

Here we will present an iteration method for computing x and y in the equation x∗ a+ y∗ b=
gcd, where gcd is a greatest common divisor of preliminary known integer numbers a= 0 and …

In this note we will give one possible way of Euclidean algorithm realization using mainly”
subtraction” arithmetic operation, which leads to considerably faster results with respect to …

A NOTE ON EXTENDED BASED ON GENERALIZED HARRIS ALGORITHM USING SGN
FUNCTION Page 1 International Scientific Conference IMEA’2023 A NOTE ON EXTENDED …

EXTENDED BASED ON GENERALIZED TEMBHURNE-SATHE ALGORITHM USING SGN
FUNCTION Anton Iliev1,2, Nikolay Kyurkchiev1,2, Asen Rahnev1 a Page 1 International …