Maths Olympiad Prep

Library / /469 of 520

Algebra Difficulty 7.5 National olympiad, round 2 Prove it

Example 2.1.14 Let a,b,c,da, b, c, d be four positive real numbers, and satisfy r4=abcdr^{4}=a b c d. Prove the following inequality: ab+1a+1+bc+1b+c+cd+1c+1+da+1d+14(1+r2)1+r\frac{a b+1}{a+1}+\frac{b c+1}{b+c}+\frac{c d+1}{c+1}+\frac{d a+1}{d+1} \geq \frac{4\left(1+r^{2}\right)}{1+r} \quad (Vasile Cirtoaje, Crux )

Solution

To prove: Given the conditions, there exist four positive real numbers x,y,z,tx, y, z, t satisfying
a=ryx,b=rzy,c=rtz,d=rxta=\frac{r y}{x}, b=\frac{r z}{y}, c=\frac{r t}{z}, d=\frac{r x}{t}

The inequality then becomes the following form

We need to prove A+(r21)B4(r2+1)r+1A+\left(r^{2}-1\right) B \geq \frac{4\left(r^{2}+1\right)}{r+1}, where
A=cycx+zry+x;B=cyczry+xA=\sum_{c y c} \frac{x+z}{r y+x} ; \quad B=\sum_{c y c} \frac{z}{r y+x}

By the AM-GM inequality, we have
4rcycxy+8(xz+yt)=[4(r1)(x+z)(y+t)]+4[(x+z)(y+t)+2(xz+yt)](r1)(cycx)2+2(cycx)2=(r+1)(cycx)2\begin{array}{l} 4 r \sum_{c y c} x y+8(x z+y t)=[4(r-1)(x+z)(y+t)]+4[(x+z)(y+t)+2(x z+y t)] \\ \leq(r-1)\left(\sum_{c y c} x\right)^{2}+2\left(\sum_{c y c} x\right)^{2}=(r+1)\left(\sum_{c y c} x\right)^{2} \end{array}

According to the Cauchy-Schwarz inequality, and noting that r1r \geq 1, we have
A=(x+z)(1ry+x+1rt+z)+(y+t)(1rx+y+1rz+t)4(x+z)x+z+ry+rt+4(y+t)y+t+rx+rz4(x+y+z+t)2(x+z)2+(y+t)2+2r(x+z)(y+t)8r+1B(x+y+z+t)2z(ry+x)+t(rz+y)+x(rt+z)+y(rx+t)(x+y+z+t)2r(xy+yz+zt+tx)+2(xz+yt)4r+1\begin{array}{l} A=(x+z)\left(\frac{1}{r y+x}+\frac{1}{r t+z}\right)+(y+t)\left(\frac{1}{r x+y}+\frac{1}{r z+t}\right) \geq \frac{4(x+z)}{x+z+r y+r t}+\frac{4(y+t)}{y+t+r x+r z} \\ \geq \frac{4(x+y+z+t)^{2}}{(x+z)^{2}+(y+t)^{2}+2 r(x+z)(y+t)} \geq \frac{8}{r+1} \\ B \geq \frac{(x+y+z+t)^{2}}{z(r y+x)+t(r z+y)+x(r t+z)+y(r x+t)} \geq \frac{(x+y+z+t)^{2}}{r(x y+y z+z t+t x)+2(x z+y t)} \geq \frac{4}{r+1} \end{array}

Thus, the inequality is proven. The equality holds when a=b=c=d=ra=b=c=d=r

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

Source: NuminaMath-1.5, licensed Apache-2.0. Statement and solution reproduced as published; topic and difficulty added by this site.