FrobeniusSolve

FrobeniusSolve[{a1,,an},b]

gives a list of all solutions of the Frobenius equation .

FrobeniusSolve[{a1,,an},b,m]

gives at most m solutions.

Details

  • The Frobenius equation is the Diophantine equation , where the ai are positive integers, b is an integer, and a solution must consist of non-negative integers. For negative b there are no solutions.

Examples

open allclose all

Basic Examples  (1)

All solutions of the Frobenius equation :

In[1]:=
Click for copyable input
Out[1]=

Check:

In[2]:=
Click for copyable input
Out[2]=

Properties & Relations  (2)

See Also

FrobeniusNumber  NumberDecompose  IntegerPartitions  Reduce  FindInstance  ExtendedGCD

Tutorials

Introduced in 2007
(6.0)