6.34.13  GCD in ℤ/pℤ[x]: gcd

The gcd command finds the greatest common divisor of two polynomials with coefficients in ℤ/pℤ (for prime p). (See also Section 6.5.1 and Section 6.28.5.)

• gcd takes two arguments:
  P and Q, two polynomials with coefficients in ℤ/pℤ (p must be prime).
• gcd(P,Q) returns the GCD of P and Q computed in ℤ/pℤ[x]

Example.
Input:

Output: