File r37/lisp/csl/html/r37_0286.html artifact b4f1b62aa0 part of check-in d58ccc1261

<A NAME=EZGCD>

<TITLE>EZGCD</TITLE></A>
<b><a href=r37_idx.html>INDEX</a></b><p><p>



<B>EZGCD</B> _ _ _  _ _ _  _ _ _  _ _ _ <B>switch</B><P>
<P>
 
 <P>
<P>
When <em>ezgcd</em> and 
<A HREF=r37_0086.html>gcd</A> are on, greatest common divisors are 
computed using the EZ GCD algorithm that uses modular arithmetic (and is 
usually faster). Default is <em>off</em>. 
<P>
<P>
As a side effect of the gcd calculation, the expressions involved are 
factored, though not the heavy-duty factoring of 
<A HREF=r37_0151.html>factorize</A>. The 
EZ GCD algorithm was introduced in a paper by J. Moses and D.Y.Y. Yun in 
&lt;Proceedings of the ACM&gt;, 1973, pp. 159-166. 
<P>
<P>
Note that the 
<A HREF=r37_0086.html>gcd</A> switch must also be on for <em>ezgcd</em> to have 

effect. 
<P>
<P>
<P>