# InnerModularGcd(R, BP, pMod, nextMod)¶

This file contains the functions for modular gcd algorithm for univariate polynomials with coefficients in a non-trivial euclidean domain (i.e. not a field). The package parametrised by the coefficient domain, the polynomial domain, a prime, and a function for choosing the next prime
modularGcd(listf) computes the gcd of the list of polynomials listf by modular methods.
modularGcdPrimitive(listf) computes the gcd of the list of primitive polynomials listf by modular methods.
reduction(f, p) reduces the coefficients of the polynomial f modulo the prime p.