Determine the maximum value
limit limit, maximum, threshold, constraint, cutoff point, check, ceiling, cap
of \[m^2+n^2\],where m and n are intergers satisfying \[m,n \in\left\{1,2,3...1981 \right\}\]and \[(n^2-mn-n^2)^2=1\]
last one is supposed to be\[(n^2-mn-m^2)^2=1\]
Are you sure you don't have to write a program for this?
no its says no calculator
NO calculator either. Wow, good luck playing with the combinations bro.
thanksi really need it
I'd be happy if I found an (n,m) combination that equaled 1. When you tack on finding the max value, that increases the difficulty even more. It wasn't enough to try to find (n,m) = 1. They had to get you to find the max value as well.
the question was likely asked in 1981
well let mesay whatyou can findcan help lot like finding ,max (n,m)
Calculators existed in 1981 bro
Even if you found max(n,m) the combination would still have to equal one
lol,and we had good mathematicieans before1800 before wolfram
Yeah, finding possible max values would be a good first strategy.
Yes, but it took them months to solve problems that it takes seconds to solve now.
They were good....for their time.
can i use calculus to optimise m^2+n^2
Yes, of course.
does that help
\[((n+m)^2-3mn)^2=1\]
I don't even know how you got that. I thought you were going to find derivative of m^2 + n^2
man this thing is heavy for me i am just trying sme random ideas
look at this http://www.artofproblemsolving.com/Wiki/index.php/1981_IMO_Problems/Problem_3
Bro, you were on the right track with finding the derivative of m^2 + n^2
did you see the link
seems to be Fibonacci
http://www.artofproblemsolving.com/Wiki/index.php/1981_IMO_Problems/Problem_3
@Hero see this
Join our real-time social learning platform and learn together with your friends!