Maths Olympiad Prep

Library / International Mathematical Olympiad /20 of 110

International Mathematical Olympiad

Algebra Difficulty 7.9 National Olympiad, round 2 Prove it China

Prove that
x2(x−1)2+y2(y−1)2+z2(z−1)2≥1, \frac{x^2}{(x-1)^2} + \frac{y^2}{(y-1)^2} + \frac{z^2}{(z-1)^2} \ge 1,
for all real numbers xx, yy, zz, each different from 11, and satisfying xyz=1xyz = 1.

(2) Prove that the equality holds for infinitely many triples of rational numbers xx, yy, zz, each different from 11, and satisfying xyz=1xyz = 1.

Solutions — 2

Solution 1

(1) Let
xx−1=a,yy−1=b,zz−1=c, \frac{x}{x-1} = a, \frac{y}{y-1} = b, \frac{z}{z-1} = c,
then
x=aa−1,y=bb−1,z=cc−1. x = \frac{a}{a-1}, \quad y = \frac{b}{b-1}, \quad z = \frac{c}{c-1}.
Since xyz=1xyz = 1, we have
abc=(a−1)(b−1)(c−1), abc = (a-1)(b-1)(c-1),
that is
a+b+c−1=ab+bc+ca. a + b + c - 1 = ab + bc + ca.
Therefore
a2+b2+c2=(a+b+c)2−2(ab+bc+ca)=(a+b+c)2−2(a+b+c−1)=(a+b+c−1)2+1≥1. \begin{aligned} a^2 + b^2 + c^2 &= (a + b + c)^2 - 2(ab + bc + ca) \\ &= (a + b + c)^2 - 2(a + b + c - 1) \\ &= (a + b + c - 1)^2 + 1 \\ &\ge 1. \end{aligned}
So
x2(x−1)2+y2(y−1)2+z2(z−1)2≥1. \frac{x^2}{(x-1)^2} + \frac{y^2}{(y-1)^2} + \frac{z^2}{(z-1)^2} \ge 1.

(2) Take (x,y,z)=(−k(k−1)2,k−k2,k−1k2)(x, y, z) = \left(-\frac{k}{(k-1)^2}, k - k^2, \frac{k-1}{k^2}\right), kk is an integer, then (x,y,z)(x, y, z) is a triple of rational numbers, with xx, yy, zz each different from 11. What is more, a different integer kk gives a different triple of rational numbers.
x2(x−1)2+y2(y−1)2+z2(z−1)2=k2(k2−k+1)2+(k−k2)2(k2−k+1)2+(k−1)2(k2−k+1)2=k4−2k3+3k2−2k+1(k2−k+1)2=1. \begin{aligned} & \frac{x^2}{(x-1)^2} + \frac{y^2}{(y-1)^2} + \frac{z^2}{(z-1)^2} \\ &= \frac{k^2}{(k^2 - k + 1)^2} + \frac{(k - k^2)^2}{(k^2 - k + 1)^2} + \frac{(k-1)^2}{(k^2 - k + 1)^2} \\ &= \frac{k^4 - 2k^3 + 3k^2 - 2k + 1}{(k^2 - k + 1)^2} = 1. \end{aligned}
So the problem is proved.

Solution 2

(1) By xyz=1xyz = 1, let p=xp = x, q=1q = 1, r=1yr = \frac{1}{y}, then x=pqx = \frac{p}{q}, y=qry = \frac{q}{r}, z=1xy=rpz = \frac{1}{xy} = \frac{r}{p}, where pp, qq, rr are different from each other. We have
x2(x−1)2+y2(y−1)2+z2(z−1)2≥1⇔p2(p−q)2+q2(q−r)2+r2(r−p)2≥1.① \begin{aligned} \frac{x^2}{(x-1)^2} + \frac{y^2}{(y-1)^2} + \frac{z^2}{(z-1)^2} &\ge 1 \\ \Leftrightarrow \frac{p^2}{(p-q)^2} + \frac{q^2}{(q-r)^2} + \frac{r^2}{(r-p)^2} &\ge 1. \end{aligned} \quad ①
Let
a=pp−q,b=qq−r,c=rr−p, a = \frac{p}{p-q}, \quad b = \frac{q}{q-r}, \quad c = \frac{r}{r-p},
after the substitution, ① reduces to ∑a2≥1\sum a^2 \ge 1. Since
−1+aa=qp,−1+bb=rq,−1+cc=pr, \frac{-1 + a}{a} = \frac{q}{p}, \quad \frac{-1 + b}{b} = \frac{r}{q}, \quad \frac{-1 + c}{c} = \frac{p}{r},
therefore
−1+aa⋅−1+bb⋅−1+cc=1,1−∑a+∑ab=0.② \begin{aligned} & \frac{-1 + a}{a} \cdot \frac{-1 + b}{b} \cdot \frac{-1 + c}{c} = 1, \\ & 1 - \sum a + \sum ab = 0. \end{aligned} \quad ②
By ②, we get
1−∑a2=−(a+b+c−1)2≤0, 1 - \sum a^2 = -(a + b + c - 1)^2 \le 0,
so ∑a2≥1\sum a^2 \ge 1. Hence ① holds.

(2) Let b=t2+tt2+t+1b = \frac{t^2 + t}{t^2 + t + 1}, c=t+1t2+t+1c = \frac{t + 1}{t^2 + t + 1}, a=−bcb+ca = -\frac{bc}{b + c}, here tt can be any rational number except 00 and −1-1. While tt varies, only finitely many of tt values can make bb, cc, aa be 11. That is, there are infinitely many triples of rational numbers aa, bb, cc each different from 11, satisfying ∑a=∑a2=1\sum a = \sum a^2 = 1. By
(x,y,z)=(aa−1,bb−1,cc−1), (x, y, z) = \left( \frac{a}{a-1}, \frac{b}{b-1}, \frac{c}{c-1} \right),
(2) holds.

Want a route through all this instead of an archive? The track puts 2,604 problems in a working order, from Junior Challenge level to the IMO shortlist.

Source: MathNet, licensed CC-BY-4.0. Statement reproduced verbatim; metadata (topic, difficulty) added by this project.