gcd!

Next: PrimeFieldUnivariateFactorizer Up: ModulopUnivariateGcd Previous: ModulopUnivariateGcd Contents Index

gcd!

$\begin{usage} gcd!(a, n, b, m, $\alpha$, p)\\ gcd!(a, n, b, m, $\alpha$, p, $[l_1,\dots,l_{p-1}], [e_1,\dots,e_{p-1}]$) \end{usage}$

$\begin{signatures} gcd!: (ARR Z, Z, ARR Z, Z, Z) $\to$\ (ARR Z, Z, Z)\\ gcd!: (ARR Z, Z, ARR Z, Z, Z, ARR Z, ARR Z) $\to$\ (ARR Z, Z, Z)\\\end{signatures}$

where
Z == MachineInteger

ARR == Array

$\begin{params} {\em a,b} & \htmlref{\texttt{PrimitiveArray}}{PrimitiveArray} \... ... \htmlref{\texttt{MachineInteger}}{MachineInteger} & exp table\\\end{params}$

$\begin{descr} Given 2 polynomials stored in $a$\ and $b$\ of degrees $n$\ and ... ...Returns the degree of the gcd and its starting index in the array.\end{descr}$

$\begin{remarks} The result can be stored in either $a$\ or $b$, so the functio... ...p modulo $p$. They are used for fast multiplication if provided.\end{remarks}$

Manuel Bronstein 2000-12-13