heuristicGcd

Next: radixInterpolate Up: HeuristicGcd Previous: balancedRemainder Contents Index

heuristicGcd

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

Signature

heuristicGcd: (P, P) $\to$ (Partial P, P, P)

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

$\begin{retval} Returns $(g, q_1, q_2)$\ such that $g = \gcd(p_1, p_2)$, $p_1 = g q_1$\ and $p_2 = g q_2$. \end{retval}$

$\begin{remarks} This heuristic can fail in theory, in which case ({\it failed}\... ..., $p_1, p_2$) is returned, although this has never been reported. \end{remarks}$

Manuel Bronstein 2000-12-13