gcd denotes the gcd (greatest common divisor) of two polynomials (or of a list of polynomials or of a sequence of polynomials) (see also 2.6.2 for GCD of integers).
Examples
Input :
^2+2*x+1,x^2-1)Output :
Input :
^2-2*x+1,x^3-1,x^2-1,x^2+x-2)or
^2-2*x+1,x^3-1,x^2-1,x^2+x-2])Output :
For polynomials with modular coefficients, input e.g. :
^2+2*x+1) mod 5,(x^2-1) mod 5)Output :
Note that :
^2+2*x+1,x^2-1) mod 5will output :
since the mod operation is done after the GCD is computed in ℤ[X].