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 "2008 IMO Problems/Problem 2"

(→‎Solution)
 
(2 intermediate revisions by one other user not shown)
Line 30: Line 30:
 
Expressing <math>\alpha</math> from the first equation and substituting into the second, we get
 
Expressing <math>\alpha</math> from the first equation and substituting into the second, we get
 
<cmath>\beta\gamma + ( \beta+\gamma ) ( -1 - \beta -\gamma ) = 0</cmath>
 
<cmath>\beta\gamma + ( \beta+\gamma ) ( -1 - \beta -\gamma ) = 0</cmath>
−
as the sole equation we need to satisfy in rational numbers.
+
as the sole condition we need to satisfy in rational numbers.
  
 
If <math>\beta = \frac{b}{m}</math> and <math>\gamma = \frac{c}{m}</math> for some integers <math>b</math>,<math>c</math>,and <math>m</math>, they would need to satisfy
 
If <math>\beta = \frac{b}{m}</math> and <math>\gamma = \frac{c}{m}</math> for some integers <math>b</math>,<math>c</math>,and <math>m</math>, they would need to satisfy
 
<cmath>bc = m(b+c)+(b+c)^2 \Leftrightarrow m = \frac{bc}{b+c} - (b+c).</cmath>
 
<cmath>bc = m(b+c)+(b+c)^2 \Leftrightarrow m = \frac{bc}{b+c} - (b+c).</cmath>
−
That means we would like <math>b+c</math> to divide <math>bc</math>.
+
For <math>m</math> to be integer, we would like <math>b+c</math> to divide <math>bc</math>.
 
Consider the example
 
Consider the example
 
<cmath>b=t, c=t^2-t, m = t-1-t^2,</cmath>
 
<cmath>b=t, c=t^2-t, m = t-1-t^2,</cmath>
 
where <math>b+c = t^2</math> divides <math>bc = t(t^2-t)</math> for any integer <math>t \ne 0</math>. Substituting back, that gives us
 
where <math>b+c = t^2</math> divides <math>bc = t(t^2-t)</math> for any integer <math>t \ne 0</math>. Substituting back, that gives us
−
<cmath>\beta = \frac{t}{t-1-t^2}, \gamma = \frac{t^2-1}{t-1-t^2}, \alpha = \frac{1-t}{t-1-t^2},</cmath>
+
<cmath>\beta = \frac{t}{t-1-t^2},\quad
 +
\gamma = \frac{t^2-t}{t-1-t^2},\quad
 +
\alpha = \frac{1-t}{t-1-t^2}.</cmath>
 +
A simple check shows that <math>\alpha,\beta,\gamma</math> are rational and well defined and that <math>p=-1</math> and <math>q=0</math> for ''any'' integer <math>t</math> (even for <math>t=0</math>).
 +
 
 +
Moreover, from <math>\lim_{t\rightarrow +\infty} \beta = 0</math> and <math>\beta < 0</math> for large <math>t</math>, we see that infinitely many <math>t</math> generate infinitely many ''different'' triplets of <math>\alpha</math>, <math>\beta</math>, and <math>\gamma</math>. That completes the proof of part '''(ii)'''.
 +
--[[User:Vbarzov|Vbarzov]] 03:03, 5 September 2008 (UTC)
 +
 
 +
==See Also==
 +
 
 +
{{IMO box|year=2008|num-b=1|num-a=3}}

Latest revision as of 00:09, 19 November 2023

Problem 2

(i) If $x$, $y$ and $z$ are three real numbers, all different from $1$, such that $xyz = 1$, then prove that $\frac {x^{2}}{\left(x - 1\right)^{2}} + \frac {y^{2}}{\left(y - 1\right)^{2}} + \frac {z^{2}}{\left(z - 1\right)^{2}} \geq 1$. (With the $\sum$ sign for cyclic summation, this inequality could be rewritten as $\sum \frac {x^{2}}{\left(x - 1\right)^{2}} \geq 1$.)

(ii) Prove that equality is achieved for infinitely many triples of rational numbers $x$, $y$ and $z$.


Solution

Consider the transormation $f:\mathbb{R}/\{1\} \rightarrow \mathbb{R}/\{-1\}$ defined by $f(u) = \frac{u}{1-u}$ and put $\alpha = f(x), \beta = f(y), \gamma = f(z)$. Since $f$ is also one-to one from $\mathbb{Q}/\{1\}$ to $\mathbb{Q}/\{-1\}$, the problem is equivalent to showing that \[\alpha^2+\beta^2+\gamma^2 \ge 1 \quad (1)\] subject to \[\left(\frac{\alpha}{\alpha+1}\right) \left(\frac{\beta}{\beta+1}\right) \left(\frac{\gamma}{\gamma+1}\right) = 1 \quad (2)\] and that equallity holds for infinitely many triplets of rational $\alpha,\beta,\gamma$.

Now, rewrite (2) as $\alpha\beta\gamma = (1+\alpha)(1+\beta)(1+\gamma)$ and express it as \[0 = 1 + p + q\] where $p=\alpha+\beta+\gamma$ and $q = \alpha\beta+\beta\gamma+\gamma\alpha$. Notice that (1) can be written as \[p^2-2q \ge 1.\] But from $p = -1-q$, we get \[p^2-2q = (1+q)^2-2q = 1 + q^2 \ge 1,\] with equality holding iff $q = 0$. That proves part (i) and points us in the direction of looking for rational $\alpha,\beta,\gamma$ for which $q=0$ and (hence) $p=-1$, that is: \begin{align*} \alpha+\beta+\gamma & = -1\\ \alpha\beta+\beta\gamma+\gamma\alpha & = 0 \end{align*} Expressing $\alpha$ from the first equation and substituting into the second, we get \[\beta\gamma + ( \beta+\gamma ) ( -1 - \beta -\gamma ) = 0\] as the sole condition we need to satisfy in rational numbers.

If $\beta = \frac{b}{m}$ and $\gamma = \frac{c}{m}$ for some integers $b$,$c$,and $m$, they would need to satisfy \[bc = m(b+c)+(b+c)^2 \Leftrightarrow m = \frac{bc}{b+c} - (b+c).\] For $m$ to be integer, we would like $b+c$ to divide $bc$. Consider the example \[b=t, c=t^2-t, m = t-1-t^2,\] where $b+c = t^2$ divides $bc = t(t^2-t)$ for any integer $t \ne 0$. Substituting back, that gives us \[\beta = \frac{t}{t-1-t^2},\quad \gamma = \frac{t^2-t}{t-1-t^2},\quad \alpha = \frac{1-t}{t-1-t^2}.\] A simple check shows that $\alpha,\beta,\gamma$ are rational and well defined and that $p=-1$ and $q=0$ for any integer $t$ (even for $t=0$).

Moreover, from $\lim_{t\rightarrow +\infty} \beta = 0$ and $\beta < 0$ for large $t$, we see that infinitely many $t$ generate infinitely many different triplets of $\alpha$, $\beta$, and $\gamma$. That completes the proof of part (ii). --Vbarzov 03:03, 5 September 2008 (UTC)

See Also

2008 IMO (Problems) • Resources
Preceded by
Problem 1 		1 • 2 • 3 • 4 • 5 • 6 Followed by
Problem 3
All IMO Problems and Solutions
Retrieved from "https://artofproblemsolving.com/wiki/index.php?title=2008_IMO_Problems/Problem_2&oldid=204529"