gaussian.spad line 620 [edit on github]
This package provides the generalized euclidean algorithm which is needed as the basic step for factoring polynomials.
solveLinearPolynomialEquation([f1, ..., fn], g)
where (fi
relatively prime to each other) returns a list of ai
such that g
= sum ai
prod fj
(j
=
i
) or equivalently g/prod fj
= sum (ai/fi) or returns "failed" if no such list exists