Difference between revisions of "Chicken McNugget Theorem"
Archimedes1 (talk | contribs) |
m |
||
| Line 1: | Line 1: | ||
| − | The '''Chicken McNugget Theorem''' states that for any two relatively prime positive | + | The '''Chicken McNugget Theorem''' 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>. |
| − | <math>mn-m-n</math>. | + | |
| + | ==See Also== | ||
| + | |||
| + | |||
| + | {{stub}} | ||
Revision as of 19:00, 16 July 2007
The Chicken McNugget Theorem states that for any two relatively prime positive integers 
, the greatest integer that cannot be written in the form 
for nonnegative integers 
is 
.
See Also
This article is a stub. Help us out by expanding it.
