GCD of two polynomials with the Euclidean algorithm: Gcd

### 6.28.6 GCD of two polynomials with the Euclidean algorithm: Gcd

Gcd is the inert form of gcd; namely, it evaluates to gcd for later evaluation. It is used when Xcas is in Maple mode (see Section 3.5.2) to compute the gcd of polynomials with coefficients in ℤ/pℤ using Maple-like syntax.

Examples.

- Input (in Xcas mode):
  Gcd(x^3-1,x^2-1)
  Output:

  gcd | ⎛ ⎝ | x3−1,x2−1 | ⎞ ⎠

- Input (in Maple mode):
  Gcd(x^2+2*x,x^2+6*x+5) mod 5
  Output:

  1