PolynomialGCD

PolynomialGCD[poly1,poly2,]

gives the greatest common divisor of the polynomials polyi.

PolynomialGCD[poly1,poly2,,Modulusp]

evaluates the GCD modulo the prime p.

Details and Options

  • In PolynomialGCD[poly1,poly2,], all symbolic parameters are treated as variables.
  • PolynomialGCD[poly1,poly2,] will by default treat algebraic numbers that appear in the polyi as independent variables.
  • PolynomialGCD[poly1,poly2,,Extension->Automatic] extends the coefficient field to include algebraic numbers that appear in the polyi.

Examples

open allclose all

Basic Examples  (1)

The greatest common divisor of polynomials:

In[1]:=
Click for copyable input
Out[1]=

Scope  (3)

Generalizations & Extensions  (1)

Options  (3)

Applications  (2)

Properties & Relations  (3)

See Also

PolynomialLCM  PolynomialQuotient  GCD  Cancel  Together  PolynomialExtendedGCD  PolynomialMod  PolynomialReduce  PolynomialRemainder

Tutorials

Introduced in 1991
(2.0)
| Updated in 1996
(3.0)