Go to the first, previous, next, last section, table of contents.


gcd, gcdz

gcd(poly1,poly2[,mod])
gcdz(poly1,poly2)
:: The polynomial greatest common divisor of poly1 and poly2.
return
polynomial
poly1,poly2
polynomial
mod
prime
[0] gcd(12*(x^2+2*x+1)^2,18*(x^2+(y+1)*x+y)^3);
x^3+3*x^2+3*x+1
[1] gcdz(12*(x^2+2*x+1)^2,18*(x^2+(y+1)*x+y)^3);
6*x^3+18*x^2+18*x+6
[2] gcd((x+y)*(x-y)^2,(x+y)^2*(x-y));
x^2-y^2
[3] gcd((x+y)*(x-y)^2,(x+y)^2*(x-y),2);
x^3+y*x^2+y^2*x+y^3
References
section igcd,igcdcntl.


Go to the first, previous, next, last section, table of contents.