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?

## Comments

Sort by:

TopNewestIts a nice theorem , and P14 in 104 number theory problems . For the proof , this link would help: AOPS-Chicken McNugget Theorem – Shivang Jindal · 4 years ago

Log in to reply

Chicken Mcnugget Theorem? Thanks! – Calvin Lin Staff · 2 years, 5 months ago

Can you add this to the Brilliant Wiki ofLog in to reply

– Shivang Jindal · 2 years, 5 months ago

Sure , i will add , with good description in 3-4 days.Log in to reply