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.
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.
has abstract
Das Münzproblem (auch als Frob ...... eine einfache Formel zu geben.
@de
Een Frobeniusgetal, genoemd na ...... er steeds een grootste getal.
@nl
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
thumbnail
Link from a Wikipage to an external page
Wikipage page ID
Wikipage revision ID
739,031,845
hypernym
type
comment
Das Münzproblem (auch als Frob ...... eine einfache Formel zu geben.
@de
Een Frobeniusgetal, genoemd na ...... esteld als g(a1, a2, ..., an).
@nl
En mathématiques, le problème ...... de Frobenius de cet ensemble.
@fr
In matematica, un problema del ...... ole, o il numero di McNugget).
@it
The coin problem (also referre ...... e Frobenius number of the set.
@en
label
Coin problem
@en
Frobeniusgetal
@nl
Münzproblem
@de
Problema delle monete
@it
Problème des pièces de monnaie
@fr