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([f1, ..., fn], g)
(where the fi
are relatively prime to each other) returns a list of ai
such that g/prod
or returns "failed" if no such exists.fi
= sum ai/fi