|
gptkbp:instanceOf
|
gptkb:mathematical_concept
|
|
gptkbp:alsoKnownAs
|
gptkb:Frobenius_number_problem
|
|
gptkbp:application
|
operations research
optimization
currency systems
|
|
gptkbp:appliesTo
|
set of coprime positive integers
|
|
gptkbp:concerns
|
gptkb:linear_Diophantine_equations
non-negative integer combinations
|
|
gptkbp:difficulty
|
NP-hard (for three or more coins)
|
|
gptkbp:field
|
number theory
|
|
gptkbp:FrobeniusNumberFormula
|
ab - a - b (for two coprime integers a, b)
|
|
gptkbp:generalizes
|
coin problem
|
|
https://www.w3.org/2000/01/rdf-schema#label
|
Frobenius coin problem
|
|
gptkbp:namedAfter
|
gptkb:Ferdinand_Georg_Frobenius
|
|
gptkbp:relatedTo
|
gptkb:Diophantine_equations
combinatorics
integer programming
|
|
gptkbp:solutionKnownFor
|
two coin denominations
|
|
gptkbp:solutionUnknownFor
|
three or more coin denominations
|
|
gptkbp:studiedBy
|
gptkb:James_Joseph_Sylvester
|
|
gptkbp:type
|
largest monetary amount that cannot be obtained using given coin denominations
|
|
gptkbp:bfsParent
|
gptkb:Ferdinand_Georg_Frobenius
|
|
gptkbp:bfsLayer
|
5
|