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 > Discrete Mathematics > Combinatorial Functions > FrobeniusNumber >
Mathematica > Mathematics and Algorithms > Mathematical Functions > Integer Functions > Combinatorial Functions > FrobeniusNumber >
BUILT-IN MATHEMATICA SYMBOLTutorials »|See Also »|More About »

FrobeniusNumber

FrobeniusNumber
gives the Frobenius number of .
MORE INFORMATION
  • The Frobenius number of is the largest integer b for which the Frobenius equation has no non-negative integer solutions. The must be positive integers.
  • If the integers are not relatively prime, the result is Infinity.
  • If one of the is the integer , then the result is .
EXAMPLESCLOSE ALL
Basic Examples   (1)
The Frobenius number of 12, 16, 20, 27:
The Frobenius number of 12, 16, 20, 27:
In[1]:=
Click for copyable input
Out[1]=
Applications   (2)
Make an array of Frobenius numbers:
Frobenius numbers of pairs:
Frobenius numbers of length-4 runs:
Properties & Relations   (1)
For a pair of relatively prime integers the Frobenius number has a closed form:
Check:
New in 6
Ask a question about this page  |  Suggest an improvement  |  Leave a message for the team
Format:   HTML  |  CDF