Art of Problem Solving
AoPS Online
Math texts, online classes, and more
for students in grades 5-12.
Visit AoPS Online ‚
Books for Grades 5-12 Online Courses
Beast Academy
Engaging math books and online learning
for students ages 6-13.
Visit Beast Academy ‚
Books for Ages 6-13 Beast Academy Online
AoPS Academy
Small live classes for advanced math
and language arts learners in grades 2-12.
Visit AoPS Academy ‚
Find a Physical Campus Visit the Virtual Campus

Difference between revisions of "1995 IMO Problems/Problem 4"
m
 
(5 intermediate revisions by 2 users not shown)
Line 1: Line 1:
−
The positive real numbers <math>x_0, x_1, x_2, x_3, x_4.....x_{1994}, x_{1995}</math> satisfy the relations  
+
==Problem==
 +
 
 +
The positive real numbers <math>x_0, x_1, x_2,.....x_{1994}, x_{1995}</math> satisfy the relations  
  
 
<math>x_0=x_{1995}</math> and <math>x_{i-1}+\frac{2}{x_{i-1}}=2{x_i}+\frac{1}{x_i}</math>  
 
<math>x_0=x_{1995}</math> and <math>x_{i-1}+\frac{2}{x_{i-1}}=2{x_i}+\frac{1}{x_i}</math>  
Line 6: Line 8:
  
 
Find the maximum value that <math>x_0</math> can have.
 
Find the maximum value that <math>x_0</math> can have.
 +
 +
==Solution==
 +
First we start by solving for <math>x_{i}</math> in the recursive relation
 +
 +
<math>x_{i-1}+\frac{2}{x_{i-1}}=2x_{i}+\frac{1}{x_{i}}</math>
 +
 +
<math>\frac{x_{i-1}^{2}+2}{x_{i-1}}=\frac{2x_{i}^{2}+1}{x_{i}}</math>
 +
 +
<math>\left( x_{i} \right)\left( x_{i-1}^{2}+2 \right)=\left( x_{i-1} \right)\left( 2x_{i}^{2}+1 \right)</math>
 +
 +
<math>x_{i}x_{i-1}^{2}+2x_{i}=2x_{i-1}x_{i}^{2}+x_{i-1}</math>
 +
 +
<math>x_{i}x_{i-1}^{2}-2x_{i-1}x_{i}^{2}+2x_{i}-x_{i-1}=0</math>
 +
 +
<math>x_{i}x_{i-1}\left( x_{i-1} \right)-2x_{i}x_{i-1}\left( x_{i} \right)+2x_{i}-x_{i-1}=0</math>
 +
 +
<math>x_{i}x_{i-1}\left( x_{i-1} -2x_{i}\right)+2x_{i}-x_{i-1}=0</math>
 +
 +
<math>\left( 2x_{i}-x_{i-1}\right)\left( 1-x_{i}x_{i-1} \right)=0</math>
 +
 +
<math>x_{i}=\frac{x_{i-1}}{2},\;</math> or <math>x_{i}=\frac{1}{x_{i-1}}</math>
 +
 +
So we have two recursive properties to chose from.
 +
 +
If we want to maximize <math>x_{0}</math> then we can use <math>x_{i}=\frac{x_{i-1}}{2}</math> from <math>i=1</math> to <math>1994</math>.  This will make <math>x_{0}</math> the largest and <math>x_{1994}</math> the smallest.
 +
 +
Then we can simply use <math>x_{i}=\frac{1}{x_{i-1}}</math> to get <math>x_{1995}</math> since the reciprocal will make it very large.
 +
 +
Then we use <math>x_{0}=x_{1995}</math> and solve for <math>x_{0}</math>
 +
 +
This means that we can write <math>x_{i}</math> as:
 +
 +
<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>,
 +
 +
thus <math>x_{1995}=\frac{1}{x_{1994}}=\frac{2^{1994}}{x_0}={x_0}</math>
 +
 +
Solving for <math>{x_0}</math> we get:
 +
 +
<math>{x_0}^{2}=2^{1994}</math>
 +
 +
<math>{x_0}=\pm\sqrt{2^{1994}}=\pm2^{997}</math>.  Since all <math>{x_i}</math> are defined as positive, <math>{x_0}=2^{997}</math>.
 +
 +
Therefore, the maximum value that <math>x_0</math> can have is <math>{x_0}=2^{997}</math>
 +
 +
~ Tomas Diaz. orders@tomasdiaz.com
 +
 +
 +
 +
{{alternate solutions}}
 +
 +
 +
== See Also ==
 +
{{IMO box|year=1995|num-b=3|num-a=5}}

Latest revision as of 20:24, 4 July 2024

Problem

The positive real numbers $x_0, x_1, x_2,.....x_{1994}, x_{1995}$ satisfy the relations

$x_0=x_{1995}$ and $x_{i-1}+\frac{2}{x_{i-1}}=2{x_i}+\frac{1}{x_i}$

for $i=1,2,3,....1995$

Find the maximum value that $x_0$ can have.

Solution

First we start by solving for $x_{i}$ in the recursive relation

$x_{i-1}+\frac{2}{x_{i-1}}=2x_{i}+\frac{1}{x_{i}}$

$\frac{x_{i-1}^{2}+2}{x_{i-1}}=\frac{2x_{i}^{2}+1}{x_{i}}$

$\left( x_{i} \right)\left( x_{i-1}^{2}+2 \right)=\left( x_{i-1} \right)\left( 2x_{i}^{2}+1 \right)$

$x_{i}x_{i-1}^{2}+2x_{i}=2x_{i-1}x_{i}^{2}+x_{i-1}$

$x_{i}x_{i-1}^{2}-2x_{i-1}x_{i}^{2}+2x_{i}-x_{i-1}=0$

$x_{i}x_{i-1}\left( x_{i-1} \right)-2x_{i}x_{i-1}\left( x_{i} \right)+2x_{i}-x_{i-1}=0$

$x_{i}x_{i-1}\left( x_{i-1} -2x_{i}\right)+2x_{i}-x_{i-1}=0$

$\left( 2x_{i}-x_{i-1}\right)\left( 1-x_{i}x_{i-1} \right)=0$

$x_{i}=\frac{x_{i-1}}{2},\;$ or $x_{i}=\frac{1}{x_{i-1}}$

So we have two recursive properties to chose from.

If we want to maximize $x_{0}$ then we can use $x_{i}=\frac{x_{i-1}}{2}$ from $i=1$ to $1994$. This will make $x_{0}$ the largest and $x_{1994}$ the smallest.

Then we can simply use $x_{i}=\frac{1}{x_{i-1}}$ to get $x_{1995}$ since the reciprocal will make it very large.

Then we use $x_{0}=x_{1995}$ and solve for $x_{0}$

This means that we can write $x_{i}$ as:

$x_{i}=\begin{cases} \frac{x_{0}}{2^{i}} & 1 \le i \le 1994 \\ \frac{1}{x_{i-1}} & i=1995\end{cases}$

Then $x_{1994}=\frac{x_0}{2^{1994}}$,

thus $x_{1995}=\frac{1}{x_{1994}}=\frac{2^{1994}}{x_0}={x_0}$

Solving for ${x_0}$ we get:

${x_0}^{2}=2^{1994}$

${x_0}=\pm\sqrt{2^{1994}}=\pm2^{997}$. Since all ${x_i}$ are defined as positive, ${x_0}=2^{997}$.

Therefore, the maximum value that $x_0$ can have is ${x_0}=2^{997}$

~ 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
Retrieved from "https://artofproblemsolving.com/wiki/index.php?title=1995_IMO_Problems/Problem_4&oldid=221672"