This is documentation for Mathematica 3, which was
based on an earlier version of the Wolfram Language.
 Algebra`PolynomialExtendedGCD` PolynomialExtendedGCD gives the extended greatest common divisor for two univariate polynomials. The Mathematica kernel has the functions GCD and ExtendedGCD for integers, and the function PolynomialGCD for multivariate polynomials over the rationals. The function defined in this package works not only for polynomials over the rationals, but also for polynomials over the integers mod prime , and for polynomials with coefficients in a finite field defined by the package Algebra`FiniteFields`. In a Euclidean domain, such as addition and multiplication on the integers, or addition and multiplication on univariate polynomials with coefficients in some field, it is possible to write the gcd of two elements as a linear combination of the two elements. The extended gcd gives the coefficients of the linear combination. PolynomialExtendedGCD[ , ] gives the list gcd, r,s where is the greatest common divisor of and , and and are polynomials such that r +s =gcd. Polynomial greatest common divisor. This loads the package. In[1]:= <7] Out[2]= Here is the same example over the rationals. In[3]:= PolynomialExtendedGCD[x^2 + 2 x + 1, Expand[(x + 1)(x + 2)]] Out[3]= Load the Algebra`FiniteFields` package. In[4]:= <