Frobenius number
= Frobenius number
{c}
{title2=$g(a_1,\ldots,a_k)$}
= Frobenius value
{c}
{synonym}
For <positive integers> $a_1,\ldots,a_k>1$ having <greatest common divisor> one, the <Frobenius number> is the largest <integer> not expressible as $\sum_i a_i x_i$ with <nonnegative integer> coefficients $x_i$. A coin interpretation allows unlimited copies of denominations $a_i$, rather than a fixed number of coins.
For denominations $4$ and $7$, the value is $17$. The next four values are representable: $18=4+7+7$, $19=4+4+4+7$, $20=5\cdot4$ and $21=3\cdot7$. Repeatedly adding $4$ then covers every larger <integer>. The <two-generator Frobenius theorem> proves the formula $g(a,b)=ab-a-b$ for two <coprime> denominations.
The hypotheses exclude two different degeneracies. If all denominations have a common <divisor> greater than one, infinitely many positive amounts are impossible, so no largest impossible amount exists. If denomination one is present, every <nonnegative integer> is possible; the usual positive-gap problem disappears. Some conventions assign the latter case the value $-1$.