Gcd is the inert form of gcd.
Gcd returns the gcd (greatest common divisor) of two polynomials
(or of a list of polynomials or of a sequence of polynomials) without
evaluation. It is used when Xcas is in Maple mode to compute
gcd of polynomials with coefficients in ℤ/pℤ using Maple-like syntax.
Input in Xcas mode :
Input in Maple mode :
^2+6*x+5) mod 5