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?
Easy Math Editor
This discussion board is a place to discuss our Daily Challenges and the math and science related to those challenges. Explanations are more than just a solution — they should explain the steps and thinking strategies that you used to obtain the solution. Comments should further the discussion of math and science.
When posting on Brilliant:
*italics*
or_italics_
**bold**
or__bold__
paragraph 1
paragraph 2
[example link](https://brilliant.org)
> This is a quote
\(
...\)
or\[
...\]
to ensure proper formatting.2 \times 3
2^{34}
a_{i-1}
\frac{2}{3}
\sqrt{2}
\sum_{i=1}^3
\sin \theta
\boxed{123}
Comments
Its a nice theorem , and P14 in 104 number theory problems . For the proof , this link would help: AOPS-Chicken McNugget Theorem
Log in to reply
Can you add this to the Brilliant Wiki of Chicken Mcnugget Theorem? Thanks!
Log in to reply
Sure , i will add , with good description in 3-4 days.