Difference between revisions of "Chicken McNugget Theorem"
m |
m (Frobenius) |
||
Line 1: | Line 1: | ||
− | The '''Chicken McNugget Theorem''' (or '''Postage Stamp Problem''' or '''Coin Problem''') states that for any two [[relatively prime]] [[positive integer]]s <math>m,n</math>, the greatest integer that cannot be written in the form <math>am + bn</math> for [[nonnegative]] integers <math>a, b</math> is <math>mn-m-n</math>. | + | The '''Chicken McNugget Theorem''' (or '''Postage Stamp Problem''' or '''Frobenius Coin Problem''') states that for any two [[relatively prime]] [[positive integer]]s <math>m,n</math>, the greatest integer that cannot be written in the form <math>am + bn</math> for [[nonnegative]] integers <math>a, b</math> is <math>mn-m-n</math>. |
A consequence of the theorem is that there are exactly <math>\frac{(m - 1)(n - 1)}{2}</math> positive integers which cannot be expressed in the form <math>am + bn</math>. The proof is based on the fact that in each pair of the form <math>(k, (m - 1)(n - 1) - k+1)</math>, exactly one element is expressible. | A consequence of the theorem is that there are exactly <math>\frac{(m - 1)(n - 1)}{2}</math> positive integers which cannot be expressed in the form <math>am + bn</math>. The proof is based on the fact that in each pair of the form <math>(k, (m - 1)(n - 1) - k+1)</math>, exactly one element is expressible. |
Revision as of 23:54, 10 July 2014
The Chicken McNugget Theorem (or Postage Stamp Problem or Frobenius Coin Problem) states that for any two relatively prime positive integers , the greatest integer that cannot be written in the form
for nonnegative integers
is
.
A consequence of the theorem is that there are exactly positive integers which cannot be expressed in the form
. The proof is based on the fact that in each pair of the form
, 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
Definition. An integer will be called purchasable if there exist nonnegative integers
such that
.
We would like to prove that is the largest non-purchasable integer. We are required to show that (1)
is non-purchasable, and (2) every
is purchasable.
Note that all purchasable integers are nonnegative, thus the set of non-purchasable integers is nonempty.
Lemma. Let be the set of solutions
to
. Then
for any
.
Proof: By Bezout's Lemma, there exist integers such that
. Then
. Hence
is nonempty. It is easy to check that
for all
. We now prove that there are no others. Suppose
and
are solutions to
. Then
implies
. Since
and
are coprime and
divides
,
divides
and
. Similarly
. Let
be integers such that
and
. Then
implies
. We have the desired result.
Lemma. For any integer , there exists unique
such that
.
Proof: By the division algorithm, there exists such that
.
Lemma. is purchasable if and only if
.
Proof: If , then we may simply pick
so
is purchasable. If
, then
if
and
if
, hence at least one coordinate of
is negative for all
. Thus
is not purchasable.
Thus the set of non-purchasable integers is . We would like to find the maximum of this set.
Since both
are positive, the maximum is achieved when
and
so that
.
Problems
Introductory
- Marcy buys paint jars in containers of
and
. 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
or
. What is the largest integer
such that there is no way to buy exactly
nuggets? Can you Generalize ?(ACOPS)
Intermediate
- Ninety-four bricks, each measuring
are to stacked one on top of another to form a tower 94 bricks tall. Each brick can be oriented so it contributes
or
or
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
, where
and
are positive integers. Paint the remaining integer point blue. Find a point
on the line such that, for every integer point
, the reflection of
with respect to
is an integer point of a different colour than
. (India TST)