LinearPolynomialEquationByFractions R

fraction.spad line 552 [edit on github]

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 multiEuclidean operation.

solveLinearPolynomialEquationByFractions: (List SparseUnivariatePolynomial R, SparseUnivariatePolynomial R) -> Union(List SparseUnivariatePolynomial R, failed)

solveLinearPolynomialEquationByFractions([f1, ..., fn], g) (where the fi are relatively prime to each other) returns a list of ai such that g/prod fi = sum ai/fi or returns “failed” if no such exists.