Given a PolynomialFactorizationExplicit ring, this package provides a defaulting rule for the
solveLinearPolynomialEquation operation, by moving into the field of fractions, and solving it there via the
- solveLinearPolynomialEquationByFractions: (List SparseUnivariatePolynomial R, SparseUnivariatePolynomial R) -> Union(List SparseUnivariatePolynomial R, failed)
solveLinearPolynomialEquationByFractions([f1, ..., fn], g)(where the
fiare relatively prime to each other) returns a list of
g/prod fi = sum ai/fior returns “failed” if no such exists.