FiniteFieldSolveLinearPolynomialEquation(F, FP, FPP)

ffcat.spad line 645 [edit on github]

This package solves linear diophantine equations for Bivariate polynomials over finite fields

solveLinearPolynomialEquation: (List FPP, FPP) -> Union(List FPP, 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.