# Coin problem

Jump to: navigation, search
With only 2 pence and 5 pence coins, one cannot make 3 pence, but one can make any higher amount.

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.[1] 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.

There is an explicit formula for the Frobenius number when there are only two different coin denominations. If the number of coin denominations is three or more, no explicit formula is known; but, for any fixed number of coin denominations, there is an algorithm computing the Frobenius number in polynomial time (in the logarithms of the coin denominations forming an input).[2] No known algorithm is polynomial time in the number of coin denominations, and the general problem, where the number of coin denominations may be as large as desired, is NP-hard.[3][4]

## Statement

In mathematical terms the problem can be stated:

Given positive integers a1, a2, ..., an such that gcd(a1, a2, ..., an) = 1, find the largest integer that cannot be expressed as an integer conical combination of these numbers, i.e., as a sum
k1a1 + k2a2 + ··· + knan,
where k1, k2, ..., kn are non-negative integers.

This largest integer is called the Frobenius number of the set { a1, a2, ..., an }, and is usually denoted by g(a1, a2, ..., an).

The requirement that the greatest common divisor (GCD) equal 1 is necessary in order for the Frobenius number to exist. If the GCD were not 1, every integer that is not a multiple of the GCD would be inexpressible as a linear, let alone conical, combination of the set, and therefore there would not be a largest such number. For example, if you had two types of coins valued at 4 cents and 6 cents, the GCD would equal 2, and there would be no way to combine any number of such coins to produce a sum which was an odd number. On the other hand, whenever the GCD equals 1, the set of integers that cannot be expressed as a conical combination of { a1, a2, ..., an } is bounded according to Schur's theorem, and therefore the Frobenius number exists.

## Frobenius numbers for small n

A closed-form solution exists for the coin problem only where n = 1 or 2. No closed-form solution is known for n > 2.[4]

### n = 1

If n = 1, then a1 = 1 so that all natural numbers can be formed. Hence no Frobenius number in one variable exists.

### n = 2

If n = 2, the Frobenius number can be found from the formula $g(a_1, a_2) = a_1a_2-a_1-a_2$. This formula was discovered by James Joseph Sylvester in 1884.[5] Sylvester also demonstrated for this case that there are a total of $N(a_1, a_2) = (a_1-1)(a_2-1)/2$ non-representable integers.

Another form of the equation for $g(a_1, a_2)$ is given by Skupień[6] in this proposition: If $a_1,a_2 \in \mathbb{N}$ and $\gcd(a_1, a_2) = 1$ then, for each $n \ge (a_1-1)(a_2-1)$, there is exactly one pair of nonnegative integers $\rho$ and $\sigma$ such that $\sigma < a_1$ and $n = \rho a_1 +\sigma a_2$.

Notice for the proof that, for $j=0,1,\ldots,a_1-1$, if $\gcd(a_1, a_2) = 1$, all integers $n - j a_2$ are mutually distinct modulo $a_1$. Hence, for exactly one $j$, say $j=\sigma$, we have $n = \rho a_1 +\sigma a_2$, whence $\rho \ge 0$ because $\rho a_1 = n - \sigma a_2 \ge (a_1-1)(a_2-1) - (a_1 -1)a_2 = -a_1 + 1$.

### n = 3

Fast algorithms are known for three numbers (see Numerical semigroup for details of one such algorithm) though the calculations can be very tedious if done by hand. Furthermore, lower- and upper bounds for the n = 3 Frobenius numbers have been determined. The Frobenius-type lower bound due to Davison

$g(a_1, a_2, a_3) \geq \sqrt{3a_1a_2a_3} - a_1 - a_2 - a_3$

is reported to be relatively sharp.[7]

## Frobenius numbers for special sets

### Arithmetic sequences

A simple formula exists for the Frobenius number of a set of integers in an arithmetic sequence.[8] Given integers a, d, s with gcd(ad) = 1:

$g(a,a+d,a+2d,\dots,a+sd)=\left(\left\lfloor\frac{a-2}{s}\right\rfloor+1\right)a+(d-1)(a-1)-1.$

### Geometric sequences

There also exists a closed form solution for the Frobenius number of a set in a geometric sequence.[9] Given integers m, n, k with gcd(mn) = 1:

$g(m^k,m^{k-1}n,m^{k-2}n^2,\dots,n^k)=n^{k-1}(mn-m-n)+\frac{m^2(n-1)(m^{k-1}-n^{k-1})}{m-n}.$

## Examples

### McNugget numbers

