×

# Chicken McNuggets Theorem

It states that if gcd(m,n)=1 and m,n are natural numbers, then the largest number that cannot be written as the sum am+bn, where a,b are non-negative integers, is mn-m-n. Also, the number of mumbers that cannot be written in this form is (m-1)(n-1)/2. How does one prove this?

Note by Shourya Pandey
3 years, 10 months ago

Sort by:

Its a nice theorem , and P14 in 104 number theory problems . For the proof , this link would help: AOPS-Chicken McNugget Theorem · 3 years, 10 months ago

Can you add this to the Brilliant Wiki of Chicken Mcnugget Theorem? Thanks! Staff · 2 years, 3 months ago