FrobeniusNumber

उपलब्ध

Returns the Frobenius number for a set of integers.

रूप

FrobeniusNumber[{a1, …, an}]

सत्यापित उदाहरणFrobeniusNumber[{}] → FrobeniusNumber::coef: The first argument {} of FrobeniusNumber should be a nonempty list of positive integers. FrobeniusNumber[{}]

इसे Qurak पर चलाएँ संदर्भ में खोजें

इनमें प्रयुक्त

Frobenius read - 6 चरण

विषय

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 »

संबंधित

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

सभी 6300 फ़ंक्शन · इसे किसी MCP क्लाइंट से उपयोग करें