1974 IMO Problems/Problem 5: Difference between revisions
No edit summary |
No edit summary |
||
| Line 4: | Line 4: | ||
==Solution== | ==Solution== | ||
Note that <cmath>2 = \frac{a}{a+b}+\frac{b}{a+b}+\frac{c}{c+d}+\frac{d}{c+d} > S > \frac{a}{a+b+c+d}+\frac{b}{a+b+c+d}+\frac{c}{a+b+c+d}+\frac{d}{a+b+c+d} = 1.</cmath> We will now prove that <math>S</math> can reach any range in between <math>1</math> and <math>2</math>. | Note that <cmath>2 = \frac{a}{a+b}+\frac{b}{a+b}+\frac{c}{c+d}+\frac{d}{c+d} > S > \frac{a}{a+b+c+d}+\frac{b}{a+b+c+d}+\frac{c}{a+b+c+d}+\frac{d}{a+b+c+d} = 1.</cmath> We will now prove that <math>S</math> can reach any range in between <math>1</math> and <math>2</math>. | ||
| Line 15: | Line 16: | ||
Notice that if we treat the numerator and denominator each as a quadratic in <math>y</math>, we will get <math>1 + \frac{g(x)}{2y^2 + 5xy + 2x^2}</math>, where <math>g(x)</math> has a degree lower than <math>2</math>. This means taking <math>\lim_{y\to\infty} 1 + \frac{g(x)}{2y^2 + 5xy + 2x^2} = 1</math>, which means <math>S</math> can be brought arbitrarily close to <math>1</math>. Therefore, we are done. | Notice that if we treat the numerator and denominator each as a quadratic in <math>y</math>, we will get <math>1 + \frac{g(x)}{2y^2 + 5xy + 2x^2}</math>, where <math>g(x)</math> has a degree lower than <math>2</math>. This means taking <math>\lim_{y\to\infty} 1 + \frac{g(x)}{2y^2 + 5xy + 2x^2} = 1</math>, which means <math>S</math> can be brought arbitrarily close to <math>1</math>. Therefore, we are done. | ||
<cmath> </cmath> | <cmath> </cmath> | ||
~Imajinary | ~Imajinary | ||
==Remarks (added by pf02, October 2025)== | |||
1. Strictly speaking, the solution given above is incomplete. | |||
It shows that <math>S</math> can be arbitrarily close to <math>1</math> and to <math>2</math>, | |||
but it does not show that <math>S</math> can take <math>\mathbf{any}</math> value | |||
in <math>(1, 2)</math>. This is not difficult to prove, but it is not | |||
obvious or trivial, so it should be mentioned. | |||
Here is an argument: Let <math>S_1</math> be given by <math>a_1, b_1, c_1, d_1</math> | |||
and let <math>S_2</math> be given by <math>a_2, b_2, c_2, d_2</math>. (Think of <math>S_1</math> | |||
close to <math>1</math> and <math>S_2</math> close to <math>2</math>). Let <math>a = (1 - t) a_1 + t a_2</math>, | |||
and similarly for <math>b, c, d</math>. Let <math>S(t)</math> be given by <math>a, b, c, d</math>. | |||
Clearly <math>S(t)</math> is a continuous function of <math>t</math>, <math>S(0) = S_1</math> and | |||
<math>S(1) = S_2</math>. By the [[Intermediate Value Theorem]] for any | |||
<math>S \in [S_1, S_2]</math> there is <math>t</math>, such that <math>S(t) = S</math>. | |||
2. Motivation for the solution: Take <math>a, b, c, d</math> of the same | |||
magnitude, for example <math>a = b = c = d = 1</math>. Then <math>S = 1.333\dots\ .</math> | |||
Now take <math>a, b</math> being of higher magnitude than <math>c, d</math>, for example | |||
<math>a = b = 1000</math>, <math>c = d = 1</math>. We get <math>S = 1.001\dots\ .</math> And, take | |||
<math>a, c</math> of higher magnitude than <math>b, d</math>, for example <math>a = c = 1000</math>, | |||
<math>b = d = 1</math>. We get <math>S = 1.997\dots\ .</math> | |||
Take a few more examples if desired. This suggests <math>1 < S < 2</math>, | |||
and that we can get values as close to <math>1</math> and <math>2</math> as we want. | |||
3. I will give another solution below. It is computationally more | |||
involved, but conceptually simpler, and it uses no calculus. | |||
==Solution 2== | |||
== See Also == {{IMO box|year=1974|num-b=4|num-a=6}} | == See Also == {{IMO box|year=1974|num-b=4|num-a=6}} | ||
Revision as of 12:55, 14 October 2025
Problem 5
Determine all possible values of
where
are arbitrary positive numbers.
Solution
Note that
We will now prove that
can reach any range in between
and
.
Choose any positive number
. For some variables such that
and
, let
,
, and
. Plugging this back into the original fraction, we get
The above equation can be further simplified to
Note that
is a continuous function and that
is a strictly increasing function. We can now decrease
and
to make
tend arbitrarily close to
. We see
, meaning
can be brought arbitrarily close to
.
Now, set
and
for some positive real numbers
. Then
Notice that if we treat the numerator and denominator each as a quadratic in
, we will get
, where
has a degree lower than
. This means taking
, which means
can be brought arbitrarily close to
. Therefore, we are done.
~Imajinary
Remarks (added by pf02, October 2025)
1. Strictly speaking, the solution given above is incomplete.
It shows that
can be arbitrarily close to
and to
,
but it does not show that
can take
value
in
. This is not difficult to prove, but it is not
obvious or trivial, so it should be mentioned.
Here is an argument: Let
be given by
and let
be given by
. (Think of
close to
and
close to
). Let
,
and similarly for
. Let
be given by
.
Clearly
is a continuous function of
,
and
. By the Intermediate Value Theorem for any
there is
, such that
.
2. Motivation for the solution: Take
of the same
magnitude, for example
. Then
Now take
being of higher magnitude than
, for example
,
. We get
And, take
of higher magnitude than
, for example
,
. We get
Take a few more examples if desired. This suggests
,
and that we can get values as close to
and
as we want.
3. I will give another solution below. It is computationally more involved, but conceptually simpler, and it uses no calculus.
Solution 2
See Also
| 1974 IMO (Problems) • Resources | ||
| Preceded by Problem 4 |
1 • 2 • 3 • 4 • 5 • 6 | Followed by Problem 6 |
| All IMO Problems and Solutions | ||