Chicken McNugget Theorem 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 .


If and are not relatively prime, then we can simply rearrange into the form

and are relatively prime, so we apply Chicken McNugget to find a bound

We can simply multiply back into the bound to get

Therefore, all multiples of greater than are representable in the form for some positive integers .