This package provides the generalized euclidean algorithm which is needed as the basic step for factoring polynomials.
- solveLinearPolynomialEquation: (List SparseUnivariatePolynomial CR, SparseUnivariatePolynomial CR) -> Union(List SparseUnivariatePolynomial CR, failed)
solveLinearPolynomialEquation([f1, ..., fn], g)where (
firelatively prime to each other) returns a list of
i) or equivalently g/prod
fj= sum (ai/fi) or returns “failed” if no such list exists