Difference between revisions of "Chicken McNugget Theorem"

Revision as of 16:22, 23 February 2016

The Chicken McNugget Theorem (or Postage Stamp Problem or Frobenius Coin Problem) states that for any two relatively prime positive integers $m,n$ , the greatest integer that cannot be written in the form $am + bn$ for nonnegative integers $a, b$ is $mn-m-n$ .

A consequence of the theorem is that there are exactly $\frac{(m - 1)(n - 1)}{2}$ positive integers which cannot be expressed in the form $am + bn$ . The proof is based on the fact that in each pair of the form $(k, (m - 1)(n - 1) - k+1)$ , exactly one element is expressible.

Origins

The story goes that the Chicken McNugget Theorem got its name because in McDonalds, people bought Chicken McNuggets in 9 and 20 piece packages. Somebody wondered what the largest amount you could never buy was, assuming that you did not eat or take away any McNuggets. They found the answer to be 151 McNuggets, thus creating the Chicken McNugget Theorem.

Proof 1

Definition. An integer $N \in \mathbb{Z}$ will be called purchasable if there exist nonnegative integers $a,b$ such that $am+bn = N$ .

We would like to prove that $mn-m-n$ is the largest non-purchasable integer. We are required to show that (1) $mn-m-n$ is non-purchasable, and (2) every $N > mn-m-n$ is purchasable. Note that all purchasable integers are nonnegative, thus the set of non-purchasable integers is nonempty.

Lemma. Let $A_{N} \subset \mathbb{Z} \times \mathbb{Z}$ be the set of solutions $(x,y)$ to $xm+yn = N$ . Then $A_{N} = \{(x+kn,y-km) \;:\; k \in \mathbb{Z}\}$ for any $(x,y) \in A_{N}$ .

