extended Euclidean algorithm for polynomials
gcdex(A, B, x, 's', 't')
gcdex(A, B, C, x, 's','t')
A, B, C
polynomials in the variable x
(optional) unevaluated names
If 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 s⁢A+t⁢B=g where g is the monic GCD (Greatest Common Divisor) of A and B. The results computed satisfy degree⁡s<degree⁡Bg and degree⁡t<degree⁡Ag. The GCD g is returned as the function value.
In the case of six parameters, gcdex solves the polynomial Diophantine equation s⁢A+t⁢B=C 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. The polynomial s computed satisfies degree⁡s<degree⁡Bg. If degree⁡Cg<degree⁡Ag+degree⁡Bg then the polynomial t will satisfy degree⁡t<degree⁡Ag. The NULL value is returned as the function value.
Note that if the input polynomials are multivariate then, in general, s and t will be rational functions in variables other than x.
Download Help Document
What kind of issue would you like to report? (Optional)
Thank you for submitting feedback on this help document. Your feedback will be used
to improve Maple's help in the future.