ezgcd heugcd modgcd psrgcd denote the gcd (greatest common divisor) of two univariate or multivariate polynomials with coefficients in ℤ or ℤ[i] using a specific algorithm:
Input:
^
2-2*x*y+y^
2-1,x-y)or:
^
2-2*x*y+y^
2-1,x-y)or:
^
2-2*x*y+y^
2-1,x-y)or:
^
2-2*x*y+y^
2-1,x-y)Output:
Input:
^
2)or:
^
2)or:
^
2)Output:
Input:
^
2)Output:
Input:
^
4-y^
4,(x+1-y)^
2)Output:
But input:
^
4-y^
4,(x+1-y)^
2)or:
^
4-y^
4,(x+1-y)^
2)or:
^
4-y^
4,(x+1-y)^
2)Output: