FrobeniusNumber

Available

Returns the Frobenius number for a set of integers.

Forms

FrobeniusNumber[{a1, …, an}]

Verified examplesFrobeniusNumber[{}] → FrobeniusNumber::coef: The first argument {} of FrobeniusNumber should be a nonempty list of positive integers. FrobeniusNumber[{}]

Run this on Qurak Search the reference

Used in

Frobenius read - 6 steps

Topics

Additive Number Theory - Representation in Terms of Powers
Combinatorial Functions - General
Integer Functions - Combinatorial Functions »
New In60 Alphabetical Listing - F
New In60 Number Theory And Integer Functions - New Integer Representation Functions
Number Theoretic Functions - Partitions »

Related

FrobeniusSolve FindInstance Reduce IntegerPartitions PartitionsP BellB PartitionsQ PolygonalNumber DeBruijnSequence FiniteGroupCount PowersRepresentations SquaresR

All 6300 functions · Use this from an MCP client