Function: gcd (<p_1>, <p_2>, <x_1>, ...) Returns the greatest common divisor of <p_1> and <p_2>. The flag
gcd determines which algorithm is employed. Setting
spmod selects the
prs, reduced, or modular algorithm, respectively. If
gcd (<p_1>, <p_2>, <x>) always returns 1 for all <x>. Many functions (e.g.
factor, etc.) cause gcds to be taken implicitly. For homogeneous polynomials it is recommended that
gcd equal to
subres be used. To take the gcd when an algebraic is present, e.g.,
gcd (<x>^2 - 2*sqrt(2)*<x> + 2, <x> - sqrt(2)),
algebraic must be
gcd must not be
gcd flag, default:
false will also prevent the greatest common divisor from being taken when expressions are converted to canonical rational expression (CRE) form. This will sometimes speed the calculation if gcds are not required.
There are also some inexact matches for
?? gcd to see them.
(%o1) true (%i2)