GCD _ _ _ _ _ _ _ _ _ _ _ _ operator

The gcd operator returns the greatest common divisor of two polynomials.

syntax:

gcd(<expression>,<expression>)

<expression> must be a polynomial (or integer), otherwise an error occurs.

examples:

gcd(2*x**2 - 2*y**2,4*x + 4*y); 

  2*(X + Y) 


gcd(sin(x),x**2 + 1); 

  1  


gcd(765,68); 

  17

The operator gcd described here provides an explicit mean s to find the gcd of two expressions. The switch gcd described below simplifies expressions by finding and canceling gcd's at every opportunity. When the switch ezgcd is also on, gcd's are figured using the EZ GCD algorithm, which is usually faster.