Previous Up Next

5.28.6 GCD of two polynomials with the Euclidean algorithm: Gcd

Gcd is the inert form of gcd; namely, it evaluates to gcd for later evaluation. It is used when Xcas is in Maple mode (see Section 2.5.2) to compute the gcd of polynomials with coefficients in ℤ/pℤ using Maple-like syntax.

Examples


Previous Up Next