Mathematica > Mathematics and Algorithms > Number Theory > Diophantine Equations >

FrobeniusSolve

FrobeniusSolve[{a1, ..., an}, b]
gives a list of all solutions of the Frobenius equation a_1x_1+...+a_nx_n=b.
FrobeniusSolve[{a1, ..., an}, b, m]
gives at most m solutions.
  • The Frobenius equation is the Diophantine equation a_1x_1+...+a_nx_n=b, where the ai are positive integers, b is an integer, and a solution x_1,...,x_n must consist of non-negative integers. For negative b there are no solutions.
New in 6
Ask a question about this page  |  Suggest an improvement  |  Leave a message for the team