PolynomialExtendedGCD
PolynomialExtendedGCD[poly1,poly2,x]
gives the extended GCD of poly1 and poly2 treated as univariate polynomials in x.
PolynomialExtendedGCD[poly1,poly2,x,Modulusp]
gives the extended GCD over the integers modulo the prime p.
Examples
open allclose allBasic Examples (2)
Scope (6)
Applications (1)
Properties & Relations (1)
The extended GCD of and is {d,{r,s}}, such that and :
d is equal to PolynomialGCD[f,g] up to a factor not containing x:
and are uniquely determined by the following Exponent conditions:
Use Cancel or PolynomialRemainder to prove that d divides f and g:
Text
Wolfram Research (2007), PolynomialExtendedGCD, Wolfram Language function, https://reference.wolfram.com/language/ref/PolynomialExtendedGCD.html (updated 2023).
CMS
Wolfram Language. 2007. "PolynomialExtendedGCD." Wolfram Language & System Documentation Center. Wolfram Research. Last Modified 2023. https://reference.wolfram.com/language/ref/PolynomialExtendedGCD.html.
APA
Wolfram Language. (2007). PolynomialExtendedGCD. Wolfram Language & System Documentation Center. Retrieved from https://reference.wolfram.com/language/ref/PolynomialExtendedGCD.html