This function computes the monic greatest common divisor of two polynomials with coefficients in an algebraic function field or an algebraic number field.

Since the ordering of objects may vary from a session to another, the leading coefficient may change accordingly.

Algebraic functions and algebraic numbers may be represented by radicals or with the RootOf notation (see type,algnum, type,algfun, type,radnum, type,radfun).

The optional arguments p and q are respectively assigned the co-factors of P and Q. Namely, ,  where G is the Gcd.

The computation is performed in the domain , where:

x is the set of names in P and Q which do not appear inside a RootOf or a radical,

K is a field generated over the rational numbers by the coefficients of P and Q.

The arguments P and Q must be polynomials in x.

Partial factorizations are preserved. The result may be a product of powers of expanded polynomials.

Algebraic numbers and functions occurring in the results are reduced modulo their minimal polynomial (see Normal).

The RootOf and the radicals defining the algebraic numbers must form an independent set of algebraic quantities,  otherwise an error is returned. Note that this condition needs not be satisfied if the expression contains only algebraic numbers in radical notation (i.e. 2^(1/2), 3^(1/2), 6^(1/2)). For, a basis over Q for the radicals can be computed by Maple in this case.

To skip the independence checking, use the option 'independent'.

If a or b contains functions, their arguments are normalized recursively and the functions are frozen before the computation proceeds.

Other objects are frozen and considered as variables.

Error, (in evala/Gcd/preproc0) invalid arguments

Error, (in evala/Gcd/preproc) reducible RootOf detected. Substitutions are {RootOf(_Z^2-_Z) = 0, RootOf(_Z^2-_Z) = 1}