Difference between revisions of "1961 IMO Problems/Problem 1"
m (→Solution 2) |
(→Solution 2) |
||
(2 intermediate revisions by the same user not shown) | |||
Line 49: | Line 49: | ||
==Solution 2== | ==Solution 2== | ||
− | The third equation implies that <math>x,z,y</math> is a geometric sequence. Then let <math>x=\frac{z}{r}</math> and <math>y=rz</math>, with <math>r | + | Obviously, <math>a=x+y+z>0</math>. The third equation implies that <math>x,z,y</math> is a geometric sequence. Then let <math>x=\frac{z}{r}</math> and <math>y=rz</math>, with <math>r,z>0</math> and <math>r\neq1</math>. Then the first two equations become: |
<cmath>\left(r+1+\frac{1}{r}\right)z=a~~~(1)</cmath> | <cmath>\left(r+1+\frac{1}{r}\right)z=a~~~(1)</cmath> | ||
and | and | ||
− | <cmath>(r^2+1+\frac{1}{r^2})z^2=b^2~~~(2)</cmath> | + | <cmath>\left(r^2+1+\frac{1}{r^2}\right)z^2=b^2~~~(2)</cmath> |
− | Taking <math>\frac{(2)}{(1)}</math>, we get: | + | Taking <math>\frac{(2)}{(1)}</math> (since <math>z>0</math>), we get: |
<cmath>\frac{(r^2+1+\frac{1}{r^2})z^2}{(r+1+\frac{1}{r})z}=\left(r-1+\frac{1}{r}\right)z=\frac{b^2}{a}~~~(3)</cmath> | <cmath>\frac{(r^2+1+\frac{1}{r^2})z^2}{(r+1+\frac{1}{r})z}=\left(r-1+\frac{1}{r}\right)z=\frac{b^2}{a}~~~(3)</cmath> | ||
We can then take <math>(1)^2-(2)</math> and <math>(2)-(3)^2</math> to get: | We can then take <math>(1)^2-(2)</math> and <math>(2)-(3)^2</math> to get: | ||
+ | <cmath>\left(r^2+2r+3+\frac{2}{r}+\frac{1}{r^2}\right)z^2-\left(r^2+1+\frac{1}{r^2}\right)z^2=2z^2\left(r+1+\frac{1}{r}\right)=a^2-b^2~~~(4)</cmath> | ||
+ | and | ||
+ | <cmath>\left(r^2+1+\frac{1}{r^2}\right)z^2-\left(r^2-2r+3-\frac{2}{r}+\frac{1}{r^2}\right)z^2=2z^2\left(r-1+\frac{1}{r}\right)=b^2-\frac{b^4}{a^2}=\frac{b^2}{a^2}(a^2-b^2)~~~(5)</cmath> | ||
+ | Let <math>k=r+\frac{1}{r}</math>. By AM-GM, <math>k\ge2</math> with equality at <math>r=\frac{1}{r}\implies r=1</math>, which is impossible. Hence, <math>k>2</math>. Then, <math>\frac{(5)}{(4)}</math> becomes: | ||
+ | <cmath>\frac{k-1}{k+1}=\frac{b^2}{a^2}~(6)\implies a^2+b^2=(a^2-b^2)k>2(a^2-b^2)\implies3b^2>a^2</cmath> | ||
+ | From the above restrictions on <math>a</math> and <math>b</math>, we see that there must exist some <math>k>2</math> satisfying <math>(6)</math>, and hence, some <math>r>0\neq1</math> satisfying <math>(6)</math>. From <math>(4)</math>, if <math>a^2-b^2>0</math>, then there must exist some positive <math>z</math> satisfying <math>(4)</math>, and consequently since <math>(4)</math> and <math>(6)</math> are equivalent to the remaining equations, they satisfy <math>(1)</math> and <math>(2)</math>. Hence, <math>x,y,z</math> satisfy the original system, and from the restrictions on <math>r</math> and <math>z</math>, they are distinct positive reals. Hence, <math>\boxed{a>0\text{ and }3b^2>a^2>b^2}</math>. <math>\blacksquare</math> | ||
+ | |||
+ | ~rhydon516 | ||
+ | |||
===Video Solution=== | ===Video Solution=== | ||
https://www.youtube.com/watch?v=_stCjNU0_M4&list=PLa8j0YHOYQQJGzkvK2Sm00zrh0aIQnof8&index=3 | https://www.youtube.com/watch?v=_stCjNU0_M4&list=PLa8j0YHOYQQJGzkvK2Sm00zrh0aIQnof8&index=3 |
Latest revision as of 17:15, 26 March 2024
Problem
(Hungary) Solve the system of equations:
where and are constants. Give the conditions that and must satisfy so that (the solutions of the system) are distinct positive numbers.
Solution 1
Note that , so the first two equations become
.
We note that , so if equals 0, then must also equal 0. We then have ; . This gives us . Mutiplying both sides by , we have . Since we want to be real, this implies . But can only equal 0 when (which, in this case, implies ). Hence there are no positive solutions when .
When , we divide by to obtain the system of equations
,
which clearly has solution , . In order for these both to be positive, we must have positive and . Now, we have ; , so are the roots of the quadratic . The discriminant for this equation is
.
If the expressions were simultaneously negative, then their sum, , would also be negative, which cannot be. Therefore our quadratic's discriminant is positive when and . But we have already replaced the first inequality with the sharper bound . It is clear that both roots of the quadratic must be positive if the discriminant is positive (we can see this either from or from Descartes' Rule of Signs). We have now found the solutions to the system, and determined that it has positive solutions if and only if is positive and . Q.E.D.
Solution 2
Obviously, . The third equation implies that is a geometric sequence. Then let and , with and . Then the first two equations become: and Taking (since ), we get: We can then take and to get: and Let . By AM-GM, with equality at , which is impossible. Hence, . Then, becomes: From the above restrictions on and , we see that there must exist some satisfying , and hence, some satisfying . From , if , then there must exist some positive satisfying , and consequently since and are equivalent to the remaining equations, they satisfy and . Hence, satisfy the original system, and from the restrictions on and , they are distinct positive reals. Hence, .
~rhydon516
Video Solution
https://www.youtube.com/watch?v=_stCjNU0_M4&list=PLa8j0YHOYQQJGzkvK2Sm00zrh0aIQnof8&index=3 - AMBRIGGS
https://youtu.be/e5cuvmW0clk [Video Solution by little fermat]
Alternate solutions are always welcome. If you have a different, elegant solution to this problem, please add it to this page.
1961 IMO (Problems) • Resources | ||
Preceded by First question |
1 • 2 • 3 • 4 • 5 • 6 | Followed by Problem 2 |
All IMO Problems and Solutions |