Mathematica 9 is now available
THIS IS DOCUMENTATION FOR AN OBSOLETE PRODUCT.
SEE THE DOCUMENTATION CENTER FOR THE LATEST INFORMATION.
Wolfram Mathematica Documentation Center
DOCUMENTATION CENTER SEARCH
New to Mathematica? Find your learning path »
Mathematica > Mathematics and Algorithms > Number Theory > Diophantine Equations > FrobeniusSolve >
BUILT-IN MATHEMATICA SYMBOLTutorials »|See Also »|More About »

FrobeniusSolve

FrobeniusSolve
gives a list of all solutions of the Frobenius equation .
FrobeniusSolve
gives at most m solutions.
MORE INFORMATION
  • The Frobenius equation is the Diophantine equation , where the are positive integers, b is an integer, and a solution must consist of non-negative integers. For negative b there are no solutions.
EXAMPLESCLOSE ALL
Basic Examples   (1)
All solutions of the Frobenius equation :
Check:
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)
Reduce may also be used to find the solutions to the Frobenius equation:
FrobeniusSolve returns the same solution set:
FrobeniusSolve gives coefficient lists for IntegerPartitions:
New in 6
Ask a question about this page  |  Suggest an improvement  |  Leave a message for the team
Format:   HTML  |  CDF