Type:

Other

Description:

Let ... , ... , ... be three positive integers with ... . It is well-known that all sufficiently large integers are representable as positive linear combinations of ... , ... , ... . Consider ... , the positive Frobenius number of ... , ... , ... , defined to be the largest integer not representable as a positive linear combination of ... , ... , ... . Then ... is the usual Frobenius number, that is, the largest integer not representable as a non-negative linear combination ... , ... , ... . ( ... differs from the positive Frobenius number ... in that multipliers for linear combinations of larger integers are allowed to be zero.) The function ... corresponds to the Mathematica built-in function ... . We assume that ... , ... , ... are pairwise prime. This Demonstration computes and represents ... in three ways as positive linear combinations of (1) ... , ... , (2) ... , ... , and (3) ... , ... .

Subjects:

    Education Levels:

      Keywords:

      EUN,LOM,LRE4,work-cmr-id:396917,http://demonstrations.wolfram.com:http://demonstrations.wolfram.com/PositiveFrobeniusNumbersOfThreeArguments/,ilox,learning resource exchange,LRE metadata application profile,LRE

      Language:

      Access Privileges:

      Public - Available to anyone

      License Deed:

      Creative Commons Attribution 3.0

      Collections:

      None
      This resource has not yet been aligned.
      Curriki Rating
      'NR' - This resource has not been rated
      NR
      'NR' - This resource has not been rated

      This resource has not yet been reviewed.

      Not Rated Yet.

      Non-profit Tax ID # 203478467