gcdex
extended Euclidean algorithm for polynomials
Calling Sequence
Parameters
Description
Examples
Compatibility
gcdex(A, B, x, 's', 't')
gcdex(A, B, C, x, 's', 't')
A, B, C
-
polynomials in the variable x
x
variable name
s, t
(optional) unevaluated names
For the first calling sequence (when the number of parameters is less than six), gcdex applies the extended Euclidean algorithm to compute unique polynomials s, t, and g in x such that where g is the monic GCD (Greatest Common Divisor) of A and B. The results computed satisfy and . The GCD g is returned as the function value.
If arguments s and t are specified, they are assigned the cofactors.
In the second calling sequence, gcdex solves the polynomial Diophantine equation for polynomials s and t in x. Let g be the GCD of A and B. The input polynomial C must be divisible by g; otherwise, an error message is displayed. The polynomial s computed satisfies . If then the polynomial t will satisfy . The NULL value is returned as the function value.
In this case, s and t are not optional.
Note that if the input polynomials are multivariate then, in general, s and t will be rational functions in variables other than x.
Error, (in `gcdex/diophant`) the Diophantine equation has no solution
The gcdex command was updated in Maple 2018.
See Also
degree
gcd
Gcdex
igcdex
Download Help Document