Graphical solution of the Chicken McNuggets problem. The grid of points indicates that quantities that can be purchased are any positive multiple of 3 (with the exception of 3 itself) and any positive multiple of 20, as well as linear combinations thereof. Each sloping line x + y = k represents a total number of k nuggets. A red line goes through no grid points, so this number of nuggets cannot be purchased. A blue line goes through at least one grid point, so this number of nuggets can be purchased. The highest red line is x + y = 43.
McDonald's Chicken McNuggets in a box of 20.

One special case of the coin problem is sometimes also referred to as the McNugget numbers. The McNuggets version of the coin problem was introduced by Henri Picciotto, who included it in his algebra textbook co-authored with Anita Wah.[10] Picciotto thought of the application in the 1980s while dining with his son at McDonald's, working the problem out on a napkin. A McNugget number is the total number of McDonald's Chicken McNuggets in any number of boxes. The original boxes (prior to the introduction of the Happy Meal-sized nugget boxes) were of 6, 9, and 20 nuggets.

According to Schur's theorem, since 6, 9, and 20 are relatively prime, any sufficiently large integer can be expressed as a linear combination of these three. Therefore, there exists a largest non-McNugget number, and all integers larger than it are McNugget numbers. Namely, every positive integer is a McNugget number, with the finite number of exceptions:

1, 2, 3, 4, 5, 7, 8, 10, 11, 13, 14, 16, 17, 19, 22, 23, 25, 28, 31, 34, 37, and 43 (sequence A065003 in OEIS).

Thus the largest non-McNugget number is 43.[11] The fact that any integer larger than 43 is a McNugget number can be seen by considering the following integer partitions

$44 = 6 + 9 + 9 + 20$
$45 = 9 + 9 + 9 + 9 + 9$
$46 = 6 + 20 + 20$
$47 = 9 + 9 + 9 + 20$
$48 = 6 + 6 + 9 + 9 + 9 + 9$
$49 = 9 + 20 + 20$

Any larger integer can be obtained by adding some number of 6s to the appropriate partition above.

Furthermore, a straightforward check demonstrates that 43 McNuggets can indeed not be purchased, as:

1. boxes of 6 and 9 alone cannot form 43 as these can only create multiples of 3 (with the exception of 3 itself);
2. including a single box of 20 does not help, as the required remainder (23) is also not a multiple of 3; and
3. more than one box of 20, complemented with boxes of size 6 or larger, obviously cannot lead to a total of 43 McNuggets.

Since the introduction of the 4-piece Happy Meal-sized nugget boxes, the largest non-McNugget number is 11. In countries where the 9-piece size is replaced with the 10-piece size, there is no largest non-McNugget number, as any odd number cannot be made.

### Other examples

In rugby union, there are four types of scores: penalty goal (3 points), drop goal (3 points), try (5 points) and converted try (7 points). By combining these any points total is possible except 1, 2, or 4.

Similarly, in American football (NFL rules), any score is possible in a non-forfeit game except 1. The only ways to score 1 point are by a single point conversion after a 6 point touchdown, or to win by forfeit, where the score will be recorded as 1-0 or 0-1. As 2 points are awarded for a safety and 3 points for a field goal, all other scores apart from 1 are possible.

## References

1. ^ J. Ramírez Alfonsín (2005). The Diophantine Frobenius problem. Oxford Univ. Press.
2. ^ Ravi Kannan (1992). "Lattice translates of a polytope and the Frobenius problem". Combinatorica 12 (2): 161–177. doi:10.1007/BF01204720.
3. ^ D. Beihoffer, J. Hendry, A. Nijenhuis, and S. Wagon (2005). "Faster algorithms for Frobenius numbers". Electronic Journal of Combinatorics 12: R27.
4. ^ a b
5. ^ Sylvester, James Joseph (1884). "Question 7382". Mathematical Questions from the Educational Times 41: 21.
6. ^ Skupień, Zdzisław (1993). "A generalization of Sylvester’s and Frobenius’ problems" (PDF). ACTA ARITHMETICA. LXV.4: 353–366.
7. ^ M. Beck and S. Zacks (2004). "Refined upper bounds for the linear Diophantine problem of Frobenius". Adv. Appl. Math. 32 (3): 454–467. arXiv:math/0305420. doi:10.1016/S0196-8858(03)00055-1.
8. ^ Ramirez Alfonsin, Jorge (2005). The Diophantine Frobenius Problem. Oxford University Press. pp. 59–60.
9. ^ Ong, Darren C. and Ponomarenko, Vadim (2008). "The Frobenius Number of Geometric Sequences". INTEGERS: the Electronic Journal of Combinatorial Number Theory 8 (1): A33.
10. ^ A. Wah, H. Picciotto (1994). "Lesson 5.8 Building-block Numbers". [http://www.mathedpage.org/attc/attc.html Algebra: Themes, Tools, Concepts] (PDF). p. 186.
11. ^