# Difference between revisions of "User:Vqbc/Testing"

Line 10: | Line 10: | ||

0\mod{m}&1\mod{m}&2\mod{m}&...&...&...&(m-1)\mod{m}\\ | 0\mod{m}&1\mod{m}&2\mod{m}&...&...&...&(m-1)\mod{m}\\ | ||

\hline | \hline | ||

+ | \cancel{0n}&1&2&&...&&m-1\\ | ||

+ | \cancel{0n+m}&...&&\vdots&&...&\\ | ||

+ | \cancel{0n+2m}&...&&\cancel{1n}&&...&\\ | ||

\end{array}</math> | \end{array}</math> |

## Revision as of 14:28, 21 September 2020

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

There are many stories surrounding the origin of the Chicken McNugget theorem. However, the most popular by far remains that of the Chicken McNugget. Originally, McDonald's sold its nuggets in packs of 9 and 20. Math enthusiasts were curious to find the largest number of nuggets that could not have been bought with these packs, thus creating the Chicken McNugget Theorem (the answer worked out to be 151 nuggets). The Chicken McNugget Theorem has also been called the Frobenius Coin Problem or the Frobenius Problem, after German mathematician Ferdinand Frobenius inquired about the largest amount of currency that could not have been made with certain types of coins.

## Proof Without Words