A NOTE ON EUCLIDEAN AND EXTENDED EUCLIDEAN ALGORITHMS FOR GREATEST
COMMON DIVISOR FOR POLYNOMIALS Anton Iliev1 §, Nikolay Kyurk Page 1 International …

In our research [7]–[30] which is dedicated to regular and extended algorithms for finding
greatest common divisor we developed new approaches for optimizing the ways of finding …

Page 1 ! " # " $% # # & ' & ' ! # # " ( # ) ( * " # + + $ , + # + + # + $ $ # # $ $ # # % # $ $ - + . # / % +
# 01 2 3 2 # + / / " # Page 2 1 Anton Iliev and Nikolay Kyurkchiev NEW TRENDS IN PRACTICAL …

In our previous works [12]–[22] we give optimized solutions of Euclidean algorithm.
Computational effectiveness of these algorithms [12]–[22] make them more useful from …

In this note we gave new implementation of Knuth's Algorithm for Computing Extended
Greatest Common Divisor using SGN Function (KACEGCDSF). Very intriguing and practical …

We develop new efficient realization of Kronecker symbol calculation. Numerical
experiments show that our approach leads to more than 10 times faster algorithm in …

In this paper we present new iterative and recursive versions of Kronecker symbol binary
algorithm. Our approach extents the results of Shallit and Sorenson [48] binary algorithm for …

Here we will give optimized solution for computing polynomial multiplicative inverse. Our
solution is based on results in [12]–[23]. New iteration scheme [12] gives better …

Here we will give faster modification of Lehmer's optimized solution for computing greatest
common divisor. Our result is a natural continuation of new realizations given in [12]–[24] …

In te rn a tio nal E le ctro n ic J ou rn alof P u re and A pp lie d M a th ema tic s – IE JPAM , V
o lu me 1 5 Page 1 International Electronic Journal of Pure and Applied Mathematics …