gcd

Next: gcd! Up: GcdDomain Previous: GcdDomain Contents Index

gcd

$\begin{usage} gcd($x_1,x_2$)\\ gcd~[$x_1, \dots, x_n$] \end{usage}$

$\begin{signatures} gcd: & (\%, \%) $\to$\ \%\\ gcd: & \htmlref{\texttt{List}}{List} \% $\to$\ \%\\\end{signatures}$

$\begin{params} {\em$x_i$} & \% & Elements of the ring\\ \end{params}$

$\begin{retval} Returns $\gcd(x_1,\dots,x_n)$, a generator of the ideal $(x_1,\dots,x_n)$. \end{retval}$

$\begin{remarks} % latex2html id marker 18222With certain types, for example p... ... version can be more efficient than iterating the binary version. \end{remarks}$

See Also

gcd!, gcdquo, lcm

Manuel Bronstein 2000-12-13