EXTENDED BASED ON GENERALIZED DAYKIN-HARRIS ALGORITHM

Abstract

In this paper we generalize Daykin-Harris algorithm [6] in the way thatnow our new algorithm can calculate coefficients x and y in Bezout’s identity [1] i.e.for arbitrary but given natural numbers a and b, so that x ∗ a + y ∗ b = gcd, where gcdis greatest common divisor of a and b. This algorithm will be useful for long numbers.It uses basically ”addition” and ”subtraction” operations.