PolynomialGCD

PolynomialGCD(p, q)

returns the GCD (‘greatest common divisor’) of the polynomials p and q.

PolynomialGCD(p, q, Modulus -> prime)

returns the GCD (‘greatest common divisor’) of the polynomials p and q modulus the prime integer.

See

• Wikipedia: Polynomial greatest common divisor

Examples

>> PolynomialGCD(x^2 + 7*x + 6, x^2-5*x-6)
1+x

Implementation status

• ✅ - full supported

Github

• Implementation of PolynomialGCD