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 in conjonction with mod in Maple syntax mode to compute
the gcd of two polynomials with coefficients in ℤ/pℤ with p prime
(see also 2.25.7).
Input in Xcas mode :
^
2+5,5*x^
2+2*x-3)%13)Output :
^
2+5)%13,(5*x^
2+2*x-3)%13)you need to eval(ans()) to get :
Input in Maple mode :
^
2+5,5*x^
2+2*x-3) mod 13Output :
Input:
^
2+2*x,x^
2+6*x+5) mod 5Output :