modularGcd

Next: ModulopUnivariateGcd Up: ModularUnivariateGcd Previous: ModularUnivariateGcd Contents Index

modularGcd

$\begin{usage} modularGcd($p_1, p_2$) \end{usage}$

$\begin{signatures} modularGcd: & (P, P) $\to$\ (\htmlref{\texttt{Partial}}{Partial} P, P, P)\\\end{signatures}$

$\begin{params} {\em$p_1, p_2$} & P & Polynomials over Z\\\end{params}$

$\begin{retval} Returns $(g, y, z)$\ such that $g = \gcd(p_1, p_2)$\ or {\it fai... ...f $g$\ is not {\it failed}\xspace , then $p = y g$\ and $q = z g$. \end{retval}$

$\begin{remarks} This algorithm can fail because it runs out of primes. This wil... ...en if the gcd has coefficients with more than around 3000 digits. \end{remarks}$

Manuel Bronstein 2000-12-13