Previous Up Next

6.28.5  GCD of two polynomials with the Euclidean algorithm: gcd Gcd

The gcd command computes the gcd (greatest common divisor) of polynomials. (See also 6.5.1 for GCD of integers.)


Examples.


Previous Up Next