IntegerSolveLinearPolynomialEquation

integer.spad line 1 [edit on github]

This package provides the implementation for the solveLinearPolynomialEquation operation over the integers. It uses a lifting technique from the package GenExEuclid

solveLinearPolynomialEquation : (List(SparseUnivariatePolynomial(Integer)), SparseUnivariatePolynomial(Integer)) -> Union(List(SparseUnivariatePolynomial(Integer)), "failed")

solveLinearPolynomialEquation([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 list of ai's exists.