Difference between revisions of "2001 IMO Shortlist Problems/N2"
Fibonacci97 (talk | contribs) (→Solution) |
Aditya1135 (talk | contribs) m (→Problem) |
||
Line 1: | Line 1: | ||
== Problem == | == Problem == | ||
− | Consider the system <math>x + y = z + u,</math> <math>2xy | + | Consider the system <math>x + y = z + u,</math> <math>2xy = zu.</math> Find the greatest value of the real constant <math>m</math> such that <math>m \leq x/y</math> for any positive integer solution <math>(x,y,z,u)</math> of the system, with <math>x \geq y</math>. |
==Solution== | ==Solution== |
Latest revision as of 13:38, 1 September 2017
Problem
Consider the system Find the greatest value of the real constant such that for any positive integer solution of the system, with .
Solution
First consider the real solutions to the system. We have by AM-GM that and substituting we get . Squaring and simplifying and dividing by , we get the inequality , where . Then , so or . Since , we discard the second inequality and have that is a lower bound for
This bound is also attainable for real values when . Since is dense, it is always possible to assign rational values to and so that approaches , though equality is never reached. From any rational solution, it is possible to create an integer solution by multiplying by the least common multiple of the denominators and keep the same value of . Thus, .