Proof: By Bezout's Lemma, there exist integers $x',y'$ such that $x'm+y'n = 1$ . Then $(Nx')m+(Ny')n = N$ . Hence $A_{N}$ is nonempty. It is easy to check that $(Nx'+kn,Ny'-km) \in A_{N}$ for all $k \in \mathbb{Z}$ . We now prove that there are no others. Suppose $(x_{1},y_{1})$ and $(x_{2},y_{2})$ are solutions to $xm+yn=N$ . Then $x_{1}m+y_{1}n = x_{2}m+y_{2}n$ implies $m(x_{1}-x_{2}) = n(y_{2}-y_{1})$ . Since $m$ and $n$ are coprime and $m$ divides $n(y_{2}-y_{1})$ , $m$ divides $y_{2}-y_{1}$ and $y_{2} \equiv y_{1} \pmod{m}$ . Similarly $x_{2} \equiv x_{1} \pmod{n}$ . Let $k_{1},k_{2}$ be integers such that $x_{2}-x_{1} = k_{1}n$ and $y_{2}-y_{1} = k_{2}m$ . Then $m(-k_{1}n) = n(k_{2}m)$ implies $k_{1} = -k_{2}.$ We have the desired result. $\square$

Lemma. For any integer $N$ , there exists unique $(a_{N},b_{N}) \in \mathbb{Z} \times \{0,1,\ldots,m-1\}$ such that $a_{N}m + b_{N}n = N$ .

Proof: By the division algorithm, there exists $k$ such that $0 \le y-km \le m-1$ . $\square$

Lemma. $N$ is purchasable if and only if $a_{N} \ge 0$ .

Proof: If $a_{N} \ge 0$ , then we may simply pick $(a,b) = (a_{N},b_{N})$ so $N$ is purchasable. If $a_{N} < 0$ , then $a_{N}+kn < 0$ if $k \le 0$ and $b_{N}-km < 0$ if $k > 0$ , hence at least one coordinate of $(a_{N}+kn,b_{N}-km)$ is negative for all $k \in \mathbb{Z}$ . Thus $N$ is not purchasable. $\square$

Thus the set of non-purchasable integers is $\{xm+yn \;:\; x<0,0 \le y \le m-1\}$ . We would like to find the maximum of this set. Since both $m,n$ are positive, the maximum is achieved when $x = -1$ and $y = m-1$ so that $xm+yn = (-1)m+(m-1)n = mn-m-n$ .

Proof 2

We start with this statement taken from Proof 2 of Fermat's Little Theorem:

"Let $S = \{1,2,3,\cdots, p-1\}$ . Then, we claim that the set $a \cdot S$ , consisting of the product of the elements of $S$ with $a$ , taken modulo $p$ , is simply a permutation of $S$ . In other words,

$S \equiv \{1a, 2a, \cdots, (p-1)a\} \pmod{p}.$

Clearly none of the $ia$ for $1 \le i \le p-1$ are divisible by $p$ , so it suffices to show that all of the elements in $a \cdot S$ are distinct. Suppose that $ai \equiv aj \pmod{p}$ for $i \neq j$ . Since $\text{gcd}\, (a,p) = 1$ , by the cancellation rule, that reduces to $i \equiv j \pmod{p}$ , which is a contradiction."

Because $m$ and $n$ are coprime, we know that multiplying the residues of $m$ by $n$ simply permutes these residues. Each of these permuted residues is purchasable (using the definition from Proof 1), because, in the form $am+bn$ , $a$ is $0$ and $b$ is the original residue. We now prove the following lemma.

Lemma: For any nonnegative integer $c < m$ , $cn$ is the least purchasable number $\equiv cn \bmod m$ .

Proof: Any number that is less than $cn$ and congruent to it $\bmod m$ can be represented in the form $cn-dm$ , where $d$ is a positive integer. If this is purchasable, we can say $cn-dm=am+bn$ for some nonnegative integers $a, b$ . This can be rearranged into $(a+d)m=(c-b)n$ , which implies that $(a+d)$ is a multiple of $n$ (since $\gcd(m, n)=1$ ). We can say that $(a+d)=gn$ for some positive integer $g$ , and substitute to get $gmn=(c-b)n$ . Because $c < m$ , $(c-b)n < mn$ , and $gmn < mn$ . We divide by $mn$ to get $g<1$ . However, we defined $g$ to be a positive integer, and all positive integers are greater than or equal to $1$ . Therefore, we have a contradiction, and $cn$ is the least purchasable number congruent to $cn \bmod m$ . $\square$

This means that because $cn$ is purchasable, every number that is greater than $cn$ and congruent to it $\bmod m$ is also purchasable (because these numbers are in the form $am+bn$ where $b=c$ ). Another result of this Lemma is that $cn-m$ is the greatest number $\equiv cn \bmod m$ that is not purchasable. $c \leq m-1$ , so $cn-m \leq (m-1)n-m=mn-m-n$ , which shows that $mn-m-n$ is the greatest number in the form $cn-m$ . Any number greater than this and congruent to some $cn \bmod m$ is purchasable, because that number is greater than $cn$ . All numbers are congruent to some $cn$ , and thus all numbers greater than $mn-m-n$ are purchasable.

Putting it all together, we can say that for any coprime $m$ and $n$ , $mn-m-n$ is the greatest number not representable in the form $am + bn$ for nonnegative integers $a, b$ . $\square$

Corollary

This corollary is based off of Proof 2, so it is necessary to read that proof before this corollary. We prove the following lemma.

Lemma For any integer $k$ , exactly one of the integers $k$ , $mn-m-n-k$ is not purchasable.

Proof: Because every number is congruent to some residue of $m$ permuted by $n$ , we can set $k \equiv cn \bmod m$ for some $c$ . We can break this into two cases.

Case 1: $k \leq cn-m$ . This implies that $k$ is not purchasable, and that $mn-m-n-k \geq mn-m-n-cn = n(m-1-c)$ . $n(m-1-c)$ is a permuted residue, and a result of the lemma in Proof 2 was that a permuted residue is the least number congruent to itself $\bmod m$ that is purchasable. Therefore, $mn-m-n-k \equiv n(m-1-c) \bmod m$ and $mn-m-n-k \geq n(m-1-c)$ , so $mn-m-n-k$ is purchasable.

Case 2: $k > cn-m$ . This implies that $k$ is purchasable, and that $mn-m-n-k < mn-m-n-cn = n(m-1-c)$ . Again, because $n(m-1-c)$ is the least number congruent to itself $\bmod m$ that is purchasable, and because $mn-m-n-k \equiv n(m-1-c) \bmod m$ and $mn-m-n-k < n(m-1-c)$ , $mn-m-n-k$ is not purchasable.

We now limit the values of $k$ to all integers $0 \leq k \leq \frac{mn-m-n}{2}$ , which limits the values of $mn-m-n-k$ to $mn-m-n \geq mn-m-n-k \geq \frac{mn-m-n}{2}$ . Because $m$ and $n$ are coprime, only one of them can be a multiple of $2$ . Therefore, $mn-m-n \equiv (0)(1)-0-1 \equiv -1 \equiv 1 \bmod 2$ , showing that $\frac{mn-m-n}{2}$ is not an integer and that $\frac{mn-m-n-1}{2}$ and $\frac{mn-m-n+1}{2}$ are integers. We can now set equivalent limits on the values of $k$ and $mn-m-n-k$ so that they cover all integers form $0$ to $mn-m-n$ without overlap: $0 \leq k \leq \frac{mn-m-n-1}{2}$ and $\frac{mn-m-n+1}{2} \leq mn-m-n-k \leq mn-m-n$ . There are $\frac{mn-m-n-1}{2}+1=\frac{(m-1)(n-1)}{2}$ values of $k$ , and each is paired with a value of $mn-m-n-k$ , so we can make $\frac{(m-1)(n-1)}{2}$ different ordered pairs of the form $(k, mn-m-n-k)$ . The coordinates of these ordered pairs cover all integers from $0$ to $mn-m-n$ inclusive, and each contains exactly one not-purchasable integer, so that means that there are $\frac{(m-1)(n-1)}{2}$ different not-purchasable integers from $0$ to $mn-m-n$ . All integers greater than $mn-m-n$ are purchasable, so that means there are a total of $\frac{(m-1)(n-1)}{2}$ integers $\geq 0$ that are not purchasable.

In other words, for every pair of coprime integers $m, n$ , there are exactly $\frac{(m-1)(n-1)}{2}$ nonnegative integers that cannot be represented in the form $am + bn$ for nonnegative integers $a, b$ . $\square$

Generalization

If $m$ and $n$ are not coprime, then we can simply rearrange $am+bn$ into the form $\gcd(m,n) \left( a\frac{m}{\gcd(m,n)}+b\frac{n}{\gcd(m,n)} \right)$ $\frac{m}{\gcd(m,n)}$ and $\frac{n}{\gcd(m,n)}$ are coprime, so we apply Chicken McNugget to find a bound $\frac{mn}{\gcd(m,n)^{2}}-\frac{m}{\gcd(m,n)}-\frac{n}{\gcd(m,n)}$ We can simply multiply $gcd(m,n)$ back into the bound to get $\frac{mn}{\gcd(m,n)}-m-n=\textrm{lcm}(m, n)-m-n$ Therefore, all multiples of $\gcd(m, n)$ greater than $\textrm{lcm}(m, n)-m-n$ are representable in the form $am+bn$ for some positive integers $a, b$ .

Problems

Introductory

Marcy buys paint jars in containers of $2$ and $7$ . What's the largest number of paint jars that Marcy can't obtain?
Bay Area Rapid food sells chicken nuggets. You can buy packages of $11$ or $7$ . What is the largest integer $n$ such that there is no way to buy exactly $n$ nuggets? Can you Generalize ?(ACOPS)

Intermediate

Ninety-four bricks, each measuring $4''\times10''\times19'',$ are to stacked one on top of another to form a tower 94 bricks tall. Each brick can be oriented so it contributes $4''\,$ or $10''\,$ or $19''\,$ to the total height of the tower. How many different tower heights can be achieved using all ninety-four of the bricks? Source

Olympiad

On the real number line, paint red all points that correspond to integers of the form $81x+100y$ , where $x$ and $y$ are positive integers. Paint the remaining integer point blue. Find a point $P$ on the line such that, for every integer point $T$ , the reflection of $T$ with respect to $P$ is an integer point of a different colour than $T$ . (India TST)

Let $S$ be a set of integers (not necessarily positive) such that

(a) there exist $a,b \in S$ with $\gcd(a,b)=\gcd(a-2,b-2)=1$ ;

(b) if $x$ and $y$ are elements of $S$ (possibly equal), then $x^2-y$ also belongs to $S$ .

Prove that $S$ is the set of all integers. (USAMO)

@@ Line 53: / Line 53: @@
 <i>Proof</i>: Because every number is congruent to some residue of <math>m</math> permuted by <math>n</math>, we can set <math>k \equiv cn \bmod m</math> for some <math>c</math>. We can break this into two cases.
-<i>Case 1</i>: <math>k < cn-m</math>. This implies that <math>k</math> is not purchasable, and that <math>mn-m-n-k > mn-m-n-cn = n(m-1-c)-m</math>. <math>n(m-1-c)</math> is a permuted residue, and a result of the lemma in Proof 2 was that a permuted residue is the least number congruent to itself <math>\bmod m</math> that is purchasable. Therefore, <math>mn-m-n-k \equiv n(m-1-c) \bmod m</math> and <math>mn-m-n-k \geq n(m-1-c)</math>, so <math>mn-m-n-k</math> is purchasable.
+<i>Case 1</i>: <math>k \leq cn-m</math>. This implies that <math>k</math> is not purchasable, and that <math>mn-m-n-k \geq mn-m-n-cn = n(m-1-c)</math>. <math>n(m-1-c)</math> is a permuted residue, and a result of the lemma in Proof 2 was that a permuted residue is the least number congruent to itself <math>\bmod m</math> that is purchasable. Therefore, <math>mn-m-n-k \equiv n(m-1-c) \bmod m</math> and <math>mn-m-n-k \geq n(m-1-c)</math>, so <math>mn-m-n-k</math> is purchasable.
 <i>Case 2</i>: <math>k > cn-m</math>. This implies that <math>k</math> is purchasable, and that <math>mn-m-n-k < mn-m-n-cn = n(m-1-c)</math>. Again, because <math>n(m-1-c)</math> is the least number congruent to itself <math>\bmod m</math> that is purchasable, and because <math>mn-m-n-k \equiv n(m-1-c) \bmod m</math> and <math>mn-m-n-k < n(m-1-c)</math>, <math>mn-m-n-k</math> is not purchasable.

Page

Toolbox

Search