PolynomialGCD[, , ... ] gives the greatest common divisor of the polynomials .
PolynomialGCD[, , ... , Modulus->p] evaluates the GCD modulo the prime p.
Example: PolynomialGCD[1 + x y, x + x^2 y] .
In PolynomialGCD[, , ... ], all symbolic parameters are treated as variables.
PolynomialGCD[, , ... ] will by default treat algebraic numbers that appear in the as independent variables.
PolynomialGCD[, , ... , Extension->Automatic] extends the coefficient field to include algebraic numbers that appear in the .
See Section 3.3.4.
See also: PolynomialLCM, PolynomialQuotient, GCD, Cancel, Together, PolynomialMod.
Related package: Algebra`PolynomialExtendedGCD`.
New in Version 2; modified in 3.