Coin problem
The coin problem (also referred to as the Frobenius coin problem or Frobenius problem, after the mathematician Ferdinand Frobenius) is a mathematical problem that asks for the largest monetary amount that cannot be obtained using only coins of specified denominations. For example, the largest amount that cannot be obtained using only coins of 3 and 5 units is 7 units. The solution to this problem for a given set of coin denominations is called the Frobenius number of the set. The Frobenius number exists as long as the set of coin denominations has no common divisor greater than 1.
43 (number)Change-making problemChicken McNugget TheoremChicken McNuggetsChicken McNuggets problemCoin ProblemComputing the Continuous DiscretelyFrobenius Coin ProblemFrobenius NumberFrobenius ProblemFrobenius coin problemFrobenius equationFrobenius numberFrobenius problemList of things named after Ferdinand Georg FrobeniusList of things named after James Joseph SylvesterMcNugget formulaMcNugget numberNumerical semigroupPostage stamp problemSchur's theoremShellsortSylver coinageSylvester's theorem
Link from a Wikipage to another Wikipage
primaryTopic
Coin problem
The coin problem (also referred to as the Frobenius coin problem or Frobenius problem, after the mathematician Ferdinand Frobenius) is a mathematical problem that asks for the largest monetary amount that cannot be obtained using only coins of specified denominations. For example, the largest amount that cannot be obtained using only coins of 3 and 5 units is 7 units. The solution to this problem for a given set of coin denominations is called the Frobenius number of the set. The Frobenius number exists as long as the set of coin denominations has no common divisor greater than 1.
has abstract
Das Münzproblem (auch als Frob ...... it ist das Briefmarkenproblem.
@de
Een frobeniusgetal, genoemd na ...... er steeds een grootste getal.
@nl
El problema de la moneda (tamb ...... ser tan grande como se desee.
@es
En mathématiques, le problème ...... ement grand, est NP-difficile.
@fr
In matematica, un problema del ...... iamata equazione di Frobenius.
@it
The coin problem (also referre ...... large as desired, is NP-hard.
@en
フロベニウスの硬貨交換問題（フロベニウスのこうかこうかんもん ...... ず、硬貨の種類に制限を設けない一般的な問題はNP困難である。
@ja
Link from a Wikipage to an external page
Wikipage page ID
page length (characters) of wiki page
Wikipage revision ID
1,021,859,625
Link from a Wikipage to another Wikipage
wikiPageUsesTemplate
hypernym
type
comment
Das Münzproblem (auch als Frob ...... it ist das Briefmarkenproblem.
@de
Een frobeniusgetal, genoemd na ...... d kan men veronderstellen dat:
@nl
El problema de la moneda (tamb ...... de moneda no sea mayor que 1.
@es
En mathématiques, le problème ...... de Frobenius de cet ensemble.
@fr
In matematica, un problema del ...... francobolli, scatole, o il ).
@it
The coin problem (also referre ...... common divisor greater than 1.
@en
フロベニウスの硬貨交換問題（フロベニウスのこうかこうかんもん ...... ず、硬貨の種類に制限を設けない一般的な問題はNP困難である。
@ja
label
Coin problem
@en
Frobeniusgetal
@nl
Münzproblem
@de
Problema de la moneda
@es
Problema delle monete
@it
Problème des pièces de monnaie
@fr
フロベニウスの硬貨交換問題
@ja