Difference between revisions of "1995 IMO Problems/Problem 4"
(→Solution) |
(→Solution) |
||
Line 42: | Line 42: | ||
<math>x_{i}=\begin{cases} \frac{x_{0}}{2^{i}} & 1 \le i \le 1994 \\ \frac{1}{x_{i-1}} & i=1995\end{cases}</math> | <math>x_{i}=\begin{cases} \frac{x_{0}}{2^{i}} & 1 \le i \le 1994 \\ \frac{1}{x_{i-1}} & i=1995\end{cases}</math> | ||
− | Then <math>x_{1994}=\frac{x_0}{2^{1994}}</math>, <math>x_{1995}=\frac{1}{x_{1994}}=\frac{2^{1994}}{x_0}={x_0}</math> | + | Then <math>x_{1994}=\frac{x_0}{2^{1994}}</math>, |
+ | |||
+ | thus <math>x_{1995}=\frac{1}{x_{1994}}=\frac{2^{1994}}{x_0}={x_0}</math> | ||
Solving for <math>{x_0}</math> we get: | Solving for <math>{x_0}</math> we get: |
Revision as of 19:31, 18 November 2023
Problem
The positive real numbers satisfy the relations
and
for
Find the maximum value that can have.
Solution
First we start by solving for in the recursive relation
or
So we have two recursive properties to chose from.
If we want to maximize then we can use from to . This will make the largest and the smallest.
Then we can simply use to get since the reciprocal will make it very large.
Then we use and solve for
This means that we can write as:
Then ,
thus
Solving for we get:
Since all are defined as pisitive then,
~ Tomas Diaz. orders@tomasdiaz.com
Alternate solutions are always welcome. If you have a different, elegant solution to this problem, please add it to this page.
See Also
1995 IMO (Problems) • Resources | ||
Preceded by Problem 3 |
1 • 2 • 3 • 4 • 5 • 6 | Followed by Problem 5 |
All IMO Problems and Solutions |