ModulopUnivariateGcd

Next: gcd! Up: Univariate Polynomials and Series Previous: modularGcd Contents Index

ModulopUnivariateGcd

$\begin{usage} import from ModulopUnivariateGcd \end{usage}$

$\begin{descr} ModulopUnivariateGcd~provides an implementation of an inplace gcd for polynomials modulo a machine prime. \end{descr}$

Exports

gcd!: (ARR Z, Z, ARR Z, Z, Z, Z) $\to$ (ARR Z, Z, Z) in-place gcd

where
Z == MachineInteger

ARR == PrimitiveArray

Subsections

gcd!

Manuel Bronstein 2000-12-13