FrobeniusNumber

FrobeniusNumber[{a1,,an}]

gives the Frobenius number of a1,,an.

Details

  • The Frobenius number of a1,,an is the largest integer b for which the Frobenius equation a1x1++anxn==b has no non-negative integer solutions. The ai must be positive integers.
  • If the integers ai are not relatively prime, the result is Infinity.
  • If one of the ai is the integer , then the result is .
  • If b is the Frobenius number of a1,,an, then FrobeniusSolve[{a1,,an},b] returns {}.

Examples

open allclose all

Basic Examples  (1)

The Frobenius number of 12, 16, 20, 27:

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

Applications  (2)

Properties & Relations  (1)

See Also

FrobeniusSolve  FindInstance  Reduce  IntegerPartitions

Tutorials

Introduced in 2007
(6.